Dynamic Leveling: Adaptive Data Broadcasting in a Mobile Computing Environment

The research issue of broadcasting has attracted a considerable amount of attention in a mobile computing system. By utilizing broadcast channels, a server is able to continuously and repeatedly broadcast data to mobile users. From these broadcast channels, mobile users obtain the data of interest efficiently and only need to wait for the required data to be present on the broadcast channel. Given the access frequencies of data items, one can design proper data allocation in the broadcast channels to reduce the average expected delay of data items. In practice, the data access frequencies may vary with time. We explore in this paper the problem of adjusting broadcast programs to effectively respond to the changes of data access frequencies, and develop an efficient algorithm DL to address this problem. Performance of algorithm DL is analyzed and a system simulator is developed to validate our results. Sensitivity analysis on several parameters, including the number of data items, the number of broadcast disks, and the variation of access frequencies, is conducted. It is shown by our results that the broadcast programs adjusted by algorithm DL are of very high quality and are in fact very close to the optimal ones.     

Optimal memory management strategies for a mobile user in abroadcast data delivery system

Data broadcasting has been considered as a promising way of disseminating information to a massive number of users in a wireless communication environment. In a broadcast data delivery system, there is a server which is broadcasting data to a user community. Due to the lack of communication from the users to the server, the server cannot know what a user needs. In order to access a certain item, a user has to wait until the item appears in the broadcast. The waiting time will be considerably long if the server's broadcast schedule does not match the user's access needs. If a user has a local memory, it can alleviate its access latency by selectively prefetching the items from the broadcast and storing them in the memory. A good memory management strategy can substantially reduce the user's access latency, which is a major concern in a broadcast data delivery system. An optimal memory management policy is identified that minimizes the expected aggregate latency. We present optimal memory update strategies with limited look ahead as implementable approximations of the optimal policy. Some interesting special cases are given for which the limited look-ahead policies are optimal. We also show that the same formulation can be used to find the optimal memory management policy which minimizes the number of deadline misses when users generate information requests which have to be satisfied within some given deadlines     

Efficient Channel Allocation Tree Generation for Data Broadcasting in a Mobile Computing Environment

The research issue of broadcasting has attracted a considerable amount of attention in a mobile computing system. By utilizing broadcast channels, a server continuously and repeatedly broadcasts data to mobile users. These broadcast channels are also known as broadcast disks from which mobile users can retrieve data. Using broadcasting, mobile users can obtain the data of interest efficiently and only need to wait for the required data to present on the broadcast channel. The issue of designing proper data allocation in the broadcast disks is to reduce the average expected delay of all data items. We explore in this paper the problem of generating hierarchical broadcast programs with the data access frequencies and the number of broadcast disks in a broadcast disk array given. Specifically, we first transform the problem of generating hierarchical broadcast programs into the one of constructing a channel allocation tree with variant-fanout. By exploiting the feature of tree generation with variant-fanout, we develop a heuristic algorithm VF ^K to minimize the expected delay of data items in the broadcast program. In order to evaluate the solution quality obtained by algorithm VF ^K and compare its resulting broadcast program with the optimal one, we devise an algorithm OPT based on a guided search to obtain the optimal solution. Performance of these algorithms is comparatively analyzed. Sensitivity analysis on several parameters, including the number of data items and the number of broadcast disks, is conducted. It is shown by our simulation results that by exploiting the feature of variant-fanout in constructing the channel allocation tree, the solution obtained by algorithm VF ^K is of very high quality and is in fact very close to the optimal one resulted by algorithm OPT. Moreover, algorithm VF ^K is of very good scalability which is important for algorithm VF ^K to be of practical use to generate hierarchical broadcast programs dynamically in a mobile computing environment.     

Data Replication for Improving Data Accessibility in Ad Hoc Networks

In ad hoc networks, due to frequent network partition, data accessibility is lower than that in conventional fixed networks. In this paper, we solve this problem by replicating data items on mobile hosts. First, we propose three replica allocation methods assuming that each data item is not updated. In these three methods, we take into account the access frequency from mobile hosts to each data item and the status of the network connection. Then, we extend the proposed methods by considering aperiodic updates and integrating user profiles consisting of mobile users' schedules, access behavior, and read/write patterns. We also show the results of simulation experiments regarding the performance evaluation of our proposed methods     

Caching algorithms for broadcasting and multicasting in disruption tolerant networks

In delay and disruption tolerant networks, the contacts among nodes are intermittent. Because of the importance of data access, providing efficient data access is the ultimate aim of analyzing and exploiting disruption tolerant networks. Caching is widely proved to be able to improve data access performance. In this paper, we consider caching schemes for broadcasting and multicasting to improve the performance of data access. First, we propose a caching algorithm for broadcasting, which selects the community central nodes as relays from both network structure perspective and social network perspective. Then, we accommodate the caching algorithm for multicasting by considering the data query pattern. Extensive trace‐driven simulations are conducted to investigate the essential difference between the caching algorithms for broadcasting and multicasting and evaluate the performance of these algorithms. Copyright © 2016 John Wiley & Sons, Ltd.     

