ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Competitive Selection of Ephemeral Relays in Wireless Networks

Naveen, K P and Altman, Eitan and Kumar, Anurag (2017) Competitive Selection of Ephemeral Relays in Wireless Networks. In: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 35 (3). pp. 586-600.

[img] PDF
Iee_Jou_Sel_Are_Com_35-3_586_2017.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: http://dx.doi.org/10.1109/JSAC.2017.2659579

Abstract

We consider an opportunistic wireless communication setting, in which two nodes (referred to as forwarders) compete to choose a relay node from a set of relays, as they ephemerally become available (e.g., wake up from a sleep state). Each relay, when it becomes available (or arrives), offers a (possibly different) ``reward'' to each forwarder. Each forwarder's objective is to minimize a combination of the delay incurred in choosing a relay and the reward offered by the chosen relay. As an example, we develop the reward structure for the specific problem of geographical forwarding over a common set of sleep-wake cycling relays. In general, our model can be considered as a game theoretic variant of the asset selling problem studied in the operations research literature. We study two variants of the generic relay selection problem, namely, the completely observable (CO) and the partially observable (PO) cases. These cases are based on whether a forwarder (in addition to observing its reward) can also observe the reward offered to the other forwarder. Formulating both problems as a two person stochastic game, we characterize the solutions in terms of Nash equilibrium policy pairs (NEPPs). For the CO case, we provide a general structure of the NEPPs. For the PO case, we prove that there exists an NEPP within the class of threshold policy pairs. Through numerical work, for a one-hop forwarding example, we compare the cost performance of various NEPPs with a simple forwarding (SF) policy, which causes each forwarder to act as if the other is not present. We find that if the forwarders are not very close then the SF policy suffices. Insights gained from this numerical work are then used in an end-to-end simulation of geographical forwarding in a large network, in which we are concerned with delivery of packets from a tagged source to a sink, in the presence of competition from other packet flows destined for the same sink.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Depositing User: Id for Latest eprints
Date Deposited: 03 Jun 2017 09:44
Last Modified: 03 Jun 2017 09:44
URI: http://eprints.iisc.ac.in/id/eprint/57125

Actions (login required)

View Item View Item