# A Simplified Mobile Ad Hoc Network Structure for Helicopter Communication

Authors: Abdeldime Mohamed Salih Abdelgader; Lenan Wu; Mohammed Mohsen Mohammed Nasr
Journal: International Journal of Aerospace Engineering
 (2016)

---

## Abstract

There are a number of volunteer and statutory organizations who are capable of conducting an emergency response using helicopters. Rescue operations require a rapidly deployable high bandwidth network to coordinate necessary relief efforts between rescue teams on the ground and helicopters. Due to massive destruction and loss of services, ordinary communication infrastructures may collapse in these situations. Consequently, information exchange becomes one of the major challenges in these circumstances. Helicopters can be also employed for providing many services in rugged environments, military applications, and aerial photography. Ad hoc network can be used to provide alternative communication link between a set of helicopters, particularly in case of significant amount of data required to be shared. This paper addresses the ability of using ad hoc networks to support the communication between a set of helicopters. A simplified network structure model is presented and extensively discussed. Furthermore, a streamlined routing algorithm is proposed. Comprehensive simulations are conducted to evaluate the proposed routing algorithm.


---

## Body

## 1. Introduction

In the recent years, Ad hoc networks emerged with the rapid development of communication technologies. Typical ad hoc approaches consider nodes with similar capabilities that move in random patterns relative to one another over time and the communication is separated from the other activity of the node. This type of networks is known as mobile ad hoc network (MANET), which is a wireless network that is formed by a collection of self-organizing mobile nodes [1]. Each node communicates with its neighbors over a shared wireless medium. In MANET, wireless nodes cooperate to relay packets over multiple relay hops from source to destination that is known as multihop network [2–4]. Due to the lack of central management, nodes in MANET are designed to act as end system and routers for other nodes. The network is connected dynamically and does not rely on any preexisting network infrastructure. In MANET, nodes are free to move and have the capability to deliver messages in a decentralized manner. MANET has been utilized in vehicular environments to form the vehicular ad hoc networks (VANETs) [3, 5]. VANETs recently emerged with great interest due to their impact in reducing traffic jams and increasing safety. It can also be used for providing many services to passengers, drivers, and authorities. VANETs are limited only to urban and highways areas and they are difficult to work in rugged environments and some extraordinary situations without special communication equipment and facilities.Unlike planes, helicopters have the advantage of not requiring a runway for taking off or landing. Therefore, they can carry both people and goods to virtually impassable locations often not connected by road and only accessible on foot with difficulty. Helicopters are therefore indispensable tool for rescue organizations, armies, navies, and especially air forces. Recently, the ambulance service has a statutory responsibility to respond to traumatic and medical emergencies. Fire and rescue authority has a statutory duty to deal with fires, road traffic accidents, and maybe certain types of terrorist related incidents such as mass decontamination. Fire and rescue authorities with discretion require responding to events such as flooding or animal rescue [6]. Helicopters can be a valuable and versatile asset in any Search and Rescue (SAR) events [4, 7, 8]. Emergency services personnel are increasingly calling on the support of a helicopter air assistance [9]. Radio contact is still of great importance for communication between helicopters, planes, and ground stations. The operation environment is different from that of vehicular networks and traditional ad hoc networks. Helicopters outperform the performance of vehicles, particularly in cases that need fast response and in rugged or distant areas. However, it requires special and reliable communication requirements to provide reliable services. Helicopters network can also serve as alternative emergency communication system in case of natural disasters, when there is lack of ordinary ground communication systems. Furthermore, in many situations, communication between helicopters and ground vehicles or operation center is highly required.Recently, the increased capabilities in embedded systems have enabled unmanned flight through the removal of the human pilot from the aircraft cockpit. As the applications of drone and Unmanned Aircraft System (UAS) expand, the principal issues of communication technologies are flexibility, adaptability, and controllability of the information/data flows. Future systems will be net-centric and rely on mobile ad hoc networking to provide real-time connectivity among cooperating agents and to provide backhaul of sensor and telemetry data from mobile nodes to a data repository or command center [10]. There is a current push towards the development of simple, small, low-cost UAS that work individually and in cooperative teams to accomplish complex and dangerous missions. These networks can be applied to numerous applications, including diffuse gas and plume detection [11], coordinated search [6] and reconnaissance [12], and in situ atmospheric sensing [13], as agents in the battlefield [14], aerial photography, and mass decontamination, and as components in command and control architectures. With smaller, cheaper UAS that have limited sensor capabilities, cooperative control relies heavily on communication with neighbors [6, 15–17]. That means, by forming a multihop communication network, information can be efficiently shared among helicopters or UAS. Consequently, this will increase the overall mission capabilities and extend the operational range.Communication networks between and through aerial vehicles are the backbone of the current battlefield communications. For instance, Google recently established a research and development project with the mission of offering Internet access to rural, rugged, and remote areas. The project is denoted as Project Loon [18]. The project uses high-altitude balloons placed in the stratosphere at an altitude of about 18 km to create an aerial wireless network with up to 4G-LTE speeds. Project Loon balloons float in the stratosphere, twice as high as airplanes and the weather. In the stratosphere, there are many layers of wind, and each layer of wind fluctuates in direction and speed. Loon balloons go where they are needed by rising or descending into a layer of wind blowing in the desired direction of travel. By associating with telecommunications companies to share cellular spectrum, loon balloons can enable people to connect to the balloon network directly from their phones and other LTE-enabled devices. The signal is then passed across the balloon network and back down to the global Internet on Earth. Each balloon can provide connectivity to a ground area (footprint) about 80 km in diameter using LTE wireless communications technology [19]. In a similar manner, helicopter network can provide I
n
t
e
r
n
e
t
∖
n
e
t
w
o
r
k access for a specific area and for a particular mission by connecting ground users to a backbone network in a certain time.Present helicopters communication systems use specialized high-cost radios that operate in designated military radio and other communication bands. Small low-cost Commercial Off-the-Shelf (COTS) radio equipment combined with powerful computer processing can be mounted on helicopters or small UA and has the potential to revolutionize battlefield communications and open up many scientific and commercial applications. One of COTS technologies is the IEEE 802.1x wireless LANs that connect wireless mobile nodes to a fixed infrastructure and is being widely deployed, including in UAS applications [15, 20]. Both IEEE 802.11 and IEEE 802.16 define Peer-to-Peer (P2P) and wireless ad hoc networks, where an end user communicates to users or servers on another local area network (LAN) or other users using its access point or base station. More interesting applications are possible when swarm of helicopters connect to each other in peer-to-peer ad hoc meshed wireless networks [2, 21]. This can form directly or through multihop connected airplane, a new kind of MANET called aerial vehicular ad hoc networks (AVANETs).The ability and performance of utilizing MANET as platform for connecting helicopters in one network have not been thoroughly investigated. MANET can be used in communicating a group of helicopters or drones working in specific mission to each other. It can also be used to communicate a helicopter or drone to the data center. Nowadays, people activities extended to deserts and other rugged environments for many purpose such as rescue, exploration, transportation, research, and mining. Helicopters can serve a lot in these areas. Improving the transmission of information about the accidents, weather, and locations in these areas will provide people with a higher degree of safety and comfort.To the best of our knowledge, the use of ad hoc networks in helicopter communications has never been previously studied, despite their reliability, scalability, high data rate, bandwidth, diversity of application, and minimum cost compared to the existing solutions. This and the promising expected applications are the motivations of this work. This paper addresses the utilization of MANET in forming AVANET that consists of helicopters or UAS nodes. The main objective of this work is to investigate the utilization of MANET as alternative data communication link for helicopters, drones, or UAS environments. We present a simple model for the network structure and extensively discusse the different expected communication scenarios. In the proposed structure, a swarm of helicopters are clustered to one or multiple clusters which can communicate to some central servers through a wireless mesh backbone as well as Internet. Within each cluster, a self-organizing MANET is formed such that all helicopters are connected to all others within the same cluster. As the research on this topic, along with other related issues, is still in its infancy, we bring the attention to network structure formation and information routing. Accordingly, we propose a simple routing protocol. Furthermore, as many MANET routing protocols, such as Clustering Based Routing Protocol (CBRP) [22], use the ID number of the nodes to select the cluster head, this paper proposes a novel swarm head (SH) election approach which considers the communication equipment, velocity, and location of the helicopters in the election process. The proposed SH election approach uses a weighting mechanism to achieve a better utilization of all the nodes and perform optimum SH selection by using the election priority factor (EPF) of the nodes. The selection based on the location, equipment, and velocity of the nodes has never been addressed by other existing protocols which only use the ID or velocity to elect the SH.The rest of this paper is organized as follows. Section2 tackles ordinary helicopters’ communication techniques and their limitations. This section also presents the promising communication scenarios which can be achieved by utilizing ad hoc networks for helicopter networks. In Section 3, we discuss the research opportunities which have not been considered by this work. The proposed network structure model and the SH election algorithm are presented in Section 4, while the routing algorithm is proposed in Section 5. Section 6 presents our simulations settings and their results. Section 7 concludes this work.


## 2. Helicopter Communications

