Selection of Efficiently Adaptable Clustering Algorithm upon Base Station Failure in Wireless Sensor Network

Size: px
Start display at page:

Download "Selection of Efficiently Adaptable Clustering Algorithm upon Base Station Failure in Wireless Sensor Network"

Transcription

1 Selection of Efficiently Adaptable Clustering Algorithm upon Base Station Failure in Wireless Sensor Network Dissertation submitted in partial fulfillment of the requirements for the degree of Master of Technology by Tushar D. Maheshwari Roll No: under the guidance of Dr. Jibi Abraham Department of Computer Engineering and Information Technology College of Engineering, Pune Pune June 2012

2 Dedicated to my mother Smt. Sunita D. Maheshwari and my father Shri. Dinesh K. Maheshwari

3 DEPARTMENT OF COMPUTER ENGINEERING AND INFORMATION TECHNOLOGY, COLLEGE OF ENGINEERING, PUNE CERTIFICATE This is to certify that the dissertation titled Selection of Efficiently Adaptable Clustering Algorithm upon Base Station Failure in Wireless Sensor Network has been successfully completed By Tushar D. Maheshwari ( ) and is approved for the degree of Master of Technology. Dr. Jibi Abraham Guide and Head, Department of Computer Engineering and Information Technology College of Engineering, Pune, Shivaji Nagar, Pune Date :

4 Abstract Wireless Sensor Network (WSN) applications have increased in recent times in fields such as environmental sensing, area monitoring, air pollution monitoring, forest fires detection, machine health monitoring, and landslide detection. In such applications, there is a high need of secure communication among sensor nodes. There are different techniques to secure network data transmissions, but due to power constraints of WSN, group key based mechanism is the most preferred one. Hence, to implement scalable energy efficient secure group communication, the best approach would be hierarchical based like Clustering. In most of the WSN designs based on clustering, Base Station (BS) is the central point of contact to the outside world and in case of its failure; it may lead to total disconnection in the communication. Critical applications like these cannot afford to have BS failure as it is a gateway from sensor networks to the outside world. In order to provide better fault tolerant immediate action, a new BS at some other physical location will have to take the charge. This may lead to a total change in the hierarchical network topology, which in turn leads to re-clustering the entire network and in turn formation of new security keys. Therefore, there is a need to find a suitable algorithm which clusters sensor nodes in such a way that when a BS fails and a new BS takes the charge, new group key gets established with minimum computation and less energy consumption. A survey on various clustering algorithms like Energy-Efficient Multi-level Clustering Algorithm for Large-scale WSNs (EEMC), Low Energy Adaptive Clustering Hierarchy Protocol for WSNs (LEACH), Power Efficient and Adaptive Clustering Hierarchy Protocol for WSNs (PEACH), Hybrid, Energy-Efficient, Distributed Clustering Approach for WSNs (HEED) and Energy Efficient Clustering Algorithm for Maximizing Lifetime of WSNs (EECML) has been done to analyze their performance with respect to various parameters like power consumption of sensor nodes, cluster overlapping, cluster stability, fault tolerance and node-cluster information based on the literature survey and on the basis of these parameters we came to know that HEED and EECML are probably the most suitable algorithms to achieve our aim. So HEED and EECML are implemented on TinyOS, an open source platform for building WSN applications and their performance is evaluated for required parameters. From evaluation it is found that EECML could be the most suitable algorithm that makes a WSN adaptable upon failure of BS. iii

5 Acknowledgments I express my sincere gratitude to my guide Dr. Jibi Abraham for her constant help, encouragement and inspiration throughout the project work. Without her invaluable guidance, this work would never have been a successful one. I would also like to thank all the faculty members of the department for their valuable suggestions and helpful discussions. Last, but not the least, I would like to thank my dearest and closest friends and of course parents who have been the backbone, advisors and constant source of motivation throughout the work. Tushar D. Maheshwari College of Engineering, Pune June, 2012 iv

6 Contents Abstract Acknowledgments List of Figures List of Tables iii iv vii viii 1 Introduction Wireless Sensor Networks MICA Clustering Motivation Thesis Objective Thesis Outline Literature Survey Wireless Sensor Networks TinyOS-Platform for Practical Implementation Basic Structure of TinyOS Features of TinyOS File Types in TinyOS The nesc language TOSSIM-TinyOS Simulator Characteristics of TOSSIM Compiling and Running Simulation Clustering Algorithms Low Energy Adaptive Clustering Hierarchy Protocol for WSNs (LEACH)

7 2.3.2 An Energy-Efficient Multi-level Clustering Algorithm for Largescale WSNs (EEMC) Power Efficient and Adaptive Clustering Hierarchy Protocol for WSNs (PEACH) Hybrid, Energy-Efficient, Distributed Clustering Approach for WSNs (HEED) Energy Efficient Clustering Algorithm for Maximizing Lifetime of WSNs (EECML) Proposed Approach Evaluation Parameters Power Consumption of Sensor Nodes Cluster Stability Fault tolerance and Re-clustering Cluster Overlapping Scalability Node Cluster Information Further Approach Implementation and Results Implementation in TinyOS Challenges in Implemetation Estimation of Energy Dissipation Results Power Consumption of sensor nodes Cluster stability Scalability Fault Tolerance Cluster Overlapping Node Cluster Information Power Consumption of Cluster Head Conclusion and Future Work Conclusion Future Work Publications 45 Bibliography 46 vi

8 List of Figures 1.1 Sensor information forwarding without clustering and aggregation Sensor information forwarding with clustering and aggregation Clustering hierarchy before failure of Base Station New clustering hierarchy after failure of Base Station Clustering hierarchy before failure of Base Station Hierarchy of the various files in TinyOS Clustering hierarchy before failure of Base Station System design of HEED protocol Algorithm model of EECML Protocol operation of EECML Complete scenario of sensor network when clustered through EECML Flowchart of each Cluster Head gathering data from its member and the lower layer CH located in the same clustering angle Power Consumption of all sensor nodes in HEED and EECML after formation of clusters but before failure of Base Station Power Consumption of all sensor nodes in HEED and EECML after failure of Base Station (average of different positions of new BS) Stability of clusters in HEED and EECML Residual energy of Cluster Head(s) in a cluster(no. of nodes=25) Residual energy of Cluster Head(s) in a cluster(no. of nodes=50). 42

9 List of Tables 3.1 Comparative results of various clustering algorithm as per literature survey Results for total energy consumed by Sensor Nodes after formation of clusters but before failure of Base Station Results for total energy consumed by Sensor Nodes after failure of Base Station Results for Cluster Stability Results showing residual energy of Cluster Head(s) in a cluster Residual energy of Cluster Head(s) in a cluster viii

10 Chapter 1 Introduction 1.1 Wireless Sensor Networks Wireless sensor network consists of large number of small, low power, low cost sensor nodes with limited memory, computational, and communication resources and a Base Station. These nodes continuously monitor environmental conditions and collect detailed information about the physical environment in which they are installed, then transmits the collected data to the BS. BS is a gateway from sensor networks to the outside world. The BS has a very large storage and large data processing capabilities. It passes the data it receives from sensor nodes to the server from where end-user can access them. The sensors nodes are generally deployed around the area of the Base Station and form groups as per the need of the Base Station. WSN has an advantage of being operated unattended in the environment where continuous human monitoring is either risky, inefficient or infeasible. Sensor nodes run on batteries and once nodes are deployed their batteries cannot be recharged, so they have short lifespan. There are various applications of Wireless Sensor Network; they are mainly deployed in military and health applications. Also they are applied in robot control, automatic manufacturing, office or home automation. WSN is useful in detecting forest fires based on temperature information it receives from large number of distributed sensor nodes. 1

11 1.2 MICA2 1.2 MICA2 The MICA2 [31, 32] is a third generation mote module used for low power Wireless Sensor Networks. A large array of available sensor boards make this mote customizable for various applications. It works on AA batteries which has life of more than one year. Hardware Specifications Sensing: It is available through expansion boards not limiting to Temperature, Barometric Pressure, Acceleration/Seismic, Acoustic, Magnetic. Modulation type : Frequency Shift key Input/Output: MICA2 has 51 pin connector for connecting to the sensor board. It supports analog inputs, digital I/O. It also contains 3 LEDs for diagnostic purposes. Chip :Atmega 128L Microcontroller Flash memory : 128KB External Storage : 512KB Static RAM : 4KB EEPROM : 4KB Execution rate : 16 MIPS. Default Power : 2 AA batteries Typical capacity : 2850mAh Radio Frequency: 868/916Mhz, 433, or 315Mhz Applications: Wireless Sensor Network Security, Surveillance and Force Protection Environmental Monitoring Distributed computing platforms 2

12 1.3 Clustering 1.3 Clustering WSN [1, 2] consists of a large number of sensor nodes, moreover these sensor nodes run on non rechargeable batteries. So to serve the objective of fault-tolerance, load balancing and network connectivity, grouping of nodes is required. Clustering [3] is a process of dividing sensor nodes into groups on the basis of various parameters, and selecting a group leader from each group. The groups are called clusters and group leaders are called Cluster Heads(CHs) of the clusters. Parameters for forming the clusters include distance between cluster head and its member, intracluster communication cost, residual energy of sensor nodes, location of node with respect to BS etc. Figure 1.1: Sensor information forwarding without clustering and aggregation Figure 1.1 and Figure 1.2 gives a pictorial representation of different ways of data communication in Wireless Sensor Network. Figure 1.1 shows communication without clustering whereas figure 1.2 shows the network scenario when there is clustering in the network. Clustering divides the sensor nodes in the network into clusters and selects a Cluster Head (CH) for each cluster so that member from each cluster communicates through their CH in order to communicate to the BS. In this way clustering increases network lifetime as after clustering less number of nodes will access the channel for communication with the BS, all the informations and updates of whole cluster are collected together at CH and forwarded to the next CH in the hierarchy or the BS. CH can also look into other functions like data aggregation, group key management, distributed computation. Clustering 3

