A Distributed Approach to Constructing k-Hop Connected Dominating Set in Ad Hoc Networks
暂无分享,去创建一个
[1] Ding-Zhu Du,et al. Connected Dominating Sets in Wireless Networks with Different Transmission Ranges , 2007, IEEE Transactions on Mobile Computing.
[2] Weili Wu,et al. A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..
[3] Jie Wu,et al. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.
[4] Dung T. Huynh,et al. Connected D-Hop Dominating Sets in Mobile Ad Hoc Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.
[5] Feng Wang,et al. On greedy construction of connected dominating sets in wireless networks: Research Articles , 2005 .
[6] Paolo Bellavista,et al. k-hop Backbone Formation in Ad Hoc Networks , 2007, 2007 16th International Conference on Computer Communications and Networks.
[7] Peng-Jun Wan,et al. Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.
[8] Vaduvur Bharghavan,et al. Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.
[9] Ding-Zhu Du,et al. On greedy construction of connected dominating sets in wireless networks , 2005, Wirel. Commun. Mob. Comput..
[10] Wei Wang,et al. A PTAS for minimum d-hop connected dominating set in growth-bounded graphs , 2010, Optim. Lett..
[11] Peng-Jun Wan,et al. New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[12] Julio Solano-González,et al. Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[13] Michael Q. Rieck,et al. Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets , 2005, Comput. Networks.
[14] Ming-Jer Tsai,et al. Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks , 2008, IEEE Transactions on Mobile Computing.
[15] Peter Janacik,et al. Biologically-Inspired Construction of Connected k-Hop Dominating Sets in Wireless Sensor Networks , 2009, 2009 Third IEEE International Conference on Self-Adaptive and Self-Organizing Systems.
[16] Chan Zheng,et al. Construction of d-Hop Connected Dominating Sets in Wireless Sensor Networks , 2011 .
[17] Li Xiao,et al. A Fully Distributed Method to Detect and Reduce Cut Vertices in Large-Scale Overlay Networks , 2012, IEEE Transactions on Computers.
[18] Jie Wu,et al. Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks , 2008, IEEE Transactions on Computers.
[19] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[20] Peng-Jun Wan,et al. Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.
[21] S. Guha,et al. Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.
[22] Jie Wu,et al. Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..
[23] Jie Wu,et al. Connected k-hop clustering in ad hoc networks , 2005, 2005 International Conference on Parallel Processing (ICPP'05).
[24] Peng-Jun Wan,et al. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..
[25] Dung T. Huynh,et al. Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks , 2006, 2006 IEEE International Performance Computing and Communications Conference.