Multi-hop Wireless Communication Research Articles

Real-Time Communications in Large-Scale Wireless Networks

There is an emerging need for realizing real-time quality of service (QoS) over multihop wireless communications in large-scale wireless networks. The applications can include wireless mesh infrastructure for broadband Internet access supporting multimedia services, visual sensor networks for surveillance, and disaster-relief networks. However, a number of challenges still exist as revealed by recent works, where the dataflow QoS performance such as throughput and end-to-end delay can degrade fast with the number of wireless hops. We propose to use large-scale cognitive networking methods to resolve the wireless multihop challenges. By the cognitive-networking concept, data packets travel along opportunistically available paths in the network with opportunistically available spectrum in every hop. Reliable end-to-end communications can be achieved for real-time services, where we show that (1) dataflow throughput can be independent of any number of wireless hops, (2) end-to-end delay and delay variance increase linearly with the number of wireless hops, and (3) delay variance decreases to zero with higher network density. These results are supported by analysis, simulations, and experiments.

Performance of wireless multihop communications systems with cooperative diversity over fading channels

AbstractWe present closed‐form bounds for the performance of wireless multihop communications systems with cooperative diversity over Nakagami‐m fading channels. The end‐to‐end signal‐to‐noise ratio is formulated and upper bounded by using the inequality between harmonic and geometric means of positive random variables. Closed‐form expression is derived for the moment‐generating function and is used to obtain lower bounds for the average error probability. Numerical results are compared with computer simulations showing the tightness of the proposed bounds. Copyright © 2007 John Wiley & Sons, Ltd.

Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-Sky

Within the short span of a decade, Wi-Fi hotspots have revolutionized Internet service provisioning. With the increasing popularity and rising demand for more public Wi-Fi hotspots, network service providers are facing a daunting task. Wi-Fi hotspots typically require extensive wired infrastructure to access the backhaul network, which is often expensive and time consuming to provide in such situations. wireless mesh networks (WMNs) offer an easy and economical alternative for providing broadband wireless Internet connectivity and could be called the web-in-the-sky. In place of an underlying wired backbone, a WMN forms a wireless backhaul network, thus obviating the need for extensive cabling. They are based on multihop communication paradigms that dynamically form a connected network. However, multihop wireless communication is severely plagued by many limitations such as low throughput and limited capacity. In this article we point out key challenges that are impeding the rapid progress of this upcoming technology. We systematically examine each layer of the network and discuss the feasibility of some state-of-the-art technologies/protocols for adequately addressing these challenges. We also provide broader and deeper insight to many other issues that are of paramount importance for the successful deployment and wider acceptance of WMNs.

Cross-Layer Optimized Video Streaming Over Wireless Multihop Mesh Networks

The proliferation of wireless multihop communication infrastructures in office or residential environments depends on their ability to support a variety of emerging applications requiring real-time video transmission between stations located across the network. We propose an integrated cross-layer optimization algorithm aimed at maximizing the decoded video quality of delay-constrained streaming in a multihop wireless mesh network that supports quality-of-service. The key principle of our algorithm lays in the synergistic optimization of different control parameters at each node of the multihop network, across the protocol layers-application, network, medium access control, and physical layers, as well as end-to-end, across the various nodes. To drive this optimization, we assume an overlay network infrastructure, which is able to convey information on the conditions of each link. Various scenarios that perform the integrated optimization using different levels (horizons) of information about the network status are examined. The differences between several optimization scenarios in terms of decoded video quality and required streaming complexity are quantified. Our results demonstrate the merits and the need for cross-layer optimization in order to provide an efficient solution for real-time video transmission using existing protocols and infrastructures. In addition, they provide important insights for future protocol and system design targeted at enhanced video streaming support across wireless mesh networks

Special Section on Challenges in Ad-hoc and Multi-hop Wireless Communications

Special Section on Challenges in Ad-hoc and Multi-hop Wireless Communications

Direction‐oriented routing scheme for intervehicle multihop wireless networks