13 1.4 Motivation Figure 1.2: Sensor information forwarding with clustering and aggregation also helps in optimal utilization of network resources, load balancing, node failure management, energy consumption and network lifetime management. 1.4 Motivation When Wireless Sensor Networks are deployed mainly for military and health applications, there is a high need of secure communication among sensor nodes. There are different techniques to secure network data transmissions, but due to power constraints of WSN, group key based mechanism [11] is the most preferred one. Hence to implement scalable energy efficient secure group communication, the best approach would be hierarchical based like Clustering [3]. In most of the WSN [1,2] designs based on clustering, Base Station is the central point of contact to the outside world and in case of its failure; it may lead to total disconnection in the communication. So in order to provide better fault tolerant immediate action, a new BS at some other physical location will have to take the charge. This may lead to a total change in the hierarchical network topology, which in turn leads to re-clustering the entire network and in turn formation of new security keys. Hence in such situations, we need a clustering algorithm which will perform the minimum re-clustering with minimum energy consumption and minimum execution time. 4

14 1.5 Thesis Objective 1.5 Thesis Objective Figure 1.3 and Figure 1.4 shows the clustering sensor network scenario before and after failure of BS respectively, it is clear that whenever there is a change in location of BS there will be some or more change in clusters and topology of the sensor network, this also results in more efforts in terms of energy consumption and time for establishment of new group key. Figure 1.3: Clustering hierarchy before failure of Base Station Figure 1.4: New clustering hierarchy after failure of Base Station We have to find a suitable algorithm which clusters sensor nodes in such a way that when a BS fails and a new BS takes the charge, new group key gets 5

15 1.6 Thesis Outline established with minimum computation and less energy consumption i.e. our objective is to come up with the most suitable clustering algorithm that requires minimum changes in clusters and topology in such situations and makes WSN efficiently adaptable. In order to accomplish our goal many clustering algorithms from the literature will be considered and their performance will be evaluated on various chosen parameters. The parameters will be chosen in such a way that in effect they will help us to find an efficiently adaptable clustering algorithm. 1.6 Thesis Outline The rest of the thesis is organized as follows: In Section 2 we give a brief description of the important papers that we have studied or utilized as a part of our literature survey. In Section 3, we introduce our proposed system model for mood recognition. Section 4 shows the experimental results achieved so far and finally in Section 5 we present the conclusion and future work. 6

16 Chapter 2 Literature Survey 2.1 Wireless Sensor Networks From the following properties obtained after literature survey of WSNs, it is clear that there are hundreds or thousands of deployed sensor nodes in the application field of WSN. The main features of WSN are:- All sensor nodes are battery operated which has very low power, and after deployment recharging those batteries is not possible. Links among the sensor nodes are symmetric, i.e., two nodes can communicate using the same transmission power. All the sensor nodes which are deployed have initially same amount of communication and battery power. There are various transmission power levels for all sensor nodes, and dynamically each node can change their power level. Mobility of sensor node varies from application to application, so in general they are quasi-stationary. Location of sensor nodes once deployed cannot be tracked down as they are not equipped with GPS antennae. 2.2 TinyOS-Platform for Practical Implementation TinyOS [29, 30] is a lightweight, event-driven, open source operating system developed specially for low-power nodes of sensor network. It operates on ultra-low 7

17 2.2 TinyOS-Platform for Practical Implementation power which is what makes it different from other operating systems. It has very advanced systems and techniques for saving power. TinyOS makes it very easy to build sensor network applications. It provides a set of important abstractions and services, such as storage, communication, timers, and sensing. It defines a concurrent execution model, so developers can build applications out of reusable components and services worrying about unforeseen interactions. TinyOS runs on many of the generic platforms, and most of them support easy addition of new nodes in the network. Furthermore, TinyOSs structure is designed in such a way that it is very easy to port it to new platforms Basic Structure of TinyOS TinyOS [29, 30] basically consists of commands, events and tasks. Commands are used to initiate a particular action in a program, events is a type of notification that notify that action has occurred. Events are generally generated by external interrupts and results are provided to the command which generated the previous command. Task is a program which runs in background doing all the computations for different modules. Figure 2.1 shows the flow of all these basic constructs i.e. application generates a command, some task is performed, then command is passed to component module which in turn generates another command for hardware interface from where event is generated and the results are provided to the application passing through the component module Features of TinyOS TinyOS provides mainly three things which make developing sensor network applications and systems easier: 1. Component Model: It defines how to write small piece of code and convert them into larger abstractions. It is grounded in nesc [29]. It allows us to write pieces of reusable code which explicitly declare their dependencies. 2. Concurrent Execution Model: It defines how components interleave their computations as well as how interrupt and non-interrupt code interact. It enables TinyOS to support many components needing to act at the same time while requiring little RAM. First, every I/O call in TinyOS is splitphase: rather than block until completion, a request returns immediately and the caller gets a callback when the I/O completes. TinyOS only needs only one stack, and does not have threads. 8

18 2.2 TinyOS-Platform for Practical Implementation Figure 2.1: Clustering hierarchy before failure of Base Station 3. Overall component structure with APIs, component libraries and services that simplifies the task of writing new applications and services. TinyOS has a set of APIs for common functionality, such as sending packets, reading sensors, and responding to events. It also provides a component structure and component libraries File Types in TinyOS There are three types of file in TinyOS namely- Interfaces : It specifies functionality to outside world, what type of commands can be called and what events need handling. Standard filename syntax is (xxx.nc). Module : This is a file in which real code is implemented, it contains the code for the interface functions defined in interface file. Its standard filename syntax is (xxxm.nc). Configuration : This is file which is used for wiring of components in an application 9

19 2.2 TinyOS-Platform for Practical Implementation Figure 2.2 shows an example where main.nc file contains abstract of an interface interfacem.nc, code2m.nc and code3m.nc are the files which contain their own defined definition of the interface interfacem.nc in interfacea and interfaceb respectively. This interface are wired through configuration file comp1c.nc and app.nc for comp3m.nc and comp2m.nc respectively. Figure 2.2: Hierarchy of the various files in TinyOS The nesc language TinyOS itself with its applications and systems are written in nesc [29, 30] which is a dialect of C language. nesc is compiler for applications that run on UCB motes built on top of avg-gcc. nesc file has extension.nc. It is a static language with no dynamic memory i.e. no malloc, no heap and no function pointers. It is influenced by Java and is designed to foster code reuse. It eliminates monolithic programs so that code can be used more easily and number of errors get decreased. It has features to reduce code and RAM size, also it supports significant optimizations and help in preventing low-level bugs like race conditions. Figure 2.3 shows execution of program in TinyOS. 10

20 2.2 TinyOS-Platform for Practical Implementation Figure 2.3: Clustering hierarchy before failure of Base Station TOSSIM-TinyOS Simulator TOSSIM [30]is a discrete event simulator provided by TinyOS for high fidelity simulation of all of its applications. User can compile TinyOS application on PC framework of TinyOS instead of compiling them on real mote. So user can test, analyze and debug developed algorithms in a controlled and repeatable environment. As it runs on PC, users can examine their code using debuggers and other development tools. TOSSIM primarily focuses on simulating TinyOS and its execution but not the real world. TOSSIM is not always a right simulation solution as it makes many assumptions focusing on making some behaviors accurate while simplifying others. There is always a question about TOSSIM that whether it can simulate Z or it has an accurate model for Z Characteristics of TOSSIM Various characteristics of TOSSIM as mentioned in [29, 30] are: Fidelity: TOSSIM simulates the network at the bit level, simulates every interrupt in the system and each individual ADC capture. By default, it captures TinyOS behavior at very low level. 11

21 2.2 TinyOS-Platform for Practical Implementation Time: While TOSSIM precisely times interrupts, it does not model execution time. A piece of code in TOSSIM will run instantaneously so the spin locks will never exit as the event that allow spin lock to stop will never occur unless code execution completes. Model: TOSSIM though provides abstractions of certain real-world phenomena like bit error but it does not model the real world. User can implement models whatever they want to by manipulating these abstractions. TOSSIM always tries to keep the simulation efficient and simple. Building: TOSSIM builds directly from TinyOS code. In-order to simulate a protocol or system, its TinyOS implementation has to be written. Though it is more difficult than an abstract simulation but once it is done it can be taken and run on real motes. Imperfections TOSSIM makes many simplifying assumptions though it captures TinyOS behavior at a very low level. So it may be possible that code which runs in a simulation might not run on real mote. As TOSSIM is discrete-event simulator, its interrupts are non-preemptive so in case of preemptive interrupt real mote may fail but simulation will run Compiling and Running Simulation TOSSIM is built automatically whenever TinyOS application is compiled. Compilation can be done by entering in the application directory and typing make or make pc. make pc will only compile a simulation of the application. The TOSSIM has executable by the name main.exe, and created in build/pc after compilation. It has the following usage: Usage:./build/pc/main.exe [options] numnodes [options] are: -h,- -help Display this message. -gui pauses simulation waiting for GUI to connect -a= model specifies ADC model (generic is default) options: generic random -b= sec motes boot over first sec seconds (default: 10) -ef= file use file for eeprom; otherwise anonymous file is used -l= scale run sim at scale times real time (fp constant) -a= model specifies a radio model (simple is default) options: simple static lossy 12

