[1] 丁 睿, 南建国. 无线传感器网络MAC协议的研究与分析[J].
计算机工程, 2009, 35(19): 105-107.
[2] Jolly G, Mohamed F. An Energy-efficient Scalable and Collision- free MAC Layer Protocol for WSN[J]. Wireless Communications and Mobile Computing, 2005, 5(3): 285-304.
[3] Ergen S C, Varaiya P. TDMA Scheduling Algorithms for Sensor Networks[J]. Wireless Networks, 2010, 16(4): 985-997.
[4] Behzad A, Robin I. On the Performance of Graph-based Schedule Algorithms for Packet Radio Networks[C]//Proc. of Global Telecommunications Conference. San Francisco, USA: IEEE Press, 2003: 3423-3436.
[5] Schneider J, Wattenhofer R. A Log-star Distributed Maximal Independent Set Algorithm for Growth Bounded Graphs[C]//Proc. of the 27th ACM Symp. on Principles of Distributed Computing. [S. 1.]: ACM Press, 2008: 35-44.
[6] Schneider J, Wattenhofer R. An Optimal Maximal Independent Set Algorithm for Bounded-independence Graphs[J]. Journal of Parallel and Distributed Computing, 2010, 22(5/6): 349-361.
[7] Gandham S, Dawande M, Prakash R. Link Scheduling in Sensor Networks: Distributed Edge Coloring Revisited[C]//Proc. of the IEEE InfoCom’05. Miami, USA: [s. n.], 2005: 2492-2501.
[8] Jain K, Padhye J, Padmanabhan V N, et al. Impact of Interference on Multi-hop Wireless Network Performance[C]//Proc. of ACM MobiCom’03. San Diego, USA: [s. n.]: 2003: 66-80.
[9] Sanghavi S, Bui L. Distributed Link Scheduling with Constant Overhead[C]//Proc. of ACM SIGMETRICS’07. San Diego, USA: [s. n.], 2007: 313-324.
[10] David A G, Alessandro P. Nearly Optimal Distributed Edge Colouring in O(loglogn) Rounds[J]. Random Structures and Algorithms, 1997, 10(3): 385-405. |