Abstract
In multi-area opportunistic network, the source can not communicate directly with the destination. An efficient low-delay routing algorithm, named message forwarding scheme for multi-area opportunistic network based on message significance (MFSMS) is proposed to solve the issue of long delay. It sorts the node buffer messages based on the level of message significance, and puts them to the message queue. Then it selects the higher forwarding probability node based on probability matrix to exchange message. Through the analysis of experiment results, the algorithm improves message delivery ratio and network resources utilization and decreases the message delay.
J. Shu—S. Han and J. Shu are with the Internet of Things Technology Institute, Nanchang Hangkong University, Nanchang, 330063, China. N. Guo is with the Unicom Xingye communication technology Co, Beijing, 100005, China. L. Sun is with the State Key Laboratory of Information Security, Institute of Software, The Chinese Academy of Sciences, Beijing, 100190, China.
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
References
Yongping, X., Limin, S., et al.: Opportunistic networks (In Chinese). J. J. Softw. 20(1), 124–137 (2009)
Becker VD.: Epidemic routing for partially connected ad hoc networks. Technical report, CS-2000-06, Department of of Computer Science, Duke University, Durham, NC (2000)
Grossglauser, M., Tse, D.N.C.: Mobility increases the capacity of ad hoc wireless networks. J. IEEE/ACM Trans. Networking 10(4), 477–486 (2002)
Spyropoulos T, Psounis K, Raghavendra CS.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: The 2005 ACM SIGCOMM Workshop on Delay Torlerant Networking, Philaadelphia, pp. 252–259 (2005)
Spyropoulos T., et al.: Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: The IEEE PerCom Workshop on Intermittently Connected Mobile Ad Hoc Networks (2007)
Lindgren, A., Doria, A., Scheln, O.: Probabilistic routing in intermittently connected networks. 1ACM SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–26 (2003)
Dapeing, W., Puning, Z., et al.: Connection status aware cost efficient message transmission mechanism in opportunistic networks (In Chinese). J. J. Commun. 34(3) (2013)
Zhen-Jing, Z., et al.: Efficient routing in social DTN based on nodes movement prediction (In Chinese). J. J. Comput. 36(3), 626–635 (2013)
Jianwei, N., Xing, Z., Yan, L., Limin, S.: A message transmission scheme for community-based opportunistic network (In Chinese). J. J. Comput. Res. Dev. 46(12), 2068–2075 (2009)
Jianwei, N., Jin-Kai, G., Yan, L..: An efficient routing algortithm for opportnistic networks based on mobility predition (In Chinese). J.J. Commun. 31(9) (2010)
Haitao, J., Qianmu, L., Jian, X., Hong, Z.: Cross-regional ferry routing design for multiple messagers in opportunistic networks (In Chinese). J. J. Comput. Res. Dev. 49(4), 700–709 (2012)
Qingsong, C., Jianwei. N.: Adaptice data dissemination algorithm for vehicular opportunistic networks (In Chinese). J. Comput. Sci. 38(6) (2011)
Yun, L., Bin-Bin, W., QILie, L., LinJun, T.: Multiple ferry route design based on city-village model in opportunistic networks (In Chinese). J. Appl. Res. Comput. 29(1) (2012)
Yahong, L., Yuan, G., Jinlong, Q., Chuanhua, T.: Communtiy-based message transmission scheme in oppprtunistic social networks (In Chinese). J. J. Comput. Appl. 33(5), 1212–1216 (2013)
Acknowledgments
Thanks for the men who give sincere suggestion to the paper. This paper is supported by the National Natural Science Foundation of China (Grant No.61363015, No.61262020), Aeronautical Science Foundation of China (2012ZC56006), and Key Project of Research Program of Jiangxi province (CB-20112038).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, S., Shu, J., Guo, N., Sun, L. (2015). Message Forwarding Scheme for Multi-area Opportunistic Network Based on Message Significance. In: Sun, L., Ma, H., Fang, D., Niu, J., Wang, W. (eds) Advances in Wireless Sensor Networks. CWSN 2014. Communications in Computer and Information Science, vol 501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46981-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-662-46981-1_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46980-4
Online ISBN: 978-3-662-46981-1
eBook Packages: Computer ScienceComputer Science (R0)
