Abstract
In order to effectively satisfy the latency requirements of the multi-priority data transmission in wireless sensor network, this paper proposes a congestion control algorithm based on multi-priority data for opportunistic routing. By means of introducing the node queue model of multi-priority data and studying the next-hop node selection strategy based on the traditional opportunistic routing, the new algorithm CEDOP working on the multi-priority data is developed, which pays attention to the shortest path, residual energy of nodes and congestion control. The simulation results demonstrate that the scheme can effectively solve the latency issue of the high-priority data transmission in wireless sensor network under the situation of low latency and network load balance.
Foundation Items: National Natural Science Foundation of China under Grant No.61272523; Nation 12th Five-Year Science and Technology Major Project Topic (No. 2011ZX05039-003-004); and the Fundamental Research Funds for the Central Universities (DUT12JS01).
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.
References
Poonguzharselvi, B., Vetriselvi, V.: Survey on routing algorithms in opportunistic networks. In: 2013 International Conference on Computer Communication and Informatics (ICCCI), pp. 1–5. IEEE (2013)
Biswas, S., Morris, R.: Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Computer Communication Review 34(1), 69–74 (2004)
Paquereau, L., Helvik, B.E.: Opportunistic ant-based path management for wireless mesh networks. In: Dorigo, M., et al. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 480–487. Springer, Heidelberg (2010)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000)
Thanayankizil, L.V., Kailas, A., Ingram, M.A.: Two energy-saving schemes for cooperative transmission with opportunistic large arrays. In: IEEE Global Telecommunications Conference, GLOBECOM 2007, pp. 1038–1042. IEEE (2007)
Camilo, T., Carreto, C., Silva, J.S., Boavida, F.: An energy-efficient ant-based routing algorithm for wireless sensor networks. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 49–59. Springer, Heidelberg (2006)
Rodoplu, V., Meng, T.H.: Minimum energy mobile wireless networks. IEEE Journal on Selected Areas in Communications 17(8), 1333–1344 (1999)
Lee, J.W., Lee, J.J.: Ant-colony-based scheduling algorithm for energy-efficient coverage of WSN. IEEE Sensors Journal 12(10), 3036–3046 (2012)
Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM (JACM) 37(3), 607–625 (1990)
Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine 44(11), 134–141 (2006)
Zhong, Z., Wang, J., Nelakuditi, S.: Opportunistic any-path forwarding in multi-hop wireless mesh networks. University of South Carolina (2006)
Lo, S.C., Lu, C.L.: A Dynamic Congestion Control based Routing for Delay-Tolerant Networks. In: 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD). IEEE (2051)
Yuan, Q., Cardei, I., Wu, J.: An efficient prediction-based routing in disruption-tolerant networks. IEEE Transactions on Parallel and Distributed Systems 23(1), 19–31 (2012)
Diana, R., Lochin, E.: Modelling the delay distribution of binary spray and wait routing protocol. In: 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), pp. 1–6. IEEE (2012)
Massri, K., Vernata, A., Vitaletti, A.: Routing protocols for delay tolerant networks: a quantitative evaluation. In: Proceedings of the 7th ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks, pp. 107–114. ACM (2012)
Zeng, K., Lou, W., Zhai, H.: Capacity of opportunistic routing in multi-rate and multi-hop wireless networks. IEEE Transactions on Wireless Communications 7(12), 5118–5128 (2008)
Darehshoorzadeh, A., Cerda-Alabern, L.: Distance progress based opportunistic routing for wireless mesh networks. In: 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC), pp. 179–184. IEEE (2012)
Jin, Z., Deng, W., Yan, N., et al.: A study of Multi-Priority Opportunistic Directional Routing for VANET. In: 2010 International Conference on Wireless Communications and Signal Processing (WCSP), pp. 1–4. IEEE (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, N., Ding, N., Hu, X. (2014). Congestion Control Based on Multi-priority Data for Opportunistic Routing. In: Sun, L., Ma, H., Hong, F. (eds) Advances in Wireless Sensor Networks. CWSN 2013. Communications in Computer and Information Science, vol 418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54522-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-54522-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54521-4
Online ISBN: 978-3-642-54522-1
eBook Packages: Computer ScienceComputer Science (R0)
