Sciweavers

514 search results - page 98 / 103
» A survey of mobility models for ad hoc network research
Sort
View
CCCG
2008
13 years 8 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
PODC
2003
ACM
14 years 19 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
SPAA
2005
ACM
14 years 28 days ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
ADHOC
2010
138views more  ADHOC 2010»
13 years 7 months ago
On the feasibility of UMTS-based Traffic Information Systems
Intelligent Transportation Systems (ITS) are a hot topic in the communications society. Currently, research is primarily focusing on setting up Vehicular Ad Hoc Networks (VANETs) ...
Christoph Sommer, Armin Schmidt, Yi Chen, Reinhard...
INFOCOM
2006
IEEE
14 years 1 months ago
Mobile Emulab: A Robotic Wireless and Sensor Network Testbed
Abstract— Simulation has been the dominant research methodology in wireless and sensor networking. When mobility is added, real-world experimentation is especially rare. However,...
David Johnson, Tim Stack, Russ Fish, Daniel Montra...