An adaptive Paris Metro Pricing scheme for mobile data networks

Because static pricing models (such as flat‐rate or tiered‐rate models) cannot improve user utility for subscribers and ease network congestion for operators during peak time, Smart Data Pricing has become an important incentive for mobile data markets. Paris Metro Pricing (PMP), which is a static pricing mode inspired by the pricing model for the Paris metro system, uses differentiated prices to motivate users to choose different train classes. Before choosing a class, people will consider their expected quality of service versus the prices that they are willing to pay. Even though PMP cannot guarantee the actual quality of service during service time, a balance between users' utilities and operators' revenue is achieved. In this paper, we propose an adaptive PMP scheme, so‐called APMP, which determines the dynamic access prices of different classes for the next 24 h. The accessible prices should try to increase the revenue while operators can serve more subscribers. Our simulation results show that APMP can significantly improve total revenue and average revenue per user for the operator. Copyright © 2016 John Wiley & Sons, Ltd.     

移动分布式无线网络中具有QoS保证的UPMA协议

该文基于有效竞争预约接入、无冲突轮询传输的思想提出了支持节点移动性、多跳网络结构和服务质量(QoS)的依据用户妥善安排的多址接入(UPMA)协议。它大大提高了信道的使用效率,保证了发送节点能快速接入信道,同时,最大程度地保证所有实时业务的时延和带宽要求。最后,我们考察了它对Internet数据业务的支持性能。     

An adaptive resource reservation for vehicular mobile networks

This paper presents the time‐based bandwidth reservation (TBR) algorithm, suitable for handoff management in cellular systems. TBR is based on real‐time measurements of mobile stations (position, velocity and acceleration). The scheme consists in sending reservation requests to the neighboring cells based on an extrapolation of the user's motion. The originality of our approach lies in dynamically adjusting the amount of time for which bandwidth has to be allocated and reserved in a cell. In addition, we propose an optimal channel requests arrangement (CRA) algorithm in order to improve the performance of TBR in terms of resource utilization. Finally, we propose VTBR, an adapted and extended version of TBR for better support of vehicular network specificities where service degradation or forced call termination may occur owing to frequent handoffs. Detailed simulation results for TBR and VTBR schemes and a comparison with the guard channel scheme are presented. The results show that TBR and VTBR can efficiently improve the flow dropping probability. Copyright © 2008 John Wiley & Sons, Ltd.     

Realistic cell-oriented adaptive admission control for QoS support in wireless multimedia networks

An important quality-of-service (QoS) issue in wireless multimedia networks is how to control handoff drops. We propose admission-control algorithms that adaptively control the admission threshold in each cell in order to keep the handoff-dropping probability below a predefined level. The admission threshold is dynamically adjusted based on handoff-dropping events. We first present a simple admission-control scheme that brings out an important performance evaluation criterion - intercell fairness - and serves as a reference point. We then investigate the intercell unfairness problem and develop two enhanced schemes to overcome this problem. The performance of these protocols is benchmarked and compared with other competitive schemes. The results indicate that our schemes perform very well while, in addition, achieving significantly reduced complexity and signaling load.     

Novel velocity and call duration support for QoS provision in mobile wireless networks

This article presents a novel mobility-based resource reservation and call admission control scheme that is applicable to any real wireless multimedia network. The scheme exploits three key mobility parameters - the position, direction, and speed of a mobile unit - together with the duration of a particular call to accurately estimate the cell visiting probability in order to identify a shadow cluster of cells the unit is most likely to visit. Each cell in the cluster reserves resources for an estimated time interval, which is adapted depending on the aggregated probability of all active units visiting a particular cell. Simulation results confirm the superiority of the new scheme over the existing predictive mobility support scheme in terms of three QoS parameters: call blocking rate, call dropping rate, and channel utilization.     

An adaptive transmission-scheduling protocol for mobile ad hoc networks

