Sciweavers

63 search results - page 4 / 13
» Bottleneck Routing Games in Communication Networks
Sort
View
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 2 months ago
Distributed Power Control in Multihop Ad Hoc CDMA Networks
— In this paper, we propose a distributed power control algorithm for multihop ad hoc CDMA networks. The algorithm attempts to maximize the QoS of each user as well as a global n...
George Kesidis, A. Neishaboori
GLOBECOM
2007
IEEE
14 years 1 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
CNSR
2010
IEEE
140views Communications» more  CNSR 2010»
13 years 11 months ago
Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
Ulrich Herberg
BIOWIRE
2007
Springer
14 years 1 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
INFOCOM
2005
IEEE
14 years 1 months ago
Designing incentives for peer-to-peer routing
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
Alberto Blanc, Yi-Kai Liu, Amin Vahdat