A new approach to the design and analysis of peer‐to‐peer mobile networks

This paper introduces a new model and methodological approach for dealing with the probabilistic nature of mobile networks based on the theory of random graphs. Probabilistic dependence between the random links prevents the direct application of the theory of random graphs to communication networks. The new model, termed Random Network Model, generalizes conventional random graph models to allow for the inclusion of link dependencies in a mobile network. The new Random Network Model is obtained through the superposition of Kolmogorov complexity and random graph theory, making in this way random graph theory applicable to mobile networks. To the best of the authors' knowledge, it is the first application of random graphs to the field of mobile networks and a first general modeling framework for dealing with adhoc network mobility. The application of this methodology makes it possible to derive results with proven properties. The theory is demonstrated by addressing the issue of the establishment of a connected virtual backbone among mobile clusterheads in a peertopeer mobile wireless network. Using the Random Network Model, we show that it is possible to construct a randomized distributed algorithm which provides connectivity with high probability, requiring exponentially fewer connections (peertopeer logical links) per clusterhead than the number of connections needed for an algorithm with a worst case deterministic guarantee.     

How to Effectively Use Multiple Channels in Wireless Mesh Networks

Operating on a frequency band occupying several nonoverlapping channels, IEEE 802.11 is now widely used in wireless mesh networks (WMNs). Many multichannel MAC protocols are proposed to improve the spatial reuse in the network under the assumption that the transmissions on nonoverlapping channels do not interfere with each other. Some joint routing and channel assignment algorithms are also designed to increase the network throughput based on the premise that we can switch between different channels freely. Although simulations show that great improvements on network throughput can be observed in both cases, two fundamental questions remain: 1) Can we really use multiple nonoverlapping channels freely in WMNs? 2) If we can, what will be the cost when we switch channels dynamically and frequently? In this paper, by conducting extensive experiments on our testbed, we attempt to answer these questions. We find that in spite of interference between both overlapping and nonoverlapping channels, we can still use multiple channels in mesh networks under certain conditions but with care. We also show that the channel switching cost is actually very significant in WMNs. We recommend not to switch the channels too frequently when designing the channel assignment algorithms, and those channel assignment algorithms selecting one channel for each packet are not really beneficial.     

Analytical results for optimal choice of location update intervalfor mobility database failure restoration in PCS networks

When the location information for a mobile user in the Home Location Register (HLR) is corrupted or obsolete, the new arriving calls to the user may be lost. In order to minimize the effect of such HLR mobility database failure, a location update scheme called period location updating is proposed, and the cost analysis is performed. Analytical results for the failure recovery time distribution and the average number of call losses, which are crucial for cost analysis, are presented. The optimal location update period is given analytically as a function of other traffic parameters. This optimal choice of location update period lays the foundation for the adaptive adjustment of the location update period in failure restoration for PCS networks     

Mobility management: from GPRS to UMTS

This paper describes mobility management for the third‐generation mobile networks. We focus on the evolution from General Packet Radio Service (GPRS) to Universal Mobile Telecommunication System (UMTS). In this evolution, the radio access network UTRAN has been introduced, and radio‐related management is moved from the core network to UTRAN. We elaborate on how this architecture change affects the mobility management functionality, including the attach and detach procedures, location update, serving radio network controller relocation and intersystem change between GPRS and UMTS. Copyright © 2001 John Wiley & Sons, Ltd.     

Scalable WDM access network architecture based on photonic slotrouting

