Opportunistic carrier sensing for energy-efficient information retrieval in sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on advanced signal processing algorithms for wireless communications
Fundamentals of wireless communication
Fundamentals of wireless communication
A comparison of opportunistic and deterministic forwarding in mobile multihop wireless networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Single and multiple relay selection schemes and their achievable diversity orders
IEEE Transactions on Wireless Communications
Analysis, insights and generalization of a fast decentralized relay selection mechanism
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
IEEE Transactions on Wireless Communications
An Integrated Approach to Energy-Aware Medium Access for Wireless Sensor Networks
IEEE Transactions on Signal Processing - Part I
Selection Cooperation in Multi-Source Cooperative Networks
IEEE Transactions on Wireless Communications
PHY-layer Fairness in Amplify and Forward Cooperative Diversity Systems
IEEE Transactions on Wireless Communications
Lifetime maximization for amplify-and-forward cooperative networks
IEEE Transactions on Wireless Communications - Part 2
Throughput maximization by utilizing multi-user diversity in slow-fading random access channels
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
On the Study of Network Coded AF Transmission Protocol for Wireless Multiple Access Channels
IEEE Transactions on Wireless Communications - Part 2
Cooperative communication in wireless networks
IEEE Communications Magazine
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
The relay selection and transmission trade-off in cooperative communication systems
IEEE Transactions on Wireless Communications
Voluntary energy harvesting relays and selection in cooperative wireless networks
IEEE Transactions on Wireless Communications
Contention for opportunistic relay selection in mobile ad hoc networks
Proceedings of the 6th International Conference on Future Internet Technologies
Hi-index | 0.00 |
Timer-based mechanisms are often used to help a given (sink) node select the best helper node from among many available nodes. In these, a node transmits a packet when its timer expires. The timer value is a monotone nonincreasing function of its local suitability metric, which ensures that the best node is the first to transmit and is selected successfully if no other node's timer expires within a 'vulnerability' window after its timer expiry and so long as the sink can hear the available nodes. In this paper, we show that the optimal metric-to-timer mapping that (i) maximizes the probability of successful selection or (ii) minimizes the average selection time subject to a minimum constraint on the probability of success, maps the metric into a set of discrete timer values. We specify, in closed-form, the optimal scheme as a function of the maximum selection duration, the vulnerability window, and the number of nodes. An asymptotic characterization of the optimal scheme turns out to be elegant and insightful. For any probability distribution function of the metric, the optimal scheme is scalable, distributed, and performs much better than the popular inverse metric timer mapping. It even compares favorably with splitting-based selection, when the latter's feedback overhead is accounted for.