Ordinarily, communications between air ambulance, police air support, SAR helicopter, and land SAR teams usually are via the ground to air channel as identified in the National Band Plan which is VHF High Band Land Search and Rescue Radio Channels (VHF-HBLS-RRC) [9]. Communications with coastguard rescue teams uses VHF channel 156 MHz. Communication between responding helicopters usually uses Scene of Search 123.1 MHz AM. SAR and some air ambulance helicopters are often fitted with VHF/UHF/HF and FM radios [9]. Some helicopters carry the Airwave Communications System (ACS), providing Terrestrial Trunked Radio (TETRA) communications used by emergency services and police through several talk groups [9]. In addition, the ACS provides a means to make telephone calls from the helicopter to mobile or PSTN telephone numbers. Some helicopters also carry a spare FM radio that can be deployed to incident control or to mobile ground units. Some kinds of helicopters, such as the Maritime Coastguard Agency (MCA) helicopters, have a satellite link (Satcom) and there is potential to communicate directly by phone [23]. Specific aspects of operations, such as hovering, winching, or refueling, may make it difficult to contact or get a reply from the crews. Although crew can monitor all radios throughout the copilot, these systems may not function with high efficiency, in case of urgent messages and life-threatening situations. Terrain masking can also be a factor and, in this case, emergency services may consider using local MCA units or MRTs helicopters (Mountain Rescue Teams) to enhance communications using satellite links. Emergency situations sometimes necessitate exchange of some information such as images, maps, and video that require high data rate and bandwidth. Besides, in some special missions an immediate exchange of information between helicopters themselves is quite needed. Conventional VHF/UHF communication systems are not the efficient way to carry this type of information.Nowadays, Aircraft Communications Addressing and Reporting networks (ACARs) are under operation in the aeronautical world for aircraft-ground communications to offer a cockpit/maintenance/cabin operation. The ACARs data link service uses VHF radio channels. The VHF ground stations coverage is “line-of-sight.” This means that a station at an airport can provide coverage to aircrafts located at the airport and above the airport within a cone limited by the curvature of the earth.ACARs usually share the VHF band with voice communications, because most channels had been assigned to voice when ACARs was implemented. Thus, there were not enough VHF channels to assign a dedicated frequency to each ACARs ground station. This required the ACARs VHF design to allow service providers to have all their ground stations across a region use the same base frequency. Furthermore, by using the traditional VHF voice systems, the data rate in ACARs system is limited to only 2.4 kilobits per second. At a higher data rate, the rate of errors in decoding the received signal would rise and communications would become impossible. Moreover, there are already no VHF frequency channels available for allocation to new VHF ACARs services in Europe. This will soon be true in certain parts of USA. Therefore, to increase VHF data link capacity further, it will be quite essential to implement a system providing more capacity per channel. Although some helicopters have satellite communication or ACS Links, these solutions have limited bandwidth, are very expensive, and are only used for necessary voice calls [23]. For instance, in surveillance, monitoring, or rescue operations, the image or video of the target area must be relayed from the helicopter to the control center with a very strict delay bound, and it requires high bandwidth. In addition, by the help of the technological advancements on sensor technologies, it is possible to collect data with very high resolution, and this makes the bandwidth requirement much higher. The collaboration and coordination of multiple helicopters also need additional bandwidth resources. Sometimes, a type of communication to provide comfortable applications, such as entertainments, Internet services, and others, for the working team is also needed. In these cases, ad hoc network possibly is one of the alternative cheap solutions.Ad hoc networks can be used to handle the communications between helicopter nodes using different scenarios:(1)
They can be used as internal communication between helicopters. Using this scenario a group of helicopters, drones, UA, or aircrafts can form together a full or half mesh topology LAN by which they can communicate to each other as shown in Figure1(a). Forming this network can enable them to share and exchange resources and information between each other.
(2)
They can be usedas a bridge in case of natural disasters or in special scenarios in which a communication between two networks is needed when the ordinary communication systems are lacking. This can be done using a rescue helicopter or small UA, to connect two nodes or networks as shown in Figure1(b). This scenario can be temporarily implemented for a particular mission, when there is some natural obstacles which prevent installing ordinary network infrastructure, such as in seas (to connect two ships), across rivers, and over mountains.
(3)
They can be used to extend the communication range: The range of the network can be extended beyond the ordinary distance ofWi-Fi or any other wireless technology, using the ad hoc multihop characteristic, as shown in Figure 1(c). This scenario has many applications using helicopter nodes. It can be used to provide temporary link to certain location in some circumstances. This characteristic is very useful in case of natural obstacles, natural disasters, or loss of ordinary communication infrastructure in specific location. The environment also affects the communication coverage of the ordinary VANETs. Obstacles, such as mountains, walls, or buildings and constructions, may block the radio signals. AVANET can help to operate behind the obstacles, and it can extend the scalability of multihelicopter applications [24].
(4)
They can be used to connect to a central point: A group of helicopters or air crafts can be connected to form a local area network (LAN) and then select one of them to act as gateway to connect to the central operation network. That means that they can exchange and share resources and information with the operation center using this topology, as shown in Figure1(a).
(5)
Helicopter or drone networks can be an active part of the upcoming technologies Internet of Vehicle (IoV) and Internet of Things (IoT). Providing Internet connection and network access to helicopters would provide a promising applications for many activities such as that of Figure 1(d).
(6)
Helicopter networks can also serve as a large-scale wireless sensor network (WSN) for future ITS and many other systems, particularly in natural disasters situations and rugged environments, because every helicopter can be regarded as a super sensor node. Helicopters are commonly equipped with thermometers, microphones, one or more cameras, ultrasound radar, GPS, and other sensory features. A WSN of such capabilities is unprecedented and can extend perceptive computer systems to every point of the world. That means that, without the need for restrictive infrastructure, information can be shared in a peer-to-peer manner.Figure 1
Helicopter network scenarios. (a) LAN and WAN. (b) Helicopter as bridge. (c) Extending network coverage range through multihops. (d) Providing Internet/network access for some users in specific area.
(a)
(b)
(c)
(d)


## 3. Important Consideration

The use of MANET in helicopters and drones networks is a new wide field of research. Up to our knowledge, this work seems to be the first one that studies the ability of using MANET to provide communication between helicopters. Therefore, many works require to be conducted in order to provide a complete investigation and implementation of MANET in such kind of environments. Many researches are required to consider the physical, MAC, and application layers in more details and study the suitability of the existing MANET and VANET solutions for AVANETs. Considering that helicopters can be a part of intelligent transport system (ITS), the use of wireless access in vehicular environment (WAVE) standard is also need to be investigated, as this standard is particularly designed for vehicular networks, and some AVANETs’ characteristics may not be similar to that of VANET. Moreover, security is one of the most important issues, as this paper does not include a security solution for communication between helicopters in different scenarios. The existing solutions need to be investigated to ensure their suitability, reliability, latency, and scalability for these types of networks.Furthermore, a general model for modeling the speed and the distribution of helicopters is much needed. Many other investigations and studies, which are related to helicopter network applications, routing, MAC, and physical layers can also be conducted. The implementation of OSI model in such type of networks may not fit well due to some constraints imposed by the nodes itself and the environment. Therefore, cross layering techniques are much needed to facilitate the interaction between layers and make it possible to tune layer parameters so that the overall performance can be improved. Many MAC and routing protocols [21, 25–27] can be used in this type of network but their impact, performance, reliability, and suitability need to be intensively examined. Additionally, the effect of these communication systems on the safety of the helicopter is one of the most important issues that is required to be carefully studied. There are many challenges for helicopter networks such as modeling mobility, connectivity, broadcast method, and routing protocols. The above stated points and many others are the next phase of research in AVANET. This paper proposes a general structure for the helicopters network and presents a routing mechanism for information exchange. The communication problem initially can be solved by using other systems’ technologies, or by utilizing other researches’ results [10, 15, 23, 28], but the high mobility and the dynamic change in topology and environments remain the biggest challenges, which require special attention. Hence, what set this work apart are the exploration and the use of MANET technologies and their induction into the scope of the proposed structure model, although not all technical difficulties are completely eliminated.


## 4. The Proposed Network Model

The network scenarios adopted throughout this paper are rescue environments or a group of helicopters/drones working in specific mission. The network structure of the proposed model is shown in Figure2. We assume a number of helicopters (N). The maximum numbers are not more than N
m
a
x. Each of these helicopters is moving with velocity equal to v
I. When the number of nodes in one group exceeds N
m
a
x, it will be divided into g
=
K
/
N
m
a
x neighbor groups; K
>
N
m
a
x is the total number of helicopters. In this paper, we use the notationswarm to represent a group of N helicopters moving in the same direction and within a communication coverage range. The basic coverage range (L) between two helicopter nodes (I
,
J) is according to (1), where x
,
y
,
z are the coordinates of nodes. The presence of multihop operation can extend the coverage range to L
m
a
x. The multihop operation can be conducted between at least three helicopters. The maximum distance between the first and the third one does not exceed 2
×
L. That means that the maximum coverage distance in one swarm can be up to L
m
a
x
≤
(
N
-
1
)
×
L. The maximum value of L depends on the type of the physical layer communication technology, such as IEEE 802.11p and IEEE 802.16. Conisder(1)L≤xi-xj2+yi-yj2+zi-zj2.Figure 2
Simple structure for helicopters communication network.The mission of the swarm can be rescue operation, aerial reconnaissance, or military mission as well as alternative emergency communication system in case of natural disasters when there is lack of ordinary communication systems. The communication conditions can be according to three scenarios shown in Figure2. The first scenario is the communication among the swarm members. The second one is the communication between two or more swarms, in case of very large number of helicopter nodes or when two or more swarms are moving in different directions. The third scenario is the communication between the swarm members and the ground operation center, the ground VANET nodes, or the communication to ground hand-held node which is a soldier or a victim that requires rescue. Practically, the number of helicopters moving in one direction for specific mission usually is very small. The small number of nodes eases swarm management and provides good performance. However, in some cases the large number of nodes may offer more alternative communication routes and facilities.In this model, we assume that all helicopters are equipped with ad hoc radio equipment in addition to the traditional VHF/UHF systems used for voice communications. The ad hoc uses the specification of IEEE 802.11p to form an ad hoc network with a coverage range about 1 Km. Using 802.11 with high-gain antenna can extend the coverage up to 20 km; however, this requires more power, while the utilization of IEEE 802.16 can increase the coverage to more than 40 km. However, some nodes may have other types of direct communication links. Therefore, this paper classifies helicopters according to their equipment into two types. The first type is that equipped with satellite link or any direct data communication link to ground terminals. We will use the notationS
1 to represent this type. The second type is the helicopters equipped with ad hoc network onboard units in addition to the ordinary voice communication links. We use the notation S
2 to represent this type of helicopters.