Transmission-scheduling protocols can support contention-free link-level broadcast transmissions and delay sensitive traffic in mobile, multiple-hop packet radio networks. Use of transmission-scheduling protocols, however, can be very inefficient in mobile environments due to the difficulty in adapting transmission schedules. The paper defines a new adaptive and distributed protocol that permits a terminal to adapt transmission assignments to changes in topology using information it collects from its local neighborhood only. Because global coordination among all the terminals is not required and changes to transmission assignments are distributed to nearby terminals only, the protocol can adapt quickly to changes in the network connectivity. The two key parameters that affect the ability of the protocol to adapt to changes in connectivity are the rate of connectivity changes and the number of terminals near the connectivity changes. Using simulation, we determine the ranges for these parameters for which our adaptive protocol can maintain collision-free schedules with an acceptable level of overhead. The stability of the protocol is also characterized by showing that the protocol can quickly return to a collision-free transmission schedule after a period of very rapid changes in connectivity. Our channel-access protocol does not require a contention-based random-access phase to adapt the transmission schedules, and thus its ability to adapt quickly does not deteriorate with an increase in the traffic load.     

Priority-determined multiclass handoff scheme with guaranteed mobile QoS in wireless multimedia networks

The provision of multiclass services is gaining wide acceptance and will be more ubiquitous in future wireless and mobile systems. The crucial issue is to provide the guaranteed mobile quality of service (QoS) for arriving multiclass calls. In multimedia cellular networks, we should not only minimize the dropping rate of handoff calls, but also control the blocking rate of new calls at an acceptable level. This paper proposes a novel multiclass call-admission-control mechanism that is based on a dynamic reservation pool for handoff requests. In this paper, we propose the concept of servicing multiclass connections based on priority determination through the combined analysis of mobile movement information and the desired QoS requirements of multimedia traffic. A practical framework is provided to determine the occurrence time of handoff-request reservations. In our simulation experiments, three kinds of timers are introduced for controlling the progress of discrete events. Our simulation results show that the individual QoS criteria of multiclass traffic such as the handoff call-dropping probability can be achieved within a targeted objective and the new-call-blocking probability is constrained to be below a given level. The proposed scheme is applicable to channel allocation of multiclass calls over high-speed wireless multimedia networks.     

Cross-layer modeling of adaptive wireless links for QoS support in heterogeneous wired-wireless networks

Future wired-wireless multimedia networks require diverse quality-of-service (QoS) support. To this end, it is essential to rely on QoS metrics pertinent to wireless links. In this paper, we develop a cross-layer model for adaptive wireless links, which enables derivation of the desired QoS metrics analytically from the typical wireless parameters across the hardware-radio layer, the physical layer and the data link layer. We illustrate the advantages of our model: generality, simplicity, scalability and backward compatibility. Finally, we outline its applications to power control, TCP, UDP and bandwidth scheduling in wireless networks. The work by Q. Liu and G. B. Giannakis are prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U.S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The work by S. Zhou is supported by UConn Research Foundation internal grant 445157. Qingwen Liu (S’04) received the B.S. degree in electrical engineering and information science in 2001, from the University of Science and Technology of China (USTC). He received the M.S. degree in electrical engineering in 2003, from the University of Minnesota (UMN). He currently pursues his Ph.D. degree in the Department of Electrical and Computer Engineering at the University of Minnesota (UMN). His research interests lie in the areas of communications, signal processing, and networking, with emphasis on cross-layer analysis and design, quality of service support for multimedia applications over wired-wireless networks, and resource allocation. Shengli Zhou (M’03) received the B.S. degree in 1995 and the M.Sc. degree in 1998, from the University of Science and Technology of China (USTC), both in electrical engineering and information science. He received his Ph.D. degree in electrical engineering from the University of Minnesota, 2002, and joined the Department of Electrical and Computer Engineering at the University of Connecticut, 2003. His research interests lie in the areas of communications and signal processing, including channel estimation and equalization, multi-user and multi-carrier communications, space time coding, adaptive modulation, and cross-layer designs. He serves as an associate editor for IEEE Transactions on Wireless Communications since Feb. 2005. G. B. Giannakis (Fellow’97) received his Diploma in Electrical Engineering from the National Technical University of Athens, Greece, 1981. From September 1982 to July 1986 he was with the University of Southern California (USC), where he received his MSc. in Electrical Engineering, 1983, MSc. in Mathematics, 1986, and Ph.D. in Electrical Engineering, 1986. After lecturing for one year at USC, he joined the University of Virginia in 1987, where he became a professor of Electrical Engineering in 1997. Since 1999 he has been a professor with the Department of Electrical and Computer Engineering at the University of Minnesota, where he now holds an ADC Chair in Wireless Telecommunications. His general interests span the areas of communications and signal processing, estimation and detection theory, time-series analysis, and system identification -- subjects on which he has published more than 200 journal papers, 350 conference papers and two edited books. Current research focuses on transmitter and receiver diversity techniques for single- and multi-user fading communication channels, complex-field and space-time coding, multicarrier, ultra-wide band wireless communication systems, cross-layer designs and sensor networks. G. B. Giannakis is the (co-) recipient of six paper awards from the IEEE Signal Processing (SP) and Communications Societies (1992, 1998, 2000, 2001, 2003, 2004). He also received the SP Society’s Technical Achievement Award in 2000. He served as Editor in Chief for the IEEE SP Letters, as Associate Editor for the IEEE Trans. on Signal Proc. and the IEEE SP Letters, as secretary of the SP Conference Board, as member of the SP Publications Board, as member and vice-chair of the Statistical Signal and Array Processing Technical Committee, as chair of the SP for Communications Technical Committee and as a member of the IEEE Fellows Election Committee. He has also served as a member of the IEEE-SP Society’s Board of Governors, the Editorial Board for the Proceedings of the IEEE and the steering committee of the IEEE Trans. on Wireless Communications.     

