ENERGY EFFICIENT ROUTING PREPARED BY: Souvik Chakraborty Department of CSE, Techno India Roll: 13000110047

ABSTRACT Wireless Sensor Networks present a great potential in monitoring systems. Routing problem is one of the most important issues in a wireless sensor network (WSN).Any routing protocol designed for wireless sensor networks is should take into consideration, the challenging factors like fault tolerance, energy efficiency, scalability, latency, power consumption and network topology. The stringent requirement of energy budget has been an emerging issue in the design specification for a wireless sensors network (WSN). ABSTRACT

INTRODUCTION WHAT IS WSN? Wireless sensor network(WSN) is a multi-hop wireless networks consists of a large of small-size, low-cost and low-power sensor nodes which are capable of sensing, computation and communication. WSN take advantage of deployment rapidly and strong survivability without fixed network support, but also with features of dynamic topology structure and energy resources are limited and so on. The application of WSN technology is a revolution of perceived and collection of information and used for various applications such as habitat monitoring, automation, and agriculture INTRODUCTION

Routing in WSN: Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networks or cellular networks. Sensor nodes are tightly constrained in terms of energy, processing, and storage capacities they require careful resource management. INTRODUCTION

MULTICAST: Multicast is the communication paradigm of one-to-many or many-to-many, based on defined groups and constituted by members, whose interest is to receive/share the same information for a specific application. Multicast routing is to find a multicast tree which is rooted from the source and spans all destination nodes. INTRODUCTION

The whole routing process includes two phases : The first phase is to seek a minimal energy path from the sink to the access point based on the idea of dynamic programming. The second phase is to search for a broadcast tree between the access point and the destination nodes in the multicast region INTRODUCTION

ENERGY EFFICIENT ROUTING: Energy Efficient Routing method is proposed for a static wireless sensors network, which consists of a large number of energy-constrained sensors and a few hubs as the cluster heads of sensors. Since each battery-powered sensor only has limited energy resource and the battery recharge or replacement is impractical, a network with energy-aware design becomes important to achieve the desired lifetime performance INTRODUCTION

MULTICAST AD HOC ON-DEMAND DISTANCE VECTOR(MAODV) MAODV has the on demand routing characteristics, but uses an entirely different approach for maintaining routing table information. As MAODV belongs to the family of on demand routing protocol, so it follows the conventional scheme of maintaining routing table i.e. only one entry will be made for each destination. The entry made contains two information's, first one is it will update its destination with the next hope and then the next hope will update its sequence number which shows that how recently this node has updated. MAODV

MAODV also updates the upstream link if any link associated against this entry goes down. MAODV also uses the same broadcasting mechanism as used by the DSR for discovery within the network but it is different from AODV as it only receives route reply from those nodes which belongs to a family of multicast group. MAODV

Fig1: MAODV Joining Process- Image reproduced

The group leader broadcast a HELLO message to all the nodes and they update their request table upon this group HELLO message. If a new node is interested to be a part of join this group, initially it will generate a route request packet (RREQ). The node unicast this request if it already knows the group leader address otherwise it will be broadcasted. The group leader or any other node of the requested group having a grater sequence number than that of the RREQ packet is allowed to respond. As the message is broadcasted the members of the group or the group leader will receive several RREQ packets but it will consider only one having the highest sequence number and least hope count. MAODV

After selecting the request packet, it unicast a route reply packet to the desired node. This replying packet consists of the sequence number which is recently updated and the distance of the node from the group leader. The requesting node at its end also receives numerous replies from different nodes and group leader but selects only one having the shortest distance among all RREP packets and most recently received. After selecting the most suitable route it generates a multicast activation packet (MCAT) to its neighbor node to enable the desired route. MAODV

