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 ...
Abstract--Positioning in indoor wireless environments is growing rapidly in importance and gains commercial interests in context-awareness applications. The essential challenge in ...
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...
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...
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...