Sciweavers

641 search results - page 39 / 129
» Improved Bounds for Wireless Localization
Sort
View
WCNC
2008
IEEE
14 years 2 months ago
A Collaborative Quasi-Linear Programming Framework for Ad Hoc Sensor Localization
—In this paper, we propose a collaborative localization scheme which utilizes, in addition to the range estimates to nodes with known locations (anchors), the range estimates bet...
Tao Jia, R. Michael Buehrer
ISCA
1992
IEEE
123views Hardware» more  ISCA 1992»
13 years 11 months ago
The Impact of Communication Locality on Large-Scale Multiprocessor Performance
As multiprocessor sizes scale and computer architects turn to interconnection networks with non-uniform communication latencies, the lure of exploiting communication locality to i...
Kirk L. Johnson
EVOW
2007
Springer
14 years 1 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
TMC
2010
138views more  TMC 2010»
13 years 6 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
ICC
2009
IEEE
111views Communications» more  ICC 2009»
14 years 2 months ago
A Study of the Percolation Threshold for k-Collaborative Wireless Networks
—How to efficiently use the air interface is a crucial issue in wireless networks. In order to improve the performance, mechanisms have been proposed to improve the reach and th...
Cédric Westphal