Routing in Wireless Networks With Interferences
暂无分享,去创建一个
[1] R. L. Brooks. On colouring the nodes of a network , 1941, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] San Skulrattanakulchai. Delta-List Vertex Coloring in Linear Time , 2002, SWAT.
[3] Baruch Awerbuch,et al. Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.
[4] Thomas Kesselheim. Dynamic packet scheduling in wireless networks , 2012, PODC '12.
[5] Dariusz R. Kowalski,et al. Deterministic Broadcast on Multiple Access Channels , 2010, 2010 Proceedings IEEE INFOCOM.
[6] Dariusz R. Kowalski,et al. Adversarial queuing on the multiple-access channel , 2006, PODC '06.
[7] Lisa Zhang,et al. Routing and scheduling in multihop wireless networks with time-varying channels , 2004, SODA '04.
[8] San Skulrattanakulchai. Delta-List vertex coloring in linear time , 2006, Inf. Process. Lett..
[9] Boaz Patt-Shamir,et al. New stability results for adversarial queuing , 2002, SPAA '02.
[10] Dariusz R. Kowalski,et al. Universal routing in multi hop radio network , 2014, FOMC '14.
[11] Andrzej Pelc,et al. Efficient Distributed Communication in Ad-Hoc Radio Networks , 2011, ICALP.
[12] Allan Borodin,et al. Adversarial queuing theory , 2001, JACM.
[13] Dariusz R. Kowalski,et al. Bounds on Stability and Latency in Wireless Communication , 2010, IEEE Communications Letters.
[14] Lisa Zhang,et al. Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data , 2005, JACM.