### 4.1. Swarm Formation

Helicopter/drone initiates the communication by broadcasting aHELLO message to discover the surrounding nodes. TheHELLO message contains the information of the helicopter. These pieces of information include the ID number, velocity, and location and direction in degree and communication equipment type. We define a transitional state calledS_UNDECIDED for smoother operation of swarm formation. “Undecided” means that a node is still in search for its hostswarm. Other nodes within the coverage region upon receiving the message will respond by sending aREPLY message. In case of the responding node already joining an existing swarm,REPLY message will include its ID number, velocity, location, direction, and the ID number of the swarm. If it is not a member of a swarm it will sendFREE message that includes its direction, ID number, velocity, and location. In case of the fact that the responding node is the SH of an existing swarm, it will send its information and the swarm information which include the amount of current nodes (N) in the swarm. If N
<
N
m
a
x, the SH will include an invitation message (INVITE) for theUndecided helicopter to join the swarm. The helicopter will directly become a swarm member and has all the information of the swarm and it can use the swarm facilities. It will change its state to “S_member.” The direction is one of the important factors that qualify any helicopter to join a certain swarm. The direction should be not more than θ degree of the SH direction.IfN
≥
N
m
a
x, SH will send to the new node a JOIN_GUEST message. TheJOIN_GUEST msg includes the information of the nearest neighbor node to the guest one. The SH finds the nearest nodes using the information of its swarm and the location of the guest node. The new node will form a temporary network with the nearest neighbor node. The nearest node will work temporarily as relay node to carry the information of the guest node through SH to the rest of the network. TheUndecided node will be treated asTail-Node (TN) of the nearest node as shown in Figure 2. This situation will continue until theUndecided helicopter joins a swarm. In case of the responding node of typeUndecided, the two nodes will store the information and directly start the SH election process according to the SH election procedure described in Section 4.2. After formation of the new swarm, the nearest node and its TN will act as relay between the two swarms. The swarm formation is not limited to the nodes that located within one MANET coverage; a set of nodes moving in the same direction can form a swarm using multihop operation until the number of nodes equals N
m
a
x.As a rule, SH and the neighbor SH can communicate directly if they are in the same ad hoc coverage. Nonetheless, in the actual situation of the physical structure of the network, SH1 and its neighbor SH2 may not necessarily to be within the same ad hoc communication range. Therefore, SH selects boundary members to act as a relay between the neighbor SHs and forward information. Therefore, swarm formation not only is the process of building the swarm structure and electing the SH, but also includes the operation of determining the boundary nodes used to communicate between the adjacent swarms as shown in Figure2.


### 4.2. Swarm Head Election

SH is responsible for route finding and organizing of interswarm communication. It is also responsible for finding the best route to distant destinations by exchanging its swarm information with other SHs. In many situations, SH participates in information forwarding process. Therefore, helicopter with best resources and facilities, located in a suitable location and having an average velocity among other nodes, is qualified to serve as a SH.The helicopters of any swarm need to select a SH. The selection of the SH depends on different factors, such as communication equipment, velocity, and location within the swarm. Helicopter with satellite link has the highest equipment priority. Helicopter located in the center of the swarm also has the highest location priority.In this paper for the purpose of SH election process, we make the following assumptions. The notationP
i is the SH election priority factor (EPF). Each helicopter node has an ID number which is unique and known to the whole network. Each helicopter is equipped with a GPS used to periodically collect location, velocity, and direction. The maximum speed for each swarm member is v
m
a
x. If the number of swarm members is too small, number of helicopter nodes that are able to act as a SH will increase and the network will become more isolated. If swarm members are too high the burden on the SH will increase. Consequently, the intraswarm communication cost increases, because the SH is responsible for communication between both its nodes and the neighbor SHs. Therefore, the swarm size needs certain constraints. In this paper, we define M
m
a
x to represent the maximum number of hops between the swarm members and the SH. We also define N
m
a
x as the maximum number of nodes in each swarm. Furthermore, if the movement direction of the SH is opposite or different to most of the nodes within the swarm, the node quickly leaves the range of swarm and joins other swarms, which increases the swarm maintenance burden. Therefore, movement direction of the nodes needs to be taken into account when selecting SH. In actual scenarios, it is very difficult to find two nodes moving exactly with the same orientation. To solve this problem, we used a threshold (θ) to determine whether the directions are approximately the same or not. Two helicopters will be considered as moving in the same direction if the angle between them does not exceed the maximum thresholds. In this paper, helicopters are moving to the same direction and the maximum threshold of difference between two helicopters is 15 degrees. Helicopters moving in the opposite direction combine another swarm. SHs moving in different directions are able to connect as long as they were in the communication range. When they are outside the ad hoc coverage, they can communicate using satellite communication or through other SH. In order to avoid frequent changes in swarm structure, the speed of the nodes also is one of the important considerations. A SH should be the node relatively near to the average rate of other nodes velocity. Based on the above assumptions, a node is elected as a SH according to its EPF value; the following expresses the mathematical calculation of the EPF (P
i).Assume thatI represents the intended helicopter node, J is another node in the same swarm, and each I node has N
-
1 neighbors, J
1
,
J
2
,
J
3
,
…
,
J
(
N
-
1
), with coordinates (x
J
1
,
y
J
1
)
,
x
J
2
,
y
J
2
,
…
,
(
x
J
N
-
1
,
y
J
N
-
1
). Φ
I is the group of nodes within the same swarm which are neighbors of node I. Intended helicopter coordinate is x
I
,
y
I. Helicopters velocities at instance election time are v
1
,
v
2
,
…
,
v
N. Helicopters are classified according to their communication equipment into S
1 and S
2 as mentioned above.Firstly, according to the equipment of the helicopter, the equipment priority valueP
E is as follows:(2)PE=0if  typeS11if  typeS2.Helicopter with P
E
=
0 has highest equipment priority.Secondly, to determine the helicopter which has the best location within the swarm, we used the summation of distances for each helicopter from all others. Distance betweenI and J nodes is obtained by(3)DI,J=xI-xJ2+yI-yJ2+zI-zj2.Each helicopter in the swarm has (N
-
1) distances toward the others, which form the D
I distance set:(4)DI=DI1DI2DI3⋯DIN-1.Summation of these distances for each node is obtained by(5)SI=∑J=1N-1DIJ.ObtainingS
I
∀
J
∈
∅
I yields(6)Si=S1S2S3⋯SN,where S
i is distance values of all nodes in the swarm. The minimum value of the set S
i is the best location. Helicopter with less value is the nearest one to all others and will take a high location priority in SH election. This means that the selected helicopter is not usually located in the centre of swarm, but it is the closest one to all swarm members. As the election process depends on many factors such as ID, equipment, and velocity priorities, we define another notation which is the location priority deviation factor (P
L), where P
L is associated with other priority factors to calculate the EPF (P
i) of a helicopter. It is a value used to represent the location priority deviation of a helicopter from that of best location priority. The following equations are used to calculate (P
L):(7)Sμ=min⁡Si,⁡PL=SI-SμFor  node  with  minimumSI,PL=0.
P
L of all nodes can be represented by(8)PLI=PL1,PL2,PL3,…,PLN.Simply, it can be normalized by scaling between 0 and 1 using(9)NormlizedPL=PL-min⁡PLImax⁡PLI-min⁡PLI.Thirdly, to calculate the helicopter velocity priority, first simply calculate the mean velocityv
μ:(10)vμ=1N∑i=1NvI.The velocity priority factorP
v for each helicopter (I) can be calculated as follows:(11)Pv=1Nv-vμ2,PvI=Pv1Pv2Pv3⋯PvN.The set P
v
I represents the velocity priority factor of all helicopters. Node with the lowest P
v
I has the highest velocity priority. The normalized velocity priority factor for each node can be(12)NormlizedPv=Pv-min⁡PvImax⁡PvI-min⁡PvI.Finally, the EPF (P
i) is a function of the normalized version of P
E
,
P
L
,
P
v which are calculated in (2), (9), and (12), respectively. Every node calculates these values and then calculates the EPF (
P
i
) according to the following: (13)Pi=aPE+bPL+cPv,where a, b, and c are weighting values that satisfy a
+
b
+
c
=
1. The EPFs of all nodes are expressed by P
i
I:(14)PiI=Pi1Pi2Pi3⋯PiN(15)NormlizedPi=Pi-min⁡PiImax⁡PiI-min⁡PiI.(1) Each helicopter periodically sends aHELLO message (msg, hop_cnt) at the same time it forwards theHELLO messages of the other. Upon doing k hops the node will be capable of processing other nodes’ information, such as the basic specification and condition of the nodes, which include the ID number, the swarm election priority (P
i), location information, velocity (v), and hop count (m). Every node upon receiving the HELLO message from others stores the information of the other nodes and subsequently uses this information to determine the hop count (m) of each node and saves it for further usage. During the information collection process, the receiving node always determines the hop count of the other node, stores the original m, adds a number 1 to the count, and then forwards the information to the next node. Through this process, the next node will be able to determine the m hop of that node; also it ensures that the number of hops does not exceed M
m
a
x and the receiving node avoids the looping. After a number of transmissions, the nodes collect their neighbors’ information, including m hops.(2) After the collection of the information, each node (I) calculates their value P
i
(
I
) according to (13) and (15) and compares the result with P
i
(
J
) for all other nodes in the group Φ
I, if(16)PiI=min⁡PiI.The node with a lower P
i value has the highest priority. Thus it will upgrade itself as a SH. If two or more nodes share the least value of P
i, hence(17)PiI=PiJ=min⁡PiI⁡PEI<PEJ.Node with least P
E value is selected as a SH, if(18)PEI=PEJIDI<IDJ.Node with the least ID should be elected as the SH.(3) The helicopter, after upgrading itself as a SH, changes its state toS_head and broadcasts a message,HEAD (Swarm_ID, head_msg, route, hop_cnt), propagating swarm information, whereSwarm_ID is a swarm label,head_msg is the SH node information,route is the route information, andhop_cnt is the number of hops. In the initial transmission, the value ofroute is set to null andhop_cnt is set to zero. Other nodes within the swarm, upon receiving the HEAD message, store all values and judge the value ofhop_cnt. Ifhop_cnt is less than M
m
a
x, then they will add one to this value and then forward the information to the next hop. Ifhop_cnt is equal to M
m
a
x, then there is no need for further treatments. When other nodes receive the sameSwarm_ID, they investigate the m values and select the lowest one and then use this value to determine the value of theirhop_cnt return. When they receive a message from a differentSwarm_ID, they analyzehead_msg of the SHs and the information of the high-priority node is retained.(4) Nodes send apply messageAPPLY ((Swarm_ID), msg, route, hop_cnt) to the SH which has been selected according to steps (2) and (3). Other nodes on the route interrupt this message and update the route information by adding +1 to thehop_cnt and then forward the new route information to the SH. This way SH can determine the hop count of its member.(5) SH will add the node to its member list just after verifying that the number of nodes is less thanN
m
a
x. In this case, SH sends back anACCP message to the intended node but otherwise sends back aJOIN_GUEST message.(6) Intended node after receiving the ACCP message broadcastsMEMR (Swarm_ID, msg, route, dis_cnt, hop_cnt) message and then is not needed to be involved in other election processes. It will senddis_cnt to other SHs.(7) Repeat the process until all nodes become SH or swarm members.(8) Border swarm members search for the adjacent node of the other swarm using thehop_cnt andSwarm_ID information making a list of all neighbor nodes.(9) Each node broadcasts its neighbor table information periodically usingHELLO packets. Therefore, by examining the neighbor table from its neighbors, a node is able to gather complete information about the network topology that is at most two hops away from itself. This two-hop topology information is kept in a small database in each node.(10) Send aBUND (msg, route, dis_cnt, hop_cnt) messagehop_cnt message to its SH indicating that it became a boundary node.The SH and the neighbor’s SH can communicate directly if they are located in the same coverage, but in the actual situation of the physical structure of the network the SH and the neighbor SH are not necessarily within the same communication range. For that reason SH selects one of the boundary swarm members to act as a gateway between the neighbor SHs. Therefore, SH election process not only is the election of the SH but also includes the operation of determining boundary nodes, used for communication between adjacent swarms, as shown in Figure2.After finishing SH election, the movement of nodes could change swarm structure. Therefore, swarm structure continuously needs maintenance. SH periodically checks member list and neighbors swarm listing status. In case of adding a new member or one of the member lefts, swarm structure will not change; SH only updates the members list. Sometimes due to the movement, the total number of nodes in two or more neighbor’s swarms may detract fromN
m
a
x. In this case, the two swarms merge to form a new swarm. This situation leads to competition on SH using the same SH election process. Loser SH sends messages to inform its member about the new SH information. SH also updates the boundary nodes periodically. When a boundary node leaves the swarm, SH will select new border nodes. Nodes also periodically send message to ensure the presence of SH and update their information, particularly location and velocity. A new SH should be elected in case of loss or leaving of SH due to abnormal situation. Moreover, SH periodically calculates its P
i and sends it to all members; if one or more members find that their P
i value became less than that of the SH, they will notify the SH. SH immediately notifies its members about the new SH. Other members respond accordingly by updating their SH information. The objective is to maintain the stability of the swarm structure, avoid exchanging many messages, and reduce performing many calculations. Therefore, the structure of the swarm will not be changed unless for the above mentioned situation or in case of deterioration in the SH performance.


