research-article

Empirical evaluation of querying mechanisms for unstructured wireless sensor networks

Authors:

Sundeep Pattem,

Avinash Sridharan,

Bhaskar KrishnamachariAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 38, Issue 3

Pages 17 - 26

https://doi.org/10.1145/1384609.1384612

Published: 01 July 2008 Publication History

Abstract

In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most of the work is theoretical in nature and while providing insights into the asymptotic behavior of these querying mechanisms, does not account for the non-idealities faced by the network in real deployments. In this paper, we propose a 3-way handshake protocol as a reliable implementation of a random walk and compare its performance with flooding in real environments. The metrics considered are delay, reliability and transmission cost. Our initial results suggest that flooding is better suited for low-interference environments, while random walks might be a better option in networks with high interference. We also present possible research directions to improve the performance oflooding and random walks.

References

[1]

D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin and S. Wicker, Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks. UCLA CS Technical Report UCLA/CSD-TR 02-0013, 2002.

[2]

D. Kotz and C. Newport and C. Elliott, The mistaken axioms of wireless-network research, Technical Report TR2003-467, Dept. of Computer Science, Dartmouth College, July 2003.

[3]

F. Stann, J. Heidemann, R. Shroff, and M. Murtaza, Rbp: Reliable broadcast propagation in wireless networks, In USC/ISI Technical Report ISI-TR-2005-608, 2006.

[4]

B. Krishnamachari, J. Ahn, Optimizing data replication for expanding ring-based queries in wireless sensor networks, WiOpt, Boston, MA, April 2006.

[5]

Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peer-to-peer networks, Proceedings of the 16th annual ACM International Conference on supercomputing (ICS) 2002.

Digital Library

[6]

S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu, Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table, In Mobile Networks and Applications (MONET), Special Issue on Wireless Sensor Networks, 8:4, Kluwer, August 2003.

Digital Library

[7]

D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin, and J. Heidemann, An Evaluation of Multi-resolution Storage for Sensor Networks, The First ACM Conference on Embedded Networked Sensor Systems (Sensys03), November 2003.

Digital Library

[8]

B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy, and S. Shenker, DIFS: A Distributed Index for Features in Sensor Networks, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, May 2003.

[9]

N. B. Chang and M. Liu, Revisiting the ttl-based controlled flooding search: Optimality and randomization, In Proceedings of the Tenth Annual International Conference on Mobile Computing and Networks (ACM MobiCom), 2004.

Digital Library

[10]

N. B. Chang and M. Liu, Controlled flooding search in a large network, accepted for publication, IEEE/ACM Trans. on Networking, 2006.

Digital Library

[11]

Z. Cheng and W. Heinzelman, Flooding Strategy for Target Discovery in Wireless Networks, ACM/Baltzer Wireless Networks, 2005.

Digital Library

[12]

