Outage Capacity and Code Design for Dying Channels
| dc.contributor | Cui, Shuguang | |
| dc.creator | Zeng, Meng | |
| dc.date.accessioned | 2012-10-19T15:28:35Z | |
| dc.date.accessioned | 2012-10-22T18:00:07Z | |
| dc.date.accessioned | 2017-04-07T20:00:38Z | |
| dc.date.available | 2012-10-19T15:28:35Z | |
| dc.date.available | 2012-10-22T18:00:07Z | |
| dc.date.available | 2017-04-07T20:00:38Z | |
| dc.date.created | 2011-08 | |
| dc.date.issued | 2012-10-19 | |
| dc.description.abstract | In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such circumstances, it is critical to quantify how fast and reliably the information can be collected over attacked links. For a single point-to-point channel subject to a random attack, named as a dying channel, we model it as a block-fading (BF) channel with a finite and random channel length. First, we study the outage probability when the coding length K is fixed and uniform power allocation is assumed. Furthermore, we discuss the optimization over K and the power allocation vector PK to minimize the outage probability. In addition, we extend the single point to-point dying channel case to the parallel multi-channel case where each sub-channel is a dying channel, and investigate the corresponding asymptotic behavior of the overall outage probability with two different attack models: the independent-attack case and the m-dependent-attack case. It can be shown that the overall outage probability diminishes to zero for both cases as the number of sub-channels increases if the rate per unit cost is less than a certain threshold. The outage exponents are also studied to reveal how fast the outage probability improves over the number of sub-channels. Besides the information-theoretical results, we also study a practical coding scheme for the dying binary erasure channel (DBEC), which is a binary erasure channel (BEC) subject to a random fatal failure. We consider the rateless codes and optimize the degree distribution to maximize the average recovery probability. In particular, we first study the upper bound of the average recovery probability, based on which we define the objective function as the gap between the upper bound and the average recovery probability achieved by a particular degree distribution. We then seek the optimal degree distribution by minimizing the objective function. A simple and heuristic approach is also proposed to provide a suboptimal but good degree distribution. | |
| dc.identifier.uri | http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-9757 | |
| dc.language.iso | en_US | |
| dc.subject | Block Fading Channels | |
| dc.subject | Convex Optimizations | |
| dc.subject | Dying Channels | |
| dc.subject | Outage Capacity | |
| dc.subject | Rateless Codes | |
| dc.title | Outage Capacity and Code Design for Dying Channels | |
| dc.type | Thesis |