Sciweavers

5901 search results - page 822 / 1181
» Algorithms for Wireless Sensor Networks
Sort
View
WDAG
2010
Springer
158views Algorithms» more  WDAG 2010»
15 years 2 months ago
Distributed Contention Resolution in Wireless Networks
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
Thomas Kesselheim, Berthold Vöcking
MOBIHOC
2003
ACM
16 years 4 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
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 10 months ago
A Stochastic Framework for Scheduling in Wireless Packet Access Networks
— We put forth a unified framework for downlink and uplink scheduling of multiple connections with diverse qualityof-service requirements, where each connection transmits using ...
Xin Wang, Georgios B. Giannakis
ATAL
2003
Springer
15 years 8 months ago
Analyzing the efficiency of strategies for MAS-based sensor interpretation and diagnosis
One of the factors holding back the application of multiagent, distributed approaches to large-scale sensor interpretation and diagnosis problems is the lack of good techniques fo...
Norman Carver, Ruj Akavipat
INFOCOM
2007
IEEE
15 years 10 months ago
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
Fenghui Zhang, Hao Li, Anxiao Jiang, Jianer Chen, ...