A hybrid scheduling scheme for data broadcast over a single channel in mobile environments

Various broadcast schemes have been proposed to reduce the data access time of mobile clients. However, they are based either on the mobile users’ data access frequencies or on the semantic relations of the data. In this paper, we present a hybrid data broadcast scheme based both on semantic relationships and access probabilities. The broadcast scheme we propose generates a broadcast sequence according to the semantic relationships and replicates popular data items several times according to the data access probabilities. The efficiency of our broadcast scheme is shown via performance evaluations.     

Optimal adaptive channel scheduling for scalable video broadcasting over MIMO wireless networks

Video broadcasting is an efficient way to deliver video content to multiple receivers. However, due to heterogeneous channel conditions in MIMO wireless networks, it is challenging for video broadcasting to map scalable video layers to proper MIMO transmit antennas to minimize the average overall video transmission distortion. In this paper, we investigate the channel scheduling problem for broadcasting scalable video content over MIMO wireless networks. An adaptive channel scheduling based unequal error protection (UEP) video broadcasting scheme is proposed. In the scheme, video layers are protected unequally by being mapped to appropriate antennas, and the average overall distortion of all receivers is minimized. We formulate this scheme into a non-linear combinatorial optimization problem. It is not practical to solve the problem by an exhaustive search method with heavy computational complexity. Instead, an efficient branch-and-bound based channel scheduling algorithm, named TBCS, is developed. TBCS finds the global optimal solution with much lower complexity. The complexity is further reduced by relaxing the termination condition of TBCS, which produces a (1 − ε)-optimal solution. Experimental results demonstrate both the effectiveness and efficiency of our proposed scheme and algorithm. As compared with some existing channel scheduling methods, TBCS improves the quality of video broadcasting across all receivers significantly.     

Multi-user data multiplexing for digital multimedia broadcasting

Recently, a Korean standard service, as the designated digital multimedia broadcasting (DMB) system, has been in commercial service following a period of time of careful reflection. Now, the next generation of digital broadcast services will not be limited to digital audio but also extended to a variety of multimedia data services as well as mobile application services. However, the current approaches for transporting multimedia content over wireless networks for the DMB require significant overhead. In this paper, we propose a new approach for multi-user data multiplexing with several access points serving a number of wireless terminals for the DMB. By modifying the multiplexer header, multiplexing time, and handling of time-critical data, the duplication overhead can be considerably decreased when compared to existing schemes.     

A continuous reverse skyline query processing scheme for multimedia data sharing in mobile environments

Multimedia Tools and Applications - Recently, various query processing schemes in mobile environments have been studied. Particularly, a reverse skyline query that is the variation of a skyline...     

A decomposition scheme for single stage scheduling problems

This paper introduces a general decomposition scheme for single stage scheduling problems with jobs that have arbitrary release dates. We assume that the objective function is monotone in the completion time of each job. The decomposition scheme has significant theoretical and practical relevance. When assuming equal processing times, we can reduce the number of steps required to solve several well-known nonpreemptive single machine scheduling problems by O(n³)mathcal{O}(n^{3}), provided the processing time p is constant. Specifically, we develop new approaches that solve the problems 1|r _i ,p _i =p|∑f _i (C _i ) and 1|r _i ,p _i =p|∑w _i U _i in O(n⁴)mathcal{O}(n^{4}) time; the algorithms that have been described in the literature for these problems operate in O(n⁷)mathcal{O}(n^{7}). Moreover, solution approaches for NPmathcal{NP}-hard problems with unequal processing times may also benefit from our decomposition rule. This is particularly true if p _max/p _min is close to 1. Using the decomposition rule, either the problem size is reduced or additional information about the maximal schedule length is obtained.     

Dynamic playout scheduling algorithms for continuous multimedia streams

In this paper, we investigate a playout scheduling framework for supporting the continuous and synchronized presentations of multimedia streams in a distributed multimedia presentation system. We assume a situation in which the server and network transmissions provide sufficient support for the delivery of media objects. In this context, major issues regarding the enforcement of the smooth presentation of multimedia streams at client sites must be addressed to deal with rate variance of stream presentations and delay variance of networks. We develop various playout-scheduling algorithms that are adaptable to quality-of-service parameters. The proposed algorithms permit the local adjustment of unsynchronized presentations by gradually accelerating or retarding presentation components, rather than abruptly skipping or pausing the presentation materials. A comprehensive experimental analysis of the proposed algorithms demonstrates that our algorithms can effectively avoid playout gaps (or hiccups) in the presentations. This scheduling framework can be readily used to support customized multimedia presentations.     

A secure data analytics scheme for multimedia communication in a decentralized smart grid