## 4.1. Swarm Formation

Helicopter/drone initiates the communication by broadcasting aHELLO message to discover the surrounding nodes. TheHELLO message contains the information of the helicopter. These pieces of information include the ID number, velocity, and location and direction in degree and communication equipment type. We define a transitional state calledS_UNDECIDED for smoother operation of swarm formation. “Undecided” means that a node is still in search for its hostswarm. Other nodes within the coverage region upon receiving the message will respond by sending aREPLY message. In case of the responding node already joining an existing swarm,REPLY message will include its ID number, velocity, location, direction, and the ID number of the swarm. If it is not a member of a swarm it will sendFREE message that includes its direction, ID number, velocity, and location. In case of the fact that the responding node is the SH of an existing swarm, it will send its information and the swarm information which include the amount of current nodes (N) in the swarm. If N
<
N
m
a
x, the SH will include an invitation message (INVITE) for theUndecided helicopter to join the swarm. The helicopter will directly become a swarm member and has all the information of the swarm and it can use the swarm facilities. It will change its state to “S_member.” The direction is one of the important factors that qualify any helicopter to join a certain swarm. The direction should be not more than θ degree of the SH direction.IfN
≥
N
m
a
x, SH will send to the new node a JOIN_GUEST message. TheJOIN_GUEST msg includes the information of the nearest neighbor node to the guest one. The SH finds the nearest nodes using the information of its swarm and the location of the guest node. The new node will form a temporary network with the nearest neighbor node. The nearest node will work temporarily as relay node to carry the information of the guest node through SH to the rest of the network. TheUndecided node will be treated asTail-Node (TN) of the nearest node as shown in Figure 2. This situation will continue until theUndecided helicopter joins a swarm. In case of the responding node of typeUndecided, the two nodes will store the information and directly start the SH election process according to the SH election procedure described in Section 4.2. After formation of the new swarm, the nearest node and its TN will act as relay between the two swarms. The swarm formation is not limited to the nodes that located within one MANET coverage; a set of nodes moving in the same direction can form a swarm using multihop operation until the number of nodes equals N
m
a
x.As a rule, SH and the neighbor SH can communicate directly if they are in the same ad hoc coverage. Nonetheless, in the actual situation of the physical structure of the network, SH1 and its neighbor SH2 may not necessarily to be within the same ad hoc communication range. Therefore, SH selects boundary members to act as a relay between the neighbor SHs and forward information. Therefore, swarm formation not only is the process of building the swarm structure and electing the SH, but also includes the operation of determining the boundary nodes used to communicate between the adjacent swarms as shown in Figure2.


## 4.2. Swarm Head Election

