Energy efficiency mechanism using mobile-based Fermat's spiral in WSN

There are 2 well-known ways to optimize energy efficiency in wireless sensor networks (WSN). The first one is to deploy multiple sinks in wireless sensor networks to balance the energy consumption among the wireless sensor nodes. The second technique is to move the sink navigating through wireless sensor network to redirect traffic flow while gathering sensed data timely and efficiently. Both ways will try to reduce the famous bottleneck problem that cause wireless sensor nodes energy nearest to base station depleted very quickly. We evaluated the performance of wireless sensor network using minimum spanning tree algorithm specifically Prim's Algorithm in order to know the bottleneck effect on wireless sensor network and propose a better solution performance based on Fermat Spiral model. We show that such a solution reduces the bottleneck problem, increases the energy efficiency of the network and produces greater data transmission throughput.

[1]  Ioan Raicu Routing Algorithms for Wireless Sensor Networks , 2004, ArXiv.

[2]  R. Prim Shortest connection networks and some generalizations , 1957 .

[3]  Bhaskar Krishnamachari,et al.  Learning-enforced time domain routing to mobile sinks in wireless sensor fields , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[4]  Mohamed F. Younis,et al.  Sink repositioning for enhanced performance in wireless sensor networks , 2005, Comput. Networks.

[5]  Avijit Kar,et al.  Energy Efficient Communication Protocol for a Mobile Wireless Sensor Network System , 2009 .

[6]  Rolland Vida,et al.  Adaptive sink mobility in event-driven multi-hop wireless sensor networks , 2006, InterSense '06.

[7]  R. Urgaonkar FLOW : An Efficient Forwarding Scheme to Mobile Sink in Wireless Sensor Networks , 2004 .

[8]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[9]  Saurabh Bagchi,et al.  Efficient collection of sensor data in remote fields using mobile collectors , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[10]  Yi Sun,et al.  Moving Schemes for Mobile Sinks in Wireless Sensor Networks , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.

[11]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[12]  Mani B. Srivastava,et al.  Mobile Element Scheduling with Dynamic Deadlines , 2007, IEEE Transactions on Mobile Computing.

[13]  S. Vujevi International Conference on Software, Telecommunications and Computer Networks , 2006, 2006 International Conference on Software in Telecommunications and Computer Networks.

[14]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[15]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[16]  Cem Ersoy,et al.  Multiple sink network design problem in large scale wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[17]  H. Vogel A better way to construct the sunflower head , 1979 .