Sciweavers

1036 search results - page 70 / 208
» The Distributed Wireless Gathering Problem
Sort
View
JAIR
2008
145views more  JAIR 2008»
14 years 9 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
CONEXT
2007
ACM
15 years 1 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
Shimin Guo, Srinivasan Keshav
ICC
2009
IEEE
196views Communications» more  ICC 2009»
15 years 4 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
SECON
2007
IEEE
15 years 4 months ago
Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda