Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akyildiz, I.F., Melodia, T., Chowdury, K.R.: Wireless multimedia sensor networks: A survey. IEEE Wireless Communications 14(6), 32–39 (2007)
Almeida, J., Grilo, A., Pereira, P.R.: Multimedia Data Transport for Wireless Sensor Networks. In: Next Generation Internet Networks, NGI 2009, July 1-3, pp. 1–8 (2009)
Krishnaswamy, D.: Robust Routing and Scheduling in Wireless Mesh Networks under Dynamic Traffic Conditions. IEEE Transactions on Mobile Computing 8(12), 1705–1717 (2009)
Avis, D.: A Survey of Heuristics for the Weighted Matching Problem. Networks 13(4), 475–493 (1983)
Preis, R.: Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs. In: Symposium on Theoretical Aspects of Computer Science (1999)
Hoepman, J.-H.: Simple Distributed Weighted Matchings, eprint (October 2004)
Dimakis, A., Walrand, J.: Sufficient Conditions for Stability of Longest-Queue-First Scheduling: Second-order Properties using Fluid Limits. Advances in Applied Probability 38(2), 505–521 (2006)
Joo, C., Shroff, N.B.: Local Greedy Approximation for Scheduling in Multi-hop Wireless Networks. IEEE Transactions on Mobile Computing, 1–14 (2011)
Riga, N., Matta, I., Bestavros, A.: DIP: Density Inference Protocol for wireless sensor networks and its application to density-unbiased statistics. Bernoulli, 1–10 (2005)
De Couto, D., Aguayo, D., Bicket, J., Morris, R.: High-throughput path metric for multi-hop wireless routing. In: Proceedings of MOBICOM 2003 (2003)
Gupta, A., Lin, X., Srikant, R.: Low-Complexity Distributed Scheduling Algorithms for Wireless Networks. Analysis 17(6), 1846–1859 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yan, G., Duan, W., Ma, C., Huang, L. (2013). A Partitioned Link Scheduling Algorithm for Wireless Multimedia Sensor Networks. In: Wang, R., Xiao, F. (eds) Advances in Wireless Sensor Networks. CWSN 2012. Communications in Computer and Information Science, vol 334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36252-1_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-36252-1_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36251-4
Online ISBN: 978-3-642-36252-1
eBook Packages: Computer ScienceComputer Science (R0)