Egocentric network focused community aware multicast routing for DTNs |
| |
Authors: | Guoxing Jiang Yanqing Shen Jun Chen Yan Dong Fang Lu Qi Jiang |
| |
Affiliation: | 1.School of Electronic Information and Communications,Huazhong University of Science and Technology,Wuhan,China |
| |
Abstract: | Multicasting for delay-tolerant networks (DTNs) in sparse social network scenarios is a challenge due to the deficiency of end-to-end paths. In social network scenarios, the behaviors of their nodes are controlled by human beings, and node mobility is the same as that of humans. To design the multicasting algorithms for DTNs, therefore, it would be promising to capture the intrinsic characteristics of relationships among these nodes. In this paper, multicasting in DTNs is regarded as a message dissemination issue in social networks, and an egocentric network focused community aware multicast routing algorithm (ENCAR) is proposed. As distinct from some social-based routing algorithms which only focus on centrality analysis, ENCAR is an utility based and hierarchical routing algorithm, its utility function is constructed on the basis of centrality analysis and destination-oriented contact probability. We take notice of clustering phenomenon in social networks, and present the community aware forwarding schemes. In addition, to simulate the mobility of individuals in social networks, a novel community based random way point mobility model is also presented. In this paper, the performance of ENCAR is theoretically analyzed and further evaluated on simulator ONE. Simulation results show that ENCAR outperforms most of the existing multicast routing algorithms in routing overhead, on condition that delivery ratio is relatively high, with other significant parameters guaranteed to perform well. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|