Performance Analysis of CSMA/NP under Finite Population Environments.

In this study, we analyze the CSMA Non-Persistent protocol with a finite number of nodes, providing more accurate results for applications like wireless sensor networks. The finite model addresses scenarios where the node count is moderate, capturing realistic system dynamics. Our analysis reveals a dependency on the node count, impacting system throughput. As the node count increases, throughput behavior aligns with Kleinrock's infinite model. We derive a complex closed-form throughput expression for a finite quantity of nodes in the system, solved numerically, and offer an approximate expression for specific conditions. These insights advance understanding of low-contention network performance, especially in scenarios where the infinite model becomes inadequate.

A Neural Network-Based Random Access Protocol for Crowded Massive MIMO Systems.

Fifth-generation (5G) and beyond networks are expected to serve large numbers of user equipments (UEs). Grant-based random access (RA) protocols are efficient when serving human users, typically with large data volumes to transmit. The strongest user collision resolution (SUCRe) is the first protocol that effectively uses the many antennas at the 5G base station (BS) to improve connectivity performance. In this paper, our proposal involves substituting the retransmission rule of the SUCRe protocol with a neural network (NN) to enhance the identification of the strongest user and resolve collisions in a decentralized manner on the UEs' side. The proposed NN-based procedure is trained offline, admitting different congestion levels of the system, aiming to obtain a single setup able to operate with different numbers of UEs. The numerical results indicate that our method attains substantial connectivity performance improvements compared to other protocols without requiring additional complexity or overhead. In addition, the proposed approach is robust regarding variations in the number of BS antennas and transmission power while improving energy efficiency by requiring fewer attempts on the RA stage.

Reliable Link Level Routing Algorithm in Pipeline Monitoring Using Implicit Acknowledgements.

End-to-end reliability for Wireless Sensor Network communications is usually provided by upper stack layers. Furthermore, most of the studies have been related to star, mesh, and tree topologies. However, they rarely consider the requirements of the multi-hop linear wireless sensor networks, with thousands of nodes, which are universally used for monitoring applications. Therefore, they are characterized by long delays and high energy consumption. In this paper, we propose an energy efficient link level routing algorithm that provides end-to-end reliability into multi-hop wireless sensor networks with a linear structure. The algorithm uses implicit acknowledgement to provide reliability and connectivity with energy efficiency, low latency, and fault tolerance in linear wireless sensor networks. The proposal is validated through tests with real hardware. The energy consumption and the delay are also mathematically modeled and analyzed. The test results show that our algorithm decreases the energy consumption and minimizes the delays when compared with other proposals that also apply the explicit knowledge technique and routing protocols with explicit confirmations, maintaining the same characteristics in terms of reliability and connectivity.