Sleeping schedule-aware minimum latency broadcast in wireless ad hoc networks

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Hong, Jue ^a,b   Cao, Jiannong ^b   Li, Wenzhong ^a   Lu, Sanglu ^a   Chen, Daoxu ^a  

^a NANJING UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; COLORING ALGORITHMS; FUNDAMENTAL OPERATIONS; IMPROVED ALGORITHM; LATENCY FUNCTION; LOWER BOUNDS; MAXIMUM DEGREE; NP-HARDNESS; POWER-SAVING; SHORTEST PATH TREE; SLEEPING SCHEDULE; TIME COMPLEXITY; TIME SLOTS; TOPDOWN;

ALGORITHMS; BROADCASTING; COLORING; CONTROL THEORY; SIMULATED ANNEALING; SLEEP RESEARCH; WIRELESS AD HOC NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 70449479008     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5199463     Document Type: Conference Paper

References (15)

1. R. Zheng, J. C. Hou, and L. Sha, "Asynchronous wakeup for ad hoc networks," in MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, 2003, pp. 35-45.
2. R. Zheng and R. Kravets, "On-demand power management for ad hoc networks," in INFOCOM 2003: Proceedings of the IEEE Infocom, vol. 1, March-3 April 2003, pp. 481-491.
3. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks," Communications Magazine, IEEE, vol. 40, no. 8, pp. 102-114, Aug 2002.
4. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The broadcast storm problem in a mobile ad hoc network," in MobiCom '99: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, 1999, pp. 151-162.
5. R. Gandhi, S. Parthasarathy, and A. Mishra, "Minimizing broadcast latency and redundancy in ad hoc networks," in MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, 2003, pp. 222-232.
6. I. Chlamtac and S. Kutten, "Tree-based broadcasting in multihop radio networks," IEEE Trans. Comput., vol. 36, no. 10, pp. 1209-1223, 1987.
7. S. Huang, P. J. Wan, X. Jia, H. Du, and W. Shang, "Minimum-latency broadcast scheduling in wireless ad hoc networks," in INFOCOM 2007: Proceedings of the IEEE Infocom, 2007, pp. 733-739.
8. R. Mahjourian, F. Chen, R. Tiwari, M. Thai, H. Zhai, and Y. Fang, "An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks," in MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, 2008, pp. 331-340.
9. O. Dousse, P. Mannersalo, and P. Thiran, "Latency of wireless sensor networks with uncoordinated power saving mechanisms," in MobiHoc '04: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, 2004, pp. 109-120.
10. G. Lu, N. Sadagopan, B. Krishnamachari, and A. Goel, "Delay efficient sleep scheduling in wireless sensor networks," in INFOCOM 2005: Proceedings of the IEEE Infocom, vol. 4, March 2005, pp. 2470-2481.
11. Q. Cao, T. Abdelzaher, T. He, and J. Stankovic, "Towards optimal sleep scheduling in sensor networks for rare-event detection," in IPSN '05: Proceedings of the 4th international symposium on Information processing in sensor networks, 2005, pp. 20-27.
12. A. Keshavarzian, H. Lee, and L. Venkatraman, "Wakeup scheduling in wireless sensor networks," in MobiHoc '06: Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing, 2006, pp. 322-333.
13. Y. Gu and T. He, "Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links," in SenSys '07: Proceedings of the 5th international conference on Embedded networked sensor systems, 2007, pp. 321-334.
14. D. W. Matula and L. L. Beck, "Smallest-last ordering and clustering and graph coloring algorithms," J. ACM, vol. 30, no. 3, pp. 417-427, 1983.
15. M. Molloy and M. R. Salavatipour, "Frequency channel assignment on planar networks," in ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms, 2002, pp. 736-747.