
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
HongYen Yang, ChiaHung Lin, MingJer Tsai, "Distributed Algorithm for Efficient Construction and Maintenance of Connected kHop Dominating Sets in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 7, no. 4, pp. 444457, April, 2008.  
BibTex  x  
@article{ 10.1109/TMC.2007.70736, author = {HongYen Yang and ChiaHung Lin and MingJer Tsai}, title = {Distributed Algorithm for Efficient Construction and Maintenance of Connected kHop Dominating Sets in Mobile Ad Hoc Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {7}, number = {4}, issn = {15361233}, year = {2008}, pages = {444457}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2007.70736}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Distributed Algorithm for Efficient Construction and Maintenance of Connected kHop Dominating Sets in Mobile Ad Hoc Networks IS  4 SN  15361233 SP444 EP457 EPD  444457 A1  HongYen Yang, A1  ChiaHung Lin, A1  MingJer Tsai, PY  2008 KW  Algorithm/Protocol Design and Analysis KW  mobile ad hoc network KW  Network topology KW  localized communication KW  routing protocols. VL  7 JA  IEEE Transactions on Mobile Computing ER   
[1] K.M. Alzoubi, P.J. Wan, and O. Frieder, “Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks,” IEEE Comm. Soc./KICS J. Comm. and Networks, vol. 4, no. 1, pp. 2229, 2002.
[2] K.M. Alzoubi, P.J. Wan, and O. Frieder, “MessageOptimal Connected Dominating Sets in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc '02, pp. 157164, 2002.
[3] L. Bao and J. GarciaLunsAceves, “Topology Management in AdHoc Networks,” Proc. ACM MobiHoc '03, pp. 129140, 2003.
[4] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized MinimumEnergy Broadcasting in Ad Hoc Networks,” Proc. IEEE INFOCOM '03, pp. 17021712, 2003.
[5] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “SPAN: An EnergyEfficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” ACM Wireless Networks J., vol. 8, no. 5, pp. 481494, 2002.
[6] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing, special issue on mobile ad hoc networking (research, trends and applications), vol. 2, no. 5, pp. 483502, 2002.
[7] B.A. Clark, C.J. Colbourn, and D.S. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165177, 1991.
[8] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 53, no. 10, pp. 908920, Oct. 2004.
[9] F. Dai and J. Wu, “On Constructing kConnected kDominating Set in Wireless Networks,” Proc. 19th Int'l Parallel and Distributed Processing Symp. (IPDPS '05), 2005.
[10] D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, “Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and LinearSize Skeletons,” Proc. 14th ACMSIAM Symp. Discrete Algorithms (SODA '03), pp. 717724, 2003.
[11] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374387, 1998.
[12] S.K.S. Gupta and P.K. Srimani, “Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 1, pp. 2738, Jan. 2003.
[13] P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, “ScenarioBased Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks,” Proc. ACM/IEEE MobiCom '99, pp. 195206, 1999.
[14] F. Kuha and R. Wattenhofer, “ConstantTime Distributed Dominating Set Approximation,” Distributed Computing, vol. 17, no. 4, pp. 303310, 2005.
[15] S. Kutten and D. Peleg, “Fast Distributed Construction of $k\hbox{}\rm Dominating$ Sets and Applications,” J. Algorithms, vol. 28, pp.4066, 1998.
[16] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of an MSTBased Topology Control Algorithm,” Proc. IEEE INFOCOM '03, pp. 22102217, 2003.
[17] D. Penso and C. Barbosa, “A Distributed Algorithm to Find $k\hbox{}\rm Dominating$ Sets,” Discrete Applied Math., vol. 141, pp. 243253, 2004.
[18] P. Sinha, R. Sivakumar, and V. Bharghavan, “Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures,” Proc. IEEE INFOCOM '01, pp. 17631772, 2001.
[19] Y.C. Tseng, S.Y. Ni, Y.S. Chen, and J.P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Wireless Networks, vol. 8, nos. 23, pp. 153167, 2002.
[20] J. Wu and H. Li, “A DominatingSetBased Routing Scheme in AdHoc Wireless Networks,” Telecomm. Systems, vol. 18, nos.13, pp. 1336, 2001.
[21] S. Yang, J. Wu, and J. Cao, “Connected $k\hbox{}\rm Hop$ Clustering in AdHoc Networks,” Proc. 34th Int'l Conf. Parallel Processing (ICPP '05), pp. 373380, 2005.
[22] C.W. Yu and L.H. Yen, “Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analysis of Wireless AdHoc Networks,” Proc. 25th IFIP WG 6.1 Int'l Conf. Formal Techniques for Networked and Distributed Systems (FORTE '05), pp.458472, 2005.