Back to Search
Start Over
Reducing the Positional Error of Connectivity-Based Positioning Algorithms Through Cooperation Between Neighbors.
- Source :
- IEEE Transactions on Mobile Computing; Aug2014, Vol. 13 Issue 8, p1868-1882, 15p
- Publication Year :
- 2014
-
Abstract
- The information available to connectivity-based positioning algorithms is the radio range of sensor devices and the position estimates of neighbors and neighbors of neighbors. This information creates special graph theoretic structures which impose new constraints on the positions of sensor devices. The new constraints sometimes lead to a feasible set of positions with disconnected regions. These properties can be used to reduce the set of feasible positions for a node. In this paper, a new fully distributed positioning algorithm, called Orbit, which exploits these properties is presented for mobile sensor networks. The algorithm uses additional constraints and trims disconnected regions. These new constraints are generated through cooperation between neighbors. The performance of Orbit is examined for many communication and mobility models, including a probabilistic communication model generated from radio experiments. Computer simulation experiments demonstrate that Orbit outperforms a recently proposed positioning algorithm in terms of positional accuracy under different models with a wide range of parameter values. Orbit is implemented on resource limited sensor devices. This implementation demonstrates the feasibility of the algorithm for sensor devices. The algorithm is tested on deployments of the sensor devices in a field and the results are comparable to those from the simulation experiments. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15361233
- Volume :
- 13
- Issue :
- 8
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Mobile Computing
- Publication Type :
- Academic Journal
- Accession number :
- 97011043
- Full Text :
- https://doi.org/10.1109/TMC.2013.143