Abstract Views :147 |
PDF Views:2
Authors
Affiliations
1 Saraswathi Velu College of Engineering, Department of Computer Applications, Sholinghur, Tamilnadu, IN
2 Department of Computer Science, Saveetha University, Tamilnadu, IN
Source
Wireless Communication, Vol 5, No 5 (2013), Pagination: 229-233
Abstract
The introduction of mobile devices into wireless sensor network systems has attracted significant attention in recent years. Mobile devices can provide a bridging mechanism to connect geographically separated sensor networks, forming a global coverage sensing network. Closest Neighbor First Search (CNFS) algorithm has taken here for an efficient query processing for mobile sensor networks. It is a walk-based algorithm that is biased to visit nodes close to the source first which is accomplished by collecting topology information about the network. The mobility of a node causes some changes in the network topology that could otherwise cause the query to fail. Therefore CNFS requires fewer messages to process a query than flooding-based algorithms, while tolerating node mobility better than random walk-based algorithms. Its success rate is comparable to flooding-based algorithms in dense networks and slightly worse in sparse networks.
Keywords
Neighbor First Search, Wireless, Flooding Algorithm, Robust, Peer-Peer.
