Sciweavers

404 search results - page 10 / 81
» Social Welfare Based Routing in 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
INFOCOM
2006
IEEE
14 years 1 months ago
A Brownian Motion Model for Last Encounter Routing
— We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...
Stratis Ioannidis, Peter Marbach
GLOBECOM
2008
IEEE
14 years 2 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
INFOCOM
2000
IEEE
13 years 12 months ago
Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the perf...
Samir Ranjan Das, Charles E. Perkins, Elizabeth M....
EUROMICRO
2004
IEEE
13 years 11 months ago
Securing Ad hoc Routing Protocols
Ad hoc networks are subject of many recent research efforts. Especially in mobile scenarios, self-organizing networks are of high interest. While the routing aspects of mobile ad ...
Frank Kargl, Stefan Schlott, Andreas Klenk, Alfred...