Distributed power aware topology control algorithm for self-organizing networks

[1] Wu J, Li H. On calculating connected dominating set for efficient routing in ad hoc wireless networks Proc of the 3rd Int-l Workshop on Discrete Algorithms and Methods for Mobile Computing and Commun. Seattle: ACM, 1999: 7-14 [2] Butenko S, Cheng X, Oliveira CAS, et al. Cooperative control and optimization[M]. Norwell: Kluwer Academic Publisher, 2004: 61-73 [3] Wu J, Dai Fei, Gao Ming,et al. On calculating power-aware connected dominating sets for efficient routing in Ad Hoc wireless networks[J]. Journal of Communications and Networks, 2002, l4(1): 1-12 [4] Li X Y, Wan P J, Wang Y, et al. Sparse power efficient topology for wireless networks Proc IEEE Hawaii Int-l Conf. System Sciences. Hawaii: IEEE, 2002: 3839-3848 [5] Li X Y, Calinescu G, Wan P J. Distributed construction of planar spanner and routing for Ad Hoc wireless networks Proc 21st Ann Joint Conf IEEE Computer and Comm Soc. New York: IEEE, 2002: 1268- 1277 [6] Vasudevan S, Kurose J, Towsley D. Design and analysis of a leader election algorithm for mobile ad hoc networks Proc of the 12th IEEE International Conference on Network Protocols. Berlin: IEEE, 2004: 350-360 [7] Awerbuch B. Peleg D. Network synchronization with polylogarithmic overhead Proc 31st Symp Found Computer Science. St. Louis: IEEE, 1990: 514-522 [8] Stojmenovic I, Lin X. Power aware localized routing in wireless networks[J]. IEEE Trans Parallel and Distrib Sys, 2001, 11(12): 1122-1133