22 2.3 Clustering Algorithms -rf= file -s= num -t= sec numnodes specifies file input for lossy model (lossy.nss is default) only boot num of nodes run simulation for sec virtual seconds number of nodes to simulate 2.3 Clustering Algorithms From the various proposed clustering algorithms in the literature, five energy efficient algorithms are selected in order to achieve our goal and these algorithms are evaluated further to select the best algorithm which makes WSN better adaptable. Evaluation is done on basis of various parameters which will be studied in chapter 3. In this section we will study the selected algorithms in detail Low Energy Adaptive Clustering Hierarchy Protocol for WSNs (LEACH) LEACH [8] is a distributed hierarchical protocol which provides data aggregation for sensor networks by selecting random CHs in a distributed manner. It forms clusters based on the received signal strength and uses the CH nodes as routers to the Base Station. All data processing such as data fusion and aggregation are local to the cluster. Each node transmits to their CHs which in turn aggregate and compress the data and send to the Base Station. A stochastic algorithm is used (round by round) by each node to determine whether it can become CH in that round or not. All non CH nodes communicate to the CH in TDMA fashion as scheduled by CH. In LEACH, Cluster Head is selected dynamically and rotated periodically which counts for less power consumption of the network. But since it uses singlelevel clustering scheme, power consumption is comparatively more to those algorithms that use multi-level clustering. Nodes that have been CH cannot be CH for next i rounds. At the end of each round, node that is not a CH selects the closest CH and joins its cluster by informing the CH. This protocol creates non overlapping clusters. Although there is no energy-balancing problem in LEACH but it doesn t care about the energy consumption in intra-clusters communication. So clusters formation and its structure in LEACH may not be optimal. 13

23 2.3 Clustering Algorithms An Energy-Efficient Multi-level Clustering Algorithm for Large-scale WSNs (EEMC) EEMC [7] is a multi-level clustering protocol which organizes nodes into hierarchy of clusters and aims at minimizing the total power consumption of the network as they use multi-level clustering scheme. It is an extension of TLCS (Two Level Clustering Scheme) [7] where each cluster is divided into sub clusters (level-2) having their respective cluster heads. These CHs after gathering data packets transmit the aggregated data packet to the corresponding CH of level-1 and finally all CHs (level-1) send data to the BS. Operation of data collection is done in rounds and each round has two phases: 1. Cluster setup phase : This phase means that the nodes execute this algorithm to establish multi-level clustering topology on its own. This phase works in a top-down fashion [20], that is Cluster Heads at level-i will be elected before level-(i + 1). Initially all active nodes are set to non-ch nodes. Then each of these nodes send their location information and current residual energy to the BS to indicate that the algorithm will select a new set of CHs in level-1. When BS receives these values, it sends a message containing total remaining energy of the network and total reciprocal of the distance from all nodes to the BS. Once active nodes receive this command message, they set their probability of becoming level-1 CH on the basis of received values. Since along with node s residual energy, transmission distance of node is also considered as a factor in deciding CH, those nodes which are closer to the BS and/or have higher remaining energy have more chances to become level-1 CH. Transmission distance is considered as a factor because ultimately the CH has to transfer the final packet to BS, so if distance is large more energy will be consumed and vice-versa. Later the elected level-1 CHs will broadcasts an advertisement message in its radio range, whoever non-ch node receive this advertisement message, sends a message back to CH containing its residual energy and joins that cluster. In this way both CHs and cluster members have information of each other. Then CHs will send a command message to their members containing number of nodes in the cluster, total remaining energy of cluster members and total reciprocal distance from normal nodes to the cluster head. In this way level-2 CHs will be selected and so on for further levels. 14

24 2.3 Clustering Algorithms 2. Data transmission phase : This phase signifies transmission of sensed data packets from nodes to BS under such kind of topology. Once n-level clustering topology is established, the non CH nodes start transmitting the sensed data to the lowest CH. Then CHs at level-n will aggregate the data they receive from ordinary nodes and transmits the collected data to the n-1 level CHs ad so on. At last each of the level-1 CHs transmits the collected data(from level-2 cluster heads) to the BS. This phase runs periodically till the end. Energy spent by a regular node in sending a data packet to level-n CHs, then by level-n CHs to send the same to level-n-1 CHs and so on to level-1 CHs and finally the energy spent by level-1 CH to send packet to BS contributes the total cost of delivering the data from non head node to the BS. In order to minimize overhead, the data transmission phase is long as compared to cluster set-up phase in the algorithm. After clustering process, a node can either elect to become CH or join a cluster as per the message it receives from the different CHs within its cluster range then inform that CH about its membership. So it is scalable for large sensor networks. This protocol produces clusters which are relatively stable. Also, since all CH sends advertisement message in their radio range, it may be possible that a non-ch may fall into range of more than one CH. Therefore, this algorithm creates overlapping clusters Power Efficient and Adaptive Clustering Hierarchy Protocol for WSNs (PEACH) PEACH [6] also prolong network lifetime of WSNs. It operates on probabilistic energy-aware routing protocols [12, 13, 14, 15, 16] such as EAR [12], EAR- DPS [16], and GEAR [13]. Therefore, it has very low power consumption. It supports both routing protocols for WSN i.e. location aware and location unaware. Location aware protocols are those which provide location information of sensor nodes like PEGASIS [21] and location unaware are those who do not provide location information of sensor nodes like LEACH [8] and HEED [5]. Based on overheard information of each sensor node, this protocol forms adaptive clusters. In PEACH to achieve the goal of maximizing the lifetime of network with various energy constraints which have been discussed,following things are taken into account while designing the protocol: Cluster formation overhead: There are many protocols [5, 8, 22, 23] which suffer from overhead of cluster formation as these protocols consumes 15

25 2.3 Clustering Algorithms lots of energy of sensor nodes which are basically battery-limited. Also each non-head node has to transmit the data packet to its Cluster Head even if it is at more distance as compared to BS. This type of reverse forwarding of packet may increase energy consumption of intra-cluster communication. So, cluster formation overhead should be the most important parameter in development of a clustering protocol. Adaptive multi-level clustering: As per the condition of WSN the level of clustering hierarchy must be adaptive in nature. Most of the clustering protocols have fixed level of hierarchical clustering. Fixed level clustering [6] can be affected adversely by distribution of WSNs. So, the clustering protocols should have a more adaptive and dynamic hierarchical clustering level. Cluster formation on PEACH Based on the information overheard by each sensor node, this protocol forms adaptive clusters. When a node N i transmits a packet to node N j then this protocol defines two sets of nodes: NodeSet(N i,n j ): It is a set of all nodes which lies in a circle whose center is node N i and radius is the distance between nodes N i and N j. ClusterSet(N i,n j ):It is a set of all nodes which belongs to NodeSet(N i,n j ) but not in NodeSet(Base station,n j ) NodeSet(N i,n j ) consists of nodes which can overhear the transmission of packet from the node N i to node N j and ClusterSet(N i,n j ) includes CH of all those nodes which are overheard. Node N j becomes the CH of ClusterSet(N i,n j ) and it waits for T delay to collect multiple packets from other nodes in ClusterSet(N i,n j ). This set remains active for both before and after T delay, selected CH N j transmits the collected data to next hop in the hierarchy. In comparison to other protocols it has no overhead on CH selection and it forms an adaptive multi-level clustering. It improves the lifetime and power consumption of WSNs significantly. PEACH protocol supporting location-aware routing (which gives location information of sensor nodes) has lowest power consumption of all the other protocols. It produces clusters which are static and fixed and thus stable. Based on overheard information, it forms clusters without any additional packet transmission of advertisement, announcement, joining and scheduling messages. This protocol design supports its scalability nature. But this algorithm being dynamic produces overlapping clusters which is why we dont prefer this algorithm for our purpose. Node can move from one cluster to another cluster. 16

26 2.3 Clustering Algorithms Hybrid, Energy-Efficient, Distributed Clustering Approach for WSNs (HEED) HEED [5] is a distributed clustering algorithm used for Wireless Sensor Networks which is energy efficient. Every node has some limited energy associated with it. But when a node transmits/receives data and processes query requests, its energy reduces. Energy can also get wasted if there are packet collisions in the network or if a node has to do idle listening. As HEED applies clustering, for each cluster a CH is selected. But if the same CH remains for large amount of time performing send/receive operations then residual energy of the CH will become very low. Therefore, HEED chooses to rotate server role among all nodes of the cluster so that a balance will be achieved between residual energy of all nodes of the cluster. Hence, residual energy of any one node(ch) would not drop to minimum leading to less node failures due to energy depletion. For Server role rotation, clustering is triggered periodically at regular intervals in order to select CHs and at each node the process gets terminated in constant number of iterations. Clustering is basically a process which divides network into clusters such that each cluster consists of adjacent nodes and selects CHs from them. Since all the nodes of the network will be competing to become CHs, certain parameters are used for deciding CHs. The parameters are as follows: 1. Residual energy of each node: This is the primary clustering parameter in deciding initial set of CHs. Residual energy means energy remaining with the node. Energy of a fully charged node will be maximum whereas that of a node performing various send/receive operations will get depleted. If energy associated with a node is not greater than minimum energy required by the a node to become CH then such a candidate should be eliminated from probable set of CHs. 2. Intra-Cluster Communication cost: This is used as a secondary parameter to decide in which cluster a node falls. Sometimes it can happen that a node falls in the range of more than clusters. In such a case Intra-Cluster Communication Cost will break ties among the probable CHs.Intra-Cluster Communication cost is the cost required by a CH to communicate with every node of a cluster. The node which has minimum communication cost will become the CH. Cluster range can be defined as transmission power level used for communication inside a cluster. This is also called as Cluster Power Level. The Cluster Power Level is set to one of lower power levels of a node. 17

