Authors: ZhiQiang Liu; Tong Wang; XiBo Wang
Addresses: College of Automotive and Mechanical, Changsha University of Science and Technology, Changsha 410076, China ' College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China ' College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
Abstract: Receiving great interest from the research community, the concept of delay/disruption tolerant networks (DTNs) is without the contemporaneous end to end connectivity to bridge communication in the challenged networks, suffering from sparse network density and frequent disruption. In this paper, our motivation is to firstly adopt geographic information instead of history encounter information to relay message. Then we argue it is unreasonable to rely on realtime location of destination to relay message due to sparse network density and high mobility. Therefore, our contribution is to propose a geographic routing algorithm for DTNs without knowing where the destination is. The key insight is to replicate message in an efficient manner rather than flooding, taking into account encounter angle between pairwise nodes. Evaluation results under the Helsinki city scenario show an improvement of our proposed.
Keywords: routing protocol; geometric routing.
International Journal of Security and Networks, 2017 Vol.12 No.2, pp.103 - 111
Available online: 14 Apr 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article