Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc Networks

Mohd-Yaseen Mir, Hengbing Zhu and Chih-Lin Hu
Additional contact information
Mohd-Yaseen Mir: Department of Communication Engineering, National Central University, Taoyuan City 32001, Taiwan
Hengbing Zhu: Department of Communication Engineering, National Central University, Taoyuan City 32001, Taiwan
Chih-Lin Hu: Department of Communication Engineering, National Central University, Taoyuan City 32001, Taiwan

Future Internet, 2022, vol. 14, issue 7, 1-24

Abstract: Opportunistic ad hoc networks are characterized by intermittent and infrastructure-less connectivity among mobile nodes. Because of the lack of up-to-date network topology information and frequent link failures, geographic routing utilizes location information and adopts the store–carry–forward data delivery model to relay messages in a delay-tolerant manner. This paper proposes a message-forwarding policy based on movement patterns (MPMF). First, one- and two-hop location information in a geographic neighborhood is exploited to select relay nodes moving closer to a destination node. Message-forwarding decisions are made by referring to selected relay nodes’ weight values obtained by calculating the contact frequency of each node with the destination node. Second, when relays in the vicinity of a message-carrying node are not qualified due to the sparse node density and nodal motion status, the destination’s movement and the location information of a one-hop relay are jointly utilized to improve the message-forwarding decision. If the one-hop relay is not closer to the destination node or moving away from it, its centrality value in the network is used instead. Based on both synthetic and real mobility scenarios, the simulation results show that the proposed policy performs incomparable efforts to some typical routing policies, such as Epidemic, PRoPHETv2, temporal closeness and centrality-based (TCCB), transient community-based (TC), and geographic-based spray-and-relay (GSaR) routing policies.

Keywords: message forwarding; geographic routing; relay selection; data dissemination; delay-tolerant networks; mobile opportunistic networks (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/14/7/214/pdf (application/pdf)
https://www.mdpi.com/1999-5903/14/7/214/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:14:y:2022:i:7:p:214-:d:867499

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().