Close category search window
 

Building Reliable and Fault Resilient Mobile Ad Hoc Networks

Full text access may be available

To access full text, please use your member or institutional sign in.


This paper appears in:
Signal Processing, Communications and Networking, 2008. ICSCN '08. International Conference on
Date of Conference: 4-6 Jan. 2008
Author(s): Vipin, M.
Anna Univ., Chennai
Sankar, K. ;  Sarad, A.V.
Page(s): 264 - 268
Product Type: Conference Publications

Available Formats Non-Member Price Member Price
US$31.00 US$10.00
Learn how you can qualify for the best price for the item!
  • Email
  • Print
  • Rights And Permissions

Abstract

The nodes in a mobile ad hoc network (MANET) have limited processing power, memory and transmission range. The mobile nodes may dynamically enter or leave the ad hoc network. To improve the resilience of the ad-hoc networks to mobility, node and link failure, we propose an algorithm involving binary trees and a special form of cycles in the network graph subject to constraints in topology and use this information to re-route packets from source to destination when interconnecting links or nodes fail.

Index Terms

Index Terms are available to subscribers and IEEE members.

 





Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A non-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2012 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.