Design and analysis of novel quorum-based sink location service scheme in wireless sensor networks

Geographic routing in wireless sensor networks requires sources nodes to be aware of the location information of sinks to send their data. To provide the sink location service, quorum-based schemes have been proposed, which exploit crossing points between a quorum of a sink location announcement (SLA) message from a sink and a quorum of a sink location query (SLQ) message from a source node. For guaranteeing at least one crossing point in irregular sensor networks with void areas or irregular boundaries, the previous schemes however collect and flood the network boundary information or forward a SLA and SLQ message along the whole network boundary. In this paper, we design a novel quorum-based sink location service scheme that exploits circle and line quorums, which does not require the network boundary information and send a SLA and SLQ message along the whole network boundary. In the proposed scheme, a source node sends a SLQ message to the network center and sends another SLQ message to an edge node in the network boundary, thus generating a SLQ line quorum. On the other hand, a sink node sends a SLA message along a circle path whose center is the network center, thus forming a SLQ circle quorum. By this way, it is guaranteed that the SLQ and SLA quorums have at least one crossing point in irregular sensor networks. Both numerical analysis and extensive simulation results verify that the proposed scheme outperforms the existing schemes in terms of the delivery distance, the delivery hop count, and the energy consumption for providing sink location service.

[1]  David E. Culler,et al.  Telos: enabling ultra-low power wireless research , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[2]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[3]  Chenyang Lu,et al.  A spatiotemporal communication protocol for wireless sensor networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[4]  B. R. Badrinath,et al.  DV Based Positioning in Ad Hoc Networks , 2003, Telecommun. Syst..

[5]  Sang-Ha Kim,et al.  Data gathering mechanism with local sink in geographic routing for wireless sensor networks , 2010, IEEE Transactions on Consumer Electronics.

[6]  Mahbub Hassan,et al.  Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks , 2013, IEEE Transactions on Mobile Computing.

[7]  Guoqiang Mao,et al.  Use of flip ambiguity probabilities in robust sensor network localization , 2011, Wirel. Networks.

[8]  Hyung Seok Kim,et al.  Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks , 2003, SenSys '03.

[9]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[10]  Naixue Xiong,et al.  Multi-Source Temporal Data Aggregation in Wireless Sensor Networks , 2011, Wirel. Pers. Commun..

[11]  Sang-Ha Kim,et al.  Sink Location Service via Inner Rectangular in Wireless Sensor Networks , 2009, 2009 International Conference on Advanced Information Networking and Applications.

[12]  Anne-Marie Kermarrec,et al.  Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach , 2012, IEEE/ACM Transactions on Networking.

[13]  Ivan Stojmenovic,et al.  A scalable quorum-based location service in ad hoc and sensor networks , 2008 .

[14]  Petra Holtzmann,et al.  Global Positioning System Theory And Practice , 2016 .

[15]  Sándor P. Fekete,et al.  Neighborhood-Based Topology Recognition in Sensor Networks , 2004, ALGOSENSORS.

[16]  Wenjing Lou,et al.  On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks , 2012, Wirel. Networks.

[17]  Athanasios V. Vasilakos,et al.  Compressed data aggregation for energy efficient wireless sensor networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[18]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[19]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[20]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[21]  Pramod K. Varshney,et al.  Selection of a Forwarding Area for Contention-Based Geographic Forwarding in Wireless Multi-Hop Networks , 2007, IEEE Transactions on Vehicular Technology.

[22]  Haiyun Luo,et al.  TTDD: A Two-tier Data Dissemination Model for Large-scale Wireless Sensor Networks , 2002 .

[23]  Sang-Ha Kim,et al.  Sink Location Service for Geographic Routing in Wireless Sensor Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[24]  Naixue Xiong,et al.  Multi-layer clustering routing algorithm for wireless vehicular sensor networks , 2010, IET Commun..

[25]  Vijay Ramaraju,et al.  Energy Efficient Image Transmission In Wireless Multimedia Sensor Networks , 2014 .

[26]  Sungjin Lee,et al.  Node distribution-based localization for large-scale wireless sensor networks , 2010, Wirel. Networks.

[27]  Pramod K. Varshney,et al.  A survey of void handling techniques for geographic routing in wireless networks , 2007, IEEE Communications Surveys & Tutorials.