80 research outputs found

    Smart PIN: performance and cost-oriented context-aware personal information network

    Get PDF
    The next generation of networks will involve interconnection of heterogeneous individual networks such as WPAN, WLAN, WMAN and Cellular network, adopting the IP as common infrastructural protocol and providing virtually always-connected network. Furthermore, there are many devices which enable easy acquisition and storage of information as pictures, movies, emails, etc. Therefore, the information overload and divergent content’s characteristics make it difficult for users to handle their data in manual way. Consequently, there is a need for personalised automatic services which would enable data exchange across heterogeneous network and devices. To support these personalised services, user centric approaches for data delivery across the heterogeneous network are also required. In this context, this thesis proposes Smart PIN - a novel performance and cost-oriented context-aware Personal Information Network. Smart PIN's architecture is detailed including its network, service and management components. Within the service component, two novel schemes for efficient delivery of context and content data are proposed: Multimedia Data Replication Scheme (MDRS) and Quality-oriented Algorithm for Multiple-source Multimedia Delivery (QAMMD). MDRS supports efficient data accessibility among distributed devices using data replication which is based on a utility function and a minimum data set. QAMMD employs a buffer underflow avoidance scheme for streaming, which achieves high multimedia quality without content adaptation to network conditions. Simulation models for MDRS and QAMMD were built which are based on various heterogeneous network scenarios. Additionally a multiple-source streaming based on QAMMS was implemented as a prototype and tested in an emulated network environment. Comparative tests show that MDRS and QAMMD perform significantly better than other approaches

    Service quality assurance for the IPTV networks

    Get PDF
    The objective of the proposed research is to design and evaluate end-to-end solutions to support the Quality of Experience (QoE) for the Internet Protocol Television (IPTV) service. IPTV is a system that integrates voice, video, and data delivery into a single Internet Protocol (IP) framework to enable interactive broadcasting services at the subscribers. It promises significant advantages for both service providers and subscribers. For instance, unlike conventional broadcasting systems, IPTV broadcasts will not be restricted by the limited number of channels in the broadcast/radio spectrum. Furthermore, IPTV will provide its subscribers with the opportunity to access and interact with a wide variety of high-quality on-demand video content over the Internet. However, these advantages come at the expense of stricter quality of service (QoS) requirements than traditional Internet applications. Since IPTV is considered as a real-time broadcast service over the Internet, the success of the IPTV service depends on the QoE perceived by the end-users. The characteristics of the video traffic as well as the high-quality requirements of the IPTV broadcast impose strict requirements on transmission delay. IPTV framework has to provide mechanisms to satisfy the stringent delay, jitter, and packet loss requirements of the IPTV service over lossy transmission channels with varying characteristics. The proposed research focuses on error recovery and channel change latency problems in IPTV networks. Our specific aim is to develop a content delivery framework that integrates content features, IPTV application requirements, and network characteristics in such a way that the network resource utilization can be optimized for the given constraints on the user perceived service quality. To achieve the desired QoE levels, the proposed research focuses on the design of resource optimal server-based and peer-assisted delivery techniques. First, by analyzing the tradeoffs on the use of proactive and reactive repair techniques, a solution that optimizes the error recovery overhead is proposed. Further analysis on the proposed solution is performed by also focusing on the use of multicast error recovery techniques. By investigating the tradeoffs on the use of network-assisted and client-based channel change solutions, distributed content delivery frameworks are proposed to optimize the error recovery performance. Next, bandwidth and latency tradeoffs associated with the use of concurrent delivery streams to support the IPTV channel change are analyzed, and the results are used to develop a resource-optimal channel change framework that greatly improves the latency performance in the network. For both problems studied in this research, scalability concerns for the IPTV service are addressed by properly integrating peer-based delivery techniques into server-based solutions.Ph.D

    Network coding meets multimedia: a review

    Get PDF
    While every network node only relays messages in a traditional communication system, the recent network coding (NC) paradigm proposes to implement simple in-network processing with packet combinations in the nodes. NC extends the concept of "encoding" a message beyond source coding (for compression) and channel coding (for protection against errors and losses). It has been shown to increase network throughput compared to traditional networks implementation, to reduce delay and to provide robustness to transmission errors and network dynamics. These features are so appealing for multimedia applications that they have spurred a large research effort towards the development of multimedia-specific NC techniques. This paper reviews the recent work in NC for multimedia applications and focuses on the techniques that fill the gap between NC theory and practical applications. It outlines the benefits of NC and presents the open challenges in this area. The paper initially focuses on multimedia-specific aspects of network coding, in particular delay, in-network error control, and mediaspecific error control. These aspects permit to handle varying network conditions as well as client heterogeneity, which are critical to the design and deployment of multimedia systems. After introducing these general concepts, the paper reviews in detail two applications that lend themselves naturally to NC via the cooperation and broadcast models, namely peer-to-peer multimedia streaming and wireless networkin

    On the optimal operation of wireless networks

    Get PDF
    With the ever increasing mobile traffic in wireless networks, radio frequency spectrum is becoming limited and overcrowded. To address the radio frequency spectrum scarcity problem, researchers proposed advanced radio technology-Cognitive Radio to make use of the uncommonly used and under-utilized licensed bands to improve overall spectrum efficiency. Mobile service providers also deploy small base stations on the streets, into shopping center and users\u27 households in order to improve spectrum efficiency per area. In this thesis, we study cooperation schemes in cognitive radio networks as well as heterogeneous networks to reuse the existing radio frequency spectrum intelligently and improve network throughput and spectrum efficiency, reduce network power consumption and provide network failure protection capability. In the first work of the thesis, we study a multicast routing problem in Cognitive Ratio Networks (CRNs). In this work, all Secondary Users (SUs) are assumed not self interested and they are willing to provide relay service for source SUs. We propose a new network modeling method, where we model CRNs using a Multi-rate Multilayer Hyper-Graph (MMHG). Given a multicast session of the MMHG, our goal is to find the multicast routing trees that minimize the worst case end-to-end delay, maximize the multicast rate and minimize the number of transmission links used in the multicast tree. We apply two metaheuristic algorithms (Multi-Objective Ant Colony System optimization algorithm (MOACS) and Archived Multi-Objective Simulated Annealing Optimization Algorithm (AMOSA)) in solving the problem. We also study the scheduling problem of multicast routing trees obtained from the MMHG model. In the second work of the thesis, we study the cell outage compensation function of the self-healing mechanism using network cooperation scheme. In a heterogeneous network environment with densely deployed Femto Base Stations (FBSs), we propose a network cooperation scheme for FBSs using Coordinated Multi-Point (CoMP) transmission and reception with joint processing technique. Different clustering methods are studied to improve the performance of the network cooperation scheme. In the final work of the thesis, we study the user cooperative multi-path routing solution for wireless Users Equipment (UEs)\u27 streaming application using auction theory. We assume that UEs use multi-path transport layer service, and establish two paths for streaming events, one path goes through its cellular link, another path is established using a Wi-Fi connection with a neighbor UE. We study user coordinated multi-path routing solution with two different energy cost functions (LCF and EAC) and design user cooperative real-time optimization and failure protection operations for the streaming application. To stimulate UEs to participate into the user cooperation operation, we design a credit system enabled with auction mechanism. Simulation results in this thesis show that optimal cooperation operations among network devices to reuse the existing spectrum wisely are able to improve network performance considerably. Our proposed network modeling approach in CRN helps reduce the complicated multicast routing problem to a simple graph problem, and the proposed algorithms can find most of the optimal multicast routing trees in a short amount of time. In the second and third works, our proposed network cooperation and user cooperation approaches are shown to provide better UEs\u27 throughput compared to non-cooperation schemes. The network cooperation approach using CoMP provides failure compensation capability by preventing the system sum rate loss from having the same speed of radio resource loss, and this is done without using additional radio resources and will not have a significant adverse effect on the performance of other UEs. The user cooperation approach shows great advantage in improving service rate, improving streaming event success rate and reducing energy consumption compared to non-cooperation solution

    Virtualization of multicast services in WiMAX networks

    Get PDF
    Multicast service is one of the methods used to efficiently manage bandwidth when sending multimedia content. To improve bandwidth utilisation, virtualization is often invoked because of its additional features such as bandwidth sharing and support of services that require high volumes of transactional data. Currently, network providers are concerned with the bandwidth amount for efficient use of the limited wireless network capabilities and the provision of a better quality of service. The virtualization design of a multicast service framework should satisfy several objectives. For example, it should enable the interchange of service delivery between multiple networks with one shareable network infrastructure. Also, it should ensure efficient use of network resources and guarantee users' demands of Quality of Service (QoS). Thus, the design of virtualization of multicast service framework is a complex research study. Due to the bandwidth-related arguments, a strong focus has been put on technical issues that facilitate virtualization in wireless networks. A well-designed virtualized network guarantees users with the required quality service. Similarly, virtualization of multicast service is invoked to improve efficient utilisation of bandwidth in wireless networks. As wireless links prove to be unstable, packet loss is unavoidable when multicast service-oriented virtual artefacts are incorporated in wireless networks. In this thesis, a virtualized multicast framework was modelled by using Generalized Assignment Problem (GAP) methodology. Mixed Integer Linear Programing (MILP) was implemented in MATLAB to solve the GAP model. This was to optimise the allocation of multicast traffic to the appropriate virtual networks. Thus, the developed model allows users to have interchangeable services offered by multiple networks. Furthermore, Network Simulator version 3 (NS-3) was used to evaluate the performance of the virtualized multicast framework. Three applications, namely, voice over IP (VoIP), video streaming, and file download have been used to evaluate the performance of a multicast service virtualization framework in Worldwide Interoperability for Microwave Access (WiMAX) networks using NS-3. The performance evaluation was based on whether MILP is used or not used. The results of experimentation have revealed that there is good performance of virtual networks when multicast traffic is sent over one single virtual network instead of sending it over multiple virtual networks. Similarly, the results show that the bandwidth is efficiently used because the multicast traffic is not delivered through multiple virtual networks. Overall, the concepts, the investigations and the model presented in this thesis can enable mobile network providers to achieve efficient use of bandwidth and provide the necessary means to support services for QoS differentiations and guarantees. Also, the multicast service virtualization framework provides an excellent tool that can enable network providers to interchange services. The developed model can serve as a basis for further extension. Specifically, the extension of the model can boost load balancing in the flow allocation problem and activate a virtual network to deliver traffic. This may rely on the QoS policy between network providers. Therefore, the model should consider the number of users in order to guarantee improved QoS

    A Survey on Adaptive Multimedia Streaming

    Get PDF
    Internet was primarily designed for one to one applications like electronic mail, reliable file transfer etc. However, the technological growth in both hardware and software industry have written in unprecedented success story of the growth of Internet and have paved the paths of modern digital evolution. In today’s world, the internet has become the way of life and has penetrated in its every domain. It is nearly impossible to list the applications which make use of internet in this era however, all these applications are data intensive and data may be textual, audio or visual requiring improved techniques to deal with these. Multimedia applications are one of them and have witnessed unprecedented growth in last few years. A predominance of that is by virtue of different video streaming applications in daily life like games, education, entertainment, security etc. Due to the huge demand of multimedia applications, heterogeneity of demands and limited resource availability there is a dire need of adaptive multimedia streaming. This chapter provides the detail discussion over different adaptive multimedia streaming mechanism over peer to peer network

    Design methods for optimal resource allocation in wireless networks

    Get PDF
    Wireless communications have seen remarkable progress over the past two decades and perceived tremendous success due to their agile nature and capability to provide fast and ubiquitous internet access. Maturation of 3G wireless network services, development of smart-phones and other broadband mobile computing devices however have motivated researchers to design wireless networks with increased capacity and coverage, therefore un-leaching the wireless broadband capabilities. In this thesis, we address two very important design aspects of wireless networks, namely, interference management and control through optimal cross-layer design and channel fading mitigation through relay-assisted cooperative communications. For the former, we address, in the context of wireless network design, the problem of optimally partitioning the spectrum into a set of non-overlapping channels with non uniform spectrum widths and we model the combinatorially complex problem of joint routing, link scheduling, and spectrum allocation as an optimization problem. We use column generation decomposition technique (which decomposes the original problem into a master and a pricing subproblem) for solving the problem optimally. We also propose several sub-optimal methods for efficiently solving the pricing subproblems. For the latter problem, we study the joint problem of relay selection and power allocation in both wireless unicast and multicast cooperative cellular networks. We employ convex optimization technique to model this complex optimization problem and use branch and bound technique to solve it optimally. We also present sub-optimal methods to reduce the problem complexity and solve it more efficiently
    • 

    corecore