Z. Cheng and W. Heinzelman, Searching Strategy for Multi-Target Discovery in Wireless Networks, 4th Workshop on Applications and Services in Wireless Networks (ASWN '04), August 2004.

[13]

D. Aldous and Fill, Reversible Markov Chains and Random Walks on Graphs, Draft Monograph, online at http://www.stat.berkeley.edu/~aldous/RWG/book.html

[14]

N. Sadagopan, B. Krishnamachari, and A. Helmy, The ACQUIRE Mechanism for Efficient Querying in Sensor Networks, IEEE International Workshop on Sensor Network Protocols and Applications (SNPA'03), May 2003.

[15]

N. Sadagopan, B. Krishnamachari, and A. Helmy, Active Query Forwarding in Sensor Networks (ACQUIRE), Journal of Ad Hoc Networks, Elsevier, Vol 3, Issue 1, pp. 91--113, January 2005.

[16]

D. Braginsky and D. Estrin, Rumor Routing Algorithm For Sensor Networks, The First Workshop on Sensor Networks and Applications (WSNA'02), October 2002.

Digital Library

[17]

J. Zhao and R. Govindan, Understanding Packet Delivery Performance in Dense Wireless Sensor Networks, ACM Sensys, November 2003.

Digital Library

[18]

D. Lal, A. Manjeshwar, F. Herrmann, E. Biyikoglu, A. Keshavarzian, Measurement and characterization of link quality metrics in energy constrained wireless sensor networks, GLOBECOM 2003 - IEEE Global Telecommunications Conference, no. 1, Dec 2003 pp. 446--452.

[19]

A. Cerpa, N. Busek, and D. Estrin, SCALE: A tool for Simple Connectivity Assessment in Lossy Environments, CENS Technical Report, September 2003.

[20]

A. Cerpa, J. Wong, L. Kuang, M. Potkonjak and D. Estrin, Statistical Model of Lossy Links in Wireless Sensor Networks, In the ACM/IEEE Fourth International Conference on Information Processing in Sensor Networks (IPSN'05), UCLA, Los Angeles, California, USA, April 25-27, 2005.

Digital Library

[21]

M. Zuniga, B. Krishnamachari, Analyzing the Transitional Region in Low Power Wireless Links, First IEEE International Conference on Sensor and Ad hoc Communications and Networks (SECON), Santa Clara, CA, October 2004.

[22]

K. Whitehouse, A. Woo, F. Jiang, J. Polastre, D. Culler, Exploiting the Capture Effect for Collision Detection and Recovery, The Second IEEE Workshop on Embedded Networked Sensors (EmNetS-II). Sydney, Australia. May 30-31, 2005.

Digital Library

[23]

D. Son, B. Krishnamachari, and J. Heidemann, Experimental Analysis of Concurrent Packet Transmissions in Low-Power Wireless Networks, Technical Report ISI-TR-609, USC/Information Sciences Institute, December, 2005.

[24]

S. D. Servetto, G. Barrenechea, Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks, In the Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, GA, September 2002.

Digital Library

[25]

C. Avin and C. Brito, Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques, In Proceedings of the Third IEEE/ACM International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 396--404, Berkeley, California, April 26-27, 2004.

Digital Library

[26]

R. Stevens and G. Wright TCP/IP Illustrated Vol.2 - The Implementation, Addison-Wesley, 1995.

Digital Library

[27]

http://www.moteiv.com/products/tmotesky.php.

Cited By

Nandi SGanguly N(2015)Resource Constrained Randomized Coverage Strategies for Unstructured NetworksPropagation Phenomena in Real World Networks10.1007/978-3-319-15916-4_5(107-134)Online publication date: 20-Mar-2015
https://doi.org/10.1007/978-3-319-15916-4_5
Mian AFatima MKhan RPrakash R(2014)An Empirical Evaluation of Lightweight Random Walk Based Routing Protocol in Duty Cycle Aware Wireless Sensor NetworksThe Scientific World Journal10.1155/2014/9462492014(1-9)Online publication date: 2014
https://doi.org/10.1155/2014/946249
Riva GFinochietto J(2014)In-Network Filtering Schemes for Type-Threshold Function Computation in Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks10.1155/2014/24592410:8(245924)Online publication date: Jan-2014
https://doi.org/10.1155/2014/245924
Show More Cited By

Index Terms

Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
1. Networks
  1. Network architectures

Recommendations

An experimental investigation of optimized flooding protocols using a wireless sensor network testbed

In addition to unicast routing, most wireless multi-hop networks also need network-wide broadcasting. In this paper, we investigate Blind Flooding and two different types of optimized flooding protocols: Counter-Based Broadcasting (CBB) and a neighbor ...
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
MobiCom '09: Proceedings of the 15th annual international conference on Mobile computing and networking

Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has yet been done on low-duty-cycle wireless sensor networks in which nodes stay ...
Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks

Network-wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 38, Issue 3

July 2008

96 pages

ISSN:0146-4833

DOI:10.1145/1384609

Issue’s Table of Contents

Copyright © 2008 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2008

Published in SIGCOMM-CCR Volume 38, Issue 3

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
234
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Nandi SGanguly N(2015)Resource Constrained Randomized Coverage Strategies for Unstructured NetworksPropagation Phenomena in Real World Networks10.1007/978-3-319-15916-4_5(107-134)Online publication date: 20-Mar-2015
https://doi.org/10.1007/978-3-319-15916-4_5
Mian AFatima MKhan RPrakash R(2014)An Empirical Evaluation of Lightweight Random Walk Based Routing Protocol in Duty Cycle Aware Wireless Sensor NetworksThe Scientific World Journal10.1155/2014/9462492014(1-9)Online publication date: 2014
https://doi.org/10.1155/2014/946249
Riva GFinochietto J(2014)In-Network Filtering Schemes for Type-Threshold Function Computation in Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks10.1155/2014/24592410:8(245924)Online publication date: Jan-2014
https://doi.org/10.1155/2014/245924
Qiu TDing YXia FMa H(2012)A Search Strategy of Level-Based Flooding for the Internet of ThingsSensors10.3390/s12081016312:8(10163-10195)Online publication date: 27-Jul-2012
https://doi.org/10.3390/s120810163
Ho JLiu DWright MDas SIyengar SBrooks R(2012)Distributed Detection of Replica Node AttacksDistributed Sensor Networks, Second Edition10.1201/b12988-27(515-536)Online publication date: 13-Dec-2012
https://doi.org/10.1201/b12988-27
Ahn JZuniga MKrishnamachari BIyengar SBrooks R(2012)On-Demand Querying in Sensor NetworksDistributed Sensor Networks, Second Edition10.1201/b12988-25(481-498)Online publication date: 13-Dec-2012
https://doi.org/10.1201/b12988-25
Ohshima KHara HHagiwara YTerada M(2012)Field investigation of the radio transmission performance and distance in a environmental wireless sensor networkProceedings of the The International Conference on Information Network 201210.1109/ICOIN.2012.6164364(132-137)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1109/ICOIN.2012.6164364
Riva GFinochietto J(2012)A parallel and adaptative query routing scheme for wireless sensor networks2012 IEEE International Conference on Communications (ICC)10.1109/ICC.2012.6364177(243-247)Online publication date: Jun-2012
https://doi.org/10.1109/ICC.2012.6364177
Ding YQiu TMa HJin N(2012)Level Based Flooding for Node Search in Wireless Sensor NetworkProceedings of the 2011 2nd International Congress on Computer Applications and Computational Science10.1007/978-3-642-28308-6_66(483-488)Online publication date: 2012
https://doi.org/10.1007/978-3-642-28308-6_66
Dhanapala DJayasumana AHan Q(2011)On random routing in wireless sensor gridsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2010.10.01671:3(369-380)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1016/j.jpdc.2010.10.016
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents