Open Access Open Access  Restricted Access Subscription or Fee Access

The Analysis of CNFS Algorithm in Mobile Sensor Networks

S. Virushaba Doss, S. Raichal


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.


Neighbor First Search, Wireless, Flooding Algorithm, Robust, Peer-Peer

Full Text:



I. Abraham, D. Dolev, and D. Malkhi. LLS: a locality aware locationService for mobile ad hoc networks. In DIAL M-POMC 2004, Joint Workshop on Foundations of Mobile Computing, Oct. 2004.

C. Avin and C. Brito. Efficient and robust query processing in dynamicenvironments using random walk techniques. In Proc. of IPSN 2004.ACM press, 2004.

D. Braginsky and D. Estrin. Rumor routing algorithm for sensornetworks. In Proc. of the First Workshop on Sensor Networks andApplications (WSNA), pages 22-31. ACM Press, Oct. 2002.

I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributedanonymous information storage and retrieval system. Lecture Notes inComputer Science, 2009, 2001.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introductionto Algorithms (Second Edition), pages 581-599. The MIT Press, 2001.

M. Demirbas, T. Nolte, A. Arora, and N. Lynch. Stalk: A self-stabilizinghierarchical tracking service for sensor networks. Technical Report OSU-CISRC-4/03-TR19 Ohio State University, 2003.

H. Huang, J. H. Hartman, and T. Hurst. Data-centric routing in sensornetworks using biased walk. In Proc. of IEEE SECON 2006, Sept. 2006.

C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. InProc. of MobiCom 2000, Aug. 2000.

P. Jacquet, A. Laouiti, P. Minet, and L. Viennot. Performance ofmultipoint relaying in ad hoc mobile routing protocols. In Networking2002, pages 387-398, Pisa, Italy, 2002.

D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hocwireless networks. Mobile Computing(edited by T. Imielinski and H.Korth), 353, 1996.

X. Liu, Q. Huang, and Y. Zhang. Combs, needles, haystacks: Balancingpush and pull for discovery in large-scale sensor networks. In ACM Sensys 2004, Baltimore, MD, November 2004.

C. Perkins, E. Belding-Royer, and S. Das. Rfc 3561: Ad hoc on-demanddistance vector (aodv) routing, July 2003.

S.Ratnasamy, B. Karp, L.Yin, F. Yu, D.Estrin, R.Govindan, and S.Shenker.GHT: A geographic hash table for data-centric storage insensornets. In Proc. of ACM WSNA’02, Sept. 2002.

N. Sadagopan, B. Krishnamachari, and A. Helmy. Active query forwarding in sensor networks (ACQUIRE). In Proc. SNPA’03, May2003.

I. Stojmenovic, M. Russell, and B. Vukojevic. Depth first search andlocation based localized routing and qos routing in wireless networks.In Proc. of ICPP 2000, pages 173-180, August 2000.

W. B. H. Z. Cheng. Searching strategy for multi-target discovery inwireless networks. In Proc. of the 4th Workshop on Applications and Services in Wireless Networks, Aug. 2004.

Huilong Huang, John H. Hartman, Terril N.Hurst , Efficient and Robust Query Processing for Mobile Wireless sensor networks.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.