Energy Efficient Reliable Data Collection in Wireless Sensor Networks with Asymmetric Links

Field measurements reveal that radio link asymmetry has a severe impact on reliable data delivery. We analyze the energy efficiencies of selected reliability schemes for asymmetric radio links using theoretical models. The analysis provides guidelines for retransmission control so as to balance between reliability and energy consumption. We also design two enhancements to the “implicit” ARQ scheme addressing the negative effects of asymmetric radio links. The energy efficiencies of these algorithms are explicitly derived using our theoretical model and validated by simulations and field trials. Based on the analysis of the two enhanced algorithms, we propose an improvement, referred to as Energy Efficient Reliable Data Collection (EERDC) that controls the retransmissions of the enhanced ARQ schemes. Simulations and field trials confirm our theoretical findings and demonstrate that our proposed EERDC algorithm alleviates the impact of link asymmetry and achieves energy savings.

Minimum Path Exposure and Detection Interval Setting for Target Detection Using Wireless Sensor Network

Sensor network generally detects target at a fixed frequency. Detection interval means time spacing between two adjacent detection attempts. While designing a sensor network for detection of target intrusion in a specific region, the interval should be carefully set with trade-off between power consumption and detection performance. This is because redundant power may be consumed if it is too short and the target may be missed if too long. In this paper, we study the determination of the maximum detection interval (MDI) with specified detection performance. Path exposure is adopted as a performance metric. For detection-oriented application, a novel method to evaluate the minimum path exposure (MPE) is developed. Then the MDI problem is formulated and its solution is presented. The factors influencing the MDI are extensively simulated.

Efficient Access Control for Wireless Sensor Data

Although very developed in many sectors (databases, filesystems), access control schemes are still somewhat elusive when it comes to wireless sensor networks. However, it is clear that many WSN systems—such as healthcare and automotive ones—need a controlled access to data that sensor nodes produce, given its high sensitivity. Enforcing access control in wireless sensor networks is a particularly difficult task due to the limited computational capacity of wireless sensor nodes. In this paper we present a full-fledged access control scheme for wireless sensor data. We enforce access control through data encryption, thus embedding access control in sensor data units. We also propose a lightweight key generation mechanism, based on cryptographic hash functions, that allows for hierarchical key derivation. The suggested protocol only relies on simple operations, does not require interactions between nodes and data consumers and has minimal storage requirements.

Improving performance of TCP over mobile wireless networks

Mobile IP is a network layer protocol for handling mobility of hosts in the Internet. However, mobile IP handoff causes degradation of TCP performance. Hence, there is a need for improving performance of TCP over mobile IP in wireless mobile networks. We propose an approach which handles losses due to both wireless link errors and host mobility. To handle losses due to host mobility, a method for seamless handoff is proposed. Empirical results show that the scheme provides substantial improvement of performance.

Modeling and designing efficient data aggregation in wireless sensor networks under entropy and energy bounds

Sensor networks are characterized by limited energy, processing power, and bandwidth capabilities. These limitations become particularly critical in the case of event-based sensor networks where multiple collocated nodes are likely to notify the sink about the same event, at almost the same time. The propagation of redundant highly correlated data is costly in terms of system performance, and results in energy depletion, network overloading, and congestion. Data aggregation is considered to be an effective technique to reduce energy consumption and prevent congestion in wireless sensor networks. In this paper, we derive a number of important insights concerning the data aggregation process, which have not been discussed in the literature so far. We first estimate the conditions under which aggregation is a costly process in comparison to a non aggregation approach, by considering a realistic scenario where the processing costs related to aggregation of data are not neglected. We also consider that aggregation should preserve the integrity of data, and therefore, the entropy of the correlated data sent by sources can be considered in order to both decrease the amount of redundant data forwarded to the sink and perform an overall lossless process. We also derive the cumulative and the probability distribution functions of the delay in an aggregator node queue, which can be used to relate the delay to the amount of aggregation being considered. The framework we present in this paper serves to investigate the tradeoff between the increase in data aggregation required to reduce energy consumption, and the need to maximize information integrity, while also understanding how aggregation impacts the network propagation delay of a data packet.

A New Coded Cooperation Scheme for Wireless Communications and its Performance Analysis

