Sciweavers

1265 search results - page 135 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 11 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
TWC
2008
201views more  TWC 2008»
13 years 9 months ago
A Novel Algorithm for Multipath Fingerprinting in Indoor WLAN Environments
Abstract--Positioning in indoor wireless environments is growing rapidly in importance and gains commercial interests in context-awareness applications. The essential challenge in ...
Shih-Hau Fang, Tsung-Nan Lin, Kun-Chou Lee
MOBIHOC
2004
ACM
14 years 8 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath
JCIT
2010
126views more  JCIT 2010»
13 years 3 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...
PDCAT
2005
Springer
14 years 2 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu