China
Africa
Explore chapters and articles related to this topic
Mobile Ad Hoc Routing Protocols
Published in Jonathan Loo, Jaime Lloret Mauri, Jesús Hamilton Ortiz, Mobile Ad Hoc Networks, 2016
Jonathan Loo, Shafiullah Khan, Ali Naser Al-Khwildi
The hop count is used for path selection as an optimized metric in some routing protocols. Other cost metrics such as link quality and path quality have also been proposed [28,29]. The path filtering and path selection decisions can be made at different types of nodes, for example, at the source node, destination node, and intermediate node. Most routing protocols handle only single paths. However, some other protocols provide and maintain multiple paths [30,31]. The source-tree on-demand adaptive routing (SOAR) [32] is another routing approach that cannot be directly applied to the Bellman–Ford and Dijkstra’s algorithms for path selection, because the standard for the choice of successor is determined both by the shortest path and by the set of neighbors that have advertised that route.
Introduction
Published in Weidong Wu, Packet Forwarding Technologies, 2007
Routing protocols are the means by which routers gain information about the network. Routing protocols map network topology and store their view of that topology in the routing table. Thus, route processing includes routing table construction and maintenance using routing protocols, such as the Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) [5–7]. The routing table consists of routing entries that specify the destination and the next-hop router through which the packets should be forwarded to reach the destination. Route calculation consists of determining a route to the destination: network, subnet, network prefix, or host.
Significance and Relevances of Functional Equations in Various Fields
Published in Hemen Dutta, Topics in Contemporary Mathematical Analysis and Applications, 2020
B. V. Senthil Kumar, Hemen Dutta
Routing is the process of selecting path in a network along which to send network traffic. Routing trees are typical structures used in WSN to deliver data to sink. To ensure robust data communication, efficient methods are required to choose routes across a network that can react quickly to communication link changes. Many algorithms have been proposed in literature to support the routing protocols of the network. In 1958, Richard Bellman [Dynamic Programming, Princeton University Press, 1957] applied the functional equation approach to devise an algorithm which converges to the solution at atmost N − 1 steps for a network with N nodes.
Q(λ) learning-based dynamic route guidance algorithm for overhead hoist transport systems in semiconductor fabs
Published in International Journal of Production Research, 2020
These new trends – unified layout, tool-to-tool direct delivery and a massive number of OHT operations – have created significant challenges in the operation of OHT systems. In this paper, we introduce a dynamic routing algorithm for OHT systems using learning. The routing depends on the travelling-path decision made each time an OHT performs a lot delivery job. In general, routing is categorised into static routing and dynamic routing. Static routing refers to a planning approach in which the path is fixed for given starting and destination points. A typical static routing involves deterministic shortest path planning. In contrast, in dynamic routing, the path depends on traffic conditions. If there is heavy congestion on the shortest route in terms of distance, then a dynamic routing system might reroute the delivery to a different path to avoid delays.
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
This new metric is useful for determining the most efficient routing protocol of a group of routing protocols for a particular network scenario. The metric is for a comparative performance analysis of various routing protocols. Because it is used to compare the performance of multiple routing protocols, the network lifetime is normalized against the largest network lifetime value observed from the routing protocols being compared. Similarly, the goodput efficiency is normalized against the largest goodput value observed from the routing protocols being compared. The overall score of the metric used in this research is the sum of these two values after they are multiplied by the constant k or .
Wireless body area networks: a comprehensive survey
Published in Journal of Medical Engineering & Technology, 2020
Bahae Abidi, Abdelillah Jilbab, El Haziti Mohamed
Routing protocol defines the specific choice of route, with the use of routing algorithms to determine an optimal network communication and data transfer between all the components of the network. The use of these routing protocols depends on the capabilities of each node and the requirements of each application. Several routing protocols have been proposed in different researches for the WBAN to treat different problems such as the energy efficiency, network size, quality of service (QoS), topology of the network, limited resources, security, mobility, data rate, heterogeneous environment, path loss. Some of them are determined in detail in the following subsections.