Show simple item record

dc.contributor.advisorTummala, Murali
dc.contributor.authorUziel, Amir
dc.dateJune 1998
dc.date.accessioned2012-08-09T19:18:35Z
dc.date.available2012-08-09T19:18:35Z
dc.date.issued1998-06-01
dc.identifier.urihttp://hdl.handle.net/10945/8074
dc.descriptionApproved for public release; distribution is unlimiteden_US
dc.description.abstractThis work addresses issues related to the design and performance of a wireless integrated services network with emphasis on a tactical framework. We propose an asynchronous transfer mode (ATM)-like protocol architecture for the mobile network, which is an extension of schemes proposed in the literature. A medium-access-control (MAC) scheme, based on slot reservation by the remotes, is proposed for the network. Traffic models for low-bit-rate applications, suitable for low-capacity channels, such as a multiple-access (macro cell) wireless network, are presented. New bi-directional speech-conversation and bursty data models are proposed. The issue of scheduling in wireline integrated services networks is thoroughly addressed and new algorithms are proposed. An analytical scheme to obtain the required (static) capacity for homogeneous sources based on their Markov-chain characterization is provided. A necessary condition for optimality of a scheduling algorithm is the balance of cell-loss-probability (CLP) ratios to values approaching 1 from below, on the boundary of the admissible region. The balanced-CLP-ratio (BCLPR) algorithm satisfies this condition but ignores the deadlines of the cells. The shortest time to extinction (STE) with BCLPR (STEBR) algorithm, proposed here for the first time, utilizes the earliest-deadline- first concept while satisfying the necessary condition. A proof is provided to show that the STEBR decisions are optimal at each service slot given that no information about future traffic arrivals is available. Simulation results indicate that STEBR admits more sources and yields larger normalized channel throughput (by up to 4%) than STE.en_US
dc.description.urihttp://www.archive.org/details/channelallocatio00uzie
dc.format.extentxxviii, 318 p.en_US
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate School, 1998.en_US
dc.rightsCopyright is reserved by the copyright owneren_US
dc.titleChannel allocation in wireless integrated services networks for low-bit-rate applicationsen_US
dc.typeThesisen_US
dc.contributor.corporateNaval Postgraduate School
dc.contributor.departmentDepartment of Electrical and Computer Engineering
dc.subject.authorB-ISDNen_US
dc.subject.authorATMen_US
dc.subject.authorMACen_US
dc.subject.authorSchedulingen_US
dc.subject.authorChannel allocationen_US
dc.subject.authorMobile networksen_US
dc.subject.authorLow-bit-rates source modelsen_US
dc.description.serviceMajor, Israeli Armyen_US
etd.thesisdegree.namePh.D. in Electrical Engineeringen_US
etd.thesisdegree.levelDoctoralen_US
etd.thesisdegree.disciplineElectrical Engineeringen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record