Efficient computation of maximal independent sets in unstructured multi-hop radio networks
暂无分享,去创建一个
[1] Roger Wattenhofer,et al. What cannot be computed locally! , 2004, PODC '04.
[2] L. Kleinrock,et al. Packet Switching in Radio Channels : Part Il-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution , 2022 .
[3] Anthony Ephremides,et al. The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..
[4] Stefano Basagni,et al. Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..
[5] Reuven Bar-Yehuda,et al. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection , 1989, Distributed Computing.
[6] Sajal K. Das,et al. An on-demand weighted clustering algorithm (WCA) for ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).
[7] Stephan Olariu,et al. Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection , 2000, IEEE Trans. Parallel Distributed Syst..
[8] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..
[9] Mario Gerla,et al. Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..
[10] Tomasz Jurdzinski,et al. Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks , 2002, ISAAC.
[11] Roger Wattenhofer,et al. Radio Network Clustering from Scratch , 2004, ESA.
[12] Roger Wattenhofer,et al. Initializing newly deployed ad hoc and sensor networks , 2004, MobiCom '04.
[13] Peng-Jun Wan,et al. Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.
[14] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.
[15] Xiang-Yang Li,et al. Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.
[16] Stefano Basagni,et al. Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).
[17] Reuven Bar-Yehuda,et al. On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization , 1987, PODC '87.
[18] Lawrence G. Roberts,et al. ALOHA packet system with and without slots and capture , 1975, CCRV.
[19] Roger Wattenhofer,et al. Constant Time Distributed Dominating Set Approximation , 2022 .
[20] Stephan Olariu,et al. A survey on leader election protocols for radio networks , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.
[21] Andrzej Pelc,et al. The wakeup problem in synchronous broadcast systems (extended abstract) , 2000, PODC '00.
[22] Dariusz R. Kowalski,et al. A better wake-up in radio networks , 2004, PODC '04.
[23] Mario Gerla,et al. Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.
[24] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[25] Stephan Olariu,et al. Randomized initialization protocols for packet radio networks , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.
[26] Thomas Moscibroda,et al. How the Hidden-Terminal Problem Affects Clustering in Ad Hoc and Sensor Networks , 2004 .
[27] Andrzej Pelc,et al. The Wakeup Problem in Synchronous Broadcast Systems , 2000, SIAM J. Discret. Math..
[28] Leonidas J. Guibas,et al. Discrete mobile centers , 2001, SCG '01.
[29] Lujun Jia,et al. An efficient distributed algorithm for constructing small dominating sets , 2002, Distributed Computing.
[30] 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.
[31] OPHIR FRIEDER,et al. Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..
[32] Mahtab Seddigh,et al. Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..
[33] Eyal Kushilevitz,et al. An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.
[34] Roger Wattenhofer,et al. Constant-time distributed dominating set approximation , 2003, PODC '03.
[35] Eyal Kushilevitz,et al. An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..