Sciweavers

2572 search results - page 435 / 515
» Identification in Ad Hoc Networks
Sort
View
MOBIHOC
2006
ACM
16 years 5 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
MOBIHOC
2003
ACM
16 years 5 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 5 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
TMC
2010
104views more  TMC 2010»
15 years 4 months ago
On Nodal Encounter Patterns in Wireless LAN Traces
—In this paper we analyze multiple wireless LAN (WLAN) traces from university and corporate campuses. In particular, we consider an important event between mobile nodes in wirele...
Wei-jen Hsu, Ahmed Helmy
PERCOM
2007
ACM
16 years 5 months ago
SOS: Secure Overlay Sensornets
Overlay Networks (ONs) are logical networks built on top of a physical network with the aim of moving part of the routing complexity to the application layer. At the same time, sen...
Leonardo B. Oliveira, Antonio Alfredo Ferreira Lou...