Energy Efficient Routing in Wireless Sensor Networks

P. Anitha Mary, II Year ME (CS), Vels University, Chennai.

Objective
To reduce the various losses occur in the nodes. By using Fair Efficient Location-based Gossiping(FEL Gossiping), network life time will be maximized. Also, it will reduce the propagation delay and loss of packets.

Existing System
In existing method Gossiping and Flooding protocols are used. Gossiping is a data-relay protocol. To Enhance Gossiping protocol, many other protocols are introduced. They are FLossipping SGDF LGossiping

Flooding
Classic Flooding (Send to all neighbors)

Disadvantages of Flooding

Implosion
A (a) C
D (a)

Data Overlap
q
A (q,r) C r

(a) B

s B
(r,s)

(a)

Resource blindness

Gossiping
A

B D C

Forward data to a random neighbor Avoids implosion Disseminates information at a slower rate Fastest rate = 1 node/round

Gossiping

Proposed system
Modified gossiping protocol called FEL Gossiping is used. New algorithm consists of three phase Network Initialization Phase. Information Gathering Phase. Routing Phase.

New Algorithm
Increased the network lifetime. Also achieved a high packet delivery ratio and reduced the delay in delivering the packet. It consists of three phases, They are Network Initialization Phase, Information Gathering Phase and Routing Phase.

Network Initialization Phase

Base station broadcasts a message to its neighbors. Message contains: the Base Station Address and Hop Count. Each node saves the hop count in its memory and increases the hop count by 1. The new hop count is then replaced with the old one. Each node has received the message it will continue to broadcast this message to farther nodes.

Network Initialization Phase

Information Gathering Phase

Source node will draw a transmission radius of 40 m to deal with the nearby nodes. All sensors have GPS and can move to any position within their mobility range. Source node then generates the request message to acquire the information from the neighboring nodes in its transmission radius.

Routing Phase
Neighbor replies to this request by using its residual energy and hop count. Source chooses two neighboring nodes within its transmission radius, that have the minimum hop count towards the sink. If two nodes have the same residual energy we take the nodes that have a lower hop count to the sink.

Source node within its transmission radius selecting two nodes

Routing Phase Contd.,

Upon receiving the message the node repeats the information gathering phase and routing phase processing to transmit the message to another node. The process continues until the message reaches the sink or the TTL is finished.

Routing phase

NS2
Network Simulator A package of tools that simulates behavior of networks Create Network Topologies Analyze events to understand the network behavior

NS-2 Components
NS, the simulator itself Nam, the network animator Visualize ns (or other) output (files.nam) Pre-processing: Traffic and topology generators Post-processing: Generates Output files Simple trace analysis, often in Awk, Perl, or Tcl

PACKET RECEIVED VS TIME

PACKET DROPPED VS TIME

ENERGY VS ITERATION

PARAMETERS CHOOSEN FOR ANALYSIS

Energy Consumption Residual Energy Packet Delay Packet Loss

FUTURE ENHANCEMENT
A novel energy saving scheme termed the Gossip-based sleep protocol (GSP) With GSP each node randomly goes to sleep for some time with gossip sleep probability P. GSP does not require a wireless nodes to maintain the states of other nodes.

Gossip-Sleep Protocol
At the beginning of a gossip period, each node chooses either going to sleep with probability p or staying awake with probability 1 - p for this period All sleeping nodes wake up at the end of each period All nodes repeat the above process for every period

References
Ali Norouzi, Faezeh Sadat Babamir, Abdhul Halim zaim, A Novel Energy Efficient Routing Protocol in Wireless Sensor Network, Scientific Research, Published on October 2011, Wireless Sensor Network,2011,3,pp.341-350. doi:10.4236/wsn.2011.310038 I. F. Akyildiz and M. C. Vuran, Wireless Sensor Net- works, 1st Edition, John Wiley & Sons, Ltd, Chichester, 2010. doi:10.1002/9780470515181

T. He, S. Krishnamurthy, J. A. Stankovic, T. Abdelzaher, L. Luo, R. Stoleru, T. Yan, L. Gu, G. Zhou, J. Hui and B. Krogh, VigilNet: An Integrated Sensor Network System for Energy-Efficient Surveillance, ACM Transactions on Sensor Networks, Vol. 2, No. 1, 2006, pp. 1-38. doi:10.1145/1138127.1138128
R. Verdone, D. Dardari, G. Mazzini and A. Cont, (2007). Wireless Sensor and Actuator Networks Technology, Analysis and Design, 1st Edition, Elsevier, London, 2007.

 K. Akkaya and M. Younis, A Survey of Routing Proto-cols in Wireless Sensor Networks, Elsevier Ad Hoc Network Journal, Vol. 3, No. 3, 2005, pp. 325-349. doi:10.1016/j.adhoc.2003.09.010
A. Norouzi and A. Sertbas, An Integrated Survey in Efficient Energy Management for WSN Using Architecture Approach, International Journal of Advanced Net-working and Applications, Vol. 3, No. 1, 2011, pp. 968- 977. W. Rabiner Heinzelman, J. Kulik and H. Balakrishnan, Adaptive Protocols for Information Dissemination in Wireless Sensor Networks, Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 99), Seattle, Washington, 15-20 August 1999, pp. 174-185 K. Sohraby, D. Minoli and T. Znati, Wireless Sensor Networks Technology, Protocols, and Applications, John Wiley & Sons, Inc., Hoboken, 2007. doi:10.1002/047011276X

Thank You