THRESHOLD SENSITIVE ENERGY EFFICIENT SENSOR NETWORK ( TEEN) Threshold sensitive Energy Efficient sensor Network (TEEN) belongs to on-demand routing protocols category and mostly used for time crucial applications. In TEEN, nodes have two levels of cluster heads and also they follow hierarchical clustering design. After nodes have selected their cluster head, user needs to manually enter the attribute values, which will be broadcasted by cluster head in form of two parameters soft threshold and hard threshold. TEEN

The sensor nodes will start transmitting data when minimum threshold value is greater than hard threshold. Another variable called sensed value is used for transmitted data. Teen saves data continuously. The soft threshold also saves energy by reducing the transmission, when there no or little change in the attribute value. Cluster head will definitely consume more energy than a normal node because it needs to do extra processing. TEEN

The biggest disadvantage of this protocol is that when hard threshold value is higher than sensed value there will be no transmission to clustered head from node, so the cluster head will have no information updation even if the node is no more in network. This problem can easily be addressed by fixing soft threshold to as minimum value as possible even though it would increase energy consumption but nodes sensibility will also be increased. This protocol uses Time Division Multiple Access (TDMA) as a scheduler to send data between nodes and their cluster heads. Figure 2 shows operational flow diagram of TEEN protocol. TEEN

Fig 2: Operational Flow of TEEN

Adaptive Periodic Threshold-sensitive Energy Efficient sensor network protocol (APTEEN) APTEEN, is a hybrid protocol proposed in for both periodic data collection and time critical events. In this, cluster is formed with 1st level and 2nd level cluster heads. After selecting the cluster head (CH) it receives the attribute from the user. The CH broadcasts the attribute, hard threshold (HT), soft threshold (ST), schedule and count time (CT) parameters to the cluster members. APTEEN

The sensor nodes sense continuously The sensor nodes sense continuously. If the sensed value is above the HT it is stored in the internal variable (SV) and transmitted to the CH through the TDMA schedule assigned for it. All the clusters formed here may not have uniform number of sensor nodes. The cluster formed with maximum number of nodes requires more time to aggregate the captured data from nodes and transmit to BS than the cluster with minimum number of nodes. APTEEN

Suppose in any cluster, adjacent nodes have the similar sensed data to transmit then those nodes are formed as a pair. Only one node from the pair will respond to the query while the another node goes to sleep mode. The node which responds to the query is considered as active node and the other node which goes to sleep mode is considered as sleep node. This protocol supports one time query, historical query and persistent query. The BS needs to respond to nodes query only after receiving the data from all the CHs. APTEEN

As the cluster head of cluster with maximum members require more time to communicate with BS a modified TDMA schedule is assigned as per which BS needs to wait until data from CH of cluster with more members reaches it. Apart from responding to time critical events, the nodes were also forced to transmit data to CH at periodic intervals as CT even though the sensed data does not exceed the threshold value. Where CT is the maximum time period between two successive reports sent by a node. Due to this periodic transmission, frequent updates of the nodes sensed value are transmitted to its CH. In this protocol the energy consumption can be reduced by properly selecting the CT and threshold values. APTEEN

CDMA schedule is used to avoid collisions during cluster heads communicating with BS. The attributes can be changed during the every cluster head change time. The main drawback ofthis protocol is the additional complexity required to implement the threshold functions and CT. APTEEN

Fig 3: Operation Flow of APTEEN

SPEED Protocol SPEED maintains a desired delivery speed across sensor networks by both diverting traffic at the networking layer and locally regulating packets sent to the MAC layer. It consists of the following components: An API, A neighbor beacon exchange scheme, A delay estimation scheme, the Stateless Non-deterministic Geographic Forwarding algorithm (SNGF), A Neighborhood Feedback Loop (NFL), Backpressure Rerouting, Last mile processing As shown in Figure 4,.SNGF is the routing module responsible for choosing the next hop candidate that can support the desired delivery speed SPEED

Fig 4 SPEED Protocol- Image reproduced

NFL and Backpressure Rerouting are two modules to reduce or divert traffic when congestion occurs, so that SNGF has available candidates to choose from. The last mile process is provided to support the three communication semantics mentioned before. Delay estimation is the mechanism by which a node determines whether or not congestion has occurred. And beacon exchange provides geographic location of the neighbors so that SNGF can do geographic based routing. SPEED