An adaptive coding scheme with code combining for mobile radiosystems

The authors propose and study an adaptive error-control coding scheme for binary digital FM (BFM) mobile radio transmission. The scheme employs code combining through packet retransmissions. The number of transmissions of a packet is in proportion to the channel fading/noise levels, which is in contrast to time diversity techniques where a fixed number of repetitions of a data packet is performed even in the absence of channel errors. Furthermore, the receiver uses received signal envelopes as channel state information, which significantly improves the throughput and bit error rate (BER) performance. Performance of the proposed scheme is analyzed for frequency-flat Rayleigh fading channels with additive white Gaussian noise (AWGN), co-channel interference and random FM noise     

An adaptive bandwidth reservation scheme for high-speed multimediawireless networks

In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization     

An adaptive location management scheme for mobile broadband cellular systems

This paper presents an adaptive location management strategy that considers both location updating and paging by evaluating realistic mobility patterns. It proposes the design of an adaptive macro-location area based on multi-registration adapted to the terminals’ trajectory to reduce location updates. The solution includes an estimation of residence probabilities in the areas of the multi-registered list. This facilitates the design of a sequential paging scheme that reduces the average paging cost. Results show the capability of the solution to adapt to mobility patterns and traffic conditions in the network to minimize the overall location cost. Furthermore, the multi-registration approach and the reduced complexity in both network infrastructure and mobile terminals make the solution suitable for new packet-based broadband cellular systems.     

An adaptive low-overhead resource discovery protocol for mobile ad-hoc networks

In this paper we propose a Distributed Hash Table (DHT)-based peer-to-peer resource discovery protocol designed for large-scale Mobile Ad-hoc NETwork (MANET). The proposed Mobile Resource Discovery Protocol (MRDP) uses a distributed dynamic clustering algorithm to adaptively and rapidly group nodes in a MANET for resource discovery purpose, and utilizes DHTs to efficiently cache resource information in a peer-to-peer manner. We provide a probabilistic lower bound on the performance of the MRDP. We also present simulation results under different scenarios to show that MRDP has low message overheads and its performance is highly insensitive to the size of the MANET. These characteristics make MRDP suitable for large-scale MANETs.     

An optimized QoS scheme for IMS‐NEMO in heterogeneous networks

The network mobility (NEMO) is proposed to support the mobility management when users move as a whole. In IP Multimedia Subsystem (IMS), the individual Quality of Service (QoS) control for NEMO results in excessive signaling cost. On the other hand, current QoS schemes have two drawbacks: unawareness of the heterogeneous wireless environment and inefficient utilization of the reserved bandwidth. To solve these problems, we present a novel heterogeneous bandwidth sharing (HBS) scheme for QoS provision under IMS‐based NEMO (IMS‐NEMO). The HBS scheme selects the most suitable access network for each session and enables the new coming non‐real‐time sessions to share bandwidth with the Variable Bit Rate (VBR) coded media flows. The modeling and simulation results demonstrate that the HBS can satisfy users' QoS requirement and obtain a more efficient use of the scarce wireless bandwidth. Copyright © 2011 John Wiley & Sons, Ltd.     

