Optimal timer based selection schemes

Shah, Vatsal; Mehta, Neelesh B.; Yim, R.

doi:10.1109/tcomm.2010.06.090266

Cited by 67 publications

(75 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A timer scheme, on the other hand, runs for a fixed preallocated selection duration T max , and does not require any feedback from the sink while it is running [1], [8], [9]. In it, a node i sets its timer based on its metric µ i .…”

Section: A Distributed Node Selection Schemesmentioning

confidence: 99%

“…The metricto-timer mapping is monotone non-increasing, which ensures that the best node transmits first. However, a collision occurs if a node transmits its packet within a time interval Δ v after the best node's transmission [8], [11], [12]. The time interval Δ v is known as the vulnerability window and is determined by the physical layer capabilities of the system.…”

Section: A Distributed Node Selection Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Dewangan

Mehta

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Opportunistic selection in multi-node wireless systems improves system performance by selecting the "best" node and by using it for data transmission. In these systems, each node has a real-valued local metric, which is a measure of its ability to improve system performance. Our goal is to identify the best node, which has the largest metric. We propose, analyze, and optimize a new distributed, yet simple, node selection scheme that combines the timer scheme with power control. In it, each node sets a timer and transmit power level as a function of its metric. The power control is designed such that the best node is captured even if η other nodes simultaneously transmit with it. We develop several structural properties about the optimal metric-to-timer-and-power mapping, which maximizes the probability of selecting the best node. These significantly reduce the computational complexity of finding the optimal mapping and yield valuable insights about it. We show that the proposed scheme is scalable and significantly outperforms the conventional timer scheme. We investigate the effect of η and the number of receive power levels. Furthermore, we find that the practical peak power constraint has a negligible impact on the performance of the scheme.

show abstract

Section: A Distributed Node Selection Schemesmentioning

confidence: 99%

Section: A Distributed Node Selection Schemesmentioning

confidence: 99%

Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Dewangan

Mehta

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…Shah et al [17] propose a selection protocol where metrics of nodes are mapped to discrete timers. The better the node's metric value, the shorter it waits until it accesses the shared medium.…”

Section: Related Workmentioning

confidence: 99%

Contention-based node selection with applications to relay communications and load balancing

Brandner

Bettstetter

Schilcher

2013

J Wireless Com Network

View full text Add to dashboard Cite

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.

show abstract

“…As our results show, from an overall system-level throughput perspective, the system is sometimes better off allocating more time to the selection phase, e.g., 7-8 slots, to improve the odds of selecting the best relay. Our results, thus, suggest that a joint design is also necessary in cooperative systems that use other selection mechanisms such as the back-off timer-based mechanism of [12], [13] or the handshaking message-based tracking approach used in [11].…”

Section: Introductionmentioning

confidence: 97%

“…In [11], the source node uses overhead handshaking messages to exhaustively track the rate that each candidate relay can support. The selection phase overhead can be reduced by using distributed mechanisms based on back-off timers [12], [13] or time-slotted splitting algorithms [14]- [16].…”

Section: Introductionmentioning

confidence: 99%

The Relay Selection and Transmission Trade-off in Cooperative Communication Systems

Shah

Mehta²,

Yim

2010

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

A common and practical paradigm in cooperative communication systems is the use of a dynamically selected best relay to decode and forward information from a source to a destination. Such systems use two phases a relay selection phase, in which the system uses transmission time and energy to select the best relay, and a data transmission phase, in which it uses the spatial diversity benefits of selection to transmit data. In this paper, we derive closed-form expressions for the overall throughput and energy consumption, and study the time and energy trade-off between the selection and data transmission phases. To this end, we analyze a baseline non-adaptive system and several adaptive systems that adapt the selection phase, relay transmission power, or transmission time. Our results show that while selection yields significant benefits, the selection phases time and energy overhead can be significant. In fact, at the optimal point, the selection can be far from perfect, and depends on the number of relays and the mode of adaptation. The results also provide guidelines about the optimal system operating point for different modes of adaptation. The analysis also sheds new insights on the fast splitting-based algorithm considered in this paper for relay selection. IEEE Transactions on Wireless CommunicationsThis work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Abstract-A common and practical paradigm in cooperative communication systems is the use of a dynamically selected 'best' relay to decode and forward information from a source to a destination. Such systems use two phases -a relay selection phase, in which the system uses transmission time and energy to select the best relay, and a data transmission phase, in which it uses the spatial diversity benefits of selection to transmit data. In this paper, we derive closed-form expressions for the overall throughput and energy consumption, and study the time and energy trade-off between the selection and data transmission phases.To this end, we analyze a baseline non-adaptive system and several adaptive systems that adapt the selection phase, relay transmission power, or transmission time. Our results show that while selection yields significant benefits, the selection phase's time and energy overhead can be significant. In fact, at the optimal point, the selection can be far from perfect, and depends on the number of relays and the mode of ad...

show abstract

Optimal timer based selection schemes

Cited by 67 publications

References 21 publications

Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Contention-based node selection with applications to relay communications and load balancing

The Relay Selection and Transmission Trade-off in Cooperative Communication Systems

Contact Info

Product

Resources

About