SH is responsible for route finding and organizing of interswarm communication. It is also responsible for finding the best route to distant destinations by exchanging its swarm information with other SHs. In many situations, SH participates in information forwarding process. Therefore, helicopter with best resources and facilities, located in a suitable location and having an average velocity among other nodes, is qualified to serve as a SH.The helicopters of any swarm need to select a SH. The selection of the SH depends on different factors, such as communication equipment, velocity, and location within the swarm. Helicopter with satellite link has the highest equipment priority. Helicopter located in the center of the swarm also has the highest location priority.In this paper for the purpose of SH election process, we make the following assumptions. The notationP
i is the SH election priority factor (EPF). Each helicopter node has an ID number which is unique and known to the whole network. Each helicopter is equipped with a GPS used to periodically collect location, velocity, and direction. The maximum speed for each swarm member is v
m
a
x. If the number of swarm members is too small, number of helicopter nodes that are able to act as a SH will increase and the network will become more isolated. If swarm members are too high the burden on the SH will increase. Consequently, the intraswarm communication cost increases, because the SH is responsible for communication between both its nodes and the neighbor SHs. Therefore, the swarm size needs certain constraints. In this paper, we define M
m
a
x to represent the maximum number of hops between the swarm members and the SH. We also define N
m
a
x as the maximum number of nodes in each swarm. Furthermore, if the movement direction of the SH is opposite or different to most of the nodes within the swarm, the node quickly leaves the range of swarm and joins other swarms, which increases the swarm maintenance burden. Therefore, movement direction of the nodes needs to be taken into account when selecting SH. In actual scenarios, it is very difficult to find two nodes moving exactly with the same orientation. To solve this problem, we used a threshold (θ) to determine whether the directions are approximately the same or not. Two helicopters will be considered as moving in the same direction if the angle between them does not exceed the maximum thresholds. In this paper, helicopters are moving to the same direction and the maximum threshold of difference between two helicopters is 15 degrees. Helicopters moving in the opposite direction combine another swarm. SHs moving in different directions are able to connect as long as they were in the communication range. When they are outside the ad hoc coverage, they can communicate using satellite communication or through other SH. In order to avoid frequent changes in swarm structure, the speed of the nodes also is one of the important considerations. A SH should be the node relatively near to the average rate of other nodes velocity. Based on the above assumptions, a node is elected as a SH according to its EPF value; the following expresses the mathematical calculation of the EPF (P
i).Assume thatI represents the intended helicopter node, J is another node in the same swarm, and each I node has N
-
1 neighbors, J
1
,
J
2
,
J
3
,
…
,
J
(
N
-
1
), with coordinates (x
J
1
,
y
J
1
)
,
x
J
2
,
y
J
2
,
…
,
(
x
J
N
-
1
,
y
J
N
-
1
). Φ
I is the group of nodes within the same swarm which are neighbors of node I. Intended helicopter coordinate is x
I
,
y
I. Helicopters velocities at instance election time are v
1
,
v
2
,
…
,
v
N. Helicopters are classified according to their communication equipment into S
1 and S
2 as mentioned above.Firstly, according to the equipment of the helicopter, the equipment priority valueP
E is as follows:(2)PE=0if  typeS11if  typeS2.Helicopter with P
E
=
0 has highest equipment priority.Secondly, to determine the helicopter which has the best location within the swarm, we used the summation of distances for each helicopter from all others. Distance betweenI and J nodes is obtained by(3)DI,J=xI-xJ2+yI-yJ2+zI-zj2.Each helicopter in the swarm has (N
-
1) distances toward the others, which form the D
I distance set:(4)DI=DI1DI2DI3⋯DIN-1.Summation of these distances for each node is obtained by(5)SI=∑J=1N-1DIJ.ObtainingS
I
∀
J
∈
∅
I yields(6)Si=S1S2S3⋯SN,where S
i is distance values of all nodes in the swarm. The minimum value of the set S
i is the best location. Helicopter with less value is the nearest one to all others and will take a high location priority in SH election. This means that the selected helicopter is not usually located in the centre of swarm, but it is the closest one to all swarm members. As the election process depends on many factors such as ID, equipment, and velocity priorities, we define another notation which is the location priority deviation factor (P
L), where P
L is associated with other priority factors to calculate the EPF (P
i) of a helicopter. It is a value used to represent the location priority deviation of a helicopter from that of best location priority. The following equations are used to calculate (P
L):(7)Sμ=min⁡Si,⁡PL=SI-SμFor  node  with  minimumSI,PL=0.
P
L of all nodes can be represented by(8)PLI=PL1,PL2,PL3,…,PLN.Simply, it can be normalized by scaling between 0 and 1 using(9)NormlizedPL=PL-min⁡PLImax⁡PLI-min⁡PLI.Thirdly, to calculate the helicopter velocity priority, first simply calculate the mean velocityv
μ:(10)vμ=1N∑i=1NvI.The velocity priority factorP
v for each helicopter (I) can be calculated as follows:(11)Pv=1Nv-vμ2,PvI=Pv1Pv2Pv3⋯PvN.The set P
v
I represents the velocity priority factor of all helicopters. Node with the lowest P
v
I has the highest velocity priority. The normalized velocity priority factor for each node can be(12)NormlizedPv=Pv-min⁡PvImax⁡PvI-min⁡PvI.Finally, the EPF (P
i) is a function of the normalized version of P
E
,
P
L
,
P
v which are calculated in (2), (9), and (12), respectively. Every node calculates these values and then calculates the EPF (
P
i
) according to the following: (13)Pi=aPE+bPL+cPv,where a, b, and c are weighting values that satisfy a
+
b
+
c
=
1. The EPFs of all nodes are expressed by P
i
I:(14)PiI=Pi1Pi2Pi3⋯PiN(15)NormlizedPi=Pi-min⁡PiImax⁡PiI-min⁡PiI.(1) Each helicopter periodically sends aHELLO message (msg, hop_cnt) at the same time it forwards theHELLO messages of the other. Upon doing k hops the node will be capable of processing other nodes’ information, such as the basic specification and condition of the nodes, which include the ID number, the swarm election priority (P
i), location information, velocity (v), and hop count (m). Every node upon receiving the HELLO message from others stores the information of the other nodes and subsequently uses this information to determine the hop count (m) of each node and saves it for further usage. During the information collection process, the receiving node always determines the hop count of the other node, stores the original m, adds a number 1 to the count, and then forwards the information to the next node. Through this process, the next node will be able to determine the m hop of that node; also it ensures that the number of hops does not exceed M
m
a
x and the receiving node avoids the looping. After a number of transmissions, the nodes collect their neighbors’ information, including m hops.(2) After the collection of the information, each node (I) calculates their value P
i
(
I
) according to (13) and (15) and compares the result with P
i
(
J
) for all other nodes in the group Φ
I, if(16)PiI=min⁡PiI.The node with a lower P
i value has the highest priority. Thus it will upgrade itself as a SH. If two or more nodes share the least value of P
i, hence(17)PiI=PiJ=min⁡PiI⁡PEI<PEJ.Node with least P
E value is selected as a SH, if(18)PEI=PEJIDI<IDJ.Node with the least ID should be elected as the SH.(3) The helicopter, after upgrading itself as a SH, changes its state toS_head and broadcasts a message,HEAD (Swarm_ID, head_msg, route, hop_cnt), propagating swarm information, whereSwarm_ID is a swarm label,head_msg is the SH node information,route is the route information, andhop_cnt is the number of hops. In the initial transmission, the value ofroute is set to null andhop_cnt is set to zero. Other nodes within the swarm, upon receiving the HEAD message, store all values and judge the value ofhop_cnt. Ifhop_cnt is less than M
m
a
x, then they will add one to this value and then forward the information to the next hop. Ifhop_cnt is equal to M
m
a
x, then there is no need for further treatments. When other nodes receive the sameSwarm_ID, they investigate the m values and select the lowest one and then use this value to determine the value of theirhop_cnt return. When they receive a message from a differentSwarm_ID, they analyzehead_msg of the SHs and the information of the high-priority node is retained.(4) Nodes send apply messageAPPLY ((Swarm_ID), msg, route, hop_cnt) to the SH which has been selected according to steps (2) and (3). Other nodes on the route interrupt this message and update the route information by adding +1 to thehop_cnt and then forward the new route information to the SH. This way SH can determine the hop count of its member.(5) SH will add the node to its member list just after verifying that the number of nodes is less thanN
m
a
x. In this case, SH sends back anACCP message to the intended node but otherwise sends back aJOIN_GUEST message.(6) Intended node after receiving the ACCP message broadcastsMEMR (Swarm_ID, msg, route, dis_cnt, hop_cnt) message and then is not needed to be involved in other election processes. It will senddis_cnt to other SHs.(7) Repeat the process until all nodes become SH or swarm members.(8) Border swarm members search for the adjacent node of the other swarm using thehop_cnt andSwarm_ID information making a list of all neighbor nodes.(9) Each node broadcasts its neighbor table information periodically usingHELLO packets. Therefore, by examining the neighbor table from its neighbors, a node is able to gather complete information about the network topology that is at most two hops away from itself. This two-hop topology information is kept in a small database in each node.(10) Send aBUND (msg, route, dis_cnt, hop_cnt) messagehop_cnt message to its SH indicating that it became a boundary node.The SH and the neighbor’s SH can communicate directly if they are located in the same coverage, but in the actual situation of the physical structure of the network the SH and the neighbor SH are not necessarily within the same communication range. For that reason SH selects one of the boundary swarm members to act as a gateway between the neighbor SHs. Therefore, SH election process not only is the election of the SH but also includes the operation of determining boundary nodes, used for communication between adjacent swarms, as shown in Figure2.After finishing SH election, the movement of nodes could change swarm structure. Therefore, swarm structure continuously needs maintenance. SH periodically checks member list and neighbors swarm listing status. In case of adding a new member or one of the member lefts, swarm structure will not change; SH only updates the members list. Sometimes due to the movement, the total number of nodes in two or more neighbor’s swarms may detract fromN
m
a
x. In this case, the two swarms merge to form a new swarm. This situation leads to competition on SH using the same SH election process. Loser SH sends messages to inform its member about the new SH information. SH also updates the boundary nodes periodically. When a boundary node leaves the swarm, SH will select new border nodes. Nodes also periodically send message to ensure the presence of SH and update their information, particularly location and velocity. A new SH should be elected in case of loss or leaving of SH due to abnormal situation. Moreover, SH periodically calculates its P
i and sends it to all members; if one or more members find that their P
i value became less than that of the SH, they will notify the SH. SH immediately notifies its members about the new SH. Other members respond accordingly by updating their SH information. The objective is to maintain the stability of the swarm structure, avoid exchanging many messages, and reduce performing many calculations. Therefore, the structure of the swarm will not be changed unless for the above mentioned situation or in case of deterioration in the SH performance.


## 5. Information Routing

Due to node mobility, a major challenge is how to route data packets over such network that changes its structure dynamically, especially when the source and the destination helicopters are out of MANET transmission range. Most of the MANET routing algorithms are not ideal for AVANETs, because of the helicopter specific issues such as rapid changes in the link quality and very high node mobility. Maintaining a routing table, as in proactive methods, also is not an optimal solution. However, repetitive path finding before each packet delivery, as in reactive routing, can also be exhaustive. Therefore, specific routing solutions are needed. A routing strategy only based on the location information of the nodes can satisfy the requirements of helicopter networks. Although some VANET routing protocols can work in these types of networks, majority of these protocols mainly rely on road side units (RSU) [29], road intersections [30], and other assumptions which may not be available in helicopters networks [31]. In this paper, we propose a simple routing algorithm which fits the special requirements of helicopter networks.


### 5.1. Route Finding