27 2.3 Clustering Algorithms This cluster range decides how many number of clusters will be formed in the WSN. Let MinPower i be the power required by a node N i to communicate with CH. Then Average Minimum Reachability Power(AMRP) of a node is defined as expected intra-cluster communication cost required if this node becomes CH. AMRP = MinP wri M (2.1) AMRP provides measures intra-cluster communication cost required for a node if it becomes CH. It indicates minimum power level required by all M nodes in the cluster. Clustering Protocol Operation for HEED is as follows: Process of re-clustering is periodically performed after a time interval of T CP + T NO seconds. Here, T CP denotes time required for the clustering protocol for completion of cluster formation and T NO denotes no operation which means this is the time during which formed clusters are stable and nodes in the network communicate with the help of these clusters and no clustering process is taking place. At each node, clustering process requires N iter iterations. Before clustering algorithm executes, initial percentage of CH among n nodes has to be decided (C prob ). For example, suppose we want 5 CHs in 100 sensor nodes then C prob =0.05. Every node in the WSN calculates its probability of becoming a CH as given below: CH prob = C prob E residual E max (2.2) where, E residual is current remaining energy of the node and E max is the maximum energy of a fully charged battery. CH prob is inversely proportional to E max which means as initial energy of a node increases its probability of becoming CH increases. There has to be a certain criterion on the values of CH prob as this is the primary selection parameter for this protocol. Therefore, a condition is set on CH prob such that CH prob > p min. Where p min is the minimum probability to become CH. If CH prob of a node falls below p min then this node will not be part of the set of probable CHs. HEED is an iterative clustering algorithm since CHs change after specific time internal. There are basically three stages in HEED protocol operation. Following stages are part of one iteration of HEED protocol: 1. Initialization: Initially, every sensor node present in the WSN calculates 18

28 2.3 Clustering Algorithms communication cost incurred to communicate with all its neighbors. Neighbors are identified by using concept of cluster range. Cluster range is calculated by the transmission power level used for communicating internally in the cluster. This level is also called as cluster power level. This is set to lower power levels of a node. This way, higher power levels can be kept reserved for inter-cluster communication. Neighbor of a node is a node present in cluster range of a node. After broadcasting cost to neighbors, every node calculates its CH prob using the formula defined in 2.2 and sets is final CH = FALSE which means final Cluster Head is not yet elected 2. Iterate through following steps until CH previous = 1: I. Initially tentative set of Cluster Heads S C H is empty. Hence, a node checks its own CH prob if CH prob = 1 then it elects itself as CH. CH prob > p min then it adds itself to a tentative set of CHs S CH In this way, primary parameter residual energy is used to find tentative set of CHs. II. If this is not initial iteration, then S CH may not be empty. if S CH! = empty then a tentative CH is selected from S CH which has minimum communication cost. If the tentative CH is the node itself and if its CH prob = 1 then it selects itself as final CH and sets is final CH = TRUE. In this way, secondary parameter, communication cost is used to find final set of CHs. III. Also,CH previous is set to CH prob and CH prob is doubled. 3. Finalization I. If a node has is final CH = TRUE, then it declares itself as CH and broadcasts this message to all its neighbors. II. But if is final CH = FALSE then whether S C H is empty or not a node having minimum communication cost is selected as final CH by considering itself uncovered. A node is defined as covered if it has heard either from tentative Cluster Head of final Cluster Head. HEED implements multi-hop router mechanism. shown in the figure 2.4. The main modules of multi-hop router are: 1. Routing Engine: This module mainly controls everything in HEED router. The design of which is as Its task is to decide whether a packet should be forwarded to parent of the tree or pushed 19

29 2.3 Clustering Algorithms Figure 2.4: System design of HEED protocol onto protocol stack. This module helps the process of data aggregation by intercepting incoming packets from nodes in the cluster and its descendants in the aggregation tree and pushes them onto stack. Routing mechanism does not have any effect on routing engine. It sends out packets which come from application layer. 2. Routing Logic: The network has to select a routing algorithm for forwarding packets. This unit selects the routing algorithm to be used. It structures the network into connected graph, maintains information of neighbor nodes and sends update messages fro tree construction. This consists of 2 main modules: i. Clustering Logic: This unit implements the selected clustering algorithm. After clustering process gets completed, Aggregation tree is formed in which only Cluster Heads are considered in infrastructure. ii. Parent Selection: This module estimates link cost for each neighbor based on quality of communications and its closeness to the Base Station. This way, CH 20

30 2.3 Clustering Algorithms helps in finding the best parent in the aggregation tree. Quality of communication is measured by symmetry of links and occurrences of data loss. The parameter data loss is very useful in finding quality of communication. This way HEED is energy efficient, distributed clustering algorithm which helps in increasing network lifetime and ensures it has no cluster overlapping. CHs in HEED are well distributed in the network, and also sensor nodes are stationary. So clusters formed are highly stable. Cost can be a function of neighbor proximity or cluster density. This protocol prolongs network lifetime and produces clusters which has several appealing properties. This protocol is scalable as it can cluster large number of sensor nodes. This protocol is applied on various sensor network protocols which require scalability, prolonged network lifetime, fault tolerance and load balancing. Currently this protocol is used to build only two level clustering hierarchies but it can be easily extended for multi-level clustering hierarchies. Once CHs are selected remaining nodes are clustered with them. So Cluster head and cluster members have information about each other Energy Efficient Clustering Algorithm for Maximizing Lifetime of WSNs (EECML) In most of the clustering algorithms including the ones discussed so far, in order to prolong the network lifetime of the cluster and the networks, there is dynamic or periodic selection of CH, which wastes much energy for broadcasting messages to general nodes or to other Cluster Heads i.e. there is additional energy consumption for the cluster head set-up and also for general nodes who spent their energy in receiving broad casted message from different new Cluster Heads frequently. So energy of general nodes cannot be used effectively. Furthermore, in actual application, WSN contains thousand number of nodes and they are deployed randomly in an area of density, so it gets difficult to balance energy balance for all the nodes. If each CH acts uninterrupted as the local control center and will not be replaced by other nodes located in the same cluster until its working times reach the threshold, then the frequency of updating CH and the energy consumption for broadcasting messages can be reduced effectively. Therefore, a new clustering algorithm EECML [6] is proposed by Xiang Min and his team which is designed to prolong network lifetime by reducing energy consumption for inter-cluster and intra-cluster communication. Nodes are divided into static clusters and the pro- 21

31 2.3 Clustering Algorithms tocol produces different size clusters i.e. clusters which are closer to the Base Station are smaller in size and those who are distant are larger in size. This is because CHs which are closer to Base Station could have enough energy to transmit the data which comes from other CHs away from the BS. So in this way energy consumption for inter-cluster communication is balanced. In intra-cluster, one cluster-head will continue to be the CH, so energy consumption for new CH set up and updating cluster is reduced. These clusters are referred as layers, clusters closest to Base Station belong to the top layer. So, entire network is divided into V-wedges of clustering angle θ and these wedges form cluster of varying size. The operation is broken into rounds where each CH receives data either from its members or from lower layer CH and send the aggregated data either to the base station or the upper layer cluster with TDMA mechanism. It has high scalability due to these layering mechanisms. This protocol creates non-overlapping cluster with high stability as there is no node mobility possible. Initially Base Station informs to all the nodes of top layer about their CH and informs CH about its members. Then for lower layer immediate upper layer CH plays the role of Base Station in giving node information. Energy Consumption Model Xiang Min and team in their algorithm [6] says that in WSN, energy consumption of sensor nodes is mainly due to three reasons: Message sending Message receiving Data processing Considering k is the length in bits of packets, d is the transmission distance in meters, the simplified energy consumption model for each part can be defined as: P T (k) = E elec k + Eamp d y k P R (k) = E elec k (2.3) P cpu (k) = E cpu k where, E elec : Dissipation energy (in nj/bit) of a radio to run its circuitry E amp : power (in nj/bit/m 2 ) above E elec needed by the transmitter for an 22

