Sciweavers

1101 search results - page 193 / 221
» Ad hoc routing based on the stability of routes
Sort
View
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 1 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
AAAI
2000
15 years 1 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
PERCOM
2010
ACM
14 years 10 months ago
HERO: Hybrid Emergency Route-Opening Protocol
—This paper presents an ad-hoc vehicular protocol to support the logistics of first responders. First responders often travel several kilometers to reach an area impacted by an ...
Jonathan Woodbridge, Mars Lan, Giovanni Pau, Mario...
INFOCOM
2011
IEEE
14 years 3 months ago
Adaptive algorithms for detecting community structure in dynamic social networks
—Social networks exhibit a very special property: community structure. Understanding the network community structure is of great advantages. It not only provides helpful informat...
Nam P. Nguyen, Thang N. Dinh, Ying Xuan, My T. Tha...
MOBIHOC
2006
ACM
15 years 11 months ago
Robust distributed node localization with error management
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
Juan Liu, Ying Zhang, Feng Zhao