As a rule, helicopters located in the same swarm and satisfying (1) can directly use ad hoc networks to communicate with each other. In order to establish a communication between two nodes beyond the ad hoc coverage (L), source node issues a communication request to SH. SH after receipt of request verifies whether the node is one of the swarm members. After verification SH finds from its storage the location and other information of the destination node and then starts the process of best route selection, which is subject to destination and source locations. SH is not only responsible of the route selection process; in many situations SH can participate in information forwarding process.In case of the fact that the intended node is one of the swarm members, SH searches the best route according to the following. The presence of multiple nodes between source and destination helicopters may lead to many paths (P). Each path has its own amount of hops M
P. d
m is the distance of a specific hop m, and d
m satisfies (1), where M
P
≤
M
m
a
x. Therefore, the general formula for short path selection is(19)Ps=min⁡∑m=1M1dm,∑m=1M2dm,∑m=1M3dm,…,∑m=1MPdm.For simplicity, assume that we have five nodes SH,I, K, J, and D, as shown in Figure 3. Assume that their locations coordinates are x
S
H
,
y
S
H
,
z
S
H, x
I
,
y
I
,
z
I, x
k
,
y
K
,
z
K, x
J
,
y
J
,
z
J, and x
d
,
y
d
,
z
d, respectively, where I is the source node, D is the destination node, and J, k are nodes in the same coverage (L) of SH. J and K act as a next hop. Distance (K
,
S
H), (I
,
S
H), (K
,
I), and (K
,
D) satisfy (1). SH finds the information of these nodes and starts calculating the distance according to the following:(20)A=xI-xSH2+yI-ySH2+zI+zSH2,B=xSH-xD2+ySH-yD2+zSH-zD2,C=xI-xK2+yI-yK2+zI-zK2,E=xK-xD2+yK-yD2+zK-zD2,F=xI-xJ2+yI-yJ2+zI-zJ2,H=xJ-xD2+yJ-yD2+zJ-zD2,where A, B, C, E, F, and H are the distances between nodes as shown in Figure 3. Shorter path (
P
s
) to the destination node is (21)Ps=min⁡A+B,C+E,F+H.Figure 3
Information routing inside swarm.In case of the fact that the SH does not find the destination information on its storage, it requests the closest SHs for the destination information and waits for their responses. If the waiting time exceeds a threshold (t
r) and the route response has not yet been received, thenRREQ is resent. If retransmission exceeds the maximum retransmission limit (r
m
a
x), the route search process is terminated. To reduce network congestion, not all neighbor SHs receivingRREQ will respond. Only those located on the route toward the destination and having the ability to serve can participate in the routing process.Therefore, neighbor SHs after having receivedRREQ message firstly determine if they are located on the route of the SH request; if not, the request is discarded. Otherwise the procedure is as follows:(1)
A neighbor SH checks the request; if it is the first time received, then it continues the procedure; if not then the request is discarded.
(2)
It checks whether the destination is in the same swarm. If not, then it applies step (4).
(3)
It forwards route request to the intended destination and waits for the routing response RREP; it also goes to (5).
(4)
SH adds its own msg to (REEQ msg) message and then forwards the updated message to the SHs of the next hope neighbours and waits for the route response.
(5)
If the waiting time exceedst
r and it does not receive the route response, then it retransmits request and adds one to request number; otherwise it goes to (7).
(6)
If the number of retransmissions exceeds the limitr
m
a
x, then it ends route request process. Alternatively, in accordance to intended destination situation it directly applies step (3) or (4).
(7)
If the SH received more than one route response, then it chooses the node with fewest number of hops and minimum distance to destination and adds its msg to (REEP msg) message. Then, it forwards the message to the previous hop SH. If the routing request failed, probably because the destination swarm is far away from the source and the routing and communication request cannot be established through ad hoc or through neighbours’ SHs, the SH can establish a connection via satellite or other direct links.
(8)
In some rare situations and according to SH election process, SH may not have a satellite equipment to communicate with the far away swarm’s heads; in this case the SH finds one of its swarm members which are equipped with satellite, to forward request to neighbors SH.
(9)
If still not able to establish connection and routing through satellite of the members, it forwards request to neighbors SH and it sends notificationWAIT indicating that the communication needs to be completed through satellite link of neighbors SH.Nodes usually prefer the use of ad hoc connections, but if the destination is out of the coverage, a node needs to communicate with operation center or public networks. In these cases, the source SH firstly searches its members to find a member that is equipped with an appropriate communication link to the intended network. If all swarm members are not equipped with suitable equipment, then SH forwards the request to the neighbor SH that is equipped with the appropriate communication equipment. Only helicopters typeS
1 can communicate with the outside networks. Upon receiving a communication request to outside networks, neighbor SH will proceed as follows:(1)
It check the request. If it is the first time received, it continues the procedure; if not, then it is discarded.
(2)
It checks whether its equipment is of typeS
2; then it will skip to step (4).
(3)
It checks whether this swarm has a free availableS
1 and then forwards the routing request, waits for response, and then skips to step (5).
(4)
It forwards the routing request to the neighboring SH and waits for a response.
(5)
If the waiting time exceedst
r and it does not receive the route response, then it will retransmit the request and add 1 to the request number; otherwise it will skip to step (7).
(6)
If the number of retransmissions exceeds the limitr
m
a
x, then it will end the route request process.
(7)
If the SH receives more than one route response, then it chooses the helicopter with fewest numbers of routing hops and the minimum distance and cost to the destination. The route through this node will be marked as the primary route. At the same time, it stores other routes as a backup (Store Route as Backup (SRB)) to be used in the future if needed. To ovoid looping multiple links to the same destination cannot be used at the same time. Any redundant link that is not as preferred is blocked until the primary link goes down.
(8)
It adds its own msg to (REEP msg) message and forwards the message to the previous hop SH in the source direction. If the routing process fails to find a helicopter typeS
1, it will send a REER notification to the source helicopter indicating a routing failure.


### 5.2. Route Maintenance (RM)

According to nodes’ movement the established route may be lost. This time, the communication will temporarily be disconnected. At the same time, the node stores the destination routing information for a while and tries to resend the request. If it is successful in sending a new route request to the intended destination, that means that the route has been recovered; if not, then it will search its backup routing information and try to use one of the best backup routes. If it fails to send the message it will start a new route finding procedure. The route maintenance also can be accomplished by using the knowledge of the nodes about their neighbor status. A forwarding node can aid in the route maintenance process by repairing a broken route using its 2-hop-topology information and modifies the source route header accordingly. The destination node sends a gratuitous route reply to inform source of the new working route.


## 5.1. Route Finding

As a rule, helicopters located in the same swarm and satisfying (1) can directly use ad hoc networks to communicate with each other. In order to establish a communication between two nodes beyond the ad hoc coverage (L), source node issues a communication request to SH. SH after receipt of request verifies whether the node is one of the swarm members. After verification SH finds from its storage the location and other information of the destination node and then starts the process of best route selection, which is subject to destination and source locations. SH is not only responsible of the route selection process; in many situations SH can participate in information forwarding process.In case of the fact that the intended node is one of the swarm members, SH searches the best route according to the following. The presence of multiple nodes between source and destination helicopters may lead to many paths (P). Each path has its own amount of hops M
P. d
m is the distance of a specific hop m, and d
m satisfies (1), where M
P
≤
M
m
a
x. Therefore, the general formula for short path selection is(19)Ps=min⁡∑m=1M1dm,∑m=1M2dm,∑m=1M3dm,…,∑m=1MPdm.For simplicity, assume that we have five nodes SH,I, K, J, and D, as shown in Figure 3. Assume that their locations coordinates are x
S
H
,
y
S
H
,
z
S
H, x
I
,
y
I
,
z
I, x
k
,
y
K
,
z
K, x
J
,
y
J
,
z
J, and x
d
,
y
d
,
z
d, respectively, where I is the source node, D is the destination node, and J, k are nodes in the same coverage (L) of SH. J and K act as a next hop. Distance (K
,
S
H), (I
,
S
H), (K
,
I), and (K
,
D) satisfy (1). SH finds the information of these nodes and starts calculating the distance according to the following:(20)A=xI-xSH2+yI-ySH2+zI+zSH2,B=xSH-xD2+ySH-yD2+zSH-zD2,C=xI-xK2+yI-yK2+zI-zK2,E=xK-xD2+yK-yD2+zK-zD2,F=xI-xJ2+yI-yJ2+zI-zJ2,H=xJ-xD2+yJ-yD2+zJ-zD2,where A, B, C, E, F, and H are the distances between nodes as shown in Figure 3. Shorter path (
P
s
) to the destination node is (21)Ps=min⁡A+B,C+E,F+H.Figure 3
Information routing inside swarm.In case of the fact that the SH does not find the destination information on its storage, it requests the closest SHs for the destination information and waits for their responses. If the waiting time exceeds a threshold (t
r) and the route response has not yet been received, thenRREQ is resent. If retransmission exceeds the maximum retransmission limit (r
m
a
x), the route search process is terminated. To reduce network congestion, not all neighbor SHs receivingRREQ will respond. Only those located on the route toward the destination and having the ability to serve can participate in the routing process.Therefore, neighbor SHs after having receivedRREQ message firstly determine if they are located on the route of the SH request; if not, the request is discarded. Otherwise the procedure is as follows:(1)
A neighbor SH checks the request; if it is the first time received, then it continues the procedure; if not then the request is discarded.
(2)
It checks whether the destination is in the same swarm. If not, then it applies step (4).
(3)
It forwards route request to the intended destination and waits for the routing response RREP; it also goes to (5).
(4)
SH adds its own msg to (REEQ msg) message and then forwards the updated message to the SHs of the next hope neighbours and waits for the route response.
(5)
If the waiting time exceedst
r and it does not receive the route response, then it retransmits request and adds one to request number; otherwise it goes to (7).
(6)
If the number of retransmissions exceeds the limitr
m
a
x, then it ends route request process. Alternatively, in accordance to intended destination situation it directly applies step (3) or (4).
(7)
If the SH received more than one route response, then it chooses the node with fewest number of hops and minimum distance to destination and adds its msg to (REEP msg) message. Then, it forwards the message to the previous hop SH. If the routing request failed, probably because the destination swarm is far away from the source and the routing and communication request cannot be established through ad hoc or through neighbours’ SHs, the SH can establish a connection via satellite or other direct links.
(8)
In some rare situations and according to SH election process, SH may not have a satellite equipment to communicate with the far away swarm’s heads; in this case the SH finds one of its swarm members which are equipped with satellite, to forward request to neighbors SH.
(9)
If still not able to establish connection and routing through satellite of the members, it forwards request to neighbors SH and it sends notificationWAIT indicating that the communication needs to be completed through satellite link of neighbors SH.Nodes usually prefer the use of ad hoc connections, but if the destination is out of the coverage, a node needs to communicate with operation center or public networks. In these cases, the source SH firstly searches its members to find a member that is equipped with an appropriate communication link to the intended network. If all swarm members are not equipped with suitable equipment, then SH forwards the request to the neighbor SH that is equipped with the appropriate communication equipment. Only helicopters typeS
1 can communicate with the outside networks. Upon receiving a communication request to outside networks, neighbor SH will proceed as follows:(1)
It check the request. If it is the first time received, it continues the procedure; if not, then it is discarded.
(2)
It checks whether its equipment is of typeS
2; then it will skip to step (4).
(3)
It checks whether this swarm has a free availableS
1 and then forwards the routing request, waits for response, and then skips to step (5).
(4)
It forwards the routing request to the neighboring SH and waits for a response.
(5)
If the waiting time exceedst
r and it does not receive the route response, then it will retransmit the request and add 1 to the request number; otherwise it will skip to step (7).
(6)
If the number of retransmissions exceeds the limitr
m
a
x, then it will end the route request process.
(7)
If the SH receives more than one route response, then it chooses the helicopter with fewest numbers of routing hops and the minimum distance and cost to the destination. The route through this node will be marked as the primary route. At the same time, it stores other routes as a backup (Store Route as Backup (SRB)) to be used in the future if needed. To ovoid looping multiple links to the same destination cannot be used at the same time. Any redundant link that is not as preferred is blocked until the primary link goes down.
(8)
It adds its own msg to (REEP msg) message and forwards the message to the previous hop SH in the source direction. If the routing process fails to find a helicopter typeS
1, it will send a REER notification to the source helicopter indicating a routing failure.


