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
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 Topologies for Wireless Sensor Networks
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
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
Routing in Wireless Sensor Networks Using Ant Colony Optimization
AHS '06 Proceedings of the first NASA/ESA conference on Adaptive Hardware and Systems
Deployment analysis in underwater acoustic wireless sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Scalable logical coordinates framework for routing in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Virtual Sensor Networks - A Resource Efficient Approach for Concurrent Applications
ITNG '07 Proceedings of the International Conference on Information Technology
Jumping ant routing algorithm for sensor networks
Computer Communications
Random walk based routing protocol for wireless sensor networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Emergency guiding and monitoring applications in indoor 3D environments by wireless sensor networks
International Journal of Sensor Networks
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
ACM SIGCOMM Computer Communication Review
On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Nonthreshold-Based Event Detection for 3D Environment Monitoring in Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
New routing framework base on rumor routing in wireless sensor networks
Computer Communications
Ants and reinforcement learning: a case study in routing in dynamic networks
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Performance of random routing on grid-based sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Connectivity optimization for wireless sensor networks applied to forest monitoring
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
IEEE Communications Magazine
Journal of Network and Computer Applications
Hi-index | 0.00 |
Random routing protocols in Wireless Sensor Networks (WSNs) forward packets to randomly selected neighbors. These packets are 'agents' carrying information about events or 'queries' seeking such information. A novel mathematical framework is proposed for analyzing random routing protocols. Exact probability of a packet visiting a given node within a given hop count as well as the rendezvous probability of agents and queries meeting at a given node in a 2-D grid-based WSN are derived. The basic relationship needed for extending the models to a 3-D grid topology is provided. Exact probabilities of agents meeting queries are derived while ignoring physical boundary effects and packet losses, under two different strategies for forwarding the packet to a neighbor: (a) with equal probability, and (b) self-avoiding forwarding. We then extend the model to account for packet losses by considering the case where a packet is forwarded to a neighbor with equal probability. Also provided is the extension of the analysis for a network with rectangular boundaries. The exact solutions presented, unlike existing models relying on asymptotic behavior, are also applicable to small and medium scale networks. They can be used to set parameters and optimize performance of several classes of random routing protocols. All the models are validated using Monte Carlo simulations. Simulation results indicate that the model is also a good approximation for sparse arrays with 75% or higher node density. Finally, the utility of the model is demonstrated by determining the protocol parameters to optimize the performance of rumor routing protocol under a fixed energy budget.