scholarly journals Algorithms for analysis of stability and dynamic characteristics of signal generators at the physical level in FANET networks

2020 ◽  
Vol 309 ◽  
pp. 03019
Author(s):  
Gleb S. Vasilyev ◽  
Oleg R. Kuzichkin ◽  
Dmitriy I. Surzhik ◽  
Igor A. Kurilov
Keyword(s):  
Dynamic Characteristics ◽  
Ad Hoc ◽  
Nyquist Criterion ◽  
Network Equipment ◽  
Physical Level ◽  
Analysis Of Stability ◽  
Nonlinear High Order ◽  
Hoc Networks ◽  
The Stability ◽  
Piecewise Functions

To ensure the reliability of the physical level of Flying Ad Hoc Networks (FANET), the article substantiates the relevance of the study of stability and dynamic processes of signal formation and processing paths in the terminal and intermediate network equipment. The limitations of the known methods of the theory of automatic control, which make it difficult to perform the analysis of essentially nonlinear high-order signal generators, are shown. To analyze the stability of such formations proposed algorithm based on the use of the Nyquist criterion and approximation of the characteristic polynomial of a device by continuous piecewise functions; to analyze the dynamic characteristics of the algorithm based on spectral method of the input signal approximation and the frequency characteristics of a device by continuous piecewise functions.

scholarly journals Hierarchical model of information signals formation at the physical layer in FANET

2020 ◽  
Vol 11 (30) ◽  
pp. 178-188
Author(s):  
G. S. Vasilyev ◽  
O. R. Kuzichkin ◽  
I. A. Kurilov ◽  
D. I. Surzhik
Keyword(s):  
Communication Networks ◽  
Hierarchical Model ◽  
Ad Hoc ◽  
Multipath Propagation ◽  
Communication Channels ◽  
Analytical Description ◽  
Physical Layer ◽  
Network Equipment ◽  
Hoc Networks ◽  
Nonlinear Signal

Creation of reliable and efficient flying ad-hoc networks (FANET) requires detailed development of the model of the physical layer of data transmission, determined by the conditions of operation of the networks. The problems of well-known software simulators of communication networks are the simplified nature of the physical layer, as well as the inability to obtain specific analytical solutions in the process of simulation. The hierarchical model of formation of information signals which allows to represent various types of communication channels and the channel-forming equipment, for providing their analytical description and the further analysis is developed. The model allows to describe communication channels between UAVs and (or) ground control centers taking into account the effects of attenuation, intersymbol interference, multipath propagation of signals; schemes of terminal and intermediate network equipment with linear and nonlinear signal conversion; circuits with forward regulation, backward regulation and combined regulation; circuits with multi-channel signal generation and processing, as well as cross-links between channels. Analytical expressions of the transfer function of the generalized hierarchical model for an arbitrary number of disclosed levels of hierarchy are obtained. An example of the presentation and study of the UAV transmitter circuit on the basis of a hierarchical model of signal formation is considered.

scholarly journals ASDSR: An Adaptive Stable DSR Routing Protocol for Mobile Ad-hoc Networks

2020 ◽  
Vol 14 (08) ◽  
pp. 164
Author(s):  
Hutaf Salah Al-Deen Natoureah ◽  
Huda Abd El-Raheem Karajeh ◽  
Alaa' Abd El-Aziz Abu Serhan
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Specific Group ◽  
Dynamic Nature ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability ◽  
Network Flooding

<p class="Abstract">Abstract—The process of finding a route between the transmitter and the receiver node in the Mobile Adhoc Networks (MANets) is a renewed issue that is becoming more and more interesting to the researchers as this type of networks  grow and expand. The dynamic nature of MANET and the limited capabilities of wireless nodes in terms of memory size and battery charge are the most important obstacles to the routing (path-finding) process between nodes. In this research, we introduced a new protocol based on the well-known DSR protocol to add a mechanism that controls the RREQ Flooding process, which aims to reach more stable (life-long) routes while reducing the overhead of routing process caused by link breakage between nodes and reduce the overhead of network flooding with RREQ messages with each attempt to find a path. In this proposed mechanism, a specific group is selected from within the devices adjacent to the transmitter to be sent RREQ so that these devices are selected based on the stability evaluation criterion. The stability criterion is calculated based on three weighted factors: the speed of the node, the out-degree value (the number of adjacent nodes), and the number of tracks stored in the device memory. The proportion of devices selected is automatically changed adaptively to ensure that the expected throughput of this network is achieved. The proposed protocol was tested using simulation where results showed that ASDSR proved an enhancement in route stability about (0.13), and a decrease in the number of deleted routes by (9%), while maintaining the expected packet delivery ratio of the original DSR by about (0.86).</p>

