Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks

2001 ◽  
Vol 12 (10) ◽  
pp. 1023-1032 ◽  
Author(s):  
I. Stojmenovic ◽  
Xu Lin
Keyword(s):  
Wireless Networks ◽  
Routing Algorithms ◽  
Single Path

Single-path routing for life time maximization in multi-hop wireless networks

2010 ◽  
Vol 17 (1) ◽  
pp. 263-275 ◽  
Author(s):  
Yigal Bejerano ◽  
Keon-Taek Lee ◽  
Seung-Jae Han ◽  
Amit Kumar
Keyword(s):  
Wireless Networks ◽  
Life Time ◽  
Single Path

scholarly journals IMPROVED PUBLIC TRANSIT ROUTING ALGORITHM FOR FINDING THE SHORTEST K-PATH

2018 ◽  
Vol XLII-4/W9 ◽  
pp. 255-264
Author(s):  
I. Jeon ◽  
H. Nam ◽  
C. Jun
Keyword(s):  
Arrival Time ◽  
Public Transit ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Path Selection ◽  
Departure Time ◽  
Before And After ◽  
Multiple Paths ◽  
Single Path ◽  
Path Calculation

<p><strong>Abstract.</strong> Most of the existing public transit routing algorithms were developed on the basis of graph theory. Recently, algorithms are being developed that can compute for O-D public transit paths by using timetable information only, not using network structure consisting of nodes and links. The timetable-based public transit routing algorithm produces one shortest path to destination, using departure time and arrival time by stop. But it has limitations in reflecting additional factors, such as transfer penalty and alternative path selection, in the process of path calculation. In addition, since public transit passengers tend to choose one among various alternative paths, it is necessary to calculate multiple paths rather than a single path as in the existing methods. Therefore, this study proposes an improved RAPTOR algorithm that can consider transfer penalty and produce multiple paths, while it is based on RAPTOR, the existing timetable-based public transit routing algorithm. The transfer penalty was applied at the point of transfer, and differently according to transfer types. As a result of analyzing computed paths of the algorithms before and after improvement, it was found that computed paths with the improved RAPTOR algorithm proposed by this study were more similar to Seoul public transit passengers' actual travel paths than computed paths by the existing RAPTOR alone.</p>

scholarly journals An Approach to Reinforce Multipath TCP with Path-Aware Information

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 476 ◽  
Author(s):  
Kien Nguyen ◽  
Mirza Golam Kibria ◽  
Kentaro Ishizu ◽  
Fumihide Kojima ◽  
Hiroo Sekiya
Keyword(s):  
Wireless Networks ◽  
Mobile Wireless Networks ◽  
Significant Problem ◽  
Mobile Wireless ◽  
Wireless Links ◽  
Multipath Tcp ◽  
Single Path

Multipath TCP (MPTCP), which enables the use of multiple wireless links (e.g., Wi-Fi and LTE) for data transmissions, is an excellent technology for evolving multi-homing devices in mobile wireless networks. This paper explores concepts and feasibility of realizing MPTCP with path awareness (PA), in which the path-aware information is leveraged to reinforce the MPTCP transmissions. In particular, when aware of a network situation, a device can facilitate a mechanism that dynamically shifts the MPTCP traffic to a single path and vice versa. As a result, MPTCP with PA could solve the significant problem of negative aggregation benefit when the MPTCP throughput over divergent paths is worse than the best one of single-path TCP. We illustrate the feasibility of the proposed concept through our new implementation of a so-called MPTCP-LA (i.e., MPTCP with Loss Awareness). MPTCP-LA keeps the aggregation benefits non-negative by temporarily switching an MPTCP transmission on a path to a standby condition when the on-device observed loss reaches a threshold. We extensively evaluate MPTCP-LA in comparison to the standard MPTCP in an emulated environment. The results show that MPTCP-LA has better performance regarding enhancing throughput and saving networking resources.

Sign in / Sign up

Export Citation Format

Share Document