32 2.3 Clustering Algorithms acceptable E b /N 0 at the receivers demodulator. γ : Path loss exponent that is related to the transmission distance. E cpu : Dissipation of energy (in nj/bit) for processing a bit. On the basis of equations 2.3, the energy consumption for the Cluster Head receiving and transmitting k bits packets can be defined as: P = P T (k) + P cpu (k) + P R (k) = k(2e elec + E cpu + E amp d γ ) (2.4) The energy consumption is in direct proportion to the length of data packets or message packets. If the message packets can be reduced, the energy consumption can be reduced. When the transmission distance is less than a threshold, the energy consumption is in direct proportion to d 2. In other case, the energy consumption is in direct proportion to d 4. Thus, shortening the transmission distance can reduce the energy consumption. Protocol Model As discussed EECML [6] protocol by Xiang Min and team is designed in a manner that the CH acts as the local control center instead of frequently changing the cluster head in order to balance the load. CH is burdened with transmitting data from other CHs through multi-hop, thus the energy dissipation of the CH is much more than that of the general nodes [26, 27]. Obviously, to maintain the connectivity of the entire network, it is very important that the CHs closer to the Base station keep alive as long as possible for the intercluster communication. So the number of the nodes in the clusters closer to the BS ought to be smaller than those farther away from the BS [28]. Assuming n sensor nodes are deployed in a wedge V area with angle called the clustering angle, and the nodes are deployed with uniform density (nodes/m 2 ). V is partitioned into m rings V 1, V 2,..., V m. Each ring denotes a cluster, and the center distance between the two adjacent rings is d 1, d 2,..., d m, and d i (1<=i<=m) is a one-hop distance for inter-cluster communication, i.e. the cluster closer to the BS is called the upper layer cluster and other is called the lower layer cluster. The schematic diagram of the model is shown in figure 2.5. cluster C 1 is made of nodes located in ring V 1, and cluster C 2 is made of nodes located in ring V 2,and so forth. 23

33 2.3 Clustering Algorithms In each cluster, the CH receives data from its members and sends fused data to the upper layer cluster or to the BS at least once. If the number of the nodes in the cluster is very large, the CH may be out of work before finishing its first task. If the size of the cluster is very small, then the number of nodes of the cluster is very small. Thus, the energy supply of its nodes is mainly used to transmit data that come from the lower layer clusters, and its nodes may have much residual energy when the network is invalid, which cannot make the best of the energy supply of its nodes. So the optimum clustering angle must be selected to control the size of the cluster. As already said that in EECML each Cluster Head acts as local control center until its working times reach the threshold. In figure 2.5, the size of the cluster C m is the largest of all the clusters. Let f i, i = 1, 2, 3,..., m be the continuous working times of the CH that acts continuously as the local control center. If the continuous working times of each CH with the same clustering angle satisfy f 1 >= f 2 >=.... >= f m, then the connectivity of the cluster with the same clustering angle can be maintained effectively. Figure 2.5: Algorithm model of EECML So, for the energy consumption and the systems lifetime the main parameters of this algorithms are one-hop distance d 1hop, the clustering angle θ and the continuous working times f i. The optimal value of these parameters are calculated in [6] by the following equations: 24

An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks

An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks Ayon Chakraborty 1, Swarup Kumar Mitra 2, and M.K. Naskar 3 1 Department of CSE, Jadavpur University, Kolkata, India 2 Department of

More information

Hybrid Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network

Hybrid Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network International Journal of Computer Applications (975 8887) Volume 4 No.6, July 21 Hybrid Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network Harneet Kour Department of Computer

More information

Enhanced Dual Level Fuzzy based Cluster Head Selection for Energy Efficient Wireless Sensor Networks

Enhanced Dual Level Fuzzy based Cluster Head Selection for Energy Efficient Wireless Sensor Networks Enhanced Dual Level Fuzzy based Cluster Head Selection for Energy Efficient Wireless Sensor Networks Sangeeta Rao Department of Computer Science Central University of Haryana Mahendergarh, Haryana, India

More information

A Secure Data Transmission for Cluster based Wireless Sensor Network Using LEACH Protocol

A Secure Data Transmission for Cluster based Wireless Sensor Network Using LEACH Protocol A Secure Data Transmission for Cluster based Wireless Sensor Network Using LEACH Protocol Vinoda B Dibbad 1, C M Parameshwarappa 2 1 PG Student, Dept of CS&E, STJIT, Ranebennur, Karnataka, India 2 Professor,

More information

Data Management in Sensor Networks

Data Management in Sensor Networks Data Management in Sensor Networks Ellen Munthe-Kaas Jarle Søberg Hans Vatne Hansen INF5100 Autumn 2011 1 Outline Sensor networks Characteristics TinyOS TinyDB Motes Application domains Data management

More information

Prediction of DDoS Attack Scheme

Prediction of DDoS Attack Scheme Chapter 5 Prediction of DDoS Attack Scheme Distributed denial of service attack can be launched by malicious nodes participating in the attack, exploit the lack of entry point in a wireless network, and

More information

Congestion Control in WSN using Cluster and Adaptive Load Balanced Routing Protocol

Congestion Control in WSN using Cluster and Adaptive Load Balanced Routing Protocol Congestion Control in WSN using Cluster and Adaptive Load Balanced Routing Protocol Monu Rani 1, Kiran Gupta 2, Arvind Sharma 3 1 M.Tech (Student), 2 Assistant Professor, 3 Assistant Professor Department

More information

LOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS

LOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS LOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS Saranya.S 1, Menakambal.S 2 1 M.E., Embedded System Technologies, Nandha Engineering College (Autonomous), (India)

More information

A NOVEL RESOURCE EFFICIENT DMMS APPROACH

A NOVEL RESOURCE EFFICIENT DMMS APPROACH A NOVEL RESOURCE EFFICIENT DMMS APPROACH FOR NETWORK MONITORING AND CONTROLLING FUNCTIONS Golam R. Khan 1, Sharmistha Khan 2, Dhadesugoor R. Vaman 3, and Suxia Cui 4 Department of Electrical and Computer

More information

PEDAMACS: Power efficient and delay aware medium access protocol for sensor networks

PEDAMACS: Power efficient and delay aware medium access protocol for sensor networks PEDAMACS: Power efficient and delay aware medium access protocol for sensor networks Sinem Coleri and Pravin Varaiya Department of Electrical Engineering and Computer Science University of California,

More information

Thingsquare Technology

Thingsquare Technology Thingsquare Technology Thingsquare connects smartphone apps with things such as thermostats, light bulbs, and street lights. The devices have a programmable wireless chip that runs the Thingsquare firmware.

More information

An Efficient Energy-Aware Coverage- Preserving Hierarchical Routing Protocol for WSN

An Efficient Energy-Aware Coverage- Preserving Hierarchical Routing Protocol for WSN An Efficient Energy-Aware Coverage- Preserving Hierarchical Routing Protocol for WSN S.Taruna 1, Sakshi Shringi 2 1,2 Banasthali Vidyapith, Jaipur, Rajasthan, India ABSTRACT Wireless sensor networks (WSN)

More information

An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs

An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs G.Michael Assistant Professor, Department of CSE, Bharath University, Chennai, TN, India ABSTRACT: Mobility management

More information

SPY AGENT BASED SECURE DATA AGGREGATION IN WSN

SPY AGENT BASED SECURE DATA AGGREGATION IN WSN ISSN: 2229-6948(ONLINE) ICTACT JOURNAL ON COMMUNICATION TECHNOLOGY, DECEMBER 214, VOLUME: 5, ISSUE: 4 SPY AGENT BASED SECURE DATA AGGREGATION IN WSN T. Lathies Bhasker 1 and G. Arul Jagan 2 1 Department

More information

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility

More information

APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM

APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM 152 APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM A1.1 INTRODUCTION PPATPAN is implemented in a test bed with five Linux system arranged in a multihop topology. The system is implemented

More information

Load Balancing in Periodic Wireless Sensor Networks for Lifetime Maximisation

Load Balancing in Periodic Wireless Sensor Networks for Lifetime Maximisation Load Balancing in Periodic Wireless Sensor Networks for Lifetime Maximisation Anthony Kleerekoper 2nd year PhD Multi-Service Networks 2011 The Energy Hole Problem Uniform distribution of motes Regular,

More information

15 th TF-Mobility Meeting Sensor Networks. Torsten Braun Universität Bern braun@iam.unibe.ch www.iam.unibe.ch/~rvs

15 th TF-Mobility Meeting Sensor Networks. Torsten Braun Universität Bern braun@iam.unibe.ch www.iam.unibe.ch/~rvs 15 th TF-Mobility Meeting Sensor Networks Torsten Braun Universität Bern braun@iam.unibe.ch www.iam.unibe.ch/~rvs Overview 2 Ubiquitous Computing > Vision defined by Mark Weiser in 1991 Seamless integration

More information

A STUDY ON SECURE DATA TRANSMISSION IN CLUSTER BASED WIRELESS SENSOR NETWORKS

A STUDY ON SECURE DATA TRANSMISSION IN CLUSTER BASED WIRELESS SENSOR NETWORKS A STUDY ON SECURE DATA TRANSMISSION IN CLUSTER BASED WIRELESS SENSOR NETWORKS C.Priya, M.Phil Scholar, Department Of Computer Science, Dr. R.A.N.M. Arts & Science College, Erode, Tamilnadu, India. M.Suriya,

More information

Local Load Balancing for Globally Efficient Routing in Wireless Sensor Networks

Local Load Balancing for Globally Efficient Routing in Wireless Sensor Networks International Journal of Distributed Sensor Networks, 1: 163 185, 2005 Copyright Taylor & Francis Inc. ISSN: 1550-1329 print/1550-1477 online DOI: 10.1080/15501320590966431 Local Load Balancing for Globally