Algorithms to Determine Stable Connected Dominating Sets for Mobile Ad Hoc Networks

2014 ◽  
pp. 249-274 ◽  
Author(s):  
Natarajan Meghanathan
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Stability Index ◽  
Dominating Sets ◽  
Connected Dominating Sets ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability ◽  
Node Size

This chapter presents three algorithms to determine stable connected dominating sets (CDS) for wireless mobile ad hoc networks (MANETs) whose topology changes dynamically with time. The three stability-based CDS algorithms are (1) Minimum Velocity (MinV)-based algorithm, which prefers to include a slow moving node as part of the CDS as long as it covers one uncovered neighbor node; (2) Node Stability Index (NSI)-based algorithm, which characterizes the stability of a node as the sum of the predicted expiration times of the links (LET) with its uncovered neighbor nodes, the nodes preferred for inclusion to the CDS in the decreasing order of their NSI values; (3) Strong Neighborhood (SN)-based algorithm, which prefers to include nodes that cover the maximum number of uncovered neighbors within its strong neighborhood (region identified by the Threshold Neighborhood Ratio and the fixed transmission range of the nodes). The three CDS algorithms have been designed to capture the node size—lifetime tradeoff at various levels. In addition to presenting a detailed description of the three stability-based CDS algorithms with illustrative examples, the authors present an exhaustive simulation study of these algorithms and compare their performance with respect to several metrics vis-à-vis an unstable maximum density-based MaxD-CDS algorithm that serves as the benchmark for the minimum CDS Node Size.

Opportunistic Channel Scheduling for Ad Hoc Networks with Queue Stability

Frequenz ◽  
2015 ◽  
Vol 69 (3-4) ◽  
Author(s):  
Lei Dong ◽  
Yongchao Wang
Keyword(s):  
Ad Hoc ◽  
Real Data ◽  
Channel Access ◽  
Multiple Sources ◽  
Current Channel ◽  
Access Problem ◽  
Channel Scheduling ◽  
Opportunistic Channel Access ◽  
Hoc Networks ◽  
The Stability

AbstractIn this paper, a distributed opportunistic channel access strategy in ad hoc network is proposed. We consider the multiple sources contend for the transmission opportunity, the winner source decides to transmit or restart contention based on the current channel condition. Owing to real data assumption at all links, the decision still needs to consider the stability of the queues. We formulate the channel opportunistic scheduling as a constrained optimization problem which maximizes the system average throughput with the constraints that the queues of all links are stable. The proposed optimization model is solved by Lyapunov stability in queueing theory. The successive channel access problem is decoupled into single optimal stopping problem at every frame and solved with

scholarly journals A-ZHLS: adaptive ZHLS routing protocol for heterogeneous mobile adhoc networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1626
Author(s):  
M V. Narayana ◽  
Aparnarajesh Atmakuri
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Nodes ◽  
Data Packets ◽  
Hybrid Routing ◽  
Novel Approach ◽  
Efficiency And Effectiveness ◽  
Hoc Networks ◽  
Set Up ◽  
The Stability

The routing protocols in MANET are mainly classified into two type’s i.e. pro-active and reactive based protocol based on its problems in the network. One of the prime and foremost issues, which have gained a lot of scope, is its dynamic nature of the networks i.e. the stability of nodes is not guaranteed in the network. Hence, this leads to loss of data packets that needs for its retransmission. Many advancements and Novel protocols have been devised in recent years for efficiency and effectiveness in the ad hoc networks. However, hybrid routing proto-cols that inculcates the nature of reactive and proactive has gained a lot of importance. ZHLS is one of the Hybrid routing protocol, and is a two tier hierarchal routing that divides the area into zones in which mobile nodes move randomly. The process of promoting ZHLS protocol is purely based on homogeneous scenarios which mean the nodes in the network are statistically identical, but there is lack of studies for heterogeneous set-up where mobile nodes act in a different way in an identical network. In this paper, we try to propose a novel approach known as “Adaptive-ZHLS: AZHLS” that can be suitable for heterogeneous scenarios. Experimental set up and simulated results will show that AZHLS provides higher packet delivery fraction as compared with the traditional one. 

