Parametric Probabilistic Sensor Network Routing

Proceedings of the Second ACM International Workshop on Wireless Sensor networks and Applications, WSNA 2003

Volumn , Issue , 2003, Pages 122-131

  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

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

PROBABILISTIC ROUTING; SENSOR NETWORKS;

SENSOR DATA FUSION;

EID: 1542347200     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/941365.941368     Document Type: Conference Paper

References (14)

1. Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, Erdal 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. 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, D. Terry; Epidemic algorithms for replicated database maintenance; Proceedings ACM Symposium on Principles of Distributed Computing (PODC), pp. 1-12, 1987.
5. Deepak Ganesan, Ramesh Govindan, Scott Shenker, Deborah Estrin; Highly Resilient, Energy Efficient Multipath Routing in Wireless Sensor Networks; Mobile Computing and Communications Review, Vol. 1, No. 2.,
6. Zygmunt Haas, Joseph Y. Halpern, Li Li; Gossip-Based Ad Hoc Routing; Proceedings of INFOCOM 2002, 2002.
7. David Kempe, Jon Kleinberg, Alan Demers; Spatial Gossip and Resource Location Protocols; 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; Proc. IEEE National Telecommunications Conference, Birmingham, AL, pp. 4.3.1-4.3,5, Dec. 1978.
9. F. Kuhn, R. Wattenhofer and A. Zollinger, Worst Case Optimal and Average Case Efficient Goemetric Ad-hoc Routing Proc. 4th ACM International Symposium on Mobile Networking and Computing, pp. 267-278, 2003.
10. Jun Luo, Patrick Th. Eugster, Jean-Pierre Hubaux; Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks; Proceedings of INFOCOM 2003, 2003.
11. M. Mauve, J. Widmer and H. Hartenstein, A Survey on Position Based Routing in Mobile Ad-hoc Networks, IEEE Network, Nov. 2001.
12. S. Ramanathan and M. Steenstrup, A survey of Routing Techniques for Mobile Communication Networks. Mobile Networks and Applications, Vol. 1-2, 1996, pp. 89-104.
13. Sergio D. Servetto, Guillermo Barranechea; Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks; Proceedings of 1st ACM International Workshop and Wireless Sensor Networks and Applications (WSNA 2002), 2002.
14. Routing in Communication Networks, M. Steenstrup, Editor, Prentice Hall, New Jersey, 1995