Share Email Print

Proceedings Paper

A novel PON based UMTS broadband wireless access network architecture with an algorithm to guarantee end to end QoS
Author(s): Ajaz Sana; Shahab Hussain; Mohammed A. Ali; Samir Ahmed
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper we proposes a novel Passive Optical Network (PON) based broadband wireless access network architecture to provide multimedia services (video telephony, video streaming, mobile TV, mobile emails etc) to mobile users. In the conventional wireless access networks, the base stations (Node B) and Radio Network Controllers (RNC) are connected by point to point T1/E1 lines (Iub interface). The T1/E1 lines are expensive and add up to operating costs. Also the resources (transceivers and T1/E1) are designed for peak hours traffic, so most of the time the dedicated resources are idle and wasted. Further more the T1/E1 lines are not capable of supporting bandwidth (BW) required by next generation wireless multimedia services proposed by High Speed Packet Access (HSPA, Rel.5) for Universal Mobile Telecommunications System (UMTS) and Evolution Data only (EV-DO) for Code Division Multiple Access 2000 (CDMA2000). The proposed PON based back haul can provide Giga bit data rates and Iub interface can be dynamically shared by Node Bs. The BW is dynamically allocated and the unused BW from lightly loaded Node Bs is assigned to heavily loaded Node Bs. We also propose a novel algorithm to provide end to end Quality of Service (QoS) (between RNC and user equipment).The algorithm provides QoS bounds in the wired domain as well as in wireless domain with compensation for wireless link errors. Because of the air interface there can be certain times when the user equipment (UE) is unable to communicate with Node B (usually referred to as link error). Since the link errors are bursty and location dependent. For a proposed approach, the scheduler at the Node B maps priorities and weights for QoS into wireless MAC. The compensations for errored links is provided by the swapping of services between the active users and the user data is divided into flows, with flows allowed to lag or lead. The algorithm guarantees (1)delay and throughput for error-free flows,(2)short term fairness among error-free flows,(3)long term fairness among errored and error-free flows,(4)graceful degradation for leading flows and graceful compensation for lagging flows.

Paper Details

Date Published: 10 September 2007
PDF: 8 pages
Proc. SPIE 6773, Next-Generation Communication and Sensor Networks 2007, 677305 (10 September 2007); doi: 10.1117/12.753831
Show Author Affiliations
Ajaz Sana, Graduate School of the City Univ. of New York (United States)
Shahab Hussain, Graduate School of the City Univ. of New York (United States)
Mohammed A. Ali, Graduate School of the City Univ. of New York (United States)
Samir Ahmed, Graduate School of the City Univ. of New York (United States)

Published in SPIE Proceedings Vol. 6773:
Next-Generation Communication and Sensor Networks 2007
Sergey I. Balandin, Editor(s)

© SPIE. Terms of Use
Back to Top