## 5.2. Route Maintenance (RM)

According to nodes’ movement the established route may be lost. This time, the communication will temporarily be disconnected. At the same time, the node stores the destination routing information for a while and tries to resend the request. If it is successful in sending a new route request to the intended destination, that means that the route has been recovered; if not, then it will search its backup routing information and try to use one of the best backup routes. If it fails to send the message it will start a new route finding procedure. The route maintenance also can be accomplished by using the knowledge of the nodes about their neighbor status. A forwarding node can aid in the route maintenance process by repairing a broken route using its 2-hop-topology information and modifies the source route header accordingly. The destination node sends a gratuitous route reply to inform source of the new working route.


## 6. Simulation and Results

### 6.1. Simulation Configurations and Settings

To evaluate the proposed work, we conducted two different types of simulations. Firstly, we evaluate the SH election approach using a Matlab program. Secondly, to evaluate the performance of the proposed routing protocol, we used the well-known simulation program OPNET [15, 32, 33], which is a discrete event network simulator that includes a rich set of detailed models for ad hoc networks. As this work does not consider the physical and data link layer the simulation program is built on the specification of IEEE 802.11p standard. The main parameters of the simulations are summarized in Table 1.Table 1
Simulation settings and configurations.
Parameters
Values
Packet size
1024
Channel sensing
0.1
Reception power thresholds
0.5 W
Traffic type
Poison
Simulation time
1200 s
Coverage area
5000 × 5000 (m)
L
1000 m
M
m
a
x
5 hop
N
15 node
Simulation period
20 minutesIn the first simulation, we implemented a simulation program to demonstrate the velocity, equipment, location, and movement direction of the helicopters. The purpose of the program is to show the SH election process according to the proposed election approach. In this simulation, we assume a number of helicopters in one swarm moving toward the same direction with different velocities, location, and equipment values. We assume that the velocity and location of all helicopters are randomly distributed and the starting point is randomly selected. In addition, we supposed that the number of helicopters of typesS
1 and S
2 is 20% and 80%, respectively. The simulation is executed several times using different number of helicopter nodes to calculate the different value of priority factors. The priority factors versus the ID numbers of helicopters are plotted in different situations.In the second simulation, we used OPNET to compare the performance of the proposed routing algorithm with both CBRP [22] and Dynamic Source Routing (DSR) [25] protocols. As the proposed routing protocol has both the on-demand and clustering characteristics, we select these protocols for compression because of the on-demand properties of DSR and the clustering characteristics of CBRP. These protocols also demonstrated acceptable performance in vehicular networks. All protocols are operated at 12 Mbps data rate. The power transmit level of 1 mw was used for all scenarios. The nodes are moving in the simulation area according to two scenarios. In the first one, helicopters are moving according to a random waypoint model. Each node chooses a random location destination and moves toward it at a speed randomly distributed between 0 and 500 km/h. In the second scenario a group of helicopters are moving in regular swarm with a constant speed 200 Km/h. The regular swarm is constructed by following three rules, which are move in the same direction as your neighbors, remain close to your neighbors, and avoid collisions with your neighbors. All helicopter nodes in the network are configured to run the proposed routing algorithm during the first round. Then they used DSR and CBRP during the second and third rounds, respectively. In case of CBRP, we treated the helicopter swarm as a cluster and helicopter with the least ID number as a cluster head. Since the elected SH plays a major role during the routing process, we used it during the evaluation of the proposed routing algorithm. The performance of the proposed algorithm is evaluated against DSR and CBRP in terms of swarm structure reconstructions, Packet Delivery Ratio (PDR), average end-to-end delay (AD), and routing cost.


### 6.2. Results and Analysis

Simulation results are shown in Figures4–9. The graphs show the election procedure result and the comparison between the three mentioned protocols using different parameter values. Figure 4 shows the priority factors (location, velocity priority equipment, and EPF) of helicopter nodes. From Figure 4, node ID number nine is elected as a SH according to EPF. Obviously, in case of using only velocity to elect the SH, as many other routing protocols do [34], node ID number two will be elected as SH though it is type S
2. Likewise, in case of using the location to elect the SH, there are three nodes (4, 7, and 9) with the same location priority; therefore, it will be difficult to elect SH among them. In order to achieve a better utilization of all nodes and optimum selection the use of EPF will solve the problem by using a weighted mechanism. This problem has not been addressed by other existing protocols that used location or velocity to elect the SH.Figure 4
SH election priority. Node with the least EPF (P
i) is elected as a SH (ID = 9).Figure 5
The effect of SH election process in swarm stability.Figure 6
Swarm structure stability over time for the proposed, CBRP, and DSR protocols.Figure 7
The PDR of the DSR, CBRP, and proposed algorithms.Figure 8
The proposed algorithm, CBRP, and DSR number of sent packets versus end-to-end delay for 15 helicopters.Figure 9
Proposed algorithm, CBRP, and DSR routing cost versus number of helicopters.Furthermore, to demonstrate that the proper election of the SH has a great effect on the stability of the network, we run the simulation using the proposed routing algorithm with SH elected using one priority factor (velocity, location, equipment, or EPF), and then we monitor the swarm structure every 100 s. The accumulated number of the swarm reconstruction is plotted in Figure5. It is realized that, using SH which is elected according to P
E, the network structure is better than when using velocity or location to elect SH. However, sometimes the variation in the velocity of the well-equipped nodes affects its performance and consequently affects the network structure. The effect of P
L and P
v seems to be convergent because the velocity affects the location of the nodes. When EPF is used, the swarm structure is more stable, because the selection process considers all factors.We also investigate the swarm reconstruction using the CBRP, DSR, and the proposed algorithm. As shown in Figure6, the swarm structure stability of both CBRP and DSR is poor. This is because CBRP algorithm uses only the IDs of the nodes as a basis for SH election. The smallest ID is elected as a SH. A swarm structure may change rapidly in case of the fact that the elected node moves with high velocity. On the other hand, using DSR, a separate periodic algorithm must be implemented, to support propagating the SH advertisements across the swarm. The response of the algorithm may affect the network structure. In contrast, the proposed election process takes into consideration the movement, location, and equipment of neighbouring helicopters, to reduce the probability of swarm change over time, so as to maintain higher stability.It is observed from Figure7 that the PDR of the proposed algorithm remains high when the number of nodes is increasing. The increase of the number of nodes does not affect the PDR because of the high efficiency and swarm structure stability. PDR of CBRP and DSR is less than that obtained by the proposed algorithm, because the source node and the intermediate nodes store the next hop information corresponding to each flow for data packet transmission. DSR and CBRP use a source routing in which a data packet carries the complete path to be traversed. The PDR is too low in the beginning of the curve due to the random initiation of the simulation program.Concerning Figure8, we observed that the average end-to-end delay of the proposed algorithm is the best among others. The proposed algorithm end-to-end delay is smaller than the others because the route search is done only once and remains stable until the swarm structure changes. This decreases the time needed for the whole process of packet delivery and reduces the number of routing messages. Other protocols have a longer delay because the route finding process takes more time as every intermediate node tries to extract information before forwarding the reply while the protocol tries to search for a new route. The proposed algorithm also outperforms others because of the built-in RM and SRB characteristics. While using other protocols, the routing mechanism searches for a new route at every request and when a route failure occurs. The packet delivery delay time is affected by both the route search algorithm and the packet delivery process itself.According to Figure9, it is observed that the routing cost of the proposed algorithm, CBRP and DSR, increases with respect to the increase of the number of nodes. This is because the increase in nodes quantity increases the amount of hops, thereby increasing the congestion in the routing process. The initiation of the route finding process of the proposed algorithm takes more time. However, this calculation is done once and remains steady until the swarm structure changes. Hopefully, the increase of swarm members will increase the opportunity of more backup route in the proposed algorithm that enhances the route maintenance process. Moreover, the number of nodes per swarm and the number of hops in the proposed algorithm are limited by N
m
a
x and M
m
a
x, respectively. The amount of N
m
a
x and M
m
a
x is specified according to certain threshold of the routing cost.The problem of other routing protocols is that the increase of intermediate nodes can lead to inconsistent routes when the source sequence number is very old and the intermediate nodes have a higher but not the latest destination sequence number, thereby having no existing or stale entries. CBRP and DSR have a higher routing cost, because they use a flooding approach to all nodes to determine the destination route, while in the proposed routing algorithm only SHs in the requested swarm that have the capability of finding the destination are able to participate in the routing process.


