Abstract
This article proposes and analyzes a distributed probabilistic selection protocol in which several nodes perform a random access competition on a shared slotted channel. Nodes that are better suited according to some metric are preferred in the random access and are thus selected with high likelihood. Analytical performance studies are made in terms of reliability, message complexity, and delay. The protocol is applied in two case studies: relay communications and load balancing in wireless networks. In relay communications, a node is selected based on its channel state to serve as relay. In load balancing, a node is selected based on its battery charge state to perform a task. Results indicate that selecting nodes based on the observed metric contributes to better performance and longer network lifetime.
Highlights
Many network protocols require a distributed solution for selecting a node from a candidate set to perform a certain task
2.2 Performance metrics We evaluate the proposed selection algorithms based on three metrics which are reliability, message complexity, and delay, respectively
We employ the same basic idea of channel access for performing node selection, we extend the work of Tang et al [16] in the following ways: We propose, derive, and analyze two access probabilities, where the first one maximizes reliability while the second one reduces message complexity
Summary
Many network protocols require a distributed solution for selecting a node from a candidate set to perform a certain task. For each time instant t, the sum of node-dependent access probabilities pij(t) in a given contention slot shall be approximately equal to the sum of node-independent sending probabilities, i.e., n i=1 pij(t) This property ensures that performance measures such as reliability, message complexity, and delay, as shown, are not significantly altered when applying metric-based selection. We employ the same basic idea of channel access for performing node selection, we extend the work of Tang et al [16] in the following ways: We propose, derive, and analyze two access probabilities, where the first one maximizes reliability while the second one reduces message complexity. For large-enough channel coherence time, the selected relay will exhibit good channel conditions for relay-destination communications
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