With the exponential increase in energy demands (commercial as well as residential), the traditional grid infrastructure significantly shifted to intelligent ICT-based Smart Grid (SG) infrastructure. In the SG environment, only efficient energy management may not be sufficient as the SG dynamics have significant impacts on multimedia communications such as video surveillance of the technical/non-technical losses of energy and many more. The inevitable energy losses can be identified by process and analyze the massive amount of heterogeneous data, i.e., Big Data (BD) generated through smart devices such as sensors, Smart Meters (SMs), and others. The key challenges in analyzing multimedia BD are computational complexity, operational integration complexity, data security, and privacy. To overcome the aforementioned issues, this paper proposes a blockchain-based data analytics scheme called ChoIce, which offers secure data collection, analysis, and decision support for the SG systems. It works in two phases; (i) secure data collection over Ethereum and (ii) BD analytics and decision-making using deep learning (DL). The robust and secure data analytics, efficient network management, and high-performance computing for BD are crucial towards the optimization of SG operation. The performance of ChoIce is evaluated considering parameters such as the data storage cost, multimedia communication latency, and prediction accuracy. Thus, the results of ChoIce shows that it outperforms in contrast to other state-of-the-art approaches.

     

A preemptive channel allocation scheme for multimedia traffic in mobile wireless networks

This paper presents a channel allocation model with both partial and full preemptive capabilities for multimedia traffic in mobile wireless networks. The different types of multimedia traffic in transmitting through next-generation networks possess different characteristics and demand an adequate channel allocation scheme to fulfill individual Quality of Service (QoS) requirements. In the proposed model, multimedia traffic is classified into three classes corresponding to different priority levels in a decreasing order. To effectively reduce the dropping probability, a higher-priority handoff call is allowed to fully or partially preempt any lower-priority ongoing calls when the channel capacity becomes insufficient. In addition, to prevent from possible starvation of the lowest-priority traffic, a portion of system channels are purposely reserved. Performance measures, including the dropping probability of handoff calls, the call-interruption probability that an ongoing call is forced to termination due to full preemption, and the bandwidth reduction ratio due to partial preemption, are investigated through an analytical model built with 4-D Markov chains. The numerical results demonstrate the effectiveness of our model.     

A client-side statistical prediction scheme for energy aware multimedia data streaming

The recent proliferation of streaming multimedia on a variety of mobile devices has severely tested their battery lifetime. The long running nature of typical streaming applications results in significant energy consumption by the wireless network interface card (WNIC) in these mobile devices. In this paper we explore linear prediction-based client-side strategies that reduce the WNIC energy consumption to receive multimedia streams by judiciously transitioning the WNIC to a lower power consuming sleep state during the no-data intervals in the multimedia stream, without explicit support from the multimedia servers themselves. Experimental results on popular streaming formats such as Microsoft Media, Real and Apple QuickTime show that a linear prediction-based strategy performs better than history-based strategies that use simple temporal averaging.     

Dependent data broadcasting for unordered queries in a multiple channel mobile environment

Data broadcast is a promising technique to improve the bandwidth utilization and conserve the power consumption in a mobile computing environment. In many applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data are restricted to a single broadcast channel environment, and as a consequence, the results are of limited applicability to the upcoming mobile environments. In view of this, we relax this restriction and explore the problem of broadcasting dependent data in multiple broadcast channels. By analyzing the model of dependent data broadcasting, we derive several theoretical properties for the average access time in a multiple channel environment. In light of the theoretical results, we develop a genetic algorithm to generate broadcast programs. Our experimental results show that the theoretical results derived are able to guide the search of the genetic algorithm very effectively, thus leading to broadcast programs of very high quality.     

移动计算环境中数据广播的启发式遗传调度算法

数据广播调度是移动计算环境中数据管理技术的研究热点之一.现有的广播调度算法在移动数据库环境中缺乏一定的实用性.在数据项长度可变的条件下,理论上分析了多盘数据广播的平均访问时间,并提出了一种启发式的遗传调度算法,在广播调度中引入贪婪变换的启发式求解策略.理论分析和实验结果表明,该算法在访问概率偏斜率较大和数据项长度不等的情况下,平均访问时间较小,能很好的适应于移动数据库环境.     

A producer mobility support scheme for real-time multimedia delivery in named data networking

Multimedia Tools and Applications - Named Data Networking (NDN) is a network architecture for the Future Internet, and can cooperate with the Internet of Things (IoT) to tackle problems existing in...     

An efficient continuous k-nearest neighbor query processing scheme for multimedia data sharing and transmission in location based services

The continuous k-nearest neighbor query is one of the most important query types to share multimedia data or to continuously identify transportable users in LBS. Various methods have been proposed to efficiently process the continuous k-NN query. However, most of the existing methods suffer from high computation time and larger memory requirement because they unnecessarily access cells to find the nearest cells on a grid index. Furthermore, most methods do not consider the movement of a query. In this paper, we propose a new processing scheme to process the continuous k nearest neighbor query for efficiently support multimedia data sharing and transmission in LBS. The proposed method uses the patterns of the distance relationships among the cells in a grid index. The basic idea is to normalize the distance relationships as certain patterns. Using this approach, the proposed scheme significantly improves the overall performance of the query processing. It is shown through various experiments that our proposed method outperforms the existing methods in terms of query processing time and storage overhead.

     