## 6.1. Simulation Configurations and Settings

To evaluate the proposed work, we conducted two different types of simulations. Firstly, we evaluate the SH election approach using a Matlab program. Secondly, to evaluate the performance of the proposed routing protocol, we used the well-known simulation program OPNET [15, 32, 33], which is a discrete event network simulator that includes a rich set of detailed models for ad hoc networks. As this work does not consider the physical and data link layer the simulation program is built on the specification of IEEE 802.11p standard. The main parameters of the simulations are summarized in Table 1.Table 1
Simulation settings and configurations.
Parameters
Values
Packet size
1024
Channel sensing
0.1
Reception power thresholds
0.5 W
Traffic type
Poison
Simulation time
1200 s
Coverage area
5000 × 5000 (m)
L
1000 m
M
m
a
x
5 hop
N
15 node
Simulation period
20 minutesIn the first simulation, we implemented a simulation program to demonstrate the velocity, equipment, location, and movement direction of the helicopters. The purpose of the program is to show the SH election process according to the proposed election approach. In this simulation, we assume a number of helicopters in one swarm moving toward the same direction with different velocities, location, and equipment values. We assume that the velocity and location of all helicopters are randomly distributed and the starting point is randomly selected. In addition, we supposed that the number of helicopters of typesS
1 and S
2 is 20% and 80%, respectively. The simulation is executed several times using different number of helicopter nodes to calculate the different value of priority factors. The priority factors versus the ID numbers of helicopters are plotted in different situations.In the second simulation, we used OPNET to compare the performance of the proposed routing algorithm with both CBRP [22] and Dynamic Source Routing (DSR) [25] protocols. As the proposed routing protocol has both the on-demand and clustering characteristics, we select these protocols for compression because of the on-demand properties of DSR and the clustering characteristics of CBRP. These protocols also demonstrated acceptable performance in vehicular networks. All protocols are operated at 12 Mbps data rate. The power transmit level of 1 mw was used for all scenarios. The nodes are moving in the simulation area according to two scenarios. In the first one, helicopters are moving according to a random waypoint model. Each node chooses a random location destination and moves toward it at a speed randomly distributed between 0 and 500 km/h. In the second scenario a group of helicopters are moving in regular swarm with a constant speed 200 Km/h. The regular swarm is constructed by following three rules, which are move in the same direction as your neighbors, remain close to your neighbors, and avoid collisions with your neighbors. All helicopter nodes in the network are configured to run the proposed routing algorithm during the first round. Then they used DSR and CBRP during the second and third rounds, respectively. In case of CBRP, we treated the helicopter swarm as a cluster and helicopter with the least ID number as a cluster head. Since the elected SH plays a major role during the routing process, we used it during the evaluation of the proposed routing algorithm. The performance of the proposed algorithm is evaluated against DSR and CBRP in terms of swarm structure reconstructions, Packet Delivery Ratio (PDR), average end-to-end delay (AD), and routing cost.


## 6.2. Results and Analysis

Simulation results are shown in Figures4–9. The graphs show the election procedure result and the comparison between the three mentioned protocols using different parameter values. Figure 4 shows the priority factors (location, velocity priority equipment, and EPF) of helicopter nodes. From Figure 4, node ID number nine is elected as a SH according to EPF. Obviously, in case of using only velocity to elect the SH, as many other routing protocols do [34], node ID number two will be elected as SH though it is type S
2. Likewise, in case of using the location to elect the SH, there are three nodes (4, 7, and 9) with the same location priority; therefore, it will be difficult to elect SH among them. In order to achieve a better utilization of all nodes and optimum selection the use of EPF will solve the problem by using a weighted mechanism. This problem has not been addressed by other existing protocols that used location or velocity to elect the SH.Figure 4
SH election priority. Node with the least EPF (P
i) is elected as a SH (ID = 9).Figure 5
The effect of SH election process in swarm stability.Figure 6
Swarm structure stability over time for the proposed, CBRP, and DSR protocols.Figure 7
The PDR of the DSR, CBRP, and proposed algorithms.Figure 8
The proposed algorithm, CBRP, and DSR number of sent packets versus end-to-end delay for 15 helicopters.Figure 9
Proposed algorithm, CBRP, and DSR routing cost versus number of helicopters.Furthermore, to demonstrate that the proper election of the SH has a great effect on the stability of the network, we run the simulation using the proposed routing algorithm with SH elected using one priority factor (velocity, location, equipment, or EPF), and then we monitor the swarm structure every 100 s. The accumulated number of the swarm reconstruction is plotted in Figure5. It is realized that, using SH which is elected according to P
E, the network structure is better than when using velocity or location to elect SH. However, sometimes the variation in the velocity of the well-equipped nodes affects its performance and consequently affects the network structure. The effect of P
L and P
v seems to be convergent because the velocity affects the location of the nodes. When EPF is used, the swarm structure is more stable, because the selection process considers all factors.We also investigate the swarm reconstruction using the CBRP, DSR, and the proposed algorithm. As shown in Figure6, the swarm structure stability of both CBRP and DSR is poor. This is because CBRP algorithm uses only the IDs of the nodes as a basis for SH election. The smallest ID is elected as a SH. A swarm structure may change rapidly in case of the fact that the elected node moves with high velocity. On the other hand, using DSR, a separate periodic algorithm must be implemented, to support propagating the SH advertisements across the swarm. The response of the algorithm may affect the network structure. In contrast, the proposed election process takes into consideration the movement, location, and equipment of neighbouring helicopters, to reduce the probability of swarm change over time, so as to maintain higher stability.It is observed from Figure7 that the PDR of the proposed algorithm remains high when the number of nodes is increasing. The increase of the number of nodes does not affect the PDR because of the high efficiency and swarm structure stability. PDR of CBRP and DSR is less than that obtained by the proposed algorithm, because the source node and the intermediate nodes store the next hop information corresponding to each flow for data packet transmission. DSR and CBRP use a source routing in which a data packet carries the complete path to be traversed. The PDR is too low in the beginning of the curve due to the random initiation of the simulation program.Concerning Figure8, we observed that the average end-to-end delay of the proposed algorithm is the best among others. The proposed algorithm end-to-end delay is smaller than the others because the route search is done only once and remains stable until the swarm structure changes. This decreases the time needed for the whole process of packet delivery and reduces the number of routing messages. Other protocols have a longer delay because the route finding process takes more time as every intermediate node tries to extract information before forwarding the reply while the protocol tries to search for a new route. The proposed algorithm also outperforms others because of the built-in RM and SRB characteristics. While using other protocols, the routing mechanism searches for a new route at every request and when a route failure occurs. The packet delivery delay time is affected by both the route search algorithm and the packet delivery process itself.According to Figure9, it is observed that the routing cost of the proposed algorithm, CBRP and DSR, increases with respect to the increase of the number of nodes. This is because the increase in nodes quantity increases the amount of hops, thereby increasing the congestion in the routing process. The initiation of the route finding process of the proposed algorithm takes more time. However, this calculation is done once and remains steady until the swarm structure changes. Hopefully, the increase of swarm members will increase the opportunity of more backup route in the proposed algorithm that enhances the route maintenance process. Moreover, the number of nodes per swarm and the number of hops in the proposed algorithm are limited by N
m
a
x and M
m
a
x, respectively. The amount of N
m
a
x and M
m
a
x is specified according to certain threshold of the routing cost.The problem of other routing protocols is that the increase of intermediate nodes can lead to inconsistent routes when the source sequence number is very old and the intermediate nodes have a higher but not the latest destination sequence number, thereby having no existing or stale entries. CBRP and DSR have a higher routing cost, because they use a flooding approach to all nodes to determine the destination route, while in the proposed routing algorithm only SHs in the requested swarm that have the capability of finding the destination are able to participate in the routing process.


## 7. Conclusions

This paper studied the possibility of using MANET as a platform for data communication between helicopters working in certain mission and special scenarios. A simple model for the network structure is proposed and intensively explained. A simple routing protocol is also presented and comprehensively evaluated using simulation. Theoretical approach for selecting the SH is proposed and extensively discussed. The investigation results show that ad hoc network can be involved in providing communication between helicopters with high degree of reliability and minimum expense. Our comprehensive simulation results show that the proposed SH election approach can assist in obtaining best results of SH selection, so as to maintain high network stability. The proper selection has great impact in the structure stability of the swarm and consequently affects the whole performance of the network. Simulation results also show that the proposed routing algorithm can be used in these types of networks with high delivery rate and less amount of delay and routing overhead. Generally this work sets the path for many researches that are related to utilization of MANET in helicopter networks. Many researches related to the PHY, data link, routing, and application of AVANET are desired. Although the general aspects are considered in this paper, there is still a lot of work and further detailed research can be conducted in more depth. Future researches can focus on studying the capability of using bidirectional routing and enhancing the SH election process by adding more priority factors such as signal strength and the movement stability of nodes as well as considering security issues. Many researches and efforts can focus on improving the physical link performance in order to increase the coverage range of a single hop. Future work can also consider obtaining actual results by implementing a kind of real practical deployment.



---

*Source: 2132941-2016-03-08.xml*