Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks

Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and excessive broadcast redundancy. In this paper a new problem, called "k-fold cover t- set" (for short, k-fold cove...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008) p. 494DoinaBein
Main Author Bein, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2008
Subjects
Broadcasting
Computer crashes
Energy consumption
Fault tolerance
Fault tolerant systems
Redundancy
Routing
Spine
Wireless communication
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and excessive broadcast redundancy. In this paper a new problem, called "k-fold cover t- set" (for short, k-fold cover), is proposed: we select a smaller set of nodes than the k-fold dominating set, to act as alternative routers for messages in the network. An advantage of the k-fold cover is that it can be defined for graphs where the k-fold dominating set cannot be defined. Computing the minimum size k-fold cover for any k ges 1 is NP-complete. Two approximation algorithms for the k-fold cover problem are proposed: one uses a greedy approach to compute the cover and the other uses randomization.
ISSN:1530-1605
2572-6862
DOI:10.1109/HICSS.2008.170