Bayesian inference approach for establishing efficient routes in wireless ad-hoc networks

被引:1
|
作者
Alkhabbaz, Wafa [1 ]
Alasaad, Amr [1 ]
Alshaye, Meshal [2 ]
机构
[1] King Abdulaziz City Sci & Technol, Ctr Excellence Telecommun Applicat, Riyadh, Saudi Arabia
[2] Univ Washington, Dept Elect Engn, 185 Stevens Way, Seattle, WA 98195 USA
关键词
Wireless ad-hoc networks; Routing protocols; Bayesian inference; AODV;
D O I
10.1007/s11235-016-0240-9
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Mobile ad hoc networks (MANETs) are dynamic wireless networks that have no fixed infrastructures and do not require predefined configurations. In this infrastructure-less paradigm, nodes in addition of being hosts, they also act as relays and forward data packets for other nodes in the network. Due to limited resources in MANETs such as bandwidth and power, the performance of the routing protocol plays a significant role. A routing protocol in MATET should not introduce excessive control messages to the network in order to save network bandwidth and nodes power. In this paper, we propose a probabilistic approach based on Bayesian inference to enable efficient routing in MANETs. Nodes in the proposed approach utilize the broadcast nature of the wireless channel to observe the network topology by overhearing wireless transmissions at neighboring nodes in a distributed manner, and learn from these observations when taking packet forwarding decision on the IP network layer. Our simulation results show that our routing approach reduces the number of control message (routing overhead) by a ratio up to 20 % when the network size is 60 nodes, while maintaining similar average route establishment delay as compared to the ad-hoc on demand routing protocol.
引用
收藏
页码:387 / 405
页数:19
相关论文
共 50 条
  • [31] An efficient reputation-based system for wireless ad hoc networks
    Peng, Gang, 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (07): : 196 - 210
  • [32] A Survey of Various Approaches to Detect Selfishness in Wireless Ad-hoc Networks
    Shah, Sachi N.
    Jhaveri, Rutvij H.
    2015 INTERNATIONAL CONFERENCE ON GREEN COMPUTING AND INTERNET OF THINGS (ICGCIOT), 2015, : 627 - 632
  • [33] Finding minimum energy disjoint paths in wireless ad-hoc networks
    Srinivas, A
    Modiano, E
    WIRELESS NETWORKS, 2005, 11 (04) : 401 - 417
  • [34] Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks
    Anand Srinivas
    Eytan Modiano
    Wireless Networks, 2005, 11 : 401 - 417
  • [35] Risk-based routing protocol for wireless ad-hoc networks
    Alarifi, A
    Du, WL
    ICWN '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS, 2005, : 161 - 165
  • [37] Towards throughput and delay optimal routing for wireless ad-hoc networks
    Gupta, Parul
    Javidi, Tara
    CONFERENCE RECORD OF THE FORTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1-5, 2007, : 249 - 254
  • [38] Heuristic Energy-Efficient Routing Solutions to Extend the Lifetime of Wireless Ad-Hoc Sensor Networks
    Nguyen Thanh Tung
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS (ACIIDS 2012), PT II, 2012, 7197 : 487 - 497
  • [39] On the Multicast Throughput Capacity of Network Coding in Wireless Ad-hoc Networks
    Karande, Shirish
    Wang, Zheng
    Sadjadpour, Hamid R.
    Garcia-Luna-Aceves, J. J.
    2ND ACM INTERNATIONAL WORKSHOP ON FOUNDATIONS OF WIRELESS AD HOC AND SENSOR NETWORKING AND COMPUTING, 2009, : 21 - 27
  • [40] Throughput Maximization for Multipath Secure Transmission in Wireless Ad-Hoc Networks
    Bai, Lin
    Han, Pengfei
    Wang, Jingjing
    Wang, Jiaxing
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (11) : 6810 - 6821