scholarly journals Stability Aware Routing in Mobile Ad-Hoc Networks using multiple Route

2012 ◽  
Vol 2 (3) ◽  
pp. 163-170
Author(s):  
Aniket Mathuriya ◽  
Pushpraj Pal ◽  
Lovedeep Grover
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Packet Transmission ◽  
Hop Count ◽  
New Approach ◽  
Expiration Time ◽  
Multiple Routes ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability

Previous work on routing in MANETs has resulted innumerous routing protocols that aim at satisfying constraints such asminimum hop or low energy. Existing routing protocols often fail todiscover stable routes between source and sink when route availabilityis transient, i.e., due to mobile devices switching their network cardsinto low-power sleep modes whenever no communication is takingplace. In this thesis, we introduce a new approach stability awaresource routing protocol that is capable of predicting the stability (i.e.,expiration time) of multiple routes. Proposed protocol selects the routethat minimizes hop count while staying available for the expectedduration of packet transmission. The stability aware routing (SAR)resolve the problem of SADSR protocol indicate a significant increasein route discovery success rate with comparable route establishmentand maintenance overheads.

Multi-Purpose DS-Based Cluster Formation and Management in Mobile Ad Hoc Networks

2011 ◽  
pp. 1-20
Author(s):  
V. S. Anitha ◽  
M. P. Sebastian
Keyword(s):  
Load Balancing ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Dominating Set ◽  
Cluster Formation ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability

This chapter proposes a scenario-based and diameter-bounded algorithm for cluster formation and management in mobile ad hoc networks (MANETs). A (k, r) -Dominating Set is used for the selection of clusterheads and gateway nodes depending on the topology of the network. Here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. The non-clusterhead node selects the most qualified dominating node as its clusterhead from among the k dominating nodes. The quality of the clusterhead is a function of various metrics, which include connectivity, stability and residual battery power. The long-term service as a clusterhead depletes its energy, causing it to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbors leads to frequent clusterhead election process. This perturbs the stability of the network and can adversely affect the network performance. Load balancing among the clusterheads and correct positioning of the clusterhead in a cluster are vital to increase the lifespan of a network. The proposed centralized algorithm periodically calculates the quality of all dominating nodes in the network and if it goes below the threshold level it resigns the job as the clusterhead and sends this message to all other members in the cluster. Since these nodes have k dominating nodes within the r -hop distance, it can choose the current best-qualified node as its clusterhead. Simulation experiments are conducted to evaluate the performance of the algorithm in terms of the number of elements in the (k, r)-DS, the load balancing factor, the number of re-affiliations per unit time and the number of dominating set updates per unit time. The results establish the potential of this algorithm for use in MANETs.

scholarly journals A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links’ Weight to Increase Network Stability

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Abbas Karimi ◽  
Abbas Afsharfarnia ◽  
Faraneh Zarafshan ◽  
S. A. R. Al-Haddad
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
High Energy ◽  
Network Stability ◽  
Cluster Heads ◽  
Virtual Links ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability

The stability of clusters is a serious issue in mobile ad hoc networks. Low stability of clusters may lead to rapid failure of clusters, high energy consumption for reclustering, and decrease in the overall network stability in mobile ad hoc network. In order to improve the stability of clusters, weight-based clustering algorithms are utilized. However, these algorithms only use limited features of the nodes. Thus, they decrease the weight accuracy in determining node’s competency and lead to incorrect selection of cluster heads. A new weight-based algorithm presented in this paper not only determines node’s weight using its own features, but also considers the direct effect of feature of adjacent nodes. It determines the weight of virtual links between nodes and the effect of the weights on determining node’s final weight. By using this strategy, the highest weight is assigned to the best choices for being the cluster heads and the accuracy of nodes selection increases. The performance of new algorithm is analyzed by using computer simulation. The results show that produced clusters have longer lifetime and higher stability. Mathematical simulation shows that this algorithm has high availability in case of failure.

scholarly journals Self-Adaptive Trust Based ABR Protocol for MANETs UsingQ-Learning

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Anitha Vijaya Kumar ◽  
Akilandeswari Jeyapal
Keyword(s):  
Ad Hoc ◽  
Weighted Average ◽  
Complex Problem ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Trust Value ◽  
Security Challenges ◽  
Hoc Networks ◽  
The Stability

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed.Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques,Q-learning achieves optimal results. Our work focuses on computing a score usingQ-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show thatQ-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation.

Sign in / Sign up

Export Citation Format

Share Document