### Abstract

In this paper, we consider a time-slotted DS-CDMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate non-real-time packet data and transmit, subject to constraints on the average energy consumed per packet transmission, in a random access fashion over a common broadband channel to the access point using different spreading codes. As in narrowband ALOHA systems, the performance of random access spread spectrum networks can be severely hampered due to saturation effects caused by inherent bistable behavior. We study the effect of dynamic spreading gain control on the stability and throughput properties of the network. We first impose no energy constraints and provide an optimal (throughput maximizing) algorithm under which (i) the asymptotically optimal retransmission probability is equal to one, and (ii) the optimal spreading gain increases linearly as the MAI level increases, or equivalently, the transmission rate decreases inverse linearly as the MAI level increases. We also obtain a simple closed-form expression for the asymptotic throughput as the number of backlogged terminals becomes large. We then impose energy constraints and modify the optimal algorithm by controlling both the spreading gain and retransmission probability of the terminals. The resulting algorithm may or may not eliminate bistability; however, in either case, it achieves high throughput.

Original language | English |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM |

Publisher | IEEE |

Pages | 556-563 |

Number of pages | 8 |

Volume | 2 |

Publication status | Published - 1998 |

Externally published | Yes |

Event | Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA Duration: 1998 Mar 29 → 1998 Apr 2 |

### Other

Other | Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) |
---|---|

City | San Francisco, CA, USA |

Period | 98/3/29 → 98/4/2 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE INFOCOM*(Vol. 2, pp. 556-563). IEEE.

**Adaptive resource management for DS-CDMA networks subject to energy constraints.** / Oh, Seong-Jun; Wasserman, Kimberly M.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - IEEE INFOCOM.*vol. 2, IEEE, pp. 556-563, Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3), San Francisco, CA, USA, 98/3/29.

}

TY - GEN

T1 - Adaptive resource management for DS-CDMA networks subject to energy constraints

AU - Oh, Seong-Jun

AU - Wasserman, Kimberly M.

PY - 1998

Y1 - 1998

N2 - In this paper, we consider a time-slotted DS-CDMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate non-real-time packet data and transmit, subject to constraints on the average energy consumed per packet transmission, in a random access fashion over a common broadband channel to the access point using different spreading codes. As in narrowband ALOHA systems, the performance of random access spread spectrum networks can be severely hampered due to saturation effects caused by inherent bistable behavior. We study the effect of dynamic spreading gain control on the stability and throughput properties of the network. We first impose no energy constraints and provide an optimal (throughput maximizing) algorithm under which (i) the asymptotically optimal retransmission probability is equal to one, and (ii) the optimal spreading gain increases linearly as the MAI level increases, or equivalently, the transmission rate decreases inverse linearly as the MAI level increases. We also obtain a simple closed-form expression for the asymptotic throughput as the number of backlogged terminals becomes large. We then impose energy constraints and modify the optimal algorithm by controlling both the spreading gain and retransmission probability of the terminals. The resulting algorithm may or may not eliminate bistability; however, in either case, it achieves high throughput.

AB - In this paper, we consider a time-slotted DS-CDMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate non-real-time packet data and transmit, subject to constraints on the average energy consumed per packet transmission, in a random access fashion over a common broadband channel to the access point using different spreading codes. As in narrowband ALOHA systems, the performance of random access spread spectrum networks can be severely hampered due to saturation effects caused by inherent bistable behavior. We study the effect of dynamic spreading gain control on the stability and throughput properties of the network. We first impose no energy constraints and provide an optimal (throughput maximizing) algorithm under which (i) the asymptotically optimal retransmission probability is equal to one, and (ii) the optimal spreading gain increases linearly as the MAI level increases, or equivalently, the transmission rate decreases inverse linearly as the MAI level increases. We also obtain a simple closed-form expression for the asymptotic throughput as the number of backlogged terminals becomes large. We then impose energy constraints and modify the optimal algorithm by controlling both the spreading gain and retransmission probability of the terminals. The resulting algorithm may or may not eliminate bistability; however, in either case, it achieves high throughput.

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

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

M3 - Conference contribution

VL - 2

SP - 556

EP - 563

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -