A Novel Approximation for Multi-Hop Connected Clustering Problem in Wireless Networks
暂无分享,去创建一个
Shaojie Tang | Fan Wu | Guihai Chen | Ding-Zhu Du | Xiaofeng Gao | Xudong Zhu | Jun Li
[1] Ian F. Akyildiz,et al. Sensor Networks , 2002, Encyclopedia of GIS.
[2] Edward J. Coyle,et al. An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[3] Minming Li,et al. Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs , 2011, Algorithmica.
[4] Jianping Pan,et al. Minimizing Energy Consumption with Probabilistic Distance Models in Wireless Sensor Networks , 2010, 2010 Proceedings IEEE INFOCOM.
[5] Donghyun Kim,et al. Construction of higher spectral efficiency virtual backbone in wireless networks , 2015, Ad Hoc Networks.
[6] José M. Barceló-Ordinas,et al. Node Clustering Based on Overlapping FoVs for Wireless Multimedia Sensor Networks , 2010, 2010 IEEE Wireless Communication and Networking Conference.
[7] Peng-Jun Wan,et al. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[8] Xiang-Yang Li,et al. Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.
[9] Donghyun Kim,et al. Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.
[10] 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.
[11] Weili Wu,et al. A constant-factor approximation for d-hop connected dominating sets in unit disk graph , 2012, Int. J. Sens. Networks.
[12] Michael Q. Rieck,et al. Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets , 2005, Comput. Networks.
[13] Dahlia Malkhi,et al. K-clustering in wireless ad hoc networks , 2002, POMC '02.
[14] Mani Srivastava,et al. Energy efficient routing in wireless sensor networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).
[15] Donghyun Kim,et al. A PTAS for Minimum d-Hop Underwater Sink Placement Problem in 2-d Underwater Sensor Networks , 2009, Discret. Math. Algorithms Appl..
[16] Yunhao Liu,et al. Sleep in the Dins: Insomnia therapy for duty-cycled sensor networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.
[17] Kayhan Erciyes,et al. A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.
[18] Dung T. Huynh,et al. Adapting d-hop dominating sets to topology changes in ad hoc networks , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).
[19] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[20] Jun Li,et al. An efficient distributed node clustering protocol for high dimensional large-scale wireless sensor networks , 2014, ICUIMC '14.
[21] Ravi Prakash,et al. Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[22] Donghyun Kim,et al. On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks , 2013, IEEE/ACM Transactions on Networking.
[23] Cong Wang,et al. Mobile data gathering with Wireless Energy Replenishment in rechargeable sensor networks , 2013, 2013 Proceedings IEEE INFOCOM.
[24] Yingfan L. Du,et al. A new bound on maximum independent set and minimum connected dominating set in unit disk graphs , 2015, J. Comb. Optim..
[25] Jianzhong Li,et al. Approximate multiple count in Wireless Sensor Networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.
[26] Donghyun Kim,et al. Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks , 2011, IEEE/ACM Transactions on Networking.
[27] Donghyun Kim,et al. A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs , 2010, IEEE Transactions on Mobile Computing.
[28] Zhao Zhang,et al. Two algorithms for minimum 2-connected r-hop dominating set , 2010, Inf. Process. Lett..
[29] Donghyun Kim,et al. A New Constant Factor Approximation to Construct Highly Fault-Tolerant Connected Dominating Set in Unit Disk Graph , 2017, IEEE/ACM Transactions on Networking.
[30] Deying Li,et al. Two Algorithms for Connected R-Hop k-Dominating Set , 2009, Discret. Math. Algorithms Appl..
[31] Julio Solano-González,et al. Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..
[32] Yunhao Liu,et al. Visualizing anomalies in sensor networks , 2011, SIGCOMM.
[33] Ossama Younis,et al. Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.
[34] Donghyun Kim,et al. On Approximating Minimum 3-Connected $m$-Dominating Set Problem in Unit Disk Graph , 2016, IEEE/ACM Transactions on Networking.
[35] Ossama Younis,et al. HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.
[36] Weili Wu,et al. Analysis on Theoretical Bounds for Approximating Dominating Set Problems , 2009, Discret. Math. Algorithms Appl..
[37] Shiow-Fen Hwang,et al. A study of recent research trends and experimental guidelines in mobile ad-hoc network , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).
[38] Weili Wu,et al. Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..