Parametric probabilistic routing in sensor networks

Mobile Networks and Applications

Volumn 10, Issue 4, 2005, Pages 529-544

  Barrett, Christopher L ^a   Eidenbenz, Stephan J ^a   Kroc, Lukas ^a   Marathe, Madhav ^a   Smith, James P ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Probabilistic routing; Sensor networks; Simulation

Indexed keywords

DETERMINISTIC PROTOCOLS; PROBABILISTIC ROUTING; ROUTING PROTOCOLS; SENSOR NETWORKS;

ALGORITHMS; COMPUTER SIMULATION; MOBILE COMPUTING; NETWORK PROTOCOLS; PACKET SWITCHING; WIRELESS TELECOMMUNICATION SYSTEMS;

SENSOR DATA FUSION;

EID: 20844456212     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11036-005-1565-x     Document Type: Conference Paper

References (15)

1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, A Survey on Sensor Networks, IEEE Communications Magazine (August 2002).
2. C.L. Barrett, M. Drozda, M.V. Marathe, S.S. Ravi and J.P. Smith, A Mobility and Traffic Generation Framework for Modeling and Simulating Ad Hoc communication networks, in press, Scientific Programming (2003).
3. J. Broch, D. Maltz, D. Johnson, Y. Hu and J. Jetcheva, Performance comparison of multi-hop wireless Ad Hoc network routing protocols, in: Proc. 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, ACM, Dallas, TX (October 1998).
4. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart and D. Terry, Epidemic algorithms for replicated database maintenance, in: Proceedings ACM Symposium on Principles of Distributed Computing (PODC) (1987) pp. 1-12.
5. D. Ganesan, R. Govindan, S. Shenker and D. Estrin, Highly resilient, energy efficient multipath routing in wireless sensor networks, Mobile Computing and Communications Review 1(2).
6. Z. Haas, J.Y. Halpern and Li Li, Gossip-based Ad Hoc routing, in: Proceedings of INFOCOM 2002 (2002).
7. D. Kempe, J. Kleinberg and A. Demers, Spatial gossip and resource location protocols, in: Proceedings of 33rd ACM Symposium on the Theory of Computing (STOC) (2001).
8. L. Kleinrock and J. Sylvester, Optimum transmission radii for packet radio networks or why six is a magic number, in: Proc. IEEE National Telecommunications Conference, Birmingham, AL (Dec. 1978) pp. 4.3.1-4.3.5.
9. http://www.ms.mff.cuni.cz/~lkro8496/LANL/PPSNR/.
10. F. Kuhn, R. Wattenhofer and A. Zollinger, Worst case optimal and average case efficient geometric Ad-hoc routing, in: Proc. 4th ACM International Symposium on Mobile Networking and Computing (2003) pp. 267-278.
11. J. Luo, P.T. Eugster and J.-P. Hubaux, Route driven gossip: Probabilistic reliable multicast in Ad Hoc networks, in: Proceedings of INFOCOM 2003 (2003).
12. M. Mauve, J. Widmer and H. Hartenstein, A survey on position based routing in mobile Ad-hoc networks, IEEE Network (Nov. 2001).
13. S. Ramanathan and M. Steenstrup, A survey of routing techniques for mobile communication networks, Mobile Networks and Applications 1/2 (1996) 89-104.
14. S.D. Servetto and G. Barranechea, Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks, in: Proceedings of 1st ACM International Workshop and Wireless Sensor Networks and Applications (WSNA 2002) (2002).
15. Routing in Communication Networks, ed. M. Steenstrup, Prentice Hall, New Jersey, 1995.