TY - JOUR
T1 - Novel group-based spreading code protocol
T2 - Hierarchy schedule sensing protocol for CDMA wireless networks
AU - Chen, Hsiao-Hwa
AU - Tea, W. T.
PY - 1999/1/1
Y1 - 1999/1/1
N2 - An efficient hierarchy schedule sensing (HSS) spreading code protocol is proposed for wireless DS/CDMA networks. It uses a central pilot frame to schedule request transmissions to avoid collisions. To reduce the scheduling time, hierarchical group-based spreading codes are employed. A two-dimensional continuous time Markov chain is used to model the behaviour of the HSS protocol. The performance is evaluated under various channel traffic loads. The results show that the HSS protocol offers a robust performance without much extra hardware cost if compared with conventional receiver-based spreading code protocols.
AB - An efficient hierarchy schedule sensing (HSS) spreading code protocol is proposed for wireless DS/CDMA networks. It uses a central pilot frame to schedule request transmissions to avoid collisions. To reduce the scheduling time, hierarchical group-based spreading codes are employed. A two-dimensional continuous time Markov chain is used to model the behaviour of the HSS protocol. The performance is evaluated under various channel traffic loads. The results show that the HSS protocol offers a robust performance without much extra hardware cost if compared with conventional receiver-based spreading code protocols.
UR - http://www.scopus.com/inward/record.url?scp=0032630015&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032630015&partnerID=8YFLogxK
U2 - 10.1049/ip-com:19990012
DO - 10.1049/ip-com:19990012
M3 - Article
AN - SCOPUS:0032630015
VL - 146
SP - 15
EP - 21
JO - IEE Proceedings: Communications
JF - IEE Proceedings: Communications
SN - 1350-2425
IS - 1
ER -