Classification and comparison of ad hoc networks: A review

Spontaneous networks lack an a priori communication infrastructure, the neighbors are unknown right after the deployment, and they are used during a period of time and in a certain location. In this paper, we present a new randomized creation model of a spontaneous wireless ad hoc network based on trusted neighbors. The idea is to manage the neighbor discovery with the exchange of identity cards, and the checking of a signature establishes a relationship based on trust of the neighbors. To asses the performance of our randomized trusted network proposal and compare it against an existing deterministic protocol used as reference, we relied on Castalia 3.2 simulator, regarding 4 metrics: time, energy consumption, throughput, and number of discoveries vs packet sent ratio. We found that our proposal outperforms the reference protocol in terms of time, energy, and discoveries vs packet sent ratio in a one-hop setting, while it outperforms the reference protocol regarding all 4 metrics in multihop environments. We also evaluated our proposal through simulations varying the transmission probability and proved that it does not require to know the number of nodes if a fixed transmission probability is set, providing reasonable results. Moreover, our proposal is based on collision detection, it knows when to terminate the process, it does not require a transmission schedule, and it follows more realistic assumptions. In addition, a qualitative comparison is carried out, comparing our proposal against existing protocols from the literature.

/pdf/a-spontaneous-wireless-ad-hoc-trusted-neighbor-network-q1jwjmn0zw.pdf

A Spontaneous Wireless Ad Hoc Trusted Neighbor Network Creation Protocol

Neighbor discovery is an important first step after the deployment of ad hoc wireless networks since they are a type of network that do not provide a communications infrastructure right after their deployment, the devices have radio transceivers which provide a limited transmission range, and there is a lack of knowledge of the potential neighbors. In this work two proposals to overcome the neighbor discovery in static one-hop environments in the presence of collisions, are presented. We performed simulations through Castalia 3.2, to compare the performance of the proposals against that for two protocols from the literature, i.e. PRR and Hello, and evaluate them according to six metrics. According to simulation results, the Leader-based proposal (O(N)) outperforms the other protocols in terms of neighbor discovery time, throughput, discoveries vs packets sent ratio, and packets received vs sent ratio, and the TDMA-based proposal is the slowest (
 $$O(N^2)$$
 ) and presents the worst results regarding energy consumption, and discoveries vs packets sent ratio. However, both proposals follow a predetermined transmission schedule that allows them to discover all the neighbors with probability 1, and use a feedback mechanism. We also performed an analytical study for both proposals according to several metrics. Moreover, the Leader-based solution can only properly operate in one-hop environments, whereas the TDMA-based proposal is appropriate for its use in multi-hop environments.

Collision Avoidance Based Neighbor Discovery in Ad Hoc Wireless Networks

https://link.springer.com/content/pdf/10.1007/s11036-022-02014-5.pdf

Industrial Internet of Things

Neighbor discovery is a crucial first step after the deployment of wireless ad hoc networks, which do not have a communications infrastructure. In this paper we present analytical models of randomized neighbor discovery protocols for static one-hop environments: CDPRR (Collision Detection Probabilistic Round Robin) and CDH (Collision Detection Hello). For CDPRR we assumed a geometric distribution and a uniform distribution for CDH. For comparison purposes, we chose two protocols from the literature, i.e., Hello and PRR, to be used as reference. To assess the performance of the proposals we carried out a mathematical study regarding six metrics, i.e., neighbor discovery time, energy consumption, overhead (number of packets sent), packet delivery ratio, the CDF of discoveries, and percentage of idle slots, and presented graphical results obtained from the equations. According to the analytical results, CDH protocol outperforms the other solutions regarding the neighbor discovery time, energy consumption, number of packets sent, packet delivery ratio and CDF of discoveries, while CDPRR achieves good results and it is better than Hello and PRR in terms of neighbor discovery time, energy consumption, CDF of discoveries and the overhead (number of packets sent). Moreover, we found that CDPRR presents more percentage of idle slots than PRR, which is a clear advantage in terms of energy consumed and number of packets sent. In addition, as novelty compared to the reference protocols, we found that both CDH and CDPRR protocols manage to discover all the neighbors, know when to terminate the discovery process, and achieve to operate under more realistic assumptions. We also focused the study on the CDH protocol varying the slot width, and demonstrated that the number of nodes in the network can be unknown, still providing reasonable results.

Analytical models for randomized neighbor discovery protocols based on collision detection in wireless ad hoc networks

Energy-aware Randomized Neighbor Discovery Protocol based on Collision Detection in Wireless Ad Hoc Networks

Neighbor discovery represents a first step after the deployment of wireless ad hoc networks, since the nodes that form them are equipped with limited-range radio transceivers, and they typically do not know their neighbors. In this paper two randomized neighbor discovery approaches, called CDH and CDPRR, based on collision detection for static multi-hop wireless ad hoc networks, are presented. Castalia 3.2 simulator has been used to compare our proposed protocols against two protocols chosen from the literature and used as reference: the PRR, and the Hello protocol. For the experiments, we chose five metrics: the neighbor discovery time, the number of discovered neighbors, the energy consumption, the throughput and the number of discovered neighbors versus packets sent ratio.
 According to the results obtained through simulation, we can conclude that our randomized proposals outperform both Hello and PRR protocols in the presence of collisions regarding all five metrics, for both one-hop and multi-hop scenarios.
 As novelty compared to the reference protocols, both proposals allow nodes to discover all their neighbors with probability 1, they are based on collision detection and know when to terminate the neighbor discovery process. Furthermore, qualitative comparisons of the existing protocols and the proposals are available in this paper. Moreover, CDPRR presents better results in terms of time, energy consumption and number of discovered neighbors versus packets sent ratio. We found that both proposals achieve to operate under more realistic assumptions. Furthermore, CDH does not need to know the number of nodes in the network.

Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks

In ad hoc wireless networks, the devices are equipped with limited range radio transceivers for communications. This type of networks does not have a communications infrastructure right after the deployment, and nodes do not know which other nodes are within their transmission range (neighbors). So, each node must discover its neighbors as a first step. In this paper we present two approaches to the neighbor discovery problem in static one-hop scenarios: TDMA-based (Time Division Multiple Access based) and Leader-based protocols. To assess the performance of these approaches we performed simulation experiments using the Castalia 3.2 simulator, comparing the proposed protocols against two protocols widely used in the literature as reference - the PRR (Probabilistic Round Robin) protocol and the Hello protocol - measuring two metrics: neighbor discovery time and number of discovered neighbors, for all the protocols tested. Results show that the leader-based and TDMA-based protocols outperform state-of-the-art solutions in the presence of collisions regarding both metrics, while finding that the TDMA-based protocol $(O(N^{2}))$ is slower than the leader-based approach $(O(N))$ . The TDMA-based proposal decreases time consumption at least at a factor of 6 in comparison with Hello protocol and a factor of 3 compared to PRR protocol. Furthermore, the leader-based protocol reduces the time consumption at least at a factor of $6N$ in comparison with Hello and a factor of $3N$ compared to PRR protocol.

Jose Vicente Sorribes

Papers

A Spontaneous Wireless Ad Hoc Trusted Neighbor Network Creation Protocol

Analytical models for randomized neighbor discovery protocols based on collision detection in wireless ad hoc networks

Energy-aware Randomized Neighbor Discovery Protocol based on Collision Detection in Wireless Ad Hoc Networks

Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks

Collision-Aware Deterministic Neighbor Discovery in Static Ad Hoc Wireless Networks