Sciweavers

610 search results - page 119 / 122
» Routing in Sparse Vehicular Ad Hoc Wireless Networks
Sort
View
MOBIDE
2005
ACM
15 years 3 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
WIOPT
2006
IEEE
15 years 3 months ago
Analyzing the impact of neighbor sensing on the performance of the OLSR protocol
— This paper presents an analysis of several neighbor sensing approaches for the OLSR routing protocol. While several performance studies of OLSR proceed this work, few attention...
Michael Voorhaen, Chris Blondia
MOBICOM
2006
ACM
15 years 3 months ago
Characterizing multi-way interference in wireless mesh networks
Wireless mesh networks (WMNs) have been proposed as a solution for ubiquitous last-mile broadband access. A critical limiting factor for many WMN protocols in realizing their thro...
Saumitra M. Das, Dimitrios Koutsonikolas, Y. Charl...
SPAA
2005
ACM
15 years 3 months 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...
WINET
2010
185views more  WINET 2010»
14 years 8 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya