Deployment Of Multimedia Services Research Articles

Optimized Dynamic Routing in Multimedia Vehicular Networks

Intelligent transport system is one of thriving research domain and in particular multimedia vehicular networks gains more attention. The deployment of multimedia services in vehicle ad-hoc networks (VANETs) provides real time support to users and provides better traffic management with high safety measures. Most of the vehicles has multimedia applications such as weather sensors, real time map applications etc., and it requires adequate resources to process. Resource allocation to a static network is simple and various routing models are evolved. In case of dynamic network like VANETs, routing is still in progress in order to obtain a better model. Routing directly related to quality of services of network and user, it is essential to develop a better dynamic routing strategy for multimedia wireless networks. The proposed work aims to provide an optimized dynamic routing strategy for multimedia networks. For efficient routing, k-means clustering is used to organize the clusters and exchanges the routing information and inverted ant colony optimization is used to obtain the optimal path for multimedia access. Proposed model is experimentally verified and compared to conventional ant colony optimization and grey wolf optimization in terms of parameters such as end to end delay, throughput, target used, average computation time and efficiency.

A Multiconstrained QoS-Compliant Routing Scheme for Highway-Based Vehicular Networks

With the deployment of multimedia services over VANETs, there is a need to develop new techniques to insure various levels of quality of services (QoS) for real time applications. However, in such environments, it is not an easy task to determine adequate routes to transmit data with specific application QoS requirements. In this paper, we propose CBQoS-Vanet, a new QoS-based routing protocol tailored towards vehicular networks in a highway scenario. This protocol is based on the use of two techniques: first a clustering technique which organizes and optimizes the exchange of routing information and, second, a bee colony inspired algorithm, which calculates the best routes from a source to a destination based on given QoS criteria. In our approach, clusters are formed around cluster heads that are themselves elected based on QoS considerations. The QoS criteria here are based on the two categories of metrics: QoS metrics and mobility metrics. The QoS metrics consists of the available bandwidth, the end-to-end delay, and the jitter. The mobility metrics consists of link expiration time and average velocity difference. We have studied the performance of CBQoS-Vanet through simulation and compared it to existing approaches. The results that we obtained show that our technique outperforms, in many aspects, the approaches that it was compared against.

Self-Similar key generation for secure communication in multimedia applications

Long term research activities focus on the provision of fundamental understanding and easy deployment of multimedia services on the multimedia communication. The rapid growth of digital communication and electronic data exchange provides the intensive data transfer without concentrating on the security issues. Secure communication with the minimal computational and storage overhead is the challenging task with the large size members nowadays. The Group Key Management (GKM) protocols offer numerous solutions to the security issues with an efficient interaction of group members controlling them. The groups participated in secure communication belongs to open or close scenario. The participation of registered members in close group is beneficial than the open group. With the increase in number of participants, the key size and the number of key generations will increase the computational overhead. To alleviate these issues, this paper proposes the novel self-similar key generation and distribution scheme on the basis of the Elliptic Curve Diffie Hellman (ECDH) and Chinese Reminder Theorem (CRT). The assigning permission to each node to generate their own key at the specified time by the ECDH prevents the unnecessary distribution of keys that reduces the communication overhead. Then, the application of CRT theorem reduces the mathematical burden of key generation. Finally, the integration of the Elliptic Curve Cryptography (ECC) with the above mechanisms validates the number of messages transferred among the participants in both sender and receiver side. The prior key generation using ECDH and the CRT-based self-similar key generation reduces the computational and communication overhead effectively. The comparative analysis between the proposed SSKG with the existing schemes in terms of overhead, complexity assures the effectiveness of proposed schemes in secure multicast communication.

A solution for the management of multimedia sessions in hybrid clouds

Cloud-based systems expanded considerably in recent years, as the demand for cheaper and easily scalable resources provisioning solutions increased. In this context, the deployment of multimedia services in the cloud, as a way to increase their usability and overcome their processing overhead, gained additional interest. Throughout this paper we present the design of a management system for multimedia services built on top of a hybrid cloud. This describes a model of service unit deployment automation as well as a services composition scheme adapted to the IaaS cloud architecture and resources pool. We propose a modular and flexible architecture to handle service composition, automated service deployment with execution flow management and scalable storage capabilities. Finally we analyse the benefits of using the service management system with a hybrid cloud back-end.

Reconfigurable video coding on multicore

This article provides an overview of the main objectives of the new RVC standard, with an emphasis on the features that enable efficient implementation on platforms with multiple cores. A brief introduction to the methodologies that efficiently map RVC codec specifications to multicore platforms is accompanied with an example of the possible breakthroughs that are expected to occur in the design and deployment of multimedia services on multicore platforms.

Effective Radio Resource Management for MBMS in UMTS Networks

Broadcast and multicast offer a significant improvement of spectrum utilization, and becomes particularly important where information channels are shared among several users. Mobile cellular environments are expected to evolve with the technological approaches necessary to facilitate the deployment of multimedia services, such as streaming, file download and carousel services. The perspective that video streaming in wireless networks services is an attractive service to end-users has spurred the research in this area. To provide for a video delivery platform in UMTS, the Third Generation Partnership Project (3GPP) addressed this problem with the introduction of the Multimedia Broadcast and Multicast Services (MBMS) in 3GPP Release 6. In this document we analyse several effective radio resource management techniques to provide MBMS, namely, use of non-uniform QAM constellations, multi-code and macro-diversity to guarantee the optimal distribution of QoS depending on the location of mobiles.

Dynamic Channel Allocation for Real-Time Connections in Highway Macrocellular Networks

The wide deployment of multimedia services in third generation wireless networks will require handoff designs that can simultaneously reduce the blocking probability of handoff requests and decrease the handoff delay. Reducing the handoff blocking probability is needed to prevent frequent call dropping of real-time VBR/VCR connections and decreasing the delay associated with handoff is needed to prevent QoS degradation for multimedia traffic. In this paper, we present a channel assignment/reassignment scheme for highway cellular networks that achieves both requirements. The scheme can be used to deliver real-time data to a large segment of global highways, namely, highways in which the radio channels used in a given cell cannot be simultaneously used in the two neighboring cells to its left and to its right. The scheme possesses the desirable features of real-time algorithms: the execution time per handoff request has a constant time complexity, the number of transmitted messages per request is small, and the space overhead is also O(1). The scheme uses a non-compact initial assignment of nominal channels to neighboring cells and utilizes a set of pointers in each base station to implement an efficient channel assignment and reassignment strategy. The resulting approach greatly simplifies the selection process and avoids the expensive computation and message exchanges typically needed by dynamic channel allocation schemes. The low communication overhead of the scheme can be further reduced via control thresholds. Performance simulation results show that the scheme achieves low blocking probability and is therefore suitable for handling handoffs of real-time connections in highway cellular networks.