Routing Communication Inside Ad Hoc Drones Network

Zemrane, Hamza; Baddi, Youssef; Hasbi, Abderrahim

doi:10.3991/ijim.v15i17.19179

Cited by 4 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They showed that the AODV performs better than the OLSR for low-density and highly dynamic networks. In [12], the authors compare the performance of reactive and proactive routing protocols for applications that use HTTP, such as voice applications, database queries, and video conferencing. However, modifications are required in existing routing algorithms to apply them to 5G applications such as UAVCENs, IoTs, and the UAV ad hoc network [10].…”

Section: Related Workmentioning

confidence: 99%

A Method to Reduce Route Discovery Cost of UAV Ad Hoc Network

Waqas

Rehman

Dilpazir

et al. 2023

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The unmanned aerial vehicle communication networks (UAVCNs) are composed of unmanned aerial vehicles (UAVs) connected in ad hoc mode to facilitate vertical communication in 5G and beyond networks. UAVs operating in an ad hoc mode of operation mostly use reactive routing protocols to establish routes in the network to reduce the energy consumption of the nodes. In this article, a route discovery method is presented to reduce the overhead faced by reactive routing protocols during the route discovery phase. The expanding ring search (ERS) method is mostly used by reactive routing protocols in the destination discovery phase of the routing algorithm. Although the performance of the ERS method is better than simple flooding, the presented method further reduces energy consumption and routing overhead as compared to the conventional ERS method. To achieve the task, the time to live (TTL) is modified to accommodate a large number of nodes in a search attempt. We proposed variants of the proposed techniques for diverse application requirements and compared the performance with the state-of-the-art ERS technique. It has been demonstrated with the help of simulations that the presented algorithm outperforms the ERS method in terms of reduced routing overhead and reduced energy consumption.

show abstract

Section: Related Workmentioning

confidence: 99%

A Method to Reduce Route Discovery Cost of UAV Ad Hoc Network

Waqas

Rehman

Dilpazir

et al. 2023

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Examples of this routing protocol are Destination sequenced distance vector (DSDV) and optimized link state protocol (OLSR) [4].…”

Section: Proactive Routingmentioning

confidence: 99%

Energy Efficient Routing Scheme for Performance Enhancement of MANET Through Dominating Set

Sangeetha

Erna²,

Kannan³

et al. 2023

Int. J. Interact. Mob. Technol.

View full text Add to dashboard Cite

Mobile Ad-Hoc network is a distributed wireless network that is self-organized and self-maintained and it doesn’t require a fixed framework or central administration. Wireless nodes in a mobile ad hoc network are transient and have a short lifespan. They combine to form a self-configured, infrastructure-free network where routing is a significant difficulty. The wireless nodes in the network must synchronize in order to decide connectivity and routing. Ad hoc network synchronization includes activities including node organization, neighborhood detection, and routing. The predetermined framework resulted in an increase in network control overhead. If a node can link to every other node in the network, it is referred to as a dominating node, and a set of dominating nodes make up the dominating set. The main purpose of this article is to lessen routing overhead in the wireless network with the dominating set based routing (DSBR). In order to discover routes, shorten reroute establishment times, and increase packet delivery rates, this research presents an energy-efficient routing algorithm (EERA) that considerably increases the network performance. The effectiveness of this technique is demonstrated by the simulation analysis of the outcome.

show abstract

“…It is needed that in a wireless network (WN), the stations that are sharing channels of communication as the same must be offered a reasonable chance as a fair one for accessing the medium. Fairness is considered as the main issue where the whole wireless network ad hoc should tackle [1]. Unfairness takes place if few stations are grabbing the channel's bandwidth mostly whereas others are starving [2].…”

Section: Introductionmentioning

confidence: 99%

A Comparision of Node Detection Algorithms Over Wireless Sensor Network

Mahdi¹,

Alwan²,

AL-Bander

et al. 2022

Int. J. Interact. Mob. Technol.

View full text Add to dashboard Cite

MANET is standing for Network as Mobile Ad-hoc which is a self-directed mobile handlers group which communicates over relatively bandwidth constrained wireless channels. Many services with different classes of Quality of Services (QoS) could be provided through the MANET such as data, voice, and video streaming. Thus, efficient packets routing is an essential issue especially over this kind of burst channel. To settle this issue, many scheduling techniques are proposed to reduce the packets dropping and channel collision when a huge demand of data is transferred from a sender to a receiver. In this paper, four MANET scheduling algorithms are selected and investigated in mobile ad hoc network which are Strict Preference (SP), Round Robin (RR), Weighted Round Robin (WRR), and Weighted Fair (WF). The network simulator EXata 2.0.1 is used to build the scenario which is consist of 50 nodes and performed the simulation. The results showed the performance metrics difference of the network such as the throughput and the end-end delay as well as queuing metrics like peak queue size, average queue length, in queue average time, and droppe of whole packets. Regrading throughput, the SP algorithm has a greater throughput than WF, RR, and WRR by 4.5%, 2.4%, and 1.42%, but WRR has outperformed others regarding the end-end delay. Moreover, WRR represents the best scheduling algorithm regarding both peak queue size since its greater than RP, WF, and WRR by 10.13%, 9.6%, and 5.32%, in order, and average output queue length in contrast, WRR worsts more time in queuing but it is the best in preventing the packets from dropping.

show abstract

Routing Communication Inside Ad Hoc Drones Network

Cited by 4 publications

References 12 publications

A Method to Reduce Route Discovery Cost of UAV Ad Hoc Network

A Method to Reduce Route Discovery Cost of UAV Ad Hoc Network

Energy Efficient Routing Scheme for Performance Enhancement of MANET Through Dominating Set

A Comparision of Node Detection Algorithms Over Wireless Sensor Network

Contact Info

Product

Resources

About