Wireless Communications

Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination. Given power limitations, the advent of short-range wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where there is never a connected path from source to destination or when a network partition exists at the time a message is originated. To this end, we introduce Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery. The goals of Epidemic Routing are to: i) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.

/pdf/epidemic-routing-for-partially-connected-ad-hoc-networks-s5rslcaiip.pdf

Epidemic routing for partially-connected ad hoc networks

It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

On the capacity of a cellular CDMA system

Cell phones and other portable devices are equipped with a variety of technologies by which existing functionality can be improved, and new functionality can be provided. Some relate to visual search capabilities, and determining appropriate actions responsive to different image inputs. Others relate to processing of image data. Still others concern metadata generation, processing, and representation. Yet others relate to coping with fixed focus limitations of cell phone cameras, e.g., in reading digital watermark data. Still others concern user interface improvements. A great number of other features and arrangements are also detailed.

Methods and Systems for Content Processing

Even though multiple non-overlapped channels exist in the 2.4 GHz and 5 GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a result, these networks rarely can fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. This prevents them from being used as an ISP's wireless last-mile access network or as a wireless enterprise backbone network. In this paper, we propose a multi-channel wireless mesh network (WMN) architecture (called Hyacinth) that equips each mesh network node with multiple 802.11 network interface cards (NICs). The central design issues of this multi-channel WMN architecture are channel assignment and routing. We show that intelligent channel assignment is critical to Hyacinth's performance, present distributed algorithms that utilize only local traffic load information to dynamically assign channels and to route packets, and compare their performance against a centralized algorithm that performs the same functions. Through an extensive simulation study, we show that even with just 2 NICs on each node, it is possible to improve the network throughput by a factor of 6 to 7 when compared with the conventional single-channel ad hoc network architecture. We also describe and evaluate a 9-node Hyacinth prototype that Is built using commodity PCs each equipped with two 802.11a NICs.

/pdf/architecture-and-algorithms-for-an-ieee-802-11-based-multi-2ha0rzhjbz.pdf

Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network

The authors propose a computationally simple approximate expression for the equivalent capacity or bandwidth requirement of both individual and multiplexed connections, based on their statistical characteristics and the desired grade-of-service (GOS). The purpose of such an expression is to provide a unified metric to represent the effective bandwidth used by connections and the corresponding effective load of network links. These link metrics can then be used for efficient bandwidth management, routing, and call control procedures aimed at optimizing network usage. While the methodology proposed can provide an exact approach to the computation of the equivalent capacity, the associated complexity makes it infeasible for real-time network traffic control applications. Hence, an approximation is required. The validity of the approximation developed is verified by comparison to both exact computations and simulation results. >

/pdf/equivalent-capacity-and-its-application-to-bandwidth-4fytcdoedy.pdf

Equivalent capacity and its application to bandwidth allocation in high-speed networks

This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed/centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.

Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey

This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed⁄centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.

Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

The shadow cluster concept can be used to estimate future resource requirements and to perform call admission decisions in wireless networks. Shadow clusters can be used to decide if a new call can be admitted to a wireless network based on its quality-of-service (QoS) requirements and local traffic conditions. The shadow cluster concept can especially be useful in future wireless networks with microcellular architectures where service will be provided to users with diverse QoS requirements. The framework of a shadow cluster system is completely distributed, and can be viewed as a message system where mobile terminals inform the base stations in their neighborhood about their requirements, position, and movement parameters. With this information, base stations predict future demands, reserve resources accordingly, and admit only those mobile terminals which can be supported adequately. The shadow cluster concept involves some processing and communication overheads. These overheads have no effect on wireless resources, but only on the base stations and the underlying wireline network. It is shown how base stations determine the probabilities that a mobile terminal will be active in other cells at future times, define and maintain shadow clusters by using probabilistic information on the future position of their mobile terminals with active calls, and predict resource demands based on shadow cluster information. In addition, a call admission algorithm is introduced, which uses current traffic and bandwidth utilization conditions, as well as the amount of resources and maximum allowable "dropping probability" being requested. Performance results showing the advantages of the shadow cluster concept are also included.

A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept

An architecture is presented for a high-speed cellular radio access network based on ATM transport technology. Central to this approach is a new concept known as the virtual connection tree which avoids the need to involve the network call processor for every cell handoff attempt. Such an approach can readily support a very high rate of handoffs, thereby enabling use of physically small radio cells to provide very high system capacity, but may occasionally cause the volume of traffic to be handled by one cell site to exceed that cell site's capacity. A simple analytical methodology is developed which can be used for admission control, the purpose of which is to limit the number of in-progress calls such that two new quality of service metrics (overload probability and average time in overload) can be kept suitably low. Finally, a general framework is presented for overall system organization and signaling. >

Mahmoud Naghshineh

Papers

Equivalent capacity and its application to bandwidth allocation in high-speed networks

Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey

Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept

An architecture and methodology for mobile-executed handoff in cellular ATM networks