A Novel Dynamic Routing with Stable Linkage in Wireless Ad Hoc Networks

被引:0
|
作者
Malwe, Shweta [1 ]
Taneja, Naman [2 ]
Nitesh, Kumar [1 ]
机构
[1] NIIT Univ, Dept Comp Sci & Engn, Neemrana 301705, Rajasthan, India
[2] IIT ISM Dhanbad, Dept Comp Sci & Engn, Dhanbad, India
关键词
Wireless ad hoc networks; Link availability; Link failure; Control overhead; Route error; MEDIUM ACCESS; PREDICTION; PROTOCOL; LIFETIME;
D O I
10.1007/s11277-024-11533-1
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Dynamic topology and power-controlled lightweight mobile devices usually affect the performance of wireless ad hoc networks and have always been a major focus of research. Data transmission between a source-destination pair is governed by different types of routing protocols like proactive, reactive, hybrid, geographical, etc. Reactive routing techniques are highly preferred due to on-demand source-based routing with limited space requirements. To get a stable route, the routing process should consider the link availability between the communicating nodes. If any two nodes along the route become unreachable, the communication could be interrupted. This could cause the receiver to lose data and experience longer delays. In this paper, we suggest a way to improve the existing DSR protocol. The focus is on choosing a stable route with less control overhead. During the route request phase, every participating node calculates its link availability time (LAT) for each adjacent link based on the current position of the neighbor and receiving signal strength. Links with lesser LATs than a threshold are not considered for route setup hence the flooding of control packets is reduced. Simulation has been performed over the basic DSR and proposed improvements over DSR in terms of control overhead, successful data transmission rate, and the number of route errors generated in the network. The findings show that previous knowledge of link availability during the routing phase aids in the discovery of more stable routes with lower control overhead, thereby promoting reliable data delivery and improving the overall network performance.
引用
收藏
页码:1439 / 1457
页数:19
相关论文
共 50 条
  • [1] Stable clustering with efficient routing in wireless ad hoc networks
    Dhurandher, Sanjay Kumar
    Singh, G. V.
    2007 2ND INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS SOFTWARE & MIDDLEWARE, VOLS 1 AND 2, 2007, : 435 - +
  • [2] A Stable Backup Routing Protocol for Wireless Ad Hoc Networks
    Zhang, Fan
    Yang, Gangqiang
    SENSORS, 2020, 20 (23) : 1 - 11
  • [3] Dynamic topology control and routing in wireless ad hoc networks
    Lee, Kwangil
    Kim, Kapdong
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006, E89D (05): : 1672 - 1675
  • [4] Routing in wireless ad hoc networks
    Rishiwal, Vinay
    Yadav, Mano
    INTERNATIONAL JOURNAL OF INTERNET PROTOCOL TECHNOLOGY, 2012, 7 (02) : 108 - 119
  • [5] Null Frequency Jamming of Dynamic Routing in Wireless Ad Hoc Networks
    Balakrishnan, Manikanden
    Huang, Hong
    Jaradat, Yousef
    Pawar, Sandeep
    Misra, Satyajayant
    Asorey-Cacheda, Rafael
    2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [6] An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks
    Jie Wu
    Telecommunication Systems, 2003, 22 : 61 - 75
  • [7] Modelling routing in wireless ad hoc networks with dynamic Bayesian games
    Nurmi, P
    2004 FIRST ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR AND AD HOC COMMUNICATIONS AND NETWORKS, 2004, : 63 - 70
  • [8] A dynamic secure QoS routing protocol for wireless ad hoc networks
    Zhu, Ting
    Yu, Ming
    2006 IEEE SARNOFF SYMPOSIUM, 2006, : 379 - 382
  • [9] Energy Saving Dynamic Source Routing for ad hoc wireless networks
    Tarique, M
    Tepe, KE
    Naserian, M
    PROCEEDINGS OF THE THIRD INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS, 2005, : 305 - 310
  • [10] Secure dynamic distributed routing algorithm for ad hoc wireless networks
    El-Khatib, K
    Korba, L
    Song, RG
    Yee, G
    2003 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS, 2003, : 359 - 366