Research on the Impact of Interaction Times in Distributed Wireless Ad Hoc Networks

Abstract

The distributed wireless ad hoc network caters to users' demands for high reliability, low latency, and low cost. It has the characteristics of low operation and maintenance costs, strong scalability, no center, and self-organization, and has wide application prospects in 5G and industrial Internet of Things. The access process is a key process for the operation of distributed wireless ad hoc networks, which has a huge impact on its performance. The distributed election mechanism is an effective solution to avoid access collision and achieve efficient access. The number of interactions in the election mechanism will affect the amount of information obtained by the nodes, which will affect the performance of the network's election success probability, delay, and efficiency. When the number of interactions is small, the node obtains less information, and the collision and waste of time slots are serious, resulting in deterioration of network performance. Increasing the number of interactions can increase the amount of information acquired by the nodes, but it will also increase network delay and network overhead. However, the current research on the number of interactions is insufficient. Therefore, this paper studies the impact of the number of interactions on the legal election set and establishes the analytical models of election success probability, delay, and efficiency. The range of interaction times is determined by maximizing the efficiency, election success probability and minimizing delay. Finally, simulation results show that the number of interactions should be adjusted according to the network scale and efficiency.

Network Consensus Analysis and Optimization of Distributed FANETs Based on Multi-agent Consensus Theory

“…Resource allocation must be successful in this case, eliminating the impact of inconsistency in practice. [20] pointed out that the link outage probability would cause packet loss and the emergence of nodes with unknown election interval information in the distributed network under the election mechanism, hence influencing the selection of election sets and the resource allocation outcomes. The above research investigated the effect of various election interval lengths on the success probability of resource allocation.…”

A dynamic even distribution resource scheduling mechanism combined with network coding for inter‐LEO satellite networks

“…Thus, a resource efficiency optimization model is established to optimize the parameters to balance network maintenance overhead and idle resource waste, retransmission and redundancy. In particular, considering the fact that the consensus probability of network maintenance has not been evaluated in state‐of‐the‐art, 18 we analyze the network maintenance consensus probability using multi‐agent consensus theory 19 A Visio Studio (VS)‐based platform is constructed for system‐level simulation to simulate the resource efficiency performance of DENC.…”

Impact of Age Violation Probability on Neighbor Election-Based Distributed Slot Access in Wireless Ad Hoc Networks

“…In recent years, there has been an increasing demand for developing next-generation multiple access schemes for the evolving fifth-generation (5G) and sixth-generation (6G) wireless networks, Internet of Things (IoT) [4][5][6] and wireless sensor networks (WSN) [7,8], where the nodes are expected to schedule themselves in a distributed manner with the knowledge of their neighbors. With the characteristics of neighborhood awareness, the neighbor election has then attracted recent research interest again [9][10][11]. Different from the well-known contention-based slotted aloha (SA) and Carrier-Sense Multiple Access (CSMA), where the nodes randomly initiate transmissions without any prior knowledge about their neighboring network, neighbor election performs contention resolution by getting acquainted with their neighbors.…”

“…If the information of a neighbor node cannot be timely updated, it will also be considered as a potential competitor, leading to an increasing number of competing neighbors. As a result, the insufficient timeliness of neighbor maintenance will decrease the probability of a node winning an election and starting its transmission [9]. Meanwhile, the maintenance of frequent neighbor updates is fundamentally supported by the communication among nodes, which implies an interaction relationship between the transmission probability of nodes and the timeliness of information maintenance.…”