Mobility-aware cross-layer routing for peer-to-peer networks

Deokate, Balu; Lal, Chhagan; Trček, Denis; Conti, Mauro

doi:10.1016/j.compeleceng.2018.11.014

Cited by 9 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, route optimisation can be implemented through the usage of link-layer feedback or by proactively enabling HELLO-message based re-routing, suggested by B. Deokate, Ch. Lal, D. Trček, and M. Conti [17]. The stateless AODV protocol uses the four main message types, namely HELLO messages (used to maintain links amongst neighbours), Route Request (RREQ) (broadcasted right before transmission), Route Reply (RREP) (informing the node about to transmit of the route to the packet's destination), and Route Error (REER) (used to inform the transmitting node of a failed link).…”

Section: Stateless Routingmentioning

confidence: 99%

Anchored self‐similar 3D Gauss‐Markov mobility model for ad hoc routing scenarios

et al. 2023

View full text Add to dashboard Cite

Given the observed developments of novel communication modes and the establishment of next‐generation cellular networks, mobility modelling and ad hoc routing requirements have emerged. Flying ad hoc networks are key pivots in enabling technological leaps in the domain of on‐demand communications, especially in emergency scenarios; as such, resorting to application‐ and mobility‐aware routing is a promising enabler of this emerging set of use cases. This article investigates swarm mobility modelling, and applicable routing protocols, conducting comparative analysis that leads to the introduction of the new Anchored Self‐Similar 3D Gauss‐Markov Mobility Model (ASSGM‐3D), which incorporates a novel set of spatio‐temporal statistical metrics.

show abstract

Section: Stateless Routingmentioning

confidence: 99%

Anchored self‐similar 3D Gauss‐Markov mobility model for ad hoc routing scenarios

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Authors in [8] proposed the MACARON P2P overlay for MANET. The proposed system does not use the DHT design.…”

Section: A Related Workmentioning

confidence: 99%

KadOLSR: An Efficient P2P Overlay for Mobile Ad Hoc Networks

Mojamed¹

2020

IJACSA

View full text Add to dashboard Cite

P2P and MANET are self-organized, decentralized, and dynamic networks. Although both networks have common characteristics, they are used for different purposes and operate at different layers. P2P provides the ability for peers to store and locate services in the network, while MANET provides an underlying routing capability to reach other mobile nodes. Thus, P2P and MANET could complement each other. However, P2P is originally designed to operate over the Internet, which provides rich routing capabilities compared to MANET. Therefore, deploying P2P over MANET must come with careful consideration of how to adjust P2P approaches to better suit MANET. In this paper, a novel system called KadOLSR is proposed to better develop an efficient P2P over MANET. The structure of the well-known Kademlia is used along with the OLSR. KadOLSR optimizes the similarities between P2P and MANET to reduce overlay management communication overhead and hence deploys a lightweight and efficient P2P over MANET. The network layer routing information is shared with the overlay to achieve the optimization. A cross-layer channel is constructed between the network layer and the overlay layer to exchange relevant routing information. The proposed system is designed, and its performance is evaluated using a network simulator. The performance of KadOLSR is also compared to one of the recent P2P for MANET systems. The simulation results show that KadOLSR performs well across all different network sizes and mobility speeds.

show abstract

“…Each participating peer, in the P2P overlay impulsively creates a linkage with other overlay participating peers. It is essential to mention that no critical centralized collaboration is required in P2P networking [1][2][3][4]. Different resources (files, memory, and CPU) are efficiently distributed in the peer-to-peer overlay networking.…”

Section: Introductionmentioning

confidence: 99%