Sciweavers

242 search results - page 15 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
ICC
2009
IEEE
196views Communications» more  ICC 2009»
15 years 6 months ago
Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
Sucha Supittayapornpong, Poompat Saengudomlert
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 3 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
MASCOTS
2010
15 years 1 months ago
Distributed Routing for Vehicular Ad Hoc Networks: Throughput-Delay Tradeoff
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
Ali Abedi, Majid Ghaderi, Carey L. Williamson
TON
2010
157views more  TON 2010»
14 years 6 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle
SPAA
2006
ACM
15 years 5 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...