Sciweavers

651 search results - page 112 / 131
» Cartesian Ad Hoc Routing Protocols
Sort
View
MOBIHOC
2003
ACM
14 years 7 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
EVOW
2009
Springer
14 years 2 months ago
Wireless Communications for Distributed Navigation in Robot Swarms
We consider a swarm of robots equipped with an infrared range and bearing device that is able both to make estimates of the relative distance and angle between two robots in line-o...
Gianni A. Di Caro, Frederick Ducatelle, Luca Maria...
ENTCS
2007
131views more  ENTCS 2007»
13 years 7 months ago
Secure Node Discovery in Ad-hoc Networks and Applications
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
Giovanni Di Crescenzo
AINA
2007
IEEE
14 years 1 months ago
Power and Delay Analysis of The WEAC Protocol Based MANET Under Video Transport
Abstract— Transporting video over wireless networks has twofold constraints. Not only should it satisfy delay requirements but power minimization and QoS issues should be handled...
Hafiz M. Asif, Tarek R. Sheltami
MOBIHOC
2004
ACM
14 years 7 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...