An effective approach to improving packet delivery fraction of ad hoc network
暂无分享,去创建一个
Jiahong Wang | Eiichiro Kodama | Kazuki Kanamori | Toyoo Takada | Takaaki Mikami | Jiahong Wang | Eiichiro Kodama | T. Mikami | Kazuki Kanamori | Toyoo Takada
[1] Ragunathan Rajkumar,et al. MAX: A Maximal Transmission Concurrency MAC for Wireless Networks with Regular Structure , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.
[2] Donghyun Kim,et al. Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.
[3] Charles E. Perkins,et al. Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.
[4] Vaduvur Bharghavan,et al. CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[5] Peng-Jun Wan,et al. Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.
[6] 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.
[7] Ching-Chi Hsu,et al. Routing in wireless/mobile ad‐hoc networks via dynamic group construction , 2000, Mob. Networks Appl..
[8] Prosenjit Bose,et al. Incremental Construction of k-Dominating Sets in Wireless Sensor Networks , 2006, Ad Hoc Sens. Wirel. Networks.
[9] Vaduvur Bharghavan,et al. Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.
[10] Friedhelm Meyer auf der Heide,et al. Energy, congestion and dilation in radio networks , 2002, SPAA '02.
[11] Michael Q. Rieck,et al. Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets , 2005, Comput. Networks.
[12] 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.
[13] M. P. Sebastian,et al. Scenario-Based Diameter-Bounded Algorithm for Cluster Creation and Management in Mobile Ad hoc Networks , 2009, 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications.
[14] Kazuya Sakai,et al. Message-Efficient CDS construction in MANETs , 2010, IEEE 5th International Symposium on Wireless Pervasive Computing 2010.
[15] 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.
[16] J. J. Garcia-Luna-Aceves,et al. Topology management in ad hoc networks , 2003, MobiHoc '03.
[17] Mario Gerla,et al. Efficient flooding in ad hoc networks: a comparative performance study , 2003, IEEE International Conference on Communications, 2003. ICC '03..
[18] Vaduvur Bharghavan,et al. Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.
[19] Limin Hu,et al. Topology control for multihop packet radio networks , 1993, IEEE Trans. Commun..
[20] Roger Wattenhofer,et al. Does topology control reduce interference? , 2004, MobiHoc '04.
[21] Donghyun Kim,et al. Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).
[22] Jie Wu,et al. Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks , 2008, IEEE Transactions on Computers.
[23] Oscar Castillo,et al. Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, IMECS 2007, March 21-23, 2007, Hong Kong, China , 2007, IMECS.