Identifying Node Falls In Mobile Wireless Networks: A Probabilistic Method

Talla Soni Priya, P Padmaja, M. Veerabhadra Rao


We adopt a probabilistic strategy and propose two node failure discovery plots that deliberately join restricted monitoring, area estimation and node  joint effort. Broad reproduction brings about both associated and detached network s exhibit that our plans accomplish high failure identification rates (near an upper bound) and low false positive rates, and bring about low correspondence overhead. Contrasted with approaches that utilization incorporated checking, our approach has up to 80% lower correspondence overhead, and just marginally bring down location rates and somewhat higher false positive rates. Moreover, our approach has the favorable position that it is relevant to both associated and disengaged network s while brought together checking is just material to associated networks.



R. Badonnel, R. State, and O. Festor.Self-configurable fault monitoring in ad-hoc networks. Ad Hoc Networks, 6(3):458–473, May 2008.

P. Bahl and V. N. Padmanabhan. RADAR: An in-building RF-based user location and tracking network .In Proc. of IEEE INFOCOM, 2000.

Y. Bar-Shalom, T. Kirubarajan, and X.-R. Li. Estimation with Applications to Tracking and Navigation. John Wiley & Sons, Inc., 2002.

D. Ben Khedher, R. Glitho, and R. Dssouli. A Novel Overlay-Based Failure Detection Architecture for MANET Applications. In IEEE International Conference on Networks, pages 130–135, 2007.

C. Bettstetter. Smooth is Better than Sharp: A Random Mobility Model for Simulation of Wireless Networks. In Proc. of ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Network s, pages 19–27, New York, NY, USA, 2001. ACM.

C. Bettstetter. Topology Properties of Ad Hoc Networks with Random Waypoint Mobility. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3):50–52, 2003.

J. Broch, D. A. Maltz, D. B. Johnson, Y.-C.Hu, and J. Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad hoc Network Routing Protocols. In Proc. of MobiCom, pages 85–97, New York, NY, USA, 1998. ACM.

T. D. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Network s. Journal of the ACM, 43:225–267, 1996.

I. Constandache, R. R. Choudhury, and I. Rhee. Towards Mobile Phone, Localization without War-Driving. In Proc. of IEEE INFOCOM, March 2010.

K. Dantu, M. H. Rahimi, H. Shah, S. Babel, A. Dhariwal, and G. S. Sukhatme.Robomote: enabling mobility in sensor networks. In Proc. of IEEE/ACM IPSN, 2005.

M. Elhadef and A. Boukerche.A Failure Detection Service for Large-Scale Dependable Wireless Ad-Hoc and Sensor Networks. In International Conference on Availability, Reliability and Security, pages 182–189, 2007.

K. Fall. A delay-tolerant network architecture for challenged internets. In Proc. of ACM SIGCOMM, pages 27–34. ACM, 2003.

I. Gupta, T. D. Chandra, and G. S. Goldszmidt. On Scalable and Efficient Distributed Failure Detectors. In Proc. of ACM symposium on Principles of distributed computing (PODC), pages 170–179, 2001.

C.-F. Hsin and M. Liu.A Distributed Monitoring Mechanism for Wireless Sensor Networks.In Proc. of ACM WiSe, December 2002.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at