On bounding node-to-sink latency in wireless sensor networks with multiple sinks

Bounding node-to-sink latency is an important issue of wireless sensor networks WSNs with a quality of service requirement. This paper proposes to deploy multiple sinks to control the worst case node-to-sink data latency in WSNs. The end-to-end latency in multihop wireless networks is known to be proportional to the hop length of the routing path that the message moves over. Therefore, we formulate the question of what is the minimum number of sinks and their locations to bound the latency as the minimum d-hop sink placement problem. We also consider its capacitated version. We show problems are NP-hard in unit disk graph UDG and unit ball graph, and propose constant factor approximations of the problems in both graph models. We further extend our algorithms so that they can work well in more realistic quasi UDG model. A simulation study is also conducted to see the average performance of our algorithms.

[1]  Donghyun Kim,et al.  A PTAS for Minimum d-Hop Underwater Sink Placement Problem in 2-d Underwater Sensor Networks , 2009, Discret. Math. Algorithms Appl..

[2]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Chang-Gun Lee,et al.  Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[5]  Hanif D. Sherali,et al.  Maximizing Capacity in Multihop Cognitive Radio Networks under the SINR Model , 2011, IEEE Transactions on Mobile Computing.

[6]  Y. Marignac,et al.  Note , 1951, Neurochemistry International.

[7]  Donghyun Kim,et al.  Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks , 2011, IEEE/ACM Transactions on Networking.

[8]  Dung T. Huynh,et al.  Connected D-Hop Dominating Sets in Mobile Ad Hoc Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[9]  Driss Aboutajdine,et al.  An energy aware QoS routing protocol for wireless sensors network , 2009, 2009 International Conference on Multimedia Computing and Systems.

[10]  Mohamed Eltoweissy,et al.  Service-oriented sensor-actuator networks: Promises, challenges, and the road ahead , 2007, Comput. Commun..

[11]  Mohamed F. Younis,et al.  An energy-aware QoS routing protocol for wireless sensor networks , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[12]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[13]  Satyajayant Misra,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Chenyang Lu,et al.  SPEED: a stateless protocol for real-time communication in sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[15]  Martin Reisslein,et al.  A survey of multimedia streaming in wireless sensor networks , 2008, IEEE Communications Surveys & Tutorials.

[16]  Lui Sha,et al.  An implicit prioritized access protocol for wireless sensor networks , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[17]  Chenyang Lu,et al.  RAP: a real-time communication architecture for large-scale wireless sensor networks , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[18]  Ian F. Akyildiz,et al.  Wireless sensor and actor networks: research challenges , 2004, Ad Hoc Networks.

[19]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[20]  Mohamed F. Younis,et al.  Intelligent Gateways Placement for Reduced Data Latency in Wireless Sensor Networks , 2007, 2007 IEEE International Conference on Communications.

[21]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[22]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[23]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[24]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[25]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[26]  Sergiy Butenko,et al.  On connected domination in unit ball graphs , 2011, Optim. Lett..

[27]  Donghyun Kim,et al.  Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks , 2010, Optim. Lett..

[28]  Sergiy Butenko,et al.  On minimum connected dominating set problem in unit-ball graphs , 2007 .

[29]  Donghyun Kim,et al.  A Better Approximation for Minimum Average Routing Path Clustering Problem in 2-d Underwater Sensor Networks , 2009, Discret. Math. Algorithms Appl..

[30]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.