Journal of Computer Research and Development (计算机研究与发展) 2009/2009:12 PP.2068-2075

A Message Transmission Scheme for Community-Based Opportunistic Network

The proliferation of mobile devices has witnessed the extensive research on opportunistic network in both academia and industry. Community-based opportunistic network combine the social people and wireless communication devices so that characteristics from both the opportunistic network and social networking are inherited. However, the prevalent multi-copy message routing algorithms in opportunistic network will lead to long transmission delay and high message loss rate when deployed directly in the community-based opportunistic network. To tackle the above problems, a community-based message transmission scheme (CMTS) is proposed in utilizing the clustering characteristics of all the nodes in community-based opportunistic network. CMTS utilizes Newmans weighted network analysis method to organize network nodes into different communities based on the contact frequencies among them. In dealing with intra-community communication, CMTS determines the number of message copies in the network and chooses more active nodes as the relays. For inter-community communication, messages are transmitted to target communities mainly relying on the nodes which have larger social degrees. Simulation results show that CMTS can balance well the tradeoff between delivery ratio and resource consumption in community-based opportunistic network. The evaluation results also show that CMTS can reduce the message forwarding times by about 20% when compared with Spray and Focus.

Key words:opportunistic network,community network,multiple copies,message routing,adaptive transmission

ReleaseDate:2014-07-21 15:00:25

[1] Xiong Yongping, Sun Limin, Niu Jianwei, et al. Opportunistic networks [J]. Journal of Software, 2009, 20(1): 124-137 (in Chinese)(熊永平, 孙利民, 牛建伟, 等. 机会网络 [J]. 软件学报, 2009, 20(1): 124-137)

[2] Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks, CS-200006 [R]. Durham, North Carolina: Duke University, 2000

[3] Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: Efficient routing in intermittently connected mobile networks [C]//Proc of ACM SIGCOMM Workshop on Delay Tolerant Networking (WDTN). New York: ACM, 2005: 45-53

[4] Spyropoulos T, Psounis K, Raghavendra C S, et al. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility [C]//Proc of the 5th Annual IEEE Int Conf on Pervasive Computing and Communications Workshops. New York: IEEE, 2007: 79-85

[5] Lindgren, Doria A, Schelèn O. Probabilistic routing in intermittently connected networks [C] Proc of ACM SIGMOBILE Mobile Computing and Communications. New York: ACM, 2003: 239-254

[6] Xiao Mingjun, Huang Liusheng. Delay-tolerant network routing algorithm [J]. Journal of Computer Research and Development, 2009, 46(7):1065-1073 (in Chinese)(肖明军, 黄刘生. 容迟网络路由算法 [J]. 计算机研究与发展, 2009, 46(7):1065-1073)

[7] Pan Hui, Jon Crowcroft, Eiko Yoneki. BUBBLE Rap: Socia-based forwarding in delay tolerant networks [C] Proc of the 9th ACM Int Symp on Mobile Ad Hoc Networking and Computing. New York: ACM, 2008: 241-250

[8] Musolesi M, Mascolo C. A community based mobility model for ad hoc network research [C]//Proc of the 2nd Int Workshop on Multi-hop Ad Hoc Networks: From Theory to Reality. New York: ACM, 2006: 26-26

[9] Newman M E J. Analysis of weighted networks [J]. Physical Review E, 2004, 70(5): 70-78

[10] Spyropoulos T, Psounis K, Raghavendra C S. Performance analysis of mobility-assisted routing [C]//Proc of the 7th ACM Int Symp on Mobile Ad Hoc Networking and Computing. New York: ACM, 2006: 49-60