Channel Adaptive Shortest Path Routing for Ad Hoc Networks

被引:2
|
作者
TIAN Hui
机构
关键词
wireless networks; ad hoc networks; routing;
D O I
暂无
中图分类号
TN925 [无线电中继通信、微波通信];
学科分类号
080402 ; 080904 ; 0810 ; 081001 ;
摘要
Routing in Mobile Ad Hoc Network (MANET) is a challenge owing to the dynamic nature of network topology and the resource constraints. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with the minimum hops approach is often adopted. However, the quality of wireless channels among the mobile nodes is time varying owing to fading, shadowing and path loss. Considering adaptive channel coding and modulation scheme, the channel state can be characterized by different link throughputs. If routing selection based on the link throughput is implemented, the minimum transfer delay from source to destination and the maximal throughput may be obtained. In this paper, a Channel Adaptive Shortest Path Routing (CASPR) is presented. Based on the adaptive channel coding and modulation, the CASPR transforms the link throughput into the channel quality factor Q and finds the shortest routing according to the Q measure. Simulation results show that the average path length in the proposed routing scheme may be slightly higher than that of the conventional shortest path with the minimum hops approach, but it can reduce the average transfer delay and increase the packet deliver rate.
引用
收藏
页码:1 / 5
页数:5
相关论文
共 50 条
  • [1] On shortest path routing schemes for wireless ad hoc networks
    Dhar, S
    Rieck, MQ
    Pai, S
    [J]. HIGH PERFORMANCE COMPUTING - HIPC 2003, 2003, 2913 : 130 - 141
  • [2] Shortest path routing in partially connected ad hoc networks
    Tan, K
    Zhang, Q
    Zhu, WW
    [J]. GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 1038 - 1042
  • [3] Topology, shortest path routing and lifetime of ad hoc networks
    Dhillon, S. S.
    Zhou, Y.
    [J]. 2007 14TH IEEE SYMPOSIUM ON COMMUNICATIONS AND VEHICULAR TECHNOLOGY IN THE BENELUX, 2007, : 151 - 155
  • [4] A cost matrix agent for shortest path routing in ad hoc networks
    Wu, Mary
    Kim, ChongGun
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2010, 35 (06) : 646 - 652
  • [5] A comparison of Load-Distributive Path Routing and Shortest path Routing in Wireless Ad Hoc Networks
    Habib, Iffat
    Badruddin, Nasreen
    Drieberg, Micheal
    [J]. 2014 5TH INTERNATIONAL CONFERENCE ON INTELLIGENT AND ADVANCED SYSTEMS (ICIAS 2014), 2014,
  • [6] Various distributed shortest path routing strategies for wireless ad hoc networks
    Dhar, S
    Rieck, MQ
    Pai, S
    Kim, EJ
    [J]. DISTRIBUTED COMPUTING: IWDC 2003, 2003, 2918 : 255 - 264
  • [7] Combined Genetic and Fuzzy Approach for Shortest Path Routing Problem in Ad hoc Networks
    Kumar, K. Senthil
    Ramkumar, D.
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2016, 90 (02) : 609 - 623
  • [8] A Memetic Algorithm for Dynamic Shortest Path Routing on Mobile Ad-hoc Networks
    Sabar, Nasser R.
    Song, Andy
    Tari, Zahir
    Yi, Xun
    Zomaya, Albert
    [J]. 2015 IEEE 21ST INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2015, : 60 - 67
  • [9] Combined Genetic and Fuzzy Approach for Shortest Path Routing Problem in Ad hoc Networks
    K. Senthil Kumar
    D. Ramkumar
    [J]. Wireless Personal Communications, 2016, 90 : 609 - 623
  • [10] Routing with adaptive path and limited flooding for mobile ad hoc networks
    Yen, Yun-Sheng
    Chang, Hung-Chieh
    Chang, Ruay-Shiung
    [J]. INTERNATIONAL SYMPOSIUM ON WIRELESS PERVASIVE COMPUTING 2006, CONFERENCE PROGRAM, 2006, : 429 - +