Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19] [ 20] [ 21]

@

Journal of Information Science and Engineering, Vol. 31 No. 3, pp. 879-896 (May 2015)


Neighbor-based Hop Size Estimation for Dense Sensor Networks


GUANING CHEN1, YAN-LING CHU2 AND MIN-TE SUN3
1Department of Information Management
Kainan University
Taoyuan, 338 Taiwan
2Department of Software Engineering
National Central University
Taoyuan, 320 Taiwan
3Department of Computer Science and Information Engineering
National Central University
Taoyuan, 320 Taiwan

Location information is crucial for many applications in wireless sensor networks. Many types of localization algorithms have been proposed in the literature. Off-shelf sensors equipped with no specialized hardware are inexpensive and have made rangefree localization schemes the most practical, especially in a large-scale sensor network. However, the range-free schemes have seldom considered the impact of the local neighborhood, the number of neighbors, or estimation of the communication hop distance of a node. In this paper, we use the local neighborhood to define the communication hop distance, called the single hop size (SHS), of a node. In addition, we propose a novel correction scheme, called SCS (SHS correction scheme), for multi-hop range-free localization. Compared to other range-free methods, SCS significantly reduces errors in position determination, even when the number of anchor nodes is low.

Keywords: hop size, local neighborhood, localization, range-free, wireless sensor networks

Full Text () Retrieve PDF document (201505_07.pdf)

Received December 6, 2013; revised May 31, 2014; accepted August 15, 2014.
Communicated by Xiaohong Jiang.