Exploring the energy-latency trade-off for broadcasts in energy-saving sensor networks

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2005, Pages 17-26

  Miller, Matthew J ^a   Sengul, Cigdem ^a   Gupta, Indranil ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMPUTER SIMULATION; NETWORK PROTOCOLS; RELIABILITY; PROBABILITY; SCHEDULING; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

PERFORMANCE METRICS; SLEEP SCHEDULING PROTOCOLS; WIRELESS SENSOR NETWORKS (WSN); ENERGY-LATENCY; MULTI-HOP WIRELESS SENSOR NETWORKS; RELIABILITY BOUNDARY; SCHEDULING PROTOCOLS;

SENSORS; TELECOMMUNICATION NETWORKS;

EID: 27944480119     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Crossbow Technology, http://www.xbow.com.
2. J. Elson and K. Römer. Wireless Sensor Networks: A New Regime for Time Synchronization. In ACM Hot Topics in Networks 2002, October 2002.
3. G. Grimmet and A. M. Stacey. Critical probabilities for site and bond percolation models. Annals of Probability, 26(4):1788-1812, 1998.
4. A. J. Guttmann and R. J. Bursill. Critical exponent for the loop erased self-avoiding walks by monte carlo methods. Journal of Statistical Physics, 59, 1990.
5. Z. J. Haas, J. Y. Halpern, and L. Li. Gossip-Based Ad Hoc Routing. In IEEE Infocom, June 2002.
6. W. R. Heinzelman, J. Kulik, and H. Balakrishnan. Adaptive Protocols for Information in Wireless Sensor Networks. In ACM MobiCom 1999, August 1999.
7. IEEE 802.11. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, 1999.
8. MICA2 Mote Datasheet. http://www.xbow.com.
9. M. E. J. Newman and R. M. Ziff. A fast monte carlo algorithm for site or bond percolation. Technical report, Santa Fe Institute, 2001.
10. R. Kenyon. Loop-erased random walks, Universite de Paris-Sud.
11. V. Rajendran, K. Obraczka, and J. J. Garcia-Luna-Aceves. Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks. In ACM SenSys 2003, November 2003.
12. N. Reijers and K. Langendoen. Efficient Code Distribution in Wireless Sensor Networks. In ACM WSNA 2003, September 2003.
13. Y. Sasson, D. Carin, and A. Schiper. Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks. In IEEE Wireless Communications of Networking Conference (WCNC), March 2003.
14. C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Srivastava. Topology Management for Sensor Networks: Exploiting Latency and Density. In ACM MobiHoc 2002, June 2002.
15. P. Sinha, R. Sivakumar, and V. Bharghavan. Enhancing ad hoc routing with dynamic virtual infrastructures. In IEEE Infocom, April 2001.
16. R. Sivakumar, P. Sinha, and V. Bharghavan. CEDAR: A core-extraction distributed ad hoc routing algorithm. In IEEE Infocom, March 1999.
17. T. Stathopoulos, J. Heidemann, and D. Estrin. A remote code update mechanism for wireless sensor networks. Technical Report CENS-TR-30, UCLA, Center for Embedded Networked Computing, 2003.
18. ns-2 - The Network Simulator. http://www.isi.edu/nsnam/ns.
19. T. van Dam and K. Langendoen. An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks. In ACM SenSys 2003, November 2003.
20. W. Ye, J. Heidemann, and D. Estrin. An Energy-Efficient MAC Protocol for Wireless Sensor Networks. In IEEE Infocom, June 2002.