A New Routing Protocol Based on Community Structure for Opportunistic Networks
In this paper we consider the problem of routing in opportunistic networks. Opportunistic networks attempt to route messages using the opportunities of meeting each other between nodes via intermittently connected nodes. Routing in such environments is difficult because there is no guarantee that a fully connected path exists between source node and destination node at any time and transfer opportunities between nodes are of limited duration. We propose a protocol for effective routing of opportunistic messages, which is based on the community structure of connected nodes and can be implemented in a distributed way. In addition, we proposed a new search strategy to make the messages quickly reach the destination nodes. Specifically, this protocol employs a new movement model, in which nodes usually move around a set of well-visited landmark points instead of moving randomly. We compare it to the earlier presented Epidemic Routing protocol, PROPHET and Spray and wait protocol through simulations. The results of the simulations show that this protocol improves the delivery ratio and reduces the delivery latency compared to traditional opportunistic routing schemes.
opportunistic networks community structure routing intermittent connectivity mobility model
Xuebin Ma
Department of Computer Sciences, Inner Mongolia University, Hohhot 010021 China
国际会议
2010 International Conference on Future Information Technology(2010年未来信息技术国际会议 ICFIT 2010)
长沙
英文
595-599
2010-12-14（万方平台首次上网日期，不代表论文的发表时间）