1. Reliable Routing Design in Predictable Wireless Networks with Unreliable Links
- Author
-
Hai Zhu, Zhen Luo, Mengmeng Xu, Song Jiongjiong, and Hengzhou Xu
- Subjects
020203 distributed computing ,Sequence ,Optimization problem ,Computer science ,business.industry ,Wireless network ,Reliability (computer networking) ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Routing algorithm ,020206 networking & telecommunications ,02 engineering and technology ,Graph ,Path (graph theory) ,Hardware_INTEGRATEDCIRCUITS ,Computer Science::Networking and Internet Architecture ,0202 electrical engineering, electronic engineering, information engineering ,Routing (electronic design automation) ,business ,Computer network - Abstract
In this paper, the reliable routing design problem is investigated in predictable wireless networks over unreliable links. The predictable wireless networks are described as a sequence of static graphs, and then modeled as a space-time graph. The reliable routing design problem on the space-time graph is defined as a bi-objective optimization problem. The aim of the new routing design problem is to find a routing path with the maximum routing reliability and the minimum routing cost. Next, a hierarchical shortest routing algorithm is proposed to find the feasible routing path. Simulation results validate the effectiveness of the proposed routing algorithm.
- Published
- 2020
- Full Text
- View/download PDF