Minimum-cost spanning tree as a path-finding problem
Information Processing Letters
The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
ACM Computing Surveys (CSUR)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Analytical model for optimizing periodic route maintenance in proactive routing for manets
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Journal of Parallel and Distributed Computing
Self-managing energy-efficient multicast support in MANETs under end-to-end reliability constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed computation of maximum lifetime spanning subgraphs in sensor networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
A new self-stabilizing minimum spanning tree construction with loop-free property
DISC'09 Proceedings of the 23rd international conference on Distributed computing
DISC'10 Proceedings of the 24th international conference on Distributed computing
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
About the self-stabilization of a virtual topology for self-organization in ad hoc networks
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Self-stabilizing consensus average algorithm in distributed sensor networks
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.00 |
We propose two distributed algorithms to maintain respectively the minimum weight spanning tree (MST) based multi-cast tree and the shortest path (SPST) multi-cast tree in a given ad hoc network for a given multi-cast group; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due to mobility of the hosts) and can readjust the multi-cast tree. Our approach is to use the paradigm of self-stabilization in distributed fault tolerance. We provide time complexity analysis of the algorithms in terms of the number of rounds needed for the algorithm to stabilize after a topology change, where a round is defined as a period of time in which each node in the system receives beacon messages from all its neighbors. In any ad hoc network, the participating nodes periodically transmit beacon messages for message transmission as well as to maintain the knowledge of the local topology at the node; as a result the nodes get the information about its neighbor nodes synchronously (at specific time intervals). Thus, the paradigm to analyze the complexity of the self-stabilizing algorithms in the context of ad hoc networks is very different from the traditional concept of adversary oracle used in proving the convergence and correctness of self-stabilizing distributed algorithms in general.