Link scheduling is one of the main difficulties for a large amount of data real-time and reliable transmission in Wireless Multimedia Sensor Networks. To improve multi-hop transmission performance, MAC layer link scheduling algorithms have received extensive attention. These algorithm allocated slots for every data link. It could lower the number of conflicts and retransmissions. However, as the network size increases, both centralized or distributed scheduling algorithms encounter performance degradation problems. To overcome this problem, a novel scheduling algorithm which based on network partition was proposed. In sparse region, the MAC layer switches to a simple 802.11 mode; In intensive region, the MAC layer switches to queue length based scheduling mode. Emulation study showed that the proposed algorithm had a better performance in both terms of total queue length and average delay. © 2013 Springer-Verlag.
CITATION STYLE
Yan, G., Duan, W., Ma, C., & Huang, L. (2013). A partitioned link scheduling algorithm for wireless multimedia sensor networks. In Communications in Computer and Information Science (Vol. 334 CCIS, pp. 562–568). Springer Verlag. https://doi.org/10.1007/978-3-642-36252-1_52
Mendeley helps you to discover research relevant for your work.