Search for dissertations about: "Radio broadcasting"
Showing result 1 - 5 of 23 swedish dissertations containing the words Radio broadcasting.
-
1. Hybrid cellular-broadcasting infrastructure systems : radio resource management issues
Abstract : This thesis addresses the problem of low-cost multicast delivery of multimedia content in future mobile networks. The trend towards reuse of existing infrastructure for cellular and broadcasting for building new systems is challenged, with respect to the opportunities for low cost service provision and scalable deployment of networks. READ MORE
-
2. Mobile Multimedia Multicasting in Future Wireless Systems : A Hybrid Cellular-Broadcasting System Approach
Abstract : This dissertation addresses the problem of providing a®ordable mobile mul-timedia services in wide area wireless networks. The approach is to con-sider novel system architectures, based on reusing and sharing of the ex-isting network infrastructure for cellular and terrestrial TV broadcastingsystems. READ MORE
-
3. Radio Network Planning and Resource Optimization : Mathematical Models and Algorithms for UMTS, WLANs, and Ad Hoc Networks
Abstract : The tremendous popularity of wireless technologies during the last decade has created a considerable expansion of wireless networks both in size and use. This fact, together with a great variety of mobile devices and numerous di®erent services that are becoming increasingly resourcedemanding, have attracted the attention of many researchers into the area of radio resource planning and optimization. READ MORE
-
4. Single frequency broadcasting networks
Abstract : An Orthogonal Frequency Division Multiplexing (OFDM) schemeallows all transmitters in a radio network to transmitidentical signals in the same frequency block, forming a socalled Single Frequency Network (SFN). By avoiding frequencyreuse, substantial improvements in bandwidth utilisation arepossible. READ MORE
-
5. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Abstract : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. READ MORE