Multiple Mobile Sinks Deployment for Energy Efficiency in Large Scale Wireless Sensor Networks

In this paper, we consider the multiple sinks placement problem in energy constrained large-scale Wireless Sensor Networks (WSN). First, some fundamental design parameters in WSNs are investigated such as nodes deployment, the network architecture, sink velocity and transmission range. Each of these parameters is analysed and discussed according to its influence on the energy consumption in a WSN. Second, a simple and efficient approach for the placement of multiple sinks within large-scale WSNs is proposed. The objective is to determine optimal sinks’ positions that maximize the network lifetime by reducing energy consumption related to data transmissions from sensor nodes to different sinks. Balanced graph partitioning techniques are used to split the entire WSN into connected sub-networks. Smaller sub-networks are created, having similar characteristics and where energy consumption can be optimized independently but in the same way. Therefore, different approaches and mechanisms that enhance the network lifetime in small-size WSN can be deployed inside each sub-network. Performance results show that the proposed technique significantly enhances the network lifetime.

[1]  Wendi Heinzelman,et al.  Non-uniform information dissemination for sensor networks , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[2]  Kai Li,et al.  A directionality based location discovery scheme for wireless sensor networks , 2002, WSNA '02.

[3]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[4]  Jian Ma,et al.  Designing Energy-Efficient Wireless Sensor Networks with Mobile Sinks , 2006 .

[5]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Anantha Chandrakasan,et al.  Upper bounds on the lifetime of sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  Emanuel Melachrinoudis,et al.  Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[8]  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).

[9]  Catherine Rosenberg,et al.  Design guidelines for wireless sensor networks: communication, clustering and aggregation , 2004, Ad Hoc Networks.

[10]  Takehiro Ito,et al.  Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size , 2006, J. Discrete Algorithms.

[11]  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).

[12]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[13]  Ashutosh Sabharwal,et al.  Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks , 2003, IPSN.

[14]  Yanghee Choi,et al.  Optimal Multi-sink Positioning and Energy-Efficient Routing in Wireless Sensor Networks , 2005, ICOIN.

[15]  Joseph Naor,et al.  Fast approximate graph partitioning algorithms , 1997, SODA '97.

[16]  Jun Luo,et al.  Joint mobility and routing for lifetime elongation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[18]  Jun Luo,et al.  MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks , 2006, DCOSS.

[19]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[20]  Janka Chlebíková,et al.  Approximating the Maximally Balanced Connected Partition Problem in Graphs , 1996, Inf. Process. Lett..

[21]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[22]  Mani B. Srivastava,et al.  The bits and flops of the n-hop multilateration primitive for node localization problems , 2002, WSNA '02.

[23]  Mohamed F. Younis,et al.  A constrained shortest-path energy-aware routing algorithm for wireless sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[24]  Clifford A. Lynch,et al.  Information Networking , 1994 .

[25]  Djamal Zeghlache,et al.  Energy Efficient Scheme for Large Scale Wireless Sensor Networks with Multiple Sinks , 2008, 2008 IEEE Wireless Communications and Networking Conference.