AbstractThis paper presents a direction‐oriented routing protocol (DORP) which exploits the features of the intervehicle multihop wireless communications (IVC) environment. Assuming a one‐dimensional highway as the IVC environment, the topology of the IVC network will be straight lines along the road. The relative position of neighboring vehicles will be limited to two directions, and the destination must be in one of two directions. In addition, once the direction of the destination is fixed, each node will just forward a packet in that direction rather than choose a relay node. Therefore, direction information is very attractive as routing information. We consider a group of vehicles driving on a one‐dimensional highway as a traffic model, and evaluate the performance of the proposed scheme by computer simulation. It is found that the proposed scheme can provide a higher packet delivery ratio and a lower number of redundant packets than DSR. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 89(10): 11–22, 2006; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/ecjc.20182

Performance bounds of multihop wireless communications with blind relays over generalized fading channels

In this letter, efficient performance bounds for multihop wireless communications systems with non-regenerative blind relays over non-identical Nakagami-n (Rice), Nakagami-m and Nakagami-q (Hoyt) generalized fading channels, are presented. More specifically, the end-to-end signal-to-noise ratio (SNR) is formulated and upper bounded by using the well-known inequality between harmonic and geometric mean of positive random variables. This bound is used to study important system's performance metrics: i) the moments of the end-to-end SNR which are obtained in closed-forms, and ii) the outage probability and the average error probability for coherent and non-coherent modulations, which are accurately approximated using the moments-based approach. Furthermore, new analytical formulae are derived for the gain of previously proposed semi-blind relays in generalized fading environments. These kind of relays are used in numerical examples and computer simulations to verify the accuracy and to show the tightness of the proposed bounds.

Performance bounds of multihop wireless communications with blind relays over generalized fading channels

Performance bounds of multihop wireless communications with blind relays over generalized fading channels

Multihop Diversity in Wireless Relaying Channels

This paper presents theoretical characterizations and analysis for the physical layer of multihop wireless communications channels. Four channel models are considered and developed: the decoded relaying multihop channel; the amplified relaying multihop channel; the decoded relaying multihop diversity channel; and the amplified relaying multihop diversity channel. Two classifications are discussed: decoded relaying versus amplified relaying, and multihop channels versus multihop diversity channels. The channel models are compared, through analysis and simulations, with the "singlehop" (direct transmission) reference channel on the basis of signal-to-noise ratio, probability of outage, probability of error, and optimal power allocation. Each of the four channel models is shown to outperform the singlehop reference channel under the condition that the set of intermediate relaying terminals is selected intelligently. Multihop diversity channels are shown to outperform multihop channels. Amplified relaying is shown to outperform decoded relaying despite noise propagation. This is attributed to the fact that amplified relaying does not suffer from the error propagation which limits the performance of decoded relaying channels to that of their weakest link.

Maintaining weakly-connected dominating sets for clustering ad hoc networks

An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been proposed to form clusters is to use weakly-connected dominating sets [Y.P. Chen, A.L. Liestman, Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks, in: The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’02), 2002, pp. 165–172; Y.P. Chen, A.L. Liestman, A zonal algorithm for clustering ad hoc networks, International Journal of Foundations of Computer Science 14(2) (2003) 305–322]. Here, we present a zonal distributed algorithm to maintain weakly-connected dominating sets as the network structure changes. When the zones are small, the algorithm is essentially localized; when the zones are large, it behaves more globally. The size of the weakly-connected dominating set obtained also varies depending on the choice of zone size, with larger zones generally resulting in smaller weakly-connected dominating sets. Experiments provide evidence that this maintenance algorithm keeps the size of the weakly-connected dominating set approximately the same as its initial size and does not compromise the network connectivity.

Bandwidth-Efficient WDM Channel Allocation for Four-Wave Mixing-Effect Minimization

