Sciweavers

641 search results - page 7 / 129
» Improved Bounds for Wireless Localization
Sort
View
PODC
2009
ACM
14 years 8 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
WIOPT
2011
IEEE
12 years 11 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
JCIT
2010
126views more  JCIT 2010»
13 years 2 months ago
An Improved DV-Hop Localization Algorithm based on The Selection of Beacon Nodes
In the trilateration of wireless sensor networks, to overcome the affection of localization error caused by the selection of beacon nodes, a selective strategy of beacon nodes bas...
Wen-yuan Liu, En-shuang Wang, Zi-jun Chen, Lin Wan...
CONEXT
2005
ACM
13 years 9 months ago
MRS: a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
Luigi Iannone, Serge Fdida
CP
2005
Springer
14 years 1 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich