Design and Development of a Resource Sharing in Decentralized Type of Wireless Network with Low Latency in Distributed Manner

With the growing abundance of portable wireless communication devices, a challenging question arises: Can the collective communication and computation power of these devices be efficiently harnessed? In this research, I investigate this question by focusing on a streaming application within a network of wireless nodes, each with a specific power capacity. Some nodes in the network are interested in receiving a data stream from a fixed server node. The main objectives are to explore whether distributed communication mechanisms can route media packets efficiently, satisfying three key criteria: 1) achieving a short average communication delay (Δ), 2) balancing the load among all nodes, ensuring roughly equal average power expenditure, and most importantly, 3) optimally sharing power resources among all nodes, thereby extending the network's lifetime to be comparable to an optimally designed network with 'n' nodes having a total power equivalent to the sum of all individual node powers (Biklen, S. K. 2019). To address these challenges, I am developing a theoretical framework that incorporates random long-range routes into wireless ad hoc networking protocols (Yang et al., 2019). The focus is on achieving performance characteristics that adhere to the aforementioned criteria. Surprisingly, my findings demonstrate the feasibility of wireless ad hoc routing algorithms based on this framework, which can deliver the desired performance. The proposed solution is a novel randomized network structuring and packet routing framework that achieves communication latency of only 'h' hops, on average, compared to 'k' hops in nearest neighbor communications (Yang et al., 2019). Moreover, it efficiently distributes the power requirement almost equally across all nodes, thus avoiding potential energy imbalances. An intriguing aspect of this research is that all network formation and routing algorithms are completely decentralized. Packets arriving at a node are routed randomly and independently, based solely on the source and destination locations. This inherent distributed nature allows easy implementation within standard wireless ad hoc communication protocols, making the proposed framework an attractive candidate for harnessing collective network resources in a truly large-scale wireless ad hoc networking environment Biklen, S. K. 2019. The investigation of a streaming application, utilizing a randomized network structuring and packet routing framework, shows promising results, offering low latency, balanced resource sharing, and scalability. The proposed approach may revolutionize wireless ad hoc networking and open doors to innovative applications in various fields (Altheide, D. L. 1994) [1].