About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
2nd International IEEE Conference on Communication System Software and Middleware

Research Article

An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1109/COMSWA.2007.382575,
        author={Tehzeeb  Ahmed Abbasi and Ash  Mohammad Abbas},
        title={An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks},
        proceedings={2nd International IEEE Conference on Communication System Software and Middleware},
        publisher={IEEE},
        proceedings_a={COMSWARE},
        year={2007},
        month={7},
        keywords={Ad hoc networks  incremental protocols  maximal set  multipath routing  multiple route discoveries  node-disjoint  path diminution},
        doi={10.1109/COMSWA.2007.382575}
    }
    
  • Tehzeeb Ahmed Abbasi
    Ash Mohammad Abbas
    Year: 2007
    An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks
    COMSWARE
    IEEE
    DOI: 10.1109/COMSWA.2007.382575
Tehzeeb Ahmed Abbasi1, Ash Mohammad Abbas2
  • 1: Electrical Engineering Section University Polytechnic, Aligarh Muslim University, Aligarh - 202002, India.
  • 2: Department of Computer Engineering Zakir Husain College of Engineering and Technology, Aligarh Muslim University, Aligarh - 202002, India.

Abstract

Identifying a maximal set of node-disjoint paths between a given source and a destination is a challenging task in mobile ad hoc networks. One cannot guarantee to identify the maximal set of node-disjoint paths in a single sequence of request-reply cycle. However, one can guarantee to identify the maximal set of node-disjoint paths in multiple attempts and in an incremental fashion. One may combine a protocol that tries to identify multiple node-disjoint paths in a single go with an incremental approach. In this paper, we present an improved version of an incremental protocol that is guaranteed to discover the maximal set of node-disjoint paths between a given source and a destination. We have analytically shown that our approach requires less number of route discoveries than that required by the existing incremental protocol. We have also discussed the scalability of the proposed approach.

Keywords
Ad hoc networks incremental protocols maximal set multipath routing multiple route discoveries node-disjoint path diminution
Published
2007-07-09
Publisher
IEEE
Modified
2011-07-24
http://dx.doi.org/10.1109/COMSWA.2007.382575
Copyright © 2007–2025 IEEE
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL