Sciweavers

277 search results - page 40 / 56
» Cooperation and Routing in Multi-Hop Networks
Sort
View
MOBICOM
2003
ACM
14 years 1 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
NETWORKING
2010
13 years 10 months ago
Synapse: A Scalable Protocol for Interconnecting Heterogeneous Overlay Networks
This paper presents Synapse, a scalable protocol for information retrieval over the inter-connection of heterogeneous overlay networks. Applications on top of Synapse see those int...
Luigi Liquori, Cédric Tedeschi, Laurent Van...
BIOWIRE
2007
Springer
14 years 2 months ago
Coalition Games and Resource Allocation in Ad-Hoc Networks
In this paper we explore some of the connections between cooperative game theory and the utility maximization framework for routing and flow control in networks. Central to both a...
Richard J. Gibbens, Peter B. Key
JCP
2008
117views more  JCP 2008»
13 years 8 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...
NETCOOP
2007
Springer
14 years 2 months ago
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
Dominique Barth, Johanne Cohen, Loubna Echabbi, Ch...