Performance of random routing on grid-based sensor networks

Authors:
Dulanjalie C. Dhanapala;Anura P. Jayasumana;Qi Han
Affiliations:
Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO;Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO;Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 13
Cited 2

Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Negotiation-based protocols for disseminating information in wireless sensor networks

Wireless Networks - Selected Papers from Mobicom'99
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
Power efficient data gathering and aggregation in wireless sensor networks

ACM SIGMOD Record
Efficient and robust query processing in dynamic environments using random walk techniques

Proceedings of the 3rd international symposium on Information processing in sensor networks
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks

RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Zonal Rumor Routing for Wireless Sensor Networks

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
RandomWalk Routing for Wireless Sensor Networks

PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Random walk based routing protocol for wireless sensor networks

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks

ACM SIGCOMM Computer Communication Review
An optimal coverage scheme for wireless sensor network

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
A survey on sensor networks

IEEE Communications Magazine

On random routing in wireless sensor grids: A mathematical model for rendezvous probability and performance optimization

Journal of Parallel and Distributed Computing
Packets travelling in non-homogeneous networks

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random routing protocols in sensor networks forward packets to randomly selected neighbors. These packets are agents carrying information about events, or queries seeking such information. We derive the probability of a packet visiting a given node in a given step as well as the rendezvous probability of agents and queries within a specific number of hops at a given node(s) in a 2-D grid-based sensor network. The utility of the model is demonstrated by determining the protocol parameters to optimize performance of rumor routing protocol under different constraints, e.g., to evaluate the number of queries and agents to maximize the probability of rendezvous for a given amount of energy. Monte Carlo simulations are used to validate the model. The closed form exact solution presented, unlike existing models relying on asymptotic behavior, is applicable to small and medium-scale networks as well. An upper bound is provided for the case where the packet is not sent back to its immediate forwarding node. Simulation results indicate that the model is a good approximation even for sparse arrays with 75 % of the nodes. The model can be used to set parameters and optimize performance of several classes of random routing protocols.