Skip to main content
SpringerLink
Log in

Controlling Node Failure Localization in Data Networks Using Probing Mechanisms

  • Conference paper
  • First Online:
Micro-Electronics and Telecommunication Engineering (ICMETE 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 373))

  • 840 Accesses

Abstract

In this paper, we prospect the potency of node failure localization in network communication from dual states (normal/fizzle) of the source to destination paths. To localize the failure nodes individually in the scheduled nodes, dissimilar path states must connect with various events of failure nodes. But, this situation is inapplicable or not easier to investigate or apply on enormous networks due to the obligation of any viable failure nodes. This objective is to deploy the set of adequate conditions for recognizing a set of failures in a set of arbitrary nodes which can be verified in a stipulated time. To avoid the above situation, probing mechanisms are assimilated additionally as a combination for network topology and locations of scrutinizes. Three probing mechanisms are considering which vary depending on measurement paths. Both the procedures can be transformed into single-node possessions by which they can be calculated effectively based on the given conditions. The exceeding measures are proposed for measuring the potency of failure localization which can be utilized for assessing the effect of different factors, which comprises topology, total monitors, and probing mechanisms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hagihara R, Shinohara M, Hara T, Nishio S (2009) A message processing method for top-k query for traffic reduction in ad hoc networks. In: Proceedings MDM, pp 11–20

    Google Scholar 

  2. Amagata D, Sasaki Y, Hara T, Nishio S (2013) A robust routing method for top-k queries processing in mobile ad hoc networks. In: Proceedings MDM, pp 251–256

    Google Scholar 

  3. Liu K, Deng J, Varshney PK, Balakrishnan K (2007) An acknowledgement-based approach for the detection of routing misbehavior in MANETs. IEEE Trans Mobile Comput 6(5):536–550

    Article  Google Scholar 

  4. Sasaki Y, Hara T, Nishio S (2011) Two-phase top-k query processing in mobile ad hoc networks. In: Proceedings NBiS, pp 42–49

    Google Scholar 

  5. Yu C-M, Ni G-K, Chen I-Y, Gelenbe E, Kuo S-Y (2014) Top-k query result completeness verification in tiered sensor networks. IEEE Trans Inf Forensics Secur 9(1):109–124

    Article  Google Scholar 

  6. Zhang R, Shi J, Liu Y, Zhang Y (2010) Verifiable fine-grained top-k queries in tiered sensor networks. In: Proceedings INFOCOM, pp 1–9

    Google Scholar 

  7. Chen B, Liang W, Zhou R, Yu JX (2010) Energy-efficient top-k query processing in wireless sensor networks. In: Proceedings CIKM, pp 329–338

    Google Scholar 

  8. Lee SJ, Gerla M (2001) Spilt multipath routing with maximally disjoint paths in ad hoc networks. In: Proceedings ICC, vol 10, pp 3201–3205

    Google Scholar 

  9. Tsuda T, Komai Y, Sasaki Y, Hara T, Nishio S (2014) Top-k query processing and malicious node identification against data replacement attack in MANETS. In: Proceedings MDM, pp 279–288

    Google Scholar 

  10. Samanta D et al Cipher block chaining support vector machine for secured decentralized cloud enabled intelligent IoT architecture. IEEE Access. https://doi.org/10.1109/ACCESS.2021.3095297@SCI-Q1

  11. Guha A, Samanta D, Banerjee A, Agarwal D (2021) A deep learning model for information loss prevention from multi-page digital documents. IEEE Access 9:80451–80465. https://doi.org/10.1109/ACCESS.2021.3084841.@SCI-Q1

    Article  Google Scholar 

  12. Mekala MS, Patan R, Islam SKH, Samanta D, Mallah GA, Chaudhry SA (2021) DAWM: cost-aware asset claim analysis approach on big data analytic computation model for cloud data centre. Secur Commun Netw. Article ID 6688162, 16 pages. https://doi.org/10.1155/2021/6688162. @SCI-Q2

  13. Samanta D, Karthikeyan MP, Banerjee A, Inokawa H (2021) Tunable graphene nano-patch antenna design for on-chip integrated terahertz detector arrays with potential application in cancer imagining. Nanomedicine, nnm-2020-0386. ISSN:1743-5889. https://doi.org/10.2217/nnm-2020-0386 @ SCI

  14. Biswal AK, Singh D, Pattanayak BK, Samanta D, Yang M-H (2021) IoT-based smart alert system for drowsy driver detection. Wireless Commun Mob Comput. Article ID 6627217, 13 pages. https://doi.org/10.1155/2021/6627217 @ SCI

  15. Maheswari M, Geetha S, Selva Kumar S, Karuppiah M, Samanta D, Park Y PEVRM: probabilistic evolution based version recommendation model for mobile applications. IEEE Access. https://doi.org/10.1109/ACCESS.2021.3053583 @ SCI

  16. Sasaki Y, Hagihara R, Hara T, Shinohara M, Nishio S (2010) A top-k query method by estimating score distribution in mobile ad hoc networks. In: Proceedings DMWPC, pp 944–949

    Google Scholar 

  17. Malhotra B, Nascimento MA, Nikolaidis I (2011) Exact top-k queries in wireless sensor networks. IEEE Trans Knowl Data Eng 23(10):1513–1525

    Google Scholar 

  18. Wu M, Xu J, Tang X, Lee WC (2007) Top-k monitoring in wire-less sensor networks. IEEE Trans Knowl Data Eng 19(7):962–976

    Google Scholar 

  19. Hu Y-C, Johnson DB, Perrig A (2003) SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Netw 1(1):175–192

    Google Scholar 

  20. Liu X, Xu J, Lee WC (2010) A cross pruning framework for top-kdata collection in wireless sensor networks. In: Proceedings MDM, pp 157–166

    Google Scholar 

  21. Kurosawa S, Nakayama H, Kato N, Jamalipour A, Nemoto Y (2007) Detecting blackhole attack on AODV-based mobile ad hoc networks bydynamic learning method. Int J Netw Secur 5(3):338–346

    Google Scholar 

  22. Chan H, Perrig A, Song D (2006) Secure hierarchical in-network aggregation in sensor networks. In: Proceedings CCS, pp 278–287

    Google Scholar 

  23. Chen S, Zhang Y, Liu Q, Feng J (2012) Dealing with dishonest recommendation: the trials in reputation management court. Ad Hoc Netw 10(8):1603–1618

    Article  Google Scholar 

  24. Dewan P, Dasgupta P (2010) P2P reputation management using distributed identities and decentralized recommendation chains. IEEE Trans Knowl Data Eng 22(7):1000–1013

    Article  Google Scholar 

  25. Buchegger S, Le Boudec J-Y (2002) Performance analysis of the CONFIDANT protocol. In: Proceedings MobiHoc, pp 226–236

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. S. V. Degree & P. G. College, Anantapur, Andhra Pradesh, India

    K. Saritha

  2. Department of CSE, K.S. R. M College of Engineering, Kadapa, Andhra Pradesh, India

    Bingi Manorama Devi

  3. Department of Computer Science, SoS, GITAM (Deemed to be University), Hyderabad, Telangana, India

    Muralidhar Kurni

  4. Department of Computer Science, CHRIST Deemed to be University, Bengaluru, India

    Debabrata Samanta & Niju P. Joseph

Authors
  1. K. Saritha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bingi Manorama Devi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Muralidhar Kurni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Debabrata Samanta
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Niju P. Joseph
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronics and Communication Engineering, SRM Institute of Science and Technology, Ghaziabad, India

    Devendra Kumar Sharma

  2. National Taipei University of Business, Taipei, Taiwan

    Sheng-Lung Peng

  3. Department of Electronics and Communication Engineering, SRM Institute of Science and Technology, Ghaziabad, India

    Rohit Sharma

  4. Odessa State Environmental University, Odessa, Ukraine

    Dmitry A. Zaitsev

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Saritha, K., Devi, B.M., Kurni, M., Samanta, D., Joseph, N.P. (2022). Controlling Node Failure Localization in Data Networks Using Probing Mechanisms. In: Sharma, D.K., Peng, SL., Sharma, R., Zaitsev, D.A. (eds) Micro-Electronics and Telecommunication Engineering . ICMETE 2021. Lecture Notes in Networks and Systems, vol 373. Springer, Singapore. https://doi.org/10.1007/978-981-16-8721-1_32

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-8721-1_32

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-8720-4

  • Online ISBN: 978-981-16-8721-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation