A Community-Based Message Transmission Algorithm for Opportunistic Networks

Abstract:

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc.

• Periodical: Applied Mechanics and Materials (Volumes 427-429)
• Pages: 2333-2337
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.427-429.2333
• Online since: September 2013
• Authors: Zhi Ren, Yan Wei Liu, Shuang Peng, Ji Bi Li
• Keywords: Communication Overlapping Areas, Community Division, Copies, Forwarding, Routing Algorithm

References

[1] X. Yongping, S. Limin, N. Jianwei, et al, Opportunistic networks, Journal of Software, vol. 20, 2009, pp.122-137.

[2] W. Ruyan, J. Yong, W. Dapeng, L. Yanfang, X. Lei, Adaptive redundant message deletion mechanism for opportunistic network, Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), vol. 25, 2013, pp.59-64.

[3] A. Keranen, J. Ott, T. Karkkainen, The ONE simulator for DTN protocol evaluation, the 2nd International Conference on Simulation Tools and Techniques, 2009, p.55.

[4] A. Vahdat, D. Becker, Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, Duke University, (2000).

[5] T. Spyropoulos, K. Psounis, C. S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM Press, 2005, pp.252-259.

DOI: 10.1145/1080139.1080143

[6] A. Lindgren, A. Doria, O. Schelen, Probabilistic routing in intermittently connected networks, Service Assurance with Partial and Intermittent Resources. Springer Berlin Heidelberg, 2004, pp.239-254.

DOI: 10.1007/978-3-540-27767-5_24

[7] L. Qiaoshou, Z. Jianer, Z. Puning, Adaptive cache management method for opportunistic network based on number of message copies, Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), vol. 23, 2011, pp.394-399.

[8] P. Hui, J. Crowcroft, How small labels create big improvements, " PerCom Workshops, 07. Fifth Annual IEEE International Conference on. IEEE, 2007, pp.65-70.

DOI: 10.1109/percomw.2007.55

[9] P. Hui, J. Crowcroft, E. Yoneki, BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks, IEEE Transl. on Mobile Computing, vol. 10, 2011, pp.1576-1589.

DOI: 10.1109/tmc.2010.246

[10] N. H. Son, S. Andrzej, A rough-granular computing in discovery of process models from data and domain knowledge, Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), vol. 20, 2008, pp.341-347.

[11] W. Li, G. Xue, A Community-driven Hierarchical Message Transmission Scheme in Opportunistic Networks, Smart Computing Review, vol. 1, 2011, pp.85-94.

DOI: 10.6029/smartcr.2011.01.007

[12] J. Duch, A. Arenas, Community detection in complex networks using extremal optimization, Physical review E, vol. 72, 2005, p.027104.

DOI: 10.1103/physreve.72.027104