Empirical evaluation of querying mechanisms for unstructured wireless sensor networks

Authors:
Joon Ahn;Shyam Kapadia;Sundeep Pattem;Avinash Sridharan;Marco Zuniga;Jung-Hyun Jun;Chen Avin;Bhaskar Krishnamachari
Affiliations:
University of Southern California, Los Angeles, CA, USA;Cisco Systems Inc., San Jose, CA, USA;University of Southern California, Los Angeles, CA, USA;University of Southern California, Los Angeles, CA, USA;National University of Ireland, Galway, Ireland;University of Cincinnati, Cincinnati, OH, USA;Ben Gurion University of The Negev;University of Southern, Los Angeles, CA, USA
Venue:
ACM SIGCOMM Computer Communication Review
Year:
2008

Citing 13
Cited 5

TCP/IP illustrated (vol. 2): the implementation

TCP/IP illustrated (vol. 2): the implementation
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Rumor routing algorthim for sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Data-centric storage in sensornets with GHT, a geographic hash table

Mobile Networks and Applications
Understanding packet delivery performance in dense wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
An evaluation of multi-resolution storage for sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Efficient and robust query processing in dynamic environments using random walk techniques

Proceedings of the 3rd international symposium on Information processing in sensor networks
Revisiting the TTL-based controlled flooding search: optimality and randomization

Proceedings of the 10th annual international conference on Mobile computing and networking
Statistical model of lossy links in wireless sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Flooding strategy for target discovery in wireless networks

Wireless Networks
Exploiting the capture effect for collision detection and recovery

EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
Controlled flooding search in a large network

IEEE/ACM Transactions on Networking (TON)

Performance of random routing on grid-based sensor networks

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Level biased random walk for information discovery in wireless sensor networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Energy efficient and low latency biased walk techniques for search in wireless sensor networks

Journal of Parallel and Distributed Computing
On random routing in wireless sensor grids: A mathematical model for rendezvous probability and performance optimization

Journal of Parallel and Distributed Computing
Querying dynamic wireless sensor networks with non-revisiting random walks

EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

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.