We propose a new coded cooperation scheme for wireless communications to obtain transmit diversity in the scenarios that agents such as mobile handsets, sensor network nodes and etc., due to size, power or other constraints, cannot utilize multiple antennas. New scheme supports more than two cooperative users with a relatively low cooperation level. We evaluate the performance of the proposed scheme in a frequency nonselective slow fading channel. For two cooperative users, we provide the exact analytical analysis. However, for more than two users, as the analytical analysis is very complicated, our performance evaluation is based on computer simulations. Our numerical results show that each of the N cooperative users obtains a full diversity order of N at moderate to high signal to noise ratio regimes. In addition, the results indicate that the new coded cooperation scheme can achieve a noticeable gain over the non-cooperative scheme. Further, the simulation results confirm the analytical derivations derived for two cooperative users.

Ad hoc networks beyond unit disk graphs

In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks while at the same time being concise enough to promote strong theoretical results. The quasi unit disk graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1. We show that—in comparison to the cost known for unit disk graphs—the complexity results of geographic routing in this model contain the additional factor 1/d ². We prove that in quasi unit disk graphs flooding is an asymptotically message-optimal routing technique, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if .

Power Management and Data Rate Maximization in Wireless Energy Harvesting Sensors

This paper considers the problem of power management and throughput maximization for energy neutral operation when using an energy harvesting sensor (EHS) to send data over a wireless link. The EHS is assumed to be able to harvest energy at a constant rate, and use a fixed part of the energy harvested in a slot for measuring the channel state. The rest of the energy harvested is available for transmission, however, it can be stored in an inefficient battery if it is not fully utilized. The key constraint that the EHS needs to satisfy is energy neutrality, i.e., the expected energy drawn from the battery should equal the expected energy deposited into the battery. In this scenario, two popular models for data transmission are contrasted: the constant bit rate (CBR) model and the variable bit rate (VBR) model. In the CBR model, it is assumed that the EHS are designed to transmit data at a constant rate (using a fixed modulation and coding scheme) but are power-controlled. In the VBR model, the EHS selects both the transmit power and the data rate of transmission in each slot based on the channel instantiation. A framework under which the system designer can optimize several parameters of the EHS that determine the average data rate performance when the channel is Rayleigh fading is developed. Using this framework, the two transmission schemes are contrasted. It is shown that, with the right choice of parameter settings, the CBR scheme can perform nearly as well as the VBR scheme at significantly lower complextiy. The usefulness and validity of the framework developed is illustrated through simulations for specific examples.

Cross-layer Routing Design in Cognitive Radio Networks by Colored Multigraph Model

In this paper, the cross-layer design routing in cognitive radio(CR) networks is studied. We propose a colored multigraph based model for the temporarily available spectrum bands, called spectrum holes in this paper. Based on this colored multigraph model, a polynomial time algorithm with complexity O(n ²) is also proposed to develop a routing and interface assignment, where n is the number of nodes in a CR network. Our algorithm optimizes the hop number of routing, meanwhile, the adjacent hop interference (AHI) is also optimized locally.

A New Routing Metric for Satisfying Both Energy and Delay Constraints in Wireless Sensor Networks

Besides energy constraint, wireless sensor networks should also be able to provide bounded communication delay when they are used to support real-time applications. In this paper, a new routing metric is proposed. It takes into account both energy and delay constraints. It can be used in AODV. By mathematical analysis and simulations, we have shown the efficiency of this new routing metric.

Routing scalability in multi-domain DWDM networks

This paper studies routing scalability in multi-domain DWDM networks. Although inter-domain provisioning has been well studied for packet/cell-switching networks, the wavelength dimension (along with wavelength conversion) poses many challenges in multi-domain DWDM settings. To address these concerns a detailed GMPLS-based hierarchical routing framework is proposed for multi-domain DWDM networks with wavelength conversion. This solution uses mesh topology abstraction schemes to hide domain-internal state. However related inter-domain routing loads can be significant here, growing by the square of the number of border nodes. To address these scalability limitations, improved inter-domain routing update strategies are also proposed and the associated performance of inter-domain lightpath RWA and signaling schemes studied.

Some New Expressions for Nakagami Fading Based on Order Statistics

Alternative representations based on order statistics are derived for the probability of error for orthogonal, biorthogonal, and transorthogonal signaling. Short programs in are developed for the computation of these representations and to furnish evidence to show that their performance is superior to the traditional Monte Carlo approach.

Robust Multi-Path Zone Routing Protocol for Video Transport Over Reconfigurable Wireless Networks

Multimedia transport has stringent bandwidth, delay, and loss requirements. It is a great challenge to support such applications in reconfigurable wireless networks (RWNs). Using multiple paths in parallel for multimedia transport provides a new degree of freedom in designing robust multimedia transport systems. In this paper, we provide a multi-path extension to zone routing protocol (ZRP) to support video transmission over RWNs. We compare ZRP and our multi-path routing scheme by using NS-2 simulator. The experiments show that our method is effective in improving the robustness of video transport over RWNs.