TDCS: a new scheduling framework for real-time multimedia OS

ABSTRACT

The emerging real-time hyper-physical system (CPS), such as autonomous vehicle and live interactive media application, requires time deterministic behaviour. This is challenging to achieve by using the traditional general purpose operating system (GPOS). This paper presents a new design of the real-time operating system (OS) scheduling mechanism called ‘time deterministic cyclic scheduling’ (TDCS) mainly for live multimedia tasks processing. This new scheduler shares a similar philosophy as classic cyclic execution but with flexibility and dynamic configuration. This hybrid design is based on both time-reserved based cyclic execution and priority-based pre-emptive scheduling for mixed criticality applications. The simulation results show that this scheduling scheme can achieve predictable timing behaviour of task delay and jitter under high CPU utilisation. This shows that the proposed scheme is promising for low latency high-performance multimedia censoring tasks that occur in a periodic manner.     

A multiresolution representation scheme for multimedia databases

We present a compression scheme that is useful for interactive video applications such as browsing a multimedia database. The focus of our approach the development of a compression scheme (and a corresponding retrieval scheme) that is optimal for any data rate. To browse a multimedia database, such a compression scheme is essential. We use a multiresolution setting, but eliminate the need for wavelets. This results in much better compression. We show experimental results and explain in detail how to extend our approach to multidimensional data.     

A novel distributed scheduling scheme for OFDMA uplink using channel information and probabilistic transmission

Distributed uplink scheduling in OFDMA systems is considered. In the proposed model, mobile terminals have the responsibility of making their own transmission decisions. The proposed scheme is based on two dimensional reservation in time and frequency. Terminals use channel state information in order to favor transmissions over certain subchannels, and transmission is done in a probabilistic manner. The proposed approach provides more autonomy to mobile devices in making transmission decisions. Furthermore, it allows avoiding collisions during transmission since it leads to collision detection during the resource reservation phase. The proposed approach is compared to other random access methods and shown to be superior in terms of increasing sum-rate, reducing the number of users in outage, and reducing the collision probability in the reservation phase.     

Secure multimedia data processing scheme in medical applications

People communicate in a variety of ways via multimedia through the propagation of various techniques. Nowadays, variety of multimedia frameworks or techniques is used in various applications such as industries, software processing, vehicles and medical systems. The usage of multimedia frameworks in healthcare systems makes it possible to process, record and store huge amount of information generated by various medical records. However, the processing and management of huge records of every individual lead to overload the security risk and human efforts. The aim of this paper is to propose a secure and efficient technique that helps the medical organizations to process every record of individuals in a secure and efficient way. The proposed mechanism is validated against various security and processing metrics over conventional mechanisms such as Response Time, Message Alteration Record, Trusted Classification Accuracy and Record Accuracy. The analyzed results claim the significant improvement of proposed mechanism as compare to other schemes.

     

一种前向共享信道下多业务的分层混合调度策略

前向采用共享信道方式的系统在承载多种业务时,单一的调度算法很难满足所有业务的QoS需求。在介绍了前向共享信道分组调度的模型后;论文依据不同类别业务的传输需求,提出一种两层的混合调度策略,该策略按业务类别对分组进行分类缓存,并按比例将传输时隙分配到各个数据类,而各数据类采用先到先服务、保证带宽的或是比例公平的调度来实现按用户的分组发送;最后,通过仿真实验对该策略的有效性进行了验证。     

Upper-level scheduling supporting multimedia traffic in cellular data networks

Wireless data networks such as cdma2000 1x EV-DO and UMTS HSDPA use downlink scheduling that exploits channel fading to increase the system throughput. As future wireless networks will eventually support multimedia and data traffic together, we need a proper criterion for scheduling that can count various service requirements such as delay and packet loss. Although some previous approaches proposed opportunistic schedulers at the lower layer, it has not been investigated well whether they are able to meet explicit QoS defined at the upper layer. Hence, in this paper, we develop a hierarchical scheduling model that considers QoS provisioning and the time-varying channel feature separately. We focus on the upper-level QoS scheduling that supports various traffic classes in a unified manner. Supposing that a user gets some satisfaction or utility when served, we introduce a novel concept of opportunity cost, which is defined as the maximum utility loss among users incurred by serving a particular user at the current turn. We obtain each user’s net profit by subtracting the opportunity cost from its expected utility, and then select a user with the maximum profit for service. Simulation results reveal that our scheme supports various QoS classes well that are represented by delay and packet loss under various traffic loadings.