An adaptive code position modulation scheme for wireless sensor networks

In this letter, an energy-efficient adaptive code position modulation scheme is proposed for wireless sensor networks to provide the relatively stable bit error ratio (BER) performance expected by the upper layers. The system is designed with focus on the adaptive control of transmission power, which is adjusted based on the measured power density of background noise. Interfaces among the modulation module, packet scheduling module and upper layer are provided for flexible adjustments to adapt to the background noise and deliver expected application quality. Simulations with signal processing worksystem (SPW) validate the effectiveness of the scheme.     

QoS routing for MPLS networks employing mobile agents

The implementation of new networking technologies, such as multiprotocol label switching and differentiated services, will introduce powerful features to the near-future Internet backbone, making a significant contribution to the overall end-to-end provision of quality of service. However, to achieve such an improvement these technologies require not only effective support from current routing algorithms, but also enhanced capabilities, which are currently being developed. To contribute to this development, a novel and powerful scheme is introduced in this article that provides a means of supporting QoS routing through the use of mobile software agents. Specifically, we describe the use of mobile agents to efficiently realize multipoint-to-point routing trees by means of the Wave paradigm, while satisfying the QoS requirements of the set of traffic streams involved in the process. Both benefits and important issues to be considered when using mobile agent schemes in QoS routing are further stressed     

An adaptive FEC scheme for data traffic in wireless ATM networks

A new adaptive forward-error-correction scheme (AFEC) is introduced at the link layer for TCP/IP data traffic in wireless ATM networks. The fading and interference in wireless links cause high and variable error rates, as well as bursty errors. The purpose of the AFEC scheme is to provide a dynamic error-control mechanism by using Reed-Solomon coding to protect the ATM cell payload, as well as the payload type indicator/cell loss priority fields in the ATM cell header. In order to enhance the error tolerance in cell framing and correct delivery, the AFEC scheme functions within a new concept called LANET framing and addressing protection mechanisms. The AFEC scheme has been validated using a simulation testbed of a low-speed wireless ATM network     

Predictive mobility support for QoS provisioning in mobile wirelessenvironments

With the proliferation of wireless network technologies, mobile users are expected to demand the same quality of service (QoS) available to fixed users. This paper presents a predictive and adaptive scheme to support timed-QoS guarantees in pico- and micro-cellular environments. The proposed scheme integrates the mobility model into the service model to achieve efficient network resource utilization and avoid severe network congestion. The mobility model uses a probabilistic approach to determine the most likely cluster to be visited by the mobile unit. The admission control is invoked when a new call arrives or an existing call performs a handoff to verify the feasibility of supporting the call. The performance of the proposed schemes is compared to the shadow cluster scheme. The performance of the proposed scheme under different traffic patterns is also presented     

End-to-end QoS provisioning in mobile heterogeneous networks

The remarkable advances in information technologies bring a heterogeneous environment for mobile users and service providers. This heterogeneity exists in wireless access technologies, networks, user terminals, applications, service providers, and so on. The ability to provide seamless and adaptive quality of service in such a heterogeneous environment is key to the success of next-generation wireless communications systems. There has been a considerable amount of QoS research recently. However, the main part of this research has been in the context of individual architectural components, and much less progress has been made in addressing the issue of an overall QoS architecture for the mobile Internet. This article first summarizes the state-of-the-art QoS techniques and standardization activities, then examines in detail important challenges in building a ubiquitous QoS framework over the heterogeneous environment, and finally proposes a QoS framework integrating a three-plane network infrastructure and a unified terminal cross-layer adaptation platform to provide seamless support for future applications.     

QoS support on fourth generation networks

The arrival of fourth generation mobile networks, based on IP core networks, lead us to the development of certain services, such as: Quality of service, mobility and AAA. This paper proposes architecture to supply quality of service support based in the differentiated services technique, known as Diffserv. In the same way we analyze the main components of this architecture: QoS Broker (central policy broker of quality of service, whose goal is the appropriate configuration of the routers in the network), Access Router (in charge of the management of the queuing system in order to provide QoS) and the AAA server (management of QoS user profiles).