A dynamic hop count shifting RWA algorithm for wavelength routed optical networks

In this article, we find that the limiting hop count in a lightpath impacts on the performance of optical networks. Based on this observation, we propose a dynamic hop count shifting (DYHOS) algorithm that limits the hop count of lightpaths dynamically, depending on the traffic load. The proposed algorithm searches an available route, while minimizing the waste of network resources and limiting excessive traffic on the network. Hence, the proposed algorithm increases the network throughput and reduces the blocking probability. Comparing with shortest path routing and adaptive path routing algorithms, we show the performance of the proposed algorithm has the lowest blocking probability influenced by the hop count of lightpaths for a given routing algorithm.

Packet loss analysis in optical packet-switched networks with limited deflection routing

We present an approximate analytical method for the evaluation of packet loss probability in synchronous optical packet-switched networks which operate under limited deflection routing with the contention resolution method based on priorities. Packets are lost because they are removed by nodes. They are removed because they experience too many deflections and stay prohibitively long in the network. Such packets have to be removed because they will be ignored by the transmission protocols (like TCP) and because the quality of their optical signal is unacceptable. Presented are results for the network in the topology of the torus of the two-dimensional grid, which operates at a steady state with the uniform load u, . The strength of our analysis is its novel mathematical approach, which is capable of providing very low packet loss probabilities. For the network composed of 100 nodes, we predict the packet loss probability as low as 10⁻⁹ or lower, while simulation provided results only at the order of 10⁻⁶. For a given permissible packet loss probability, our analysis provides the maximal network load and the number of allowed deflections. We verify the analysis with simulation in the cases for which simulation gave results.

Scalable architectures for all-optical label swapping nodes

All-Optical Label Swapping (AOLS) nodes are believed to be part of the future networks. The original node designs, however, are very hard scalable. This article presents three alternatives that swap labels analogous to the original design. Two of the proposed new switches use the same all-optical technology to parallelly compare labels but, they divide fibres in data wavelengths that only transport payloads and label wavelengths that only transport labels. The third design sequentially compares the incoming label with addresses in the node available in order to make the routing decision. All three architectures are compared in terms of hardware necessary to perform routing.

On the performance of distributed lightpath provisioning with dynamic routing and wavelength assignment

Distributed lightpath provisioning in wavelength-division multiplexing (WDM) networks has gained wide research interests. In this article, we study the performance of distributed lightpath provisioning in WDM networks with dynamic routing and wavelength assignment (RWA). Specifically, we consider the case where routing of each lightpath is calculated based on globally flooded link-state information, and wavelength assignment is decided through local information exchanges. Simulation results show that such schemes steadily outperform those schemes with only global flooding or only local information exchanges. More significantly, the impacts of various factors on the proposed scheme, including RWA algorithm, network topology, number of wavelengths per fiber, global flooding interval, and traffic load, have been evaluated. Such evaluations help to achieve some insights useful for the future developments of efficient lightpath provisioning schemes.

OSNR model to consider physical layer impairments in transparent optical networks

We propose a model that considers several physical impairments in all-optical networks based on optical signal-to-noise degradation. Our model considers the gain saturation effect and amplified spontaneous emission depletion in optical amplifiers, coherent crosstalk in optical switches, and four-wave mixing in transmission fibers. We apply our model to investigate the impact of different physical impairments on the performance of all-optical networks. The simulation results show the impact of each impairment on network performance in terms of blocking probability as a function of device parameters. We also apply the model as a metric for impairment-constraint routing in all-optical networks. We show that our proposed routing and wavelength assignment algorithm outperforms two common approaches.

Potential Cognitive Radio Denial-of-Service Vulnerabilities and Protection Countermeasures: a Multi-dimensional Analysis and Assessment

Cognitive radios sense spectrum activity and apply spectrum policies in order to make decisions on when and in what bands they may communicate. These activities go beyond what is done when traditional radios communicate. This paper examines the denial of service vulnerabilities that are opened by these additional activities and explores potential protection remedies that can be applied. An analysis of how vulnerable are victim cognitive radios to potential denial of service attacks is presented along different axis, namely the network architecture employed, the spectrum access technique used and the spectrum awareness model. The goal is to assist cognitive radio designers to incorporate effective security measures now in the early stages of cognitive radio development.