基于业务请求数据包长度的机会频谱接入算法

针对非时隙主用户网络,研究了单个次用户在周期性感知框架下的机会频谱接入问题。通过建立次用户信道感知和接入模型,提出了一种基于次用户请求业务数据包长度的机会频谱接入算法。该算法根据每个时隙分配给次用户业务数据包长度,自适应调整机会频谱接入策略。仿真结果表明,所提算法能够在干扰水平要求较高情况下,提高次用户平均有效传输吞吐量的同时,实现有效吞吐量与碰撞概率的折中;同时当外部环境发生变化时算法具有较强的鲁棒性。     

Quality-driven cross-layer optimized video delivery over LTE

3GPP Long Term Evolution is one of the major steps in mobile communication to enhance the user experience for next-generation mobile broadband networks. In LTE, orthogonal frequency- division multiple access is adopted in the downlink of its E-UTRA air interface. Although cross-layer techniques have been widely adopted in literature for dynamic resource allocation to maximize data rate in OFDMA wireless networks, application-oriented quality of service for video delivery, such as delay constraint and video distortion, have been largely ignored. However, for wireless video delivery in LTE, especially delay-bounded real-time video streaming, higher data rate could lead to higher packet loss rate, thus degrading the user-perceived video quality. In this article we present a new QoS-aware LTE OFDMA scheduling algorithm for wireless real-time video delivery over the downlink of LTE cellular networks to achieve the best user-perceived video quality under the given application delay constraint. In the proposed approach, system throughput, application QoS constraints, and scheduling fairness are jointly integrated into a cross-layer design framework to dynamically perform radio resource allocation for multiple users, and to effectively choose the optimal system parameters such as modulation and coding scheme and video encoding parameters to adapt to the varying channel quality of each resource block. Experimental results have shown significant performance enhancement of the proposed system.     

移动P2P网络中能量有效连续查询研究

在移动P2P网络中一个基本应用问题是访问分布式空间数据库中的数据对象,同时节省电量.文中提出了在移动P2P网络中能量有效连续查询处理（Energy Efficient Continuous Query Processing,EECQP）算法,包括范围查询和k个最近邻居节点查询（k-nearest-neighbor queries, k-NN）.EECQP算法能够提供移动用户找到一个有质量保证的连续查询结果.EECQP算法主要的想法是允许用户与节点合作,持续保存查询结果,而不是总是从头开始处理查询,从而减少通信开销.实验结果表明所提出的EECQP算法对于范围查询和k个最近邻居节点查询在通信开销和QoS保证是能量有效和可扩展的.     

VLC网络中兼具功率与时隙分配的自适应干扰管理机制

为了更好解决目前可见光通信（visible light communication,VLC）中干扰管理方案存在的动态优化问题,提出了一种兼具优化功率分配与时隙分配的自适应干扰管理机制。首先,在每个时隙依据用户的位置建立每个用户的接入点（access point,AP）协作集,寻找所有由最多数量互不干扰用户组成的极大独立集,以此自适应地避免同频干扰;在每个时隙为每个极大独立集采用改进的线性注水功率分配算法为信道自适应地分配发送功率,以此优化每个极大独立集的用户和速率;基于用户和速率、速率公平性及时延公平性的归一化优先因子,选出具有最大优先因子的候选极大独立集,其中包含的用户在该时隙被调用。通过仿真且与代表性文献中的算法比较可得,本文提出的自适应干扰管理与优化资源分配方案在网络频谱利用率、能效、用户速率公平性与时延公平性方面具有明显优势。      

System Capacity and Access Control for Multimedia TDMA/SS Networks

In this paper, we study the system capacity and access control for the TDMA/SS (time division multiple access with spread spectrum) cellular networks supporting multimedia services. In the TDMA/SS system, time is divided into frames and each frame is further divided into slots. Only one user is allowed to transmit in a slot and spread spectrum technique is adopted to combat inter-cell interference. A packet can occupy more than one slot, depending on the user's data rate and quality of service requirement. We derive a necessary and sufficient condition for a group of users to be admissible for the TDMA/SS system and prove that its admission region contains that of the TDMA/CDMA system. In the TDMA/CDMA system, time is also divided into frames and each frame consists of several slots. The difference is that every packet occupies exactly one slot and multiple users can transmit their packets in the same slot. Numerical results show that the admission region of the TDMA/SS system can be significantly larger than that of the TDMA/CDMA system. To further increase bandwidth utilization and guarnatee delay bound requirements, several access control schemes are proposed. Simulation results are obtained for these access control schemes.     

