Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
暂无分享,去创建一个
[1] Shay Kutten,et al. Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.
[2] Valmir Carneiro Barbosa,et al. A distributed algorithm to find k-dominating sets , 2004, Discret. Appl. Math..
[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] Bartosz Mielczarek,et al. Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.
[5] Tracy Camp,et al. A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..
[6] Yu-Chee Tseng,et al. The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.
[7] Robert Tappan Morris,et al. Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.
[8] Shay Kutten,et al. Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.
[9] Ivan Stojmenovic,et al. Localized minimum-energy broadcasting in ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[10] Vaduvur Bharghavan,et al. Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[11] Jie Wu,et al. Connected k-hop clustering in ad hoc networks , 2005, 2005 International Conference on Parallel Processing (ICPP'05).
[12] Peng-Jun Wan,et al. Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.
[13] Li-Hsing Yen,et al. Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks , 2005, FORTE.
[14] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.
[15] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[16] Peng-Jun Wan,et al. Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.
[17] J. J. Garcia-Luna-Aceves,et al. Topology management in ad hoc networks , 2003, MobiHoc '03.
[18] Lui Sha,et al. Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.
[19] T. Nandagopal,et al. The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, MobiCom 1999.
[20] Jie Wu,et al. On constructing k-connected k-dominating set in wireless networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.
[21] Aravind Srinivasan,et al. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..
[22] Jie Wu,et al. A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..
[23] Sandeep K. S. Gupta,et al. Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks , 2003, IEEE Trans. Parallel Distributed Syst..
[24] Roger Wattenhofer,et al. Constant-time distributed dominating set approximation , 2003, PODC '03.
[25] Jie Wu,et al. On constructing k-connected k-dominating set in wireless ad hoc and sensor networks , 2006, J. Parallel Distributed Comput..