Shortest-Path Routing in Wireless Mesh Networks under Time Varying Link-Cost Metric
Nandini K. S1, S.A. Hariprasad2
1Nandini K. S, Research Scholar, Department of Electronics and Communication Engineering, Jain University, Bangalore (Karnataka), India.
2S.A. Hariprasad, Director, Department of Engineering and Technology, Jain University, Bangalore (Karnataka), India.
Manuscript received on 05 January 2019 | Revised Manuscript received on 13 January 2019 | Manuscript published on 30 January 2019 | PP: 153-165 | Volume-8 Issue-3, January 2019 | Retrieval Number: C2627018319/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In a wireless Mesh Network, with cognitive radios, the cost of the available communication links can vary with respect to time due to the schedules of the primary users. Under this condition, to find the time dependent shortest paths for the secondary users is a challenging task. At a particular time slot, if no forward links are available at a node, the data packet which has just arrived have to halt (or wait) until the availability of one or more forward paths. Then the data packet suffers halting delay. Thus the overall arrival time could be more than that of an alternate path. Therefore, in this paper we provide an innovative method of reducing the halts along the path. We also have to minimize the length of the topological (physical) distance along the selected path. Thus, in our paper, two objectives, the earliest arrival time as well as minimum shortest topological path, are realized. The weight assigned to each objective can be adjusted according to the requirements. To solve this bi-objective optimization problem, we propose a new modification to the well-known Dijkstra shortest path algorithm which takes care of the actual link cost and also the halting cost.
Keyword: Cognitive Radio Network, Spectrum Sensing, Secondary users, Time dependent cost Matrices, Probability of Interference, Optimal Assignment.
Scope of the Article: Heterogeneous Wireless Networks