This paper presents theoretical characterizations and analysis for the physical layer of multihop wireless communications channels. Four channel models are considered and developed: the decoded relaying multihop channel; the amplified relaying multihop channel; the decoded relaying multihop diversity channel; and the amplified relaying multihop diversity channel. Two classifications are discussed: decoded relaying versus amplified relaying; and multihop channels versus multihop diversity channels. The channel models are compared, through analysis and simulations, with the (direct transmission) reference channel on the basis of signal-to-noise ratio, probability of outage, probability of error, and optimal power allocation. Each of the four channel models is shown to outperform the singlehop reference channel under the condition that the set of intermediate relaying terminals is selected intelligently. Multihop diversity channels are shown to outperform multihop channels. Amplified relaying is shown to outperform decoded relaying despite noise propagation. This is attributed to the fact that amplified relaying does not suffer from the error propagation which limits the performance of decoded relaying channels to that of their weakest link.

Quality of service challenges for wireless mobile ad hoc networks

AbstractWireless mobile ad hoc networks consist of mobile nodes interconnected by wireless multi‐hop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. The topology of such networks changes dynamically as mobile nodes join or depart the network or radio links between nodes become unusable. Supporting appropriate quality of service for mobile ad hoc networks is a complex and difficult issue because of the dynamic nature of the network topology and generally imprecise network state information, and has become an intensely active area of research in the last few years. This paperThis article, except for some minor changes, is essentially the same as one that appears in 103. The latter is a revised and updated version of 51 presents the basic concepts of quality of service support in ad hoc networks for unicast communication, reviews the major areas of current research and results, and addresses some new issues. The principal focus is on routing and security issues associated with quality of service support. The paper concludes with some observations on the open areas for further investigation. Copyright © 2004 John Wiley & Sons, Ltd.

Neighbor caching in multi-hop wireless ad hoc networks

We propose a neighbor caching strategy to overcome the overhead of multi-hop wireless communications. Neighbor caching makes a node able to expand its caching storage instantaneously by storing its data in the storage of idle neighbors. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The ranking based prediction is an adaptive algorithm that adjusts the frequency of neighbor caching and makes neighbor caching flexible according to the idleness of nodes.

Outage probability of multihop transmission over Nakagami fading channels

We present a general analytical framework for the evaluation of the end-to-end outage probability of multihop wireless communication systems with nonregenerative relays over Nakagami fading channels. It is shown that the presented results can either be exact or tight lower bounds on the performance of these systems depending on the choice of the relay gain. More specifically, we obtain a closed-form expression for the moment generating function of the reciprocal of the end-to-end signal-to-noise ratio (SNR) and we then use this expression to calculate the outage probability via numerical inversion of the Laplace transform. Numerical examples show that regeneration is more crucial at low average SNR and for multihop systems with a large number of hops.

Fundamental characteristics of multi-hop wireless communication networks

This paper discusses stochastic characteristics of hierarchical multi?hop wireless networks. It is assumed that terminals and base stations are distributed according to specific distributions, respectively. It is also assumed that a multi?hop wireless network is logically divided into clusters by a clustering algorithm. In this paper, the Lowest ID Cluster algorithm and another simple clustering algorithm are considered. Using theoretical techniques based on the stochastic geometry, this paper analyzes fundamental characteristics of the multi?hop wireless networks with the clustering algorithms.

F/A-18 Hornet reliability program: status report : Tommy W. Gordon. Proc. a. Reliab. Maintainab. Symp., 228 (1986)

Vespa velutina, also known as the Asian hornet, is considered as an invasive species out of its native zone. In particular, since it preys on honey bees, its recent progression in Europe could soon pose a significant risk to the local apiculture activity. European beekeepers are therefore investigating adapted control strategies, including V. velutina nest destruction. Unfortunately, nest location pinpointing generally follows a manual process which can prove tedious, time-consuming and inaccurate. In this article, we propose the use of a network of micro aerial vehicles featuring autonomous and cooperative flight capabilities. We describe an adapted controlled mobility strategy and detail the design of our Virtual Force Protocol (VFP) which allows a swarm of vehicles to track and follow hornets to their nests, while maintaining connectivity through a wireless multi-hop communication route with a remote ground station used to store applicative data such as hornet trajectory and vehicle telemetry. In order to achieve the mission objectives with a minimum of vehicles, we identify through simulations appropriate value for the key parameters of VFP and discuss the obtained network performance.