More information

International Journal of Advancements in Research & Technology, Volume 3, Issue 4, April-2014 55 ISSN 2278-7763

International Journal of Advancements in Research & Technology, Volume 3, Issue 4, April-2014 55 ISSN 2278-7763 International Journal of Advancements in Research & Technology, Volume 3, Issue 4, April-2014 55 Management of Wireless sensor networks using cloud technology Dipankar Mishra, Department of Electronics,

More information

Demystifying Wireless for Real-World Measurement Applications

Demystifying Wireless for Real-World Measurement Applications Proceedings of the IMAC-XXVIII February 1 4, 2010, Jacksonville, Florida USA 2010 Society for Experimental Mechanics Inc. Demystifying Wireless for Real-World Measurement Applications Kurt Veggeberg, Business,

More information

Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4

Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4 Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4 Michael Binhack, sentec Elektronik GmbH, Werner-von-Siemens-Str. 6, 98693 Ilmenau, Germany Gerald Kupris, Freescale Semiconductor

More information

A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network

A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network Parama Bhaumik 1, Somprokash Bandyopadhyay 2 1 Dept. of Information Technology, Jadavpur

More information

A Transport Protocol for Multimedia Wireless Sensor Networks

A Transport Protocol for Multimedia Wireless Sensor Networks A Transport Protocol for Multimedia Wireless Sensor Networks Duarte Meneses, António Grilo, Paulo Rogério Pereira 1 NGI'2011: A Transport Protocol for Multimedia Wireless Sensor Networks Introduction Wireless

More information

ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 5, September

ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 5, September Analysis and Implementation of IEEE 802.11 MAC Protocol for Wireless Sensor Networks Urmila A. Patil, Smita V. Modi, Suma B.J. Associate Professor, Student, Student Abstract: Energy Consumption in Wireless

More information

Monitoring Software using Sun Spots. Corey Andalora February 19, 2008

Monitoring Software using Sun Spots. Corey Andalora February 19, 2008 Monitoring Software using Sun Spots Corey Andalora February 19, 2008 Abstract Sun has developed small devices named Spots designed to provide developers familiar with the Java programming language a platform

More information

A Hierarchical Structure based Coverage Repair in Wireless Sensor Networks

A Hierarchical Structure based Coverage Repair in Wireless Sensor Networks A Hierarchical Structure based Coverage Repair in Wireless Sensor Networks Jie Wu Computer Science & Engineering Department Florida Atlantic University Boca Raton, FL 3343, USA E-mail: jie@cse.fau.edu

More information

Role of Clusterhead in Load Balancing of Clusters Used in Wireless Adhoc Network

Role of Clusterhead in Load Balancing of Clusters Used in Wireless Adhoc Network International Journal of Electronics Engineering, 3 (2), 2011, pp. 283 286 Serials Publications, ISSN : 0973-7383 Role of Clusterhead in Load Balancing of Clusters Used in Wireless Adhoc Network Gopindra

More information

QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES

QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering

More information

SmartDiagnostics Application Note Wireless Interference

SmartDiagnostics Application Note Wireless Interference SmartDiagnostics Application Note Wireless Interference Publication Date: May 27, 2015 KCF Technologies, Inc. Background The SmartDiagnostics wireless network is an easy to install, end-to-end machine

More information

Event Processing Middleware for Wireless Sensor Networks

Event Processing Middleware for Wireless Sensor Networks Event Processing Middleware for Wireless Sensor Networks Selvakennedy Selvadurai University of Sydney Outline Introduction System Assumptions EPM Architecture Group Management and Centre Localisation Components

More information

Dipak Wajgi Dept. of Computer Science and Engineering Ramdeobaba College of Engg. and Management Nagpur, India

Dipak Wajgi Dept. of Computer Science and Engineering Ramdeobaba College of Engg. and Management Nagpur, India Load Balancing Algorithms in Wireless Sensor Network : A Survey Dipak Wajgi Dept. of Computer Science and Engineering Ramdeobaba College of Engg. and Management Nagpur, India Dr. Nileshsingh V. Thakur

More information

XBee Wireless Sensor Networks for Temperature Monitoring

XBee Wireless Sensor Networks for Temperature Monitoring XBee Wireless Sensor Networks for Temperature Monitoring Vongsagon Boonsawat, Jurarat Ekchamanonta, Kulwadee Bumrungkhet, and Somsak Kittipiyakul School of Information, Computer, and Communication Technology

More information

Using Received Signal Strength Indicator to Detect Node Replacement and Replication Attacks in Wireless Sensor Networks

Using Received Signal Strength Indicator to Detect Node Replacement and Replication Attacks in Wireless Sensor Networks Using Received Signal Strength Indicator to Detect Node Replacement and Replication Attacks in Wireless Sensor Networks Sajid Hussain* and Md Shafayat Rahman Jodrey School of Computer Science, Acadia University

More information

Real-Time Systems Prof. Dr. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Real-Time Systems Prof. Dr. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Real-Time Systems Prof. Dr. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture No. # 26 Real - Time POSIX. (Contd.) Ok Good morning, so let us get

More information

Technology White Paper Capacity Constrained Smart Grid Design

Technology White Paper Capacity Constrained Smart Grid Design Capacity Constrained Smart Grid Design Smart Devices Smart Networks Smart Planning EDX Wireless Tel: +1-541-345-0019 I Fax: +1-541-345-8145 I info@edx.com I www.edx.com Mark Chapman and Greg Leon EDX Wireless

More information

CHAPTER - 4 CHANNEL ALLOCATION BASED WIMAX TOPOLOGY

CHAPTER - 4 CHANNEL ALLOCATION BASED WIMAX TOPOLOGY CHAPTER - 4 CHANNEL ALLOCATION BASED WIMAX TOPOLOGY 4.1. INTRODUCTION In recent years, the rapid growth of wireless communication technology has improved the transmission data rate and communication distance.

More information

Surveillance System Using Wireless Sensor Networks

Surveillance System Using Wireless Sensor Networks Surveillance System Using Wireless Sensor Networks Dan Nguyen, Leo Chang Computer Engineering, Santa Clara University Santa Clara, California, USA dantnguyen84@gmail.com chihshun@gmail.com Abstract The

More information

Towards Lightweight Logging and Replay of Embedded, Distributed Systems

Towards Lightweight Logging and Replay of Embedded, Distributed Systems Towards Lightweight Logging and Replay of Embedded, Distributed Systems (Invited Paper) Salvatore Tomaselli and Olaf Landsiedel Computer Science and Engineering Chalmers University of Technology, Sweden

More information

A Routing Algorithm Designed for Wireless Sensor Networks: Balanced Load-Latency Convergecast Tree with Dynamic Modification

A Routing Algorithm Designed for Wireless Sensor Networks: Balanced Load-Latency Convergecast Tree with Dynamic Modification A Routing Algorithm Designed for Wireless Sensor Networks: Balanced Load-Latency Convergecast Tree with Dynamic Modification Sheng-Cong Hu r00631036@ntu.edu.tw Jen-Hou Liu r99631038@ntu.edu.tw Min-Sheng

More information

The Monitoring of Ad Hoc Networks Based on Routing

The Monitoring of Ad Hoc Networks Based on Routing The Monitoring of Ad Hoc Networks Based on Routing Sana Ghannay, Sonia Mettali Gammar, Farouk Kamoun CRISTAL Laboratory ENSI, University of Manouba 21 Manouba - Tunisia {chnnysn,sonia.gammar}@ensi.rnu.tn,

More information

Implementation of Virtual Local Area Network using network simulator

Implementation of Virtual Local Area Network using network simulator 1060 Implementation of Virtual Local Area Network using network simulator Sarah Yahia Ali Department of Computer Engineering Techniques, Dijlah University College, Iraq ABSTRACT Large corporate environments,

More information

The BSN Hardware and Software Platform: Enabling Easy Development of Body Sensor Network Applications

The BSN Hardware and Software Platform: Enabling Easy Development of Body Sensor Network Applications The BSN Hardware and Software Platform: Enabling Easy Development of Body Sensor Network Applications Joshua Ellul jellul@imperial.ac.uk Overview Brief introduction to Body Sensor Networks BSN Hardware

More information

A Survey on Lifetime Maximization of Wireless Sensor Network using Load Balancing

A Survey on Lifetime Maximization of Wireless Sensor Network using Load Balancing A Survey on Lifetime Maximization of Wireless Sensor Network using Load Balancing Radhika Sarad, Kiran Bhame, Vaibhav Wabale, Amol Katake B.E. Students, Dept. of Computer Engineering, KJCOEMR, Pune, Maharashtra,

More information

EDK 350 (868 MHz) EDK 350U (902 MHz) EnOcean Developer Kit

EDK 350 (868 MHz) EDK 350U (902 MHz) EnOcean Developer Kit EDK 350 (868 MHz) EDK 350U (902 MHz) EnOcean Developer Kit EDK 350 User Manual Important Notes This information describes the type of component and shall not be considered as assured characteristics. No

More information

Effective Communication in Schools of Submersibles

Effective Communication in Schools of Submersibles Oceans 06, Singapore (authors manuscript do not distribute) Effective Communication in Schools of Submersibles Felix Schill & Uwe R. Zimmer Research School of Information Sciences and Engineering Autonomous

More information

