Name
Abstract | ||
|---|---|---|
In this paper a weighted Fastmap (WFM) algorithm is proposed in which more than one pair of anchor nodes is used to evaluate the one-dimensional coordinates of the unknown nodes while in the original Fastmap (FM) algorithm only one pair of anchor nodes was employed. However, some nodes might be too far from the anchor nodes thus resulting in a high coordinate estimation error. This motivates the use of the WFM but at a slight increase in the computational complexity. The optimal WFM weights were determined via (constrained) minimization of the mean-squared error (MSE) of the estimated node coordinates. A simplification of the WFM is also introduced, called the averaged FM (AFM), where the complexity is reduced at the expense of the WFM performance. Both the WFM and AFM exhibit improved performance over the original FM algorithm. |
Year | Venue | Keywords |
|---|---|---|
2011 | Barcelona | computational complexity,sensor placement,wireless sensor networks,afm,mse,wfm algorithm,anchor nodes,averaged fm algorithm,high coordinate estimation error,mean-squared error minimization,node coordinates,one-dimensional coordinates,weighted fastmap algorithm,wireless sensor node localization,noise,wireless communication,frequency modulation,algorithm design and analysis |
Field | DocType | ISSN |
Wireless,Algorithm design,Atomic force microscopy,Computer science,Algorithm,Minification,Frequency modulation,Wireless sensor network,Signal processing algorithms,Computational complexity theory | Conference | 2076-1465 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Waleed Saif | 1 | 16 | 1.22 |
| Desmond C. McLernon | 2 | 161 | 15.18 |
| Mounir Ghogho | 3 | 1072 | 113.80 |