SPREADING CODE PROTOCOL ENABLING PROGRAMMABLE COMPLEXITY PERFORMANCE FOR CDMA LOCAL WIRELESS NETWORKS/

Citation
Hh. Chen et al., SPREADING CODE PROTOCOL ENABLING PROGRAMMABLE COMPLEXITY PERFORMANCE FOR CDMA LOCAL WIRELESS NETWORKS/, IEE proceedings. Communications, 144(6), 1997, pp. 395-401
Citations number
7
ISSN journal
13502425
Volume
144
Issue
6
Year of publication
1997
Pages
395 - 401
Database
ISI
SICI code
1350-2425(1997)144:6<395:SCPEPC>2.0.ZU;2-F
Abstract
The paper introduces a novel spreading code protocol, the adaptive gro up-receiver code protocol, offering flexibility and stability under va rying traffic conditions. In the protocol, terminals are divided into groups co-ordinated by central stations and a group-based receiver spr eading coding is used to manage the contention among users in the grou ps. The protocol can adaptively adjust the number of groups according to traffic load and throughput-delay requirements. The analytical resu lts show that the protocol is particularly befitting for the applicati ons in local wireless networks requiring high throughput and low acces s delay.