NOQ_NQ-9121 Z-Wave Data Logger for Gas Meters Firmware Version : 2.55

NOQ_NQ-9121 Z-Wave Data Logger for Gas Meters Firmware Version : 2.55 NOQ_NQ-9121 Z-Wave Data Logger for Gas Meters Firmware Version : 2.55 Quick Start S This device is a Z-Wave Sensor. Inclusion and Exclusion are confirmed by triple clicking the Z-Wave button on the device.

More information

ZME_RC2 Z-Wave Remote Control

ZME_RC2 Z-Wave Remote Control ZME_RC2 Z-Wave Remote Control Firmware Version : 1.1 Quick Start S This device is a Z-Wave Remote Control with the logical function of a sensor. Push the "Include" button behind the slider on the back

More information

Hybrid Data Gathering Scheme in Wireless Sensor Networks

Hybrid Data Gathering Scheme in Wireless Sensor Networks JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 19 No. 2 (2011), pp. 73-88 Hybrid Data Gathering Scheme in Wireless Sensor Networks Swarup Kumar Mitra 1, Ayon Chakraborty 2, Mrinal Kanti Naskar 2 1 MCKV Institute

More information

Introduction to Wireless Sensor Network Security

Introduction to Wireless Sensor Network Security Smartening the Environment using Wireless Sensor Networks in a Developing Country Introduction to Wireless Sensor Network Security Presented By Al-Sakib Khan Pathan Department of Computer Science and Engineering

More information

Online Communication of Critical Parameters in Powerplant Using ZIGBEE

Online Communication of Critical Parameters in Powerplant Using ZIGBEE International Journal of Engineering Science Invention Volume 2 Issue 2 ǁ February. 2013 Online Communication of Critical Parameters in Powerplant Using ZIGBEE D.Santhiya 1, R.Renita Priyatharshini 2,K.C.Dhivya

More information

Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks

Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks Ahmed Helmy Electrical Engineering Department University of Southern California (USC) helmy@usc.edu http://ceng.usc.edu/~helmy

More information

other. A B AP wired network

other. A B AP wired network 1 Routing and Channel Assignment in Multi-Channel Multi-Hop Wireless Networks with Single-NIC Devices Jungmin So + Nitin H. Vaidya Department of Computer Science +, Department of Electrical and Computer

More information

A SECURE DATA TRANSMISSION FOR CLUSTER- BASED WIRELESS SENSOR NETWORKS IS INTRODUCED

A SECURE DATA TRANSMISSION FOR CLUSTER- BASED WIRELESS SENSOR NETWORKS IS INTRODUCED A SECURE DATA TRANSMISSION FOR CLUSTER- BASED WIRELESS SENSOR NETWORKS IS INTRODUCED J Karunamayi 1, Annapurna V K 2 1 Student, Computer Network and Engineering,The National Institute of Engineering, Mysuru,

More information

A Graph-Center-Based Scheme for Energy-Efficient Data Collection in Wireless Sensor Networks

A Graph-Center-Based Scheme for Energy-Efficient Data Collection in Wireless Sensor Networks A Graph-Center-Based Scheme for Energy-Efficient Data Collection in Wireless Sensor Networks Dajin Wang Department of Computer Science Montclair State University, Upper Montclair, NJ 07043, USA wang@pegasus.montclair.edu

More information

Wireless Sensor Network: Improving the Network Energy Consumption

Wireless Sensor Network: Improving the Network Energy Consumption Wireless Sensor Network: Improving the Network Energy Consumption Ingrid Teixeira, José Ferreira de Rezende and Aloysio de Castro P. Pedroza Abstract-- In a remote sensor application it is desirable that

More information

Wireless Sensor Networks Database: Data Management and Implementation

Wireless Sensor Networks Database: Data Management and Implementation Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Wireless Sensor Networks Database: Data Management and Implementation Ping Liu Computer and Information Engineering Institute,

More information

PART IV Performance oriented design, Performance testing, Performance tuning & Performance solutions. Outline. Performance oriented design

PART IV Performance oriented design, Performance testing, Performance tuning & Performance solutions. Outline. Performance oriented design PART IV Performance oriented design, Performance testing, Performance tuning & Performance solutions Slide 1 Outline Principles for performance oriented design Performance testing Performance tuning General

More information

High-Frequency Distributed Sensing for Structure Monitoring

High-Frequency Distributed Sensing for Structure Monitoring High-Frequency Distributed Sensing for Structure Monitoring K. Mechitov, W. Kim, G. Agha and T. Nagayama* Department of Computer Science, University of Illinois at Urbana-Champaign 201 N. Goodwin Ave.,

More information

Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey

Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey Data Aggregation and Gathering Transmission in Wireless Sensor Networks: A Survey PHANI PRIYA KAKANI THESIS WORK2011-2013 SUBJECT Master of Electrical Engineering: Specialization inembedded Systems Postadress:

More information

Wireless Sensor Network: Challenges, Issues and Research

