scholarly journals An Optimized Routing OLSR Protocol with Low Control Overhead for UAV Ad Hoc Networks

2021 ◽  
Vol 10 (1) ◽  
pp. 6
Author(s):  
Qizheng Zhu ◽  
Zhou Zhou ◽  
Jie Yang ◽  
Zeliang Fu
2011 ◽  
Vol 2011 ◽  
pp. 1-11 ◽  
Author(s):  
Adnan Agbaria ◽  
Muhamad Hugerat ◽  
Roy Friedman

Data dissemination is an important service in mobile ad hoc networks (MANETs). The main objective of this paper is to present a dissemination protocol, calledlocBcast, which utilizes positioning information to obtain efficient dissemination trees with low-control overhead. This paper includes an extensive simulation study that compares locBast with selfP, dominantP, fooding, and a couple of probabilistic-/counter-based protocols. It is shown that locBcast behaves similar to or better than those protocols and is especially useful in the following challenging environments: the message sizes are large, the network is dense, and nodes are highly mobile.


Author(s):  
Valeriy Bezruk ◽  
Kyrylo Halchenko

The paper discusses the practical aspects of application of multicriterion approach to solving the problem of an optimal routing for wireless self-organizing networks. As the initial metrics analyzed convergence time, memory overhead, control overhead, time complexity and communication complexity.


2010 ◽  
Vol 11 (2) ◽  
pp. 240-254
Author(s):  
Tanay Dey ◽  
M.M.A. Hashem ◽  
Subroto Kumar Mondal

Due to mobility of nodes in ad hoc networks, the most challenging issue is to design and to make sound analysis of a routing protocol that determines its robustness to deliver packets in low routing packet overhead. In this paper, we thoroughly analyzed the Adaptive Monitor Based Routing (AMBR) protocol by varying different parameters that affect a routing protocol to measure its performance. Analysis shows that it requires less routing control overhead comparing with other prevalent routing protocols. An improved analytical model is also presented in this paper. All these analyses firmly prove that AMBR is a sound and robust protocol in terms of flooding, routing overhead and hence, enhances reliability


2015 ◽  
Vol 2015 ◽  
pp. 1-18 ◽  
Author(s):  
Khalid A. Darabkh ◽  
Ola A. Alsukour

Due to its simplicity, efficiency, and robustness to mobility, the On-Demand Multicast Routing Protocol (ODMRP) becomes a standout amongst the most broadly utilized multicast routing protocols in mobile ad hoc networks (MANETs). However, the robustness of ODMRP comes at the expense of incurring a high control overhead to the network. The Enhanced ODMRP (EODMRP) proposed a dynamic refresh interval for the multicast mesh based on the network feedback on real disconnections experienced by the multicast network members. Veritably, EODMRP decreased the network control overhead at the cost of obtaining a low packet delivery ratio especially in high mobility conditions of the network. In this paper, two protocols, as improvements to both ODMRP and EODMRP, are proposed where the refresh interval is basically adapted based on the source moving speed and the number of disconnections reported by multicast members. Furthermore, we proposed an impressive local recovery to be employed in both protocols, which includes new setup and failure mechanisms that contribute effectively to boosting the performance of our proposed protocols. Since the majority of nodes in MANET rely on batteries, the main contribution of this research is to limit the amount of control information that is passed between nodes (i.e., reducing the control overhead over that in ODMRP) while maintaining a better packet delivery ratio than EODMRP.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Yutao Liu ◽  
Yue Li ◽  
Yimeng Zhao ◽  
Chunhui Zhang

Mobile ad hoc networks can be widely used in many scenes, for example, military communication, emergency communication, and 5G wide area coverage as well as ultradense network scenes. A cluster-based network can decrease network overhead effectively and then constitute a large-scale network through extending network scale by clustering and cascading. In view of multiservice simultaneous transmission demand for small-scale dense networking scene and large-scale extended networking scene, a MAC protocol based on scheduling of cluster head is proposed, which can avoid collision and retransmission between nodes effectively, and then the network synchronizing in intercluster and intracluster as well as the time-slot scheduling is solved fast and efficiently. A network synchronization algorithm based on clock spread of the sponsorship node is proposed to achieve network self-synchronizing, and a modified schedule-tree algorithm based on cluster head and exactly sponsorship node is proposed to decrease network overhead and to increase network fairness, then MAC protocol based on scheduling of cluster head is verified by simulated analysis. Finally, a dynamic gateway selection algorithm based on link stability is proposed in this paper to decrease intercluster communication control overhead and improve intercluster communication reliability.


Sign in / Sign up

Export Citation Format

Share Document