Leader election in SINR model with arbitrary power control
暂无分享,去创建一个
[1] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[2] Calvin C. Newport,et al. Leader election in shared spectrum radio networks , 2012, PODC '12.
[3] John Capetanakis,et al. Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.
[4] Reuven Bar-Yehuda,et al. On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization , 1987, PODC '87.
[5] Rene L. Cruz,et al. Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[6] Robert G. Gallager,et al. A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.
[7] Andrzej Pelc,et al. Topology recognition and leader election in colored networks , 2016, Theor. Comput. Sci..
[8] Anthony Ephremides,et al. Wireless Link Scheduling With Power Control and SINR Constraints , 2006, IEEE Transactions on Information Theory.
[9] Roger Wattenhofer,et al. The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[10] Calvin C. Newport,et al. Contention Resolution on a Fading Channel , 2016, PODC.
[11] Calvin C. Newport. Radio Network Lower Bounds Made Easy , 2014, DISC.
[12] Imrich Chlamtac,et al. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.
[13] Dan E. Willard,et al. Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..
[14] Norman M. Abramson,et al. THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).