Wireless Sensor Network: Challenges, Issues and Research ISBN 978-93-84468-20-0 Proceedings of 2015 International Conference on Future Computational Technologies (ICFCT'2015) Singapore, March 29-30, 2015, pp. 224-228 Wireless Sensor Network: Challenges, Issues

More information

Figure 1. The Example of ZigBee AODV Algorithm

Figure 1. The Example of ZigBee AODV Algorithm TELKOMNIKA Indonesian Journal of Electrical Engineering Vol.12, No.2, February 2014, pp. 1528 ~ 1535 DOI: http://dx.doi.org/10.11591/telkomnika.v12i2.3576 1528 Improving ZigBee AODV Mesh Routing Algorithm

More information

UNIT 8:- Mobile Ad-Hoc Networks, Wireless Sensor Networks

UNIT 8:- Mobile Ad-Hoc Networks, Wireless Sensor Networks UNIT 8:- Mobile Ad-Hoc Networks, Wireless Sensor Networks a Mobile Ad hoc NETwork (MANET) is one that comes together as needed, not necessarily with any support from the existing infrastructure or any

More information

Node Degree based Clustering for WSN

Node Degree based Clustering for WSN Node Degree based Clustering for WSN Sanjeev Kumar Gupta Dept. of Electronics & Comm. SCOPE College of Engineering,NH-12, Hoshangabad Road, Bhopal (INDIA) Neeraj Jain Dept. of Computer Science SCOPE College

More information

Lecture 3: Scaling by Load Balancing 1. Comments on reviews i. 2. Topic 1: Scalability a. QUESTION: What are problems? i. These papers look at

Lecture 3: Scaling by Load Balancing 1. Comments on reviews i. 2. Topic 1: Scalability a. QUESTION: What are problems? i. These papers look at Lecture 3: Scaling by Load Balancing 1. Comments on reviews i. 2. Topic 1: Scalability a. QUESTION: What are problems? i. These papers look at distributing load b. QUESTION: What is the context? i. How

More information

Wireless Sensor Networks Chapter 3: Network architecture

Wireless Sensor Networks Chapter 3: Network architecture Wireless Sensor Networks Chapter 3: Network architecture António Grilo Courtesy: Holger Karl, UPB Goals of this chapter Having looked at the individual nodes in the previous chapter, we look at general

More information

Partition-based Network Load Balanced Routing in Large Scale Multi-sink Wireless Sensor Networks

Partition-based Network Load Balanced Routing in Large Scale Multi-sink Wireless Sensor Networks Department of Electrical Engineering, Mathematics and Computer Science Partition-based Network Load Balanced Routing in Large Scale Multi-sink Wireless Sensor Networks Master Thesis Thijs Mutter 439 Supervisors

More information

Implementing Software on Resource- Constrained Mobile Sensors Experience with Impala and ZebraNet

Implementing Software on Resource- Constrained Mobile Sensors Experience with Impala and ZebraNet Implementing Software on Resource- Constrained Mobile Sensors Experience with Impala and ZebraNet T. Liu, C. Sadler, P. Zhang, and M. Martonosi, MobiSys 04 Presented by Fabián E. Bustamante (based on the

More information

Module 5. Broadcast Communication Networks. Version 2 CSE IIT, Kharagpur

Module 5. Broadcast Communication Networks. Version 2 CSE IIT, Kharagpur Module 5 Broadcast Communication Networks Lesson 9 Cellular Telephone Networks Specific Instructional Objectives At the end of this lesson, the student will be able to: Explain the operation of Cellular

More information

A Multi-Poller based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks

A Multi-Poller based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks A Multi-Poller based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks Changlei Liu and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University E-mail:

More information

Attenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction

Attenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit

More information

Dynamic Source Routing in Ad Hoc Wireless Networks

Dynamic Source Routing in Ad Hoc Wireless Networks Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3891 dbj@cs.cmu.edu Abstract

More information

M2M I/O Modules. To view all of Advantech s M2M I/O Modules, please visit www.advantech.com/products.

M2M I/O Modules. To view all of Advantech s M2M I/O Modules, please visit www.advantech.com/products. M2M I/O Modules 14 M2M I/O Modules Overview 14-2 M2M I/O Modules Selection Guide 14-6 ADAM-2510Z Wireless Router Node 14-8 ADAM-2520Z Wireless Modbus RTU Gateway 14-9 ADAM-2031Z ADAM-2632Z ADAM-2017Z ADAM-2018Z

More information

Mobile Security Wireless Mesh Network Security. Sascha Alexander Jopen

Mobile Security Wireless Mesh Network Security. Sascha Alexander Jopen Mobile Security Wireless Mesh Network Security Sascha Alexander Jopen Overview Introduction Wireless Ad-hoc Networks Wireless Mesh Networks Security in Wireless Networks Attacks on Wireless Mesh Networks

More information

MAXIMIZING THE LIFETIME OF NETWORK SECURITY BY DSDV PROTOCOL USING GAME THEORY TECHNIQUES IN WIRELESS SENSOR NETWORK

MAXIMIZING THE LIFETIME OF NETWORK SECURITY BY DSDV PROTOCOL USING GAME THEORY TECHNIQUES IN WIRELESS SENSOR NETWORK MAXIMIZING THE LIFETIME OF NETWORK SECURITY BY DSDV PROTOCOL USING GAME THEORY TECHNIQUES IN WIRELESS SENSOR NETWORK 1 V. Vinoba, 2 P.Hema 1 Department of Mathematics, K.N. Government Arts college, (India)

More information

2.0 System Description

2.0 System Description 2.0 System Description The wireless alarm system consists of two or more alarm units within a specified range of one another. Each alarm unit employs a radio transceiver, allowing it to communicate with

More information

EPL 657 Wireless Networks

EPL 657 Wireless Networks EPL 657 Wireless Networks Some fundamentals: Multiplexing / Multiple Access / Duplex Infrastructure vs Infrastructureless Panayiotis Kolios Recall: The big picture... Modulations: some basics 2 Multiplexing

More information

Design and Analysis of Load Balancing Clusters in wireless Adhoc Network

Design and Analysis of Load Balancing Clusters in wireless Adhoc Network www..org Design and Analysis of Load Balancing Clusters in wireless Adhoc Network 1 K.K.Tripathi 1, Gopindra Kumar 2, Neeraj Tyagi 3 1 Prof & Head, Department of electronics Engineering, RKGIT, Ghaziabad

More information

MOTEWORKS. Key Features. Overview

MOTEWORKS. Key Features. Overview MOTEWORKS SOFTWARE PLATFORM MoteWorks 2.0 provides a complete software development environment for wireless sensor network applications. Included is a collection of flexible software packages that enables

More information

1. Comments on reviews a. Need to avoid just summarizing web page asks you for:

1. Comments on reviews a. Need to avoid just summarizing web page asks you for: 1. Comments on reviews a. Need to avoid just summarizing web page asks you for: i. A one or two sentence summary of the paper ii. A description of the problem they were trying to solve iii. A summary of

More information

Research Article ISSN 2277 9140 Copyright by the authors - Licensee IJACIT- Under Creative Commons license 3.0

Research Article ISSN 2277 9140 Copyright by the authors - Licensee IJACIT- Under Creative Commons license 3.0 INTERNATIONAL JOURNAL OF ADVANCES IN COMPUTING AND INFORMATION TECHNOLOGY An international, online, open access, peer reviewed journal Volume 2 Issue 2 April 2013 Research Article ISSN 2277 9140 Copyright

More information

Level 2 Routing: LAN Bridges and Switches

Level 2 Routing: LAN Bridges and Switches Level 2 Routing: LAN Bridges and Switches Norman Matloff University of California at Davis c 2001, N. Matloff September 6, 2001 1 Overview In a large LAN with consistently heavy traffic, it may make sense

More information

Energy Constrained Resource Scheduling for Cloud Environment

Energy Constrained Resource Scheduling for Cloud Environment Energy Constrained Resource Scheduling for Cloud Environment 1 R.Selvi, 2 S.Russia, 3 V.K.Anitha 1 2 nd Year M.E.(Software Engineering), 2 Assistant Professor Department of IT KSR Institute for Engineering

More information

- An Essential Building Block for Stable and Reliable Compute Clusters

- An Essential Building Block for Stable and Reliable Compute Clusters Ferdinand Geier ParTec Cluster Competence Center GmbH, V. 1.4, March 2005 Cluster Middleware - An Essential Building Block for Stable and Reliable Compute Clusters Contents: Compute Clusters a Real Alternative

More information

Load Balancing Routing Algorithm for Data Gathering Sensor Network

Load Balancing Routing Algorithm for Data Gathering Sensor Network Load Balancing Routing Algorithm for Data Gathering Sensor Network Evgeny Bakin, Grigory Evseev State University of Aerospace Instrumentation Saint-Petersburg, Russia {jenyb, egs}@vu.spb.ru Denis Dorum

More information

Chapter 13 Embedded Operating Systems

Chapter 13 Embedded Operating Systems Operating Systems: Internals and Design Principles Chapter 13 Embedded Operating Systems Eighth Edition By William Stallings Embedded System Refers to the use of electronics and software within a product

More information

Water Quality Monitoring System Using Zigbee Based Wireless Sensor Network

Water Quality Monitoring System Using Zigbee Based Wireless Sensor Network 24 Water Quality Monitoring System Using Zigbee Based Wireless Sensor Network Zulhani Rasin Faculty of Electrical Engineering Universiti Teknikal Malaysia Melaka (UTeM) Melaka, Malaysia Email: zulhani@utem.edu.my

More information

Christian Bettstetter. Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks

Christian Bettstetter. Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks Christian Bettstetter Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks Contents 1 Introduction 1 2 Ad Hoc Networking: Principles, Applications, and Research Issues 5 2.1 Fundamental

More information

LARGE-SCALE wireless sensor networks are an emerging

LARGE-SCALE wireless sensor networks are an emerging 484 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 7, NO. 4, APRIL 2008 General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies Zhao Cheng, Mark Perillo, and Wendi B.

More information

Wireless Sensor Network Performance Monitoring

Wireless Sensor Network Performance Monitoring Wireless Sensor Network Performance Monitoring Yaqoob J. Al-raisi & David J. Parish High Speed Networks Group Loughborough University MSN Coseners 12-13th 13th July 2007 Overview The problem we are trying

More information

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS Reza Azizi Engineering Department, Bojnourd Branch, Islamic Azad University, Bojnourd, Iran reza.azizi@bojnourdiau.ac.ir

More information

Research Article CAPNet: An Enhanced Load Balancing Clustering Algorithm for Prolonging Network Lifetime in WSNs

Research Article CAPNet: An Enhanced Load Balancing Clustering Algorithm for Prolonging Network Lifetime in WSNs International Distributed Sensor Networks, Article ID 234394, 8 pages http://dx.doi.org/1.1155/214/234394 Research Article CAPNet: An Enhanced Load Balancing Clustering Algorithm for Prolonging Network

More information

RT-QoS for Wireless ad-hoc Networks of Embedded Systems

RT-QoS for Wireless ad-hoc Networks of Embedded Systems RT-QoS for Wireless ad-hoc Networks of Embedded Systems Marco accamo University of Illinois Urbana-hampaign 1 Outline Wireless RT-QoS: important MA attributes and faced challenges Some new ideas and results

More information

Energy Effective Routing Protocol for Maximizing Network Lifetime of WSN

Energy Effective Routing Protocol for Maximizing Network Lifetime of WSN Energy Effective Routing Protocol for Maximizing Network Lifetime of WSN Rachana Ballal 1, S.Girish 2 4 th sem M.tech, Dept.of CS&E, Sahyadri College of Engineering and Management, Adyar, Mangalore, India

More information

Power Consumption Analysis of Prominent Time Synchronization Protocols for Wireless Sensor Networks

Power Consumption Analysis of Prominent Time Synchronization Protocols for Wireless Sensor Networks J Inf Process Syst, Vol.10, No.2, pp.300~313, June 2014 http://dx.doi.org/10.3745/jips.03.0006 pissn 1976-913X eissn 2092-805X Power Consumption Analysis of Prominent Time Synchronization Protocols for

More information

INTERNET OF THE THINGS (IoT): An introduction to wireless sensor networking middleware

INTERNET OF THE THINGS (IoT): An introduction to wireless sensor networking middleware 1 INTERNET OF THE THINGS (IoT): An introduction to wireless sensor networking middleware Dr Antoine Bagula ISAT Laboratory, University of Cape Town, South Africa Goal of the lecture 2 The lecture intends

More information

Maximizing Range and Battery Life in Low-Cost Wireless Networks

Maximizing Range and Battery Life in Low-Cost Wireless Networks Maximizing Range and Battery Life in Low-Cost Wireless Networks The proliferation of cost-effective wireless technology has led to the rise of entirely new types of networks across a wide range of applications

More information

Mobility-based d-hop Clustering Algorithm for Mobile Ad Hoc Networks

Mobility-based d-hop Clustering Algorithm for Mobile Ad Hoc Networks Mobility-based d-hop Clustering Algorithm for Mobile Ad Hoc Networks 1 Institute for Infocomm Research Agency for Science Technology and Research Singapore Inn Inn ER,1 Winston K.G. Seah 1, {stuerii, winston}@ir.a-star.edu.sg

More information

A Slow-sTart Exponential and Linear Algorithm for Energy Saving in Wireless Networks

A Slow-sTart Exponential and Linear Algorithm for Energy Saving in Wireless Networks 1 A Slow-sTart Exponential and Linear Algorithm for Energy Saving in Wireless Networks Yang Song, Bogdan Ciubotaru, Member, IEEE, and Gabriel-Miro Muntean, Member, IEEE Abstract Limited battery capacity

More information