Finding the geographical location of the sensors is the most common problem associated with the Wireless sensor networks. The Sequential Monte Carlo Localization (SMCL) algorithm is the base for most of the localization algorithms proposed. These localization algorithms requires high seed node density and they also suffers from low sampling efficiency. There are some papers which solves this problems but they are not energy efficient. Another approach The Monte Carlo Localization Boxed (MCB) method was used to reduce the scope of searching the candidate samples and thus reduces the time for finding the set of valid samples. In this paper we have proposed an energy efficient approach which will consider the direction of movement and the speed of acceleration of the sensor nodes. This additional information will help in further reducing the scope of searching the candidate samples. The valid samples will have more accurate location information and they are less likely to be filtered in the filtering step of SMCL. Thus it reduces the number of iterations the algorithm needs and hence achieves high localization accuracy in less time as compared to traditional SMCL and MCB.
分享
引用
