Flying Ad-Hoc Network (FANET) is a hot topic in current research. The design of routing mechanism is challenging because when the scale of Unmanned Aerial Vehicle (UAV) nodes is large, vast amount of routing overhead may lead to network collapse. An elastic routing mechanism is proposed for large-scale small UAVs multitasking scenarios. Firstly, the New-Unifying Connected Dominating Set (N-UCDS) algorithm is proposed to construct a virtual backbone network based on the connected dominating set. The number of neighboring nodes, remaining energy and link duration are considered to influence the UAV network performance when electing backbone nodes. Secondly, by deploying and running the New Better Approach to Mobile Ad-Hoc Network-Advanced (NBATMAN-ADV) routing protocol on the backbone nodes, the link quality can be evaluated by using the received signal strength index and signal-to-noise ratio of the physical layer data. In this way, the change of the link can be quickly sensed while reducing the routing overhead. The simulation results show that the routing protocol proposed in this paper has significantly improved average packet delivery rate, end-to-end delay and received throughput compared with other traditional proactive routing protocols.

https://ieeexplore.ieee.org/ielx7/6287639/6514899/09893122.pdf

Elastic Routing Mechanism for Flying Ad Hoc Network

Virtual backbones based on connected dominating sets(CDS) help to optimize multi-level hierarchical networks from flat models in wireless sensor networks.However,the backbones are vulnerable due to frequent node/link failures.Therefore effective approaches are needed to make the virtual backbones fault-tolerant and highly reliable.In this paper,a distributed algorithm of 2-connected k-dominating set construction is proposed in unit disk graph network model.The informations of every node and its neighborhood are used to construct k-dominating sets distributedly,and then k-dominating sets are 2-connected.The complexity,approximation ratio and performance of the algorithm are given through theoretical analysis.Experimental simulations show that the algorithm can produce less-dominating nodes than traditional approaches.

Constructing 2-connected k-dominating sets for fault-tolerant backbone in wireless sensor networks

Flying Ad-Hoc Network (FANET) is a hot topic in current research. The design of routing mechanism is challenging because when the scale of Unmanned Aerial Vehicle (UAV) nodes is large, vast amount of routing overhead may lead to network collapse. An elastic routing mechanism is proposed for large-scale small UAVs multitasking scenarios. Firstly, the New-Unifying Connected Dominating Set (N-UCDS) algorithm is proposed to construct a virtual backbone network based on the connected dominating set. The number of neighboring nodes, remaining energy and link duration are considered to influence the UAV network performance when electing backbone nodes. Secondly, by deploying and running the New Better Approach to Mobile Ad-Hoc Network-Advanced (NBATMAN-ADV) routing protocol on the backbone nodes, the link quality can be evaluated by using the received signal strength index and signal-to-noise ratio of the physical layer data. In this way, the change of the link can be quickly sensed while reducing the routing overhead. The simulation results show that the routing protocol proposed in this paper has significantly improved average packet delivery rate, end-to-end delay and received throughput compared with other traditional proactive routing protocols. 

The broadcast storm problem in mobile ad hoc networks can be effectively alleviated by a connected dominating set-based virtual backbone network. However, the existing methods of connected dominating sets are not adapted to dynamic ad hoc networks. In this paper, a connected dominating set-based energy-efficient distributed routing algorithm is proposed. Furthermore, in order to select an appropriate relay forwarding node which reflects the energy efficiency of the dominating node and reduces its contribution to the entire network communication overhead, the additional coverage, residual energy and mobility of nodes are taken into overall consideration. To optimize the construction of network topology, the information entropy method is used to quantize each factor’s weight. The numerical results show that compared to the existing algorithm, the proposed algorithm can significantly reduce the network structure construction overhead, guarantee network connectivity, improve energy efficiency and extend the network lifetime.

Yiyun Zhang

Papers

Connected Dominating Set-based Energy-efficient Distributed Routing Algorithm