SPEED only stores the information of very next node, so it requires less memory. Neighboring beacon is used for information interchange between nodes. To identify traffic changes in the network two types of on demand beacons are used i.e. delay estimation and back pressure beacon. SPEED uses Backpressure rerouting mechanism for congestion control handling in the network. congestion. Figure 4 shows the protocol structure of SPEED protocol. SPEED

REAL-TIME POWER-AWARE ROUTING IN SENSOR NETWORKS (RPAR) RPAR is a real time protocol proposed in which achieves application-specified communication delays at low energy cost by dynamically adapting transmission power and routing decisions based on packet deadlines. The primary design objective of RPAR is to increase the number of packets which meets their deadlines. Another distinguishing feature of RPAR is that it handles realistic properties of WSN such as lossy links, limited memory, and bandwidth. RPAR

RPAR has four components: Dynamic velocity assignment policy : It uses the velocity assignment policy to map a packet’s deadline to a required velocity. Delay estimator: This evaluates the one-hop delay of each forwarding choice in the neighbor table, i.e. the time a node takes to deliver a packet to neighbor N at power level p. RPAR

Forwarding policy: Based on the velocity requirement and the information provided by the delay estimator, It forwards the packet using the most energy efficient forwarding choice in its neighborhood table that meets the required velocity. Neighborhood manager: This manager attempts to find a new forwarding choice that meets the required velocity through power adaptation and neighbor discovery, when the forwarding policy cannot find a forwarding choice that meets the required velocity in the neighbor table. RPAR trades-off between the communication delay and throughput. RPAR

LEACH Protocol In the LEACH protocol, random, adaptive, self-organizing cluster formation method. Fig 5. depicts a wireless sensor network protocol based on LEACH is divided into five clusters, each cluster has a black circle represents the first cluster node , the rest of the white circle indicates a non cluster head node. Each cluster has a cluster head node, protocol randomly selecting cluster head node cycle, the energy of the entire network load equally distributed to each sensor node can achieve lower energy consumption, the purpose of improving network lifetime LEACH

Fig 5: LEACH protocol Cluster Structure

LEACH protocol has the following deficiencies: the use of cluster head nodes in random rotation method which can reduce the energy consumption, but repeatedly re-clustering will still consume more energy. different clusters, the cluster head node and cluster head nodes from non-different, the communication process increases the energy consumption of cluster head. The cluster head node need to communicate with the sink node to complete the data fusion work, energy consumption increased LEACH

Conclusion Providing an energy-efficient multicast routing protocol is of paramount importance for many new applications being developed for the resource scarce in WSN. This presentation presents an overview of different energy efficient multicast routing protocols for wireless sensor networks. Generally, all of them needs low processing and memory for routing that means lower energy requirements. CONCLUSION

REFERENCES D.Baghyalakshmi, Jemimah Ebenezer, S.A.V. Satyamurty,”LOW LATENCY AND ENERGY EFFICIENTROUTING PROTOCOLS FOR WIRELESSSENSOR NETWORKS” ICWCSC,2010. Abid Ali Minhas, Fazl-e-Hadi, Danish Sattar, KashifMustaq and S. Ali Rizvi” Energy Efficient Multicast Routing Protocols for Wireless Sensor Networks” IEEE 2011. Ricardo Silva #1, Jorge S´a Silva #2.”Why Should Multicast be used in WSNs” IEEE ISWCS 2008 W. B. Jaballah and N. Tabbane, "Multi path multi speed contention window adapter," IJCSNS International Journal of Computer Science and Network Security" vol. 9, no. 2, 2009. A. Manjeshwar and D. P. Agarwal, "Teen: A routing protocol for enhanced efficiency in wireless sensor networks," Proceedings 15th International Parallel and Distributed Processing. IPDPS, 2001 REFERENCES