Optimal Information-Dispersal for Fault-Tolerant Communication over a Burst-Error Channel

Shiuhpyng Shieh; Yea Ching Tsai; Yu-Lun Huang

doi:10.1109/TR.2003.820498

Optimal Information-Dispersal for Fault-Tolerant Communication over a Burst-Error Channel

Shiuhpyng Shieh^*, Yea Ching Tsai, Yu-Lun Huang

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

The (m, n) wireless information dispersal scheme (WIDS) is useful for fault-tolerant parallel wireless communications, where it can be used to tolerate up to n - m path (subchannel) failures. This paper constructs a performance model of (m, n) WIDS used in wireless communications, and proposes an algorithm to find the optimal set of (m, n) with the highest reliability. This algorithm reduces the complexity of finding the candidate set of (m, n) from O(N²) to O(N); N is the maximum number of available sub-channels.

Original language	English
Pages (from-to)	354-366
Number of pages	13
Journal	IEEE Transactions on Reliability
Volume	52
Issue number	3
DOIs	https://doi.org/10.1109/TR.2003.820498
State	Published - 1 Sep 2003

Keywords

Fault tolerance
Security
Threshold scheme
Wireless communications

Access to Document

10.1109/TR.2003.820498

Cite this

@article{1f56383d3ab74ef6803ca3012e00ee09,

title = "Optimal Information-Dispersal for Fault-Tolerant Communication over a Burst-Error Channel",

abstract = "The (m, n) wireless information dispersal scheme (WIDS) is useful for fault-tolerant parallel wireless communications, where it can be used to tolerate up to n - m path (subchannel) failures. This paper constructs a performance model of (m, n) WIDS used in wireless communications, and proposes an algorithm to find the optimal set of (m, n) with the highest reliability. This algorithm reduces the complexity of finding the candidate set of (m, n) from O(N2) to O(N); N is the maximum number of available sub-channels.",

keywords = "Fault tolerance, Security, Threshold scheme, Wireless communications",

author = "Shiuhpyng Shieh and Tsai, {Yea Ching} and Yu-Lun Huang",

year = "2003",

month = sep,

day = "1",

doi = "10.1109/TR.2003.820498",

language = "English",

volume = "52",

pages = "354--366",

journal = "IEEE Transactions on Reliability",

issn = "0018-9529",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Optimal Information-Dispersal for Fault-Tolerant Communication over a Burst-Error Channel

AU - Shieh, Shiuhpyng

AU - Tsai, Yea Ching

AU - Huang, Yu-Lun

PY - 2003/9/1

Y1 - 2003/9/1

N2 - The (m, n) wireless information dispersal scheme (WIDS) is useful for fault-tolerant parallel wireless communications, where it can be used to tolerate up to n - m path (subchannel) failures. This paper constructs a performance model of (m, n) WIDS used in wireless communications, and proposes an algorithm to find the optimal set of (m, n) with the highest reliability. This algorithm reduces the complexity of finding the candidate set of (m, n) from O(N2) to O(N); N is the maximum number of available sub-channels.

AB - The (m, n) wireless information dispersal scheme (WIDS) is useful for fault-tolerant parallel wireless communications, where it can be used to tolerate up to n - m path (subchannel) failures. This paper constructs a performance model of (m, n) WIDS used in wireless communications, and proposes an algorithm to find the optimal set of (m, n) with the highest reliability. This algorithm reduces the complexity of finding the candidate set of (m, n) from O(N2) to O(N); N is the maximum number of available sub-channels.

KW - Fault tolerance

KW - Security

KW - Threshold scheme

KW - Wireless communications

UR - http://www.scopus.com/inward/record.url?scp=0347603319&partnerID=8YFLogxK

U2 - 10.1109/TR.2003.820498

DO - 10.1109/TR.2003.820498

M3 - Article

AN - SCOPUS:0347603319

SN - 0018-9529

VL - 52

SP - 354

EP - 366

JO - IEEE Transactions on Reliability

JF - IEEE Transactions on Reliability

IS - 3

ER -

Optimal Information-Dispersal for Fault-Tolerant Communication over a Burst-Error Channel

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this