Minimum-latency schedulings for group communications in Multi-channel multihop wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5682 LNCS, Issue , 2009, Pages 469-478

  Wan, Peng Jun ^a   Wang, Zhu ^a   Wan, Zhiyuan ^b   Huang, Scott C H ^b   Liu, Hai ^c  

^a ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION LATENCY; COMMUNICATION TASK; CONSTANT FACTORS; FOUR-GROUP; GROUP COMMUNICATIONS; INTERFERENCE MODELS; LATENCY BOUNDS; MULTI-CHANNEL; MULTIHOP WIRELESS NETWORK; MULTIPLE CHANNELS; SPEED-UPS; TIGHT BOUND;

COMMUNICATION; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; SCHEDULING ALGORITHMS;

WIRELESS NETWORKS;

EID: 70349331383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03417-6_46     Document Type: Conference Paper

References (14)

1. Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., Perennes, S.: Hardness and approximation of gathering in static radio networks. In: Proceedings FAWN 2006 (2006)
2. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: An Approximation Algorithm for the Wireless Gathering Problem. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.4059, pp. 328-338. Springer, Heidelberg (2006)
3. Chen, X.J., Hu, X.D., Zhu, J.M.: Minimum data aggregation time problem in wireless sensor networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol.3794, pp. 133-142. Springer, Heidelberg (2005)
4. Chen, Z., Qiao, C., Xu, J., Lee, T.: A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks. In: IEEE INFOCOM 2007 (2007)
5. Dessmark, A., Pelc, A.: Tradeoffs between knowledge and time of communication in geometric radio networks. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crete, Greece, July 2001, pp. 59-66 (2001)
6. Florens, C., McEliece, R.: Packets distribution algorithms for sensor networks. In: IEEE INFOCOM 2003, pp. 1063-1072 (2003)
7. Gandhi, R., Kim, Y.-A., Lee, S., Ryu, J., Wan, P.-J.: Approximation Algorithms for Data Broadcast in Wireless Networks. In: IEEE INFOCOM Mini-conference 2009 (2009)
8. Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: Proceedings of the 4th ACM international symposium on Mobile Ad hoc networking and computing (MobiHoc 2003), pp. 222-232 (2003)
9. Groemer, H.:Über die Einlagerung von Kreisen in einen konvexen Bereich. Math. Z. 73, 285-294 (1960)
10. Huang, S.C.-H., Du, H., Park, E.-K.: Minimum-latency gossiping in multi-hop wireless networks. In: ACM Mobihoc 2008 (2008)
11. Huang, C.-H.,Wan, P.-J., Deng, J., Han, Y.S.: Broadcast Scheduling in Interference Environment. IEEE Transactions on Mobile Computing 7(11), 1338-1348 (2008)
12. Huang, S.C.-H., Wan, P.-J., Vu, C.T., Li, Y., Yao, F.: Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. In: IEEE INFOCOM 2007 (2007)
13. Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. Journal of the Association of Computing Machinery 30(3), 417-427 (1983)
14. Wan, P.-J., Huang, C.-H., Wang, L., Wan, Z.-Y., Jia, X.: Minimum-Latency Aggregation Scheduling in Multihop Wireless Networks. In: ACM MOBIHOC 2009 (2009)