This paper introduces an approach to solving the fundamental scalability problem of all-optical packet switching wavelength-division multiplexing (WDM) access networks. Current optical networks cannot be scaled by simply adding nodes to existing systems due to the accumulation of insertion losses and/or the limited number of wavelengths. Scalability through bridging requires, on the other hand, the capability to switch packets among adjacent subnetworks on a wavelength basis. Such a solution is, however, not possible due to the unavailability of fast-switching wavelength sensitive devices. In this paper, we propose a scalable WDM access network architecture based on a recently proposed optical switching approach, termed photonic slot routing. According to this approach, entire slots, each carrying multiple packets (one on each wavelength) are “transparently” routed through the network as single units so that wavelength sensitive data flows can be handled using fast-switching wavelength nonsensitive devices based on proven technologies. The paper shows that the photonic slot routing technique can be successfully used to achieve statistical multiplexing of the optical bandwidth in the access network, thus providing a cost-effective solution to today's increasing bandwidth demand for data transmissions     

A deterministic approach to the end-to-end analysis of packet flowsin connection-oriented networks

We analyze the worst-case behavior of general connection-oriented networks, with first-in-first-out (FIFO) queueing policy, forwarding packets along an arbitrary system of routes. A worst-case bound is proven for the end-to-end queueing delay and buffer size needed to guarantee loss-free packet delivery, given that sources satisfy a given source rate condition. The results are based on a novel deterministic approach and help in reconciling the discrepancy between the unstable worst-case behavior of FIFO-based networks and their good practical performance     

An all-IP approach for UMTS third-generation mobile networks

This article describes the UMTS all-IP approach for third-generation mobile systems, with emphasis on the core network architecture. Following the introduction of the core network nodes, we elaborate on application-level registration, circuit-switched call origination, packet-switched call origination, and packet-switched call termination.     

General Packet Radio Service (GPRS): architecture,interfaces, and deployment

This article provides an overview of General Packet Radio Service (GPRS). GPRS reuses the existing GSM infrastructure to provide end‐to‐end packet‐switched services. Benefits of GPRS include efficient radio usage, fast set‐up/access time and high bandwidth with multiple timeslots. GPRS also provides a smooth path for GSM evolution to the third generation mobile network. Specifically, a third generation network can continue to utilize the GPRS IP backbone network. We describe the GPRS network nodes and the interfaces among these nodes. Deployment issues for GPRS are also elaborated. Copyright © 2001 John Wiley & Sons, Ltd.     

Cross-layer quality-driven adaptation for scheduling heterogeneous multimedia over 3G satellite networks

Wireless networks are experiencing a paradigm shift from focusing on the traditional data transfer to accommodating the rapidly increasing multimedia traffic. Hence, their scheduling algorithms have to concern not only network-oriented quality-of-service (QoS) profiles, but also application-oriented QoS targets. This is particularly challenging for satellite multimedia networks that lack fast closed-loop power control and reliable feedbacks. In this paper, we present a cross-layer packet scheduling scheme, namely Hybrid Queuing and Reception Adaptation (HQRA), which performs joint adaptations by considering the traffic information and QoS targets from the applications, the queuing dynamics induced from the network, as well as the end-to-end performance and channel variations from respective users. By jointly optimizing multiple performance criteria at different layers, the scheme enjoys quality-driven, channel-dependant, and network-aware features. HQRA can well accommodate return link diversity and the imperfect feedbacks, whilst ensuring robustness in highly heterogeneous and dynamic satellite environments. We evaluate its performance over diverse network and media configurations in comparison with the state-of-the-art solutions. We observe noticeable performance gains on application-oriented QoS, bandwidth utilization, and objective video quality, together with favorable fairness and scalability measures.     

On Broadcasting in Radio Networks--Problem Analysis and Protocol Design

In this paper we develop a graph-oriented model for dealing with broadcasting in radio networks. Using this model, optimality in broadcasting protocols is defined, and it is shown that the problem of finding an optimal protocol is NP-hard. A polynomial time algorithm is proposed under which a channel is assigned to nodes from global, multiple-source broadcasting considerations. In particular, nodes participating in the broadcast do not interfere with each other's transmissions, but otherwise simultaneous channel reuse is permitted. Protocol implementations of this approach by frequency division and by time division are given. It is shown that, using these protocols, bounded delay for broadcasted messages can be guaranteed.