Explore chapters and articles related to this topic
The Switch/Router
Published in James Aweya, Switch/Router Architectures, 2019
This increased traffic created by the routing loops and wrong paths exacerbates traffic congestion in the network. In the worst case, a positive feedback loop occurs in the overall packet forwarding process, in which there is little useful end-user data being forwarded but only packets circulating but not effectively trying to bring the network back to stability.
A context-aware improved POR protocol for Delay Tolerant networks
Published in Automatika, 2023
Allam Balaram, T. Sakthivel, Radha Raman Chandan
The works in [9] and [10] survey the geographic routing protocols proposed for DTN. The Delay Tolerant Firework Routing (DTFR) supports routing in disconnected Delay Tolerant Networks with a large number of location-aware mobile nodes [11]. DTFR protocol comprises four phases such as dissemination rule, forwarding rule, priority policy, and buffer policy. The GeoCross prevents the routing loop formed due to the absence of a forwarding node [12]. GeoCross enhances its perimeter mode to detect the crossing links and generates a planar graph. Location-Aided ROuting for DTN (LAROD) [13] exploits a delay-tolerant geographic routing protocol. The nodes close to the destination set up the timer after overhearing the transmission based on their location. The node broadcasts a reply announcing to its neighbours that it is the new custodian if it expires. The other nodes discard the packet based on the timer. The work in [14] designs a geographic routing protocol highly suitable for heterogeneous network scenarios. Firstly, the geographic routing protocol selects the best relay node with an optimal number of message copies by utilizing The-Best Geographic-Relay (TBGR) method. Also, it overcomes the local maximum issue by clustering the network nodes. Secondly, the geographic routing mechanism extends the TBGR to heterogeneous networks, named TBGR. The work in [15] introduces an improved opportunistic routing protocol in which two predictable methods are exploited to best forwarder selection in DTN wireless sensor networks. The current and maximum delivery predictability methods diminish the buffer overflow and escalate the packet delivery ratio in DTN-based sensor networks. A new geographic routing method in [16], called GeoDTN-NDN, maximizes routing efficiency by designing a hybrid geographic routing strategy. The hybrid model uses confined greedy, perimeter, and DTN modes for successful data transmission.
Model and simulations of multipath bridge routing for inter-swarm UAV communications in EMANE/CORE
Published in International Journal of Modelling and Simulation, 2022
Zhe Chu, Fei Hu, Elizabeth Serena Bentley, Sunil Kumar
The intermediate nodes then forward both PS packets and MP-UDP packets to the next hop. When it receives a PS packet, it will check the previous packet’s path and then decide whether a routing loop occurs. If it does not occur, the node adds its own IP address to the PS packet. Similarly, during the MP-UDP transmission period, each intermediate node checks the packet’s path. Then, it selects the next node and forwards the packet to it.
A metric for measuring power efficiency and data throughput in mobile ad hoc networks
Published in International Journal of Parallel, Emergent and Distributed Systems, 2019
Todd A. Newton, Eugene B. John
The increase in node density from 16 to 32 nodes caused a routing loop in the AODV protocol that it never recovered from. Instead, the loop ushered in a quick death for the nodes involved in the routing loop, thus ending the simulation sooner, which reduced the total amount of data transferred across the network. Figure 6 provides the network efficiency scores for the four protocols being compared for various values of k.