Sciweavers

469 search results - page 83 / 94
» Distributed Cooperative Routing for UWB Ad-Hoc Networks
Sort
View
WINE
2005
Springer
161views Economy» more  WINE 2005»
14 years 1 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
ISPAN
2005
IEEE
14 years 1 months ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...
ICPADS
2006
IEEE
14 years 1 months ago
Joint Optimization of MAC and Network Coding for Cooperative and Competitive Wireless Multicasting
In this paper, we address the problem of cross-layer optimization in medium access control (MAC) and network layers for wireless multicasting with multiple cooperative or competit...
Yalin Evren Sagduyu, Anthony Ephremides
NETCOOP
2007
Springer
14 years 1 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...
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 2 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...