Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Multi-hop communication is order-optimal for homogeneous sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
RandomWalk Routing for Wireless Sensor Networks
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A Device Search Strategy Based on Connections History for Patient Monitoring
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Performance of random routing on grid-based sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
INFOCOM'10 Proceedings of the 29th conference on Information communications
Random walk with jumps in large-scale random geometric graphs
Computer Communications
Dircast: flooding-reduced routing in MANETs without destination coordinates
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Journal of Parallel and Distributed Computing
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In recent years, design of wireless sensor networks using methodologies and mechanisms from other disciplines has gained popularity for addressing many networking aspects and providing more flexible and robust algorithms. We address in this paper the problem of random walk to model routing for data gathering in wireless sensor networks. While at first glance, this approach may seem to be overly simplistic and highly inefficient, many encouraging results that prove its comparability with other approaches have been obtained over the years. In this approach, a packet generated from a given sensor node performs a random motion until reaching a sink node where it is collected. The objective of this paper is to give an analytical model to evaluate the performance of the envisioned routing scheme with special attention to two metrics: the mean system data gathering delay and the induced spatial distribution of energy consumption. The main result shows that this approach achieves acceptable performance for applications without too stringent QoS requirements provided that the ratio of sink nodes over the total number of sensor nodes is carefully tuned.