Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the 2002 ACM symposium on Applied computing
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Source-location privacy in energy-constrained sensor network routing
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Minimum energy reliable paths using unreliable wireless links
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 2005 ACM symposium on Applied computing
SmartGossip: an improved randomized broadcast protocol for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Wireless ad hoc lattice computers (WAdL)
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Adaptive Localized QoS-Constrained Data Aggregation and Processing in Distributed Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
International Journal of Sensor Networks
Dynamic address allocation for self-organised management and control in sensor networks
International Journal of Mobile Network Design and Innovation
A study of self-organization mechanisms in ad hoc and sensor networks
Computer Communications
Performance analysis of probabilistic multi-path geographic routing in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?
Bio-Inspired Computing and Communication
Localized Probabilistic Routing for Data Gathering in Wireless Ad Hoc Networks
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Performance Evaluation of Gradient Routing Strategies for Wireless Sensor Networks
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks
Computer Communications
SAGE: a strong privacy-preserving scheme against global eavesdropping for ehealth systems
IEEE Journal on Selected Areas in Communications - Special issue on wireless and pervasive communications for healthcare
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
A framework for opportunistic routing in multi-hop wireless networks
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
CASINO: creating alea with a sensor-based interactive network
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
EURASIP Journal on Wireless Communications and Networking - Special issue on design, implementation, and evaluation of wireless sensor network systems
Fuzzy-based load self-configuration in mobile P2P services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximizing network lifetime online by localized probabilistic load balancing
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Probability based dynamic load-balancing tree algorithm for wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
Hi-index | 0.00 |
Motivated by realistic sensor network scenarios that have misinformed nodes and variable network topologies, we propose a fundamentally different approach to routing that combines the best features of limited-flooding and information-sensitive path-finding protocols into a reliable, low-power method that can make delivery guarantees independent of parameter values or information noise levels. We introduce Parametric Probabilistic Sensor Network Routing Protocols, a family of light-weight and robust multi-path routing protocols for sensor networks in which an intermediate sensor decides to forward a message with a probability that depends on various parameters, such as the distance of the sensor to the destination, the distance of the source sensor to the destination, or the number of hops a packet has already traveled. We propose two protocol variants of this family and compare the new methods to other probabilistic and deterministic protocols, namely constant-probability gossiping, uncontrolled flooding, random wandering, shortest path routing (and a variation), and a load-spreading shortest-path protocol inspired by [Servetto, Barrenechea, 2002]. We consider sensor networks where a sensor's knowledge of the local or global information is uncertain (parametrically noised) due to sensor mobility, and investigate the trade-off between robustness of the protocol as measured by quality of service (in particular, successful delivery rate and delivery lag) and use of resources (total network load). Our results show that the multi-path protocols are less sensitive to misinformation, and suggest that in the presence of noisy data, a limited flooding strategy will actually perform better and use fewer resources than an attempted single-path routing strategy, with the Parametric Probabilistic Sensor Network Routing Protocols outperforming other protocols. Our results also suggest that protocols using network information perform better than protocols that do not, even in the presence of strong noise.