2279 search results - page 49 / 456 » Distributed Spectrum-Efficient Routing Algorithms in Wireles... |
139
Voted
MOBIHOC
2001
ACM
16 years 2 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
125
Voted
EWSN
2009
Springer
16 years 3 months ago
2009
Springer
The problem of configuration of Wireless Sensor Networks is an interesting challenge. The objective is to find the settings, for each sensor node, that optimise certain task-level ...
115
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
130
Voted
CISS
2007
IEEE
15 years 2 months ago
2007
IEEE
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
127
Voted
OPODIS
2010
15 years 13 days ago
2010
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...