Packet multiple access for channel with binary feedback, capture, and multiple reception

This paper considers the multiple access of mobile users to a common wireless channel. The channel is slotted and the binary feedback (empty slot/nonempty slot) is sent to all accessing users. If a slot was not empty and only one user transmitted in it, the transmission is considered successful. Only the user, which had the successful transmission, receives information about its success. In the Introduction, the paper gives a review of known multiple-access algorithms for such a channel. Then our algorithm is constructed that has none of the weaknesses of the algorithms discussed in the Introduction. The algorithm is stable, in contrast to the ALOHA algorithm. It can work in a channel with capture and multiple reception. Without them, the algorithm has a throughput of 0.2891. It is shown how capture and multiple reception can increase the algorithm throughput to 0.6548 and decrease the packet delay for some fading models. The average packet delay and variance are found for two fading models. The models are Rayleigh fading with incoherent and coherent combining of joint interference power. The accessing traffic is Poisson.     

Replica Allocation Methods in Ad Hoc Networks with Data Update

In ad hoc networks, since mobile hosts move freely, network division occurs frequently, and thus data accessibility is lower than that in conventional fixed networks. In this paper, assuming an environment where each data item is periodically updated, we propose three replica allocation methods to improve data accessibility by replicating data items on mobile hosts. In these three methods, we take into account the access frequency from mobile hosts to each data item, the status of the network connection, and the time remaining until each item is updated next. We also show the results of simulation experiments regarding the performance evaluation of our proposed methods. We further extend the proposed methods to adapt to an environment where aperiodic data updates occur.     

Rate-regulated power control for supporting flexible transmissionin future CDMA mobile networks

In code division multiple access (CDMA) mobile networks, transmitted power is controlled to provide each user an acceptable connection by limiting the interference seen by other users. Previous work has focused on finding a power assignment that maximizes the minimum carrier-to-interference ratio where the transmission rate of each user is known and fixed. In future mobile networks, however, fluctuations in mobiles' transmission rate should be considered in designing power control algorithms. In this work, we present an algorithm for controlling mobiles' transmitter power levels while explicitly handling their time-varying transmission rates. During the whole power control process, the required signal quality is always maintained. The traffic-carrying performance of the algorithm is evaluated by simulation where different types of users are sending burst data     

File transmission over wireless fast fading downlink

The third-generation code division multiple access (3G CDMA) mobile communication networks are designed to transmit voice and data over wireless channels. Fundamental problems need to be solved for such mobile communication networks to operate efficiently. One of the problems is finding optimal scheduling algorithms for file transmission over the fading downlink channel from a base station to mobile users. Here, the problem is solved in the case of transmission of a given number of files. Optimal algorithms that minimize the delay and the transmission time are found. Also, specific nonoptimal algorithms are considered and compared numerically with the optimal ones. We consider a slotted downlink with channels to the mobile users that are dependent in the same slot but independent for different slots. Additionally, some generalizations are presented.     

An on‐demand data broadcasting scheduling algorithm based on dynamic index strategy

On‐demand data broadcasting scheduling is an effective wireless data dissemination technique. Existing scheduling algorithms usually have two problems: (1) with the explosive growth of mobile users and real‐time individual requirements, broadcasting systems present a shortage of scalability, dynamics and timeliness (request drop ratio); (2) with the growth of intelligent and entertained application, energy consumption of mobile client cannot be persistent (tuning time). This paper proposes an effective scheduling algorithm LxRxW. It takes into account the number of lost requests during next item broadcasting time, the number of requests and the waiting time. LxRxW can reduce the request drop ratio. At the same time, the algorithm employs a dynamic index strategy to put forward a dynamic adjusting method on the index cycle length (DAIL) to determine the proper index cycle. Extensive experimental results show that the LxRxW algorithm has better performance than other state‐of‐the‐art scheduling algorithms and can significantly reduce the drop ratio of user requests by 40%–50%. The request drop ratio and accessing time of LxRxW with index increase by 1%–2% than LxRxW algorithm without index, but the tuning time decreases by 70%. The index strategy shows that when the index cycle length is less than 20units, it can significantly reduce the average tuning time but when the index cycle length continues increasing, the average tuning time will increase contrarily. DAIL can dynamically determine the length of index cycle. Moreover, it can reach optimal integrated performance of the request drop ratio, the average accessing time and the average tuning time. Copyright © 2013 John Wiley & Sons, Ltd.     

A Cost-Efficient Scheduling Algorithm of On-Demand Broadcasts

In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the response time of the requests has been used as a performance measure. In this paper we consider the performance as the average cost of request composed of three kinds of costs – access time cost, tuning time cost, and cost of handling failure request. Our main contribution is a self-adaptive scheduling algorithm named LDFC, which computes the delay cost of data item as the priority of broadcast. It costs less compared with some previous algorithms in this context, and shows good adaptability as well even in pure push-based broadcasts.     

