Avancerad sökning
Visar resultat 1 - 5 av 68 avhandlingar som matchar ovanstående sökkriterier.
1. Mobile Multimedia Multicasting in Future Wireless Systems : A Hybrid Cellular-Broadcasting System Approach
Sammanfattning : 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. LÄS MER
2. Wireless Broadcasting with Network Coding
Sammanfattning : Wireless digital broadcasting applications such as digital audio broadcast (DAB) and digital video broadcast (DVB) are becoming increasingly popular since the digital format allows for quality improvements as compared to traditional analogue broadcast. The broadcasting is commonly based on packet transmission. LÄS MER
3. Single frequency broadcasting networks
Sammanfattning : 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. LÄS MER
4. Hybrid cellular-broadcasting infrastructure systems : radio resource management issues
Sammanfattning : 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. LÄS MER
5. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Sammanfattning : 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. LÄS MER