Destination unaware geometric routing for delay tolerant networks Online publication date: Mon, 24-Apr-2017
by ZhiQiang Liu; Tong Wang; XiBo Wang
International Journal of Security and Networks (IJSN), Vol. 12, No. 2, 2017
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.
Online publication date: Mon, 24-Apr-2017
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com