Sciweavers

104 search results - page 20 / 21
» Multi-Initiator Connected Dominating Set Construction for Mo...
Sort
View
CCCG
2008
13 years 6 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
INFOCOM
2003
IEEE
13 years 10 months ago
IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks
— A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are curren...
Fan Bai, Narayanan Sadagopan, Ahmed Helmy
MHCI
2005
Springer
13 years 10 months ago
Searching common experience: a social communication tool based on mobile ad-hoc networking
As small digital cameras become more popular, opportunities to take photos are rapidly increasing. Photo sharing is a great way to maintain and revitalize relationships between fa...
Michimune Kohno, Jun Rekimoto
ACSAC
2004
IEEE
13 years 9 months ago
PEACE: A Policy-Based Establishment of Ad-hoc Communities
Ad-hoc networks are perceived as communities of autonomous devices that interconnect with each other. Typically, they have dynamic topologies and cannot rely on a continuous conne...
Sye Loong Keoh, Emil Lupu, Morris Sloman
MOBIHOC
2006
ACM
14 years 4 months ago
Performance analysis of mobility-assisted routing
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...