Competitive selection of ephemeral relays in wireless networks
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 …
to as forwarders) compete to choose a relay node from a set of relays, as they ephemerally …
Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks
In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-
wake cycling nodes, we are interested in the local decision problem faced by a node that …
wake cycling nodes, we are interested in the local decision problem faced by a node that …
Relay selection for geographical forwarding in sleep-wake cycling wireless sensor networks
Our work is motivated by geographical forwarding of sporadic alarm packets to a base
station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling …
station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling …
Relay selection with channel probing in sleep-wake cycling wireless sensor networks
In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-
wake cycling nodes, we are interested in the local decision problem faced by a node that …
wake cycling nodes, we are interested in the local decision problem faced by a node that …
Relay selection with channel probing for geographical forwarding in WSNs
In a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested
in the local decision problem faced by a node that has “custody” of a packet and has to …
in the local decision problem faced by a node that has “custody” of a packet and has to …
Computation of a nash equilibrium of multiple-leader stackelberg network games
V Rodoplu, GS Raj - 2010 Fifth International Conference on …, 2010 - ieeexplore.ieee.org
We propose a multiple-leader Stackelberg network game to model the pricing decisions of
relay nodes on an arbitrary topology between a source and a destination, under a …
relay nodes on an arbitrary topology between a source and a destination, under a …
Relay selection with partial information in wireless sensor networks
Our work is motivated by geographical forwarding of sporadic alarm packets to a base
station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling …
station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling …
Delay and energy optimal two-hop relaying in delay tolerant networks
C Singh, A Kumar, R Sundaresan - … Symposium on Modeling …, 2010 - ieeexplore.ieee.org
We study the trade-off between delivery delay and energy consumption in delay tolerant
mobile wireless networks that use two-hop relaying. The source may not have perfect …
mobile wireless networks that use two-hop relaying. The source may not have perfect …
Optimal forwarding games in mobile ad hoc networks with two-hop f-cast relay
J Liu, X Jiang, H Nishiyama, R Miura… - IEEE Journal on …, 2012 - ieeexplore.ieee.org
This paper examines the optimal forwarding problem in mobile ad hoc networks (MANETs)
based on a generalized two-hop relay with limited packet redundancy f (f-cast) for packet …
based on a generalized two-hop relay with limited packet redundancy f (f-cast) for packet …
An epidemic game between contents in a wireless network
E Altman - 2012 International Symposium on Wireless …, 2012 - ieeexplore.ieee.org
Consider a town with N competing sources of content where each one wishes to
disseminate its own content and thus to make its content available to as many destination …
disseminate its own content and thus to make its content available to as many destination …