Broadcast Data Allocation for Efficient Access of Multiple Data Items in Mobile Environments

The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and facilitate data access for the mobile user. Many approaches have been proposed to schedule data items for broadcasting. However, the issues of accessing multiple data items on the broadcast channel are less discussed. Two problems are discussed in this paper, that is, deciding the content of the broadcast channel based on the queries from the clients, and scheduling the data items to be broadcast. We will show that these two problems are NP-complete. Different heuristics to these problems are presented and compared through performance evaluations.     

A Bandwidth Reservation Multiple Access Protocol for Wireless ATM Local Networks

A bandwidth reservation multiple access scheme(BRMA) is proposed to resolve contention and assignbandwidth among multiple users trying to gain access toa common channel such as in mobile users contending for resources in an ATM-based cellular networkor a wireless local area network (LAN) with shortpropagation delays. The protocol is best suited tosupport variable-bit-rate (VBR) traffic that exhibits high temporal fluctuations. Each mobile user isconnected end-to-end to another user over virtualchannels via the base station that is connected to thewired ATM B-ISDN network. The channel capacity is modeled as a time frame with a fixed duration.Each frame starts with minislots, to resolve contentionand reserve bandwidth, followed by data-transmissionslots. Every contending user places a request for data slots in one of the minislots. If therequest is granted by the base station through adownlink broadcast channel, the user then startstransmission in the assigned slot(s). The number ofassigned slots varies according to the required qualityof service (QoS), such as delay and packet lossprobability. A speech activity detector is utilized inorder to indicate the talkspurts to avoid wastingbandwidth. Due to its asynchronous nature, BRMA is ratherinsensitive to the burstiness of the traffic. Since theassignment of the minislots is deterministic, therequest channels are contention-free and the data channels are collision-free. Hence, in spite ofthe overhead (minislots) in each frame, BRMA provideshigher throughput than Packet Reservation MultipleAccess (PRMA) for the same QoS, especially for high-speed systems. A better delay performance is alsoachieved for data traffic compared to Slotted Alohareservation-type protocol PRMA. In addition, BRMAperforms better in terms of bandwidth efficiency thanthe conventional TDMA or the Dynamic TDMA, wherespeech activity detectors are very difficult toimplement.     

A demand assignment system for mobile users in a community ofinterest

The paper presents a high performance wireless access and switching system for interconnecting mobile users in a community of interest. Radio channel and time slot assignments are made on user demand, while the switch operations are controlled by a scheduling algorithm designed to maximize utilization of system resources and optimize performance. User requests and assignments are carried over a low-capacity control channel, while user information is transmitted over the traffic channels. The proposed system resolves both the multiple access and the switching problems and allows a direct connection between the mobile end users. The system also provides integration of voice and data traffic in both the access link and the switching equipment. The “movable boundary” approach is used to achieve dynamic sharing of the channel capacity between the voice calls and the data packets. Performance analysis based on a discrete time Markov model, carried out for the case of optimum scheduling yields call blocking probabilities and data packet delays. Performance results indicate that data packets may be routed via the exchange node with limited delays, even with heavy load of voice calls. Also the authors have proposed scheduling algorithms that may be used in implementing this system     

Optimal reliable relay selection in multiuser cooperative relaying networks

In this paper, we investigate the problem of optimal reliable relay selection in multiuser cooperative wireless networks in the presence of malicious relay nodes. A general discrete time queueing model for such networks is introduced which takes into account the dynamic variations of the channel state, the dynamic malicious behaviour of relay nodes as well as stochastic arrival of data packets into the system. The model consists of a set of mobile users, one destination node and a set of relay nodes which may be either mobile or fixed. The system uses the benefit of cooperative diversity by relaying in the decode and forward mode. We assume that each user either transmits its packets directly to the destination (direct mode) or transmits them with the cooperation of a selected relay node (cooperative mode). It is assumed that a centralized network controller manages the relay selection process in the system. At each time slot, a malicious relay node in the system may behave spitefully and refuse to cooperate with a user deliberately when it is selected to cooperate with that user. A malicious relay node usually acts stochastically to hide its malicious behaviour for longer time. In such a system, at each time slot the network controller should decide whether a user has to cooperate with any relay node or not and if so, which relay node must be selected for cooperation. First, we show that the malicious behaviour of relay nodes makes the stable throughput region shrink. Then, we propose a throughput optimal secure relay selection policy that can stabilize the system for all the arrival rate vectors strictly inside the network stability region. We show that the optimal policy is equivalent to finding the maximum weighted matching in a weighted bipartite graph at each time slot. Finally, we use simulations to compare the performance of the proposed policy with that of four other sub-optimal policies in terms of average queue occupancy (or queueing delay).