Minimum-latency beaconing schedule in multihop wireless networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2340-2346

  Wan, Peng Jun ^a   Xu, Xiaohua ^a   Wang, Lixin ^a   Jia, Xiaohua ^b   Park, E K ^c  

^a Illinois Institute of Technology   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; INTERFERENCE MODELS; MULTIHOP WIRELESS NETWORK; NP-HARD; TRANSMISSION RADIUS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY;

WIRELESS NETWORKS;

EID: 70349656199     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062160     Document Type: Conference Paper

References (16)

1. I. Chlamtac and A. Farago, Making Transmission Schedules Immune to Topology Changes in Multi-Hop Packet Radio Networks, IEEE/ACM Transactions on Networking, Vol. 2, No. 1, pp. 23-29, Feb. 1994.
2. I. Chlamtac and S. Kutten, A spatial reuse tdma/fdma for mobile multihop radio nertworks, in IEEE INFOCOM, pp. 389-394, March 1985.
3. B.N. Clark, C.J. Colbourn, and D.S. Johnson. Unit disk graphs. Discrete Mathematics, 86:165-177, 1990.
4. A. Ephremides and T.V. Truong, Scheduling Broadcasts in Multihop Radio Networks, IEEE Transactions on Communications, vol. 38, no. 4, pp. 456-60, April 1990.
5. L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
6. M.C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, New York, NY, 1980.
7. P. Gupta and P. Kumar, The capacity of wireless networks, IEEE Trans. Inform. Theory, vol. 46, pp. 388-404, Mar. 2000.
8. D. W. Matula and L. L. Beck. Smallest-last ordering and clustering and graph coloring algorithms, Journal of the Association of Computing Machinery, 30(3):417-427, 1983.
9. R.H. Möhring. Algorithmic aspects of comparability graphs and interval graphs. In I. Rival, editor, Graphs and Orders, pp. 41-101. Reidel, Dordrecht, 1985.
10. R. Nelson and L. Kleinrock, Spatial-TDMA: A collision-free multihop channel access protocol, IEEE Transactions on Communications, vol. 33, no. 9, pp. 934944, Sep. 1985.
11. S. Ramanathan and E.L. Lloyd, Scheduling algorithms for multi-hop radio networks, IEEE/ACM Transactions on Networking, vol. 1, pp. 166-172, April 1993.
12. R. Ramaswami and K. K. Parhi, Distributed scheduling of broadcasts in a radio network, in IEEE INFOCOM, pp. 497-504, 1989.
13. A. Sen and M. L. Huson, A New Model for Scheduling Packet Radio Networks, ACM/Baltzer Journal Wireless Networks, 3 (1997), pp. 71-82.
14. A. Sen and E. Malesinska, Approximation Algorithms for Radio Network Scheduling, Proceedings of 35th Allerton Coneference on Communication, Control and Computing, Champaign, Illinois, pp. 573-582, October, 1997.
15. D.S. Stevens and M.H. Ammar, Evaluation of slot allocation strategies for TDMA protocols in packet radio networks, IEEE Military Communications Conference, pp: 835-839, 1990.
16. P.-J. Wan, C.-W. Yi, X. Jia, and D. Kim: Approximation Algorithms for Conflict-Free Channel Assignment in Wireless Ad Hoc Networks, Wiley Journal on Wireless Communications and Mobile Computing, 6(2):201-211, March 2006.