Max-min d-cluster formation in wireless ad hoc networks

作者: A.D. Amis , R. Prakash , T.H.P. Vuong , D.T. Huynh

DOI: 10.1109/INFCOM.2000.832171

关键词:

摘要: An ad hoc network may be logically represented as a set of clusters. The clusterheads form a d-hop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form …

参考文章(13)
Therese Biedl, Goos Kant, A better heuristic for orthogonal graph drawings Algorithms — ESA '94. pp. 24- 35 ,(1994) , 10.1007/BFB0049394
Leslie G. Valiant, Universality considerations in VLSI circuits IEEE Transactions on Computers. ,vol. 30, pp. 135- 140 ,(1981) , 10.1109/TC.1981.6312176
L. Kleinrock, J. Silvester, Spatial reuse in multihop packet radio networks Proceedings of the IEEE. ,vol. 75, pp. 156- 167 ,(1987) , 10.1109/PROC.1987.13711
Jennifer Lundelius, Nancy Lynch, An upper and lower bound for clock synchronization Information & Computation. ,vol. 62, pp. 190- 204 ,(1984) , 10.1016/S0019-9958(84)80033-9
David S. Johnson, Approximation algorithms for combinatorial problems Journal of Computer and System Sciences. ,vol. 9, pp. 256- 278 ,(1974) , 10.1016/S0022-0000(74)80044-9
A. Ephremides, J.E. Wieselthier, D.J. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling Proceedings of the IEEE. ,vol. 75, pp. 56- 73 ,(1987) , 10.1109/PROC.1987.13705
Mario Gerla, Jack Tzu-Chieh Tsai, Multicluster, mobile, multimedia radio network Wireless Networks. ,vol. 1, pp. 255- 265 ,(1995) , 10.1007/BF01200845
B. Das, V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets international conference on communications. ,vol. 1, pp. 376- 380 ,(1997) , 10.1109/ICC.1997.605303
D. Baker, A. Ephremides, The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm IEEE Transactions on Communications. ,vol. 29, pp. 1694- 1701 ,(1981) , 10.1109/TCOM.1981.1094909
E. Gafni, D. Bertsekas, Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology IEEE Transactions on Communications. ,vol. 29, pp. 11- 18 ,(1981) , 10.1109/TCOM.1981.1094876