Energy-efficient Packet Forwarding Research Articles

Energy-Efficient Packet Forwarding Scheme Based on Fuzzy Decision-Making in Underwater Sensor Networks.

Underwater Wireless Sensor Networks (UWSNs) are subjected to a multitude of real-life challenges. Maintaining adequate power consumption is one of the critical ones, for obvious reasons. This includes proper energy consumption due to nodes close to and far from the sink node (gateway), which affect the overall energy efficiency of the system. These wireless sensors gather and route the data to the onshore base station through the gateway at the sea surface. However, finding an optimum and efficient path from the source node to the gateway is a challenging task. The common reasons for the loss of energy in existing routing protocols for underwater are (1) a node shut down due to battery drainage, (2) packet loss or packet collision which causes re-transmission and hence affects the performance of the system, and (3) inappropriate selection of sensor node for forwarding data. To address these issues, an energy efficient packet forwarding scheme using fuzzy logic is proposed in this work. The proposed protocol uses three metrics: number of hops to reach the gateway node, number of neighbors (in the transmission range of a node) and the distance (or its equivalent received signal strength indicator, RSSI) in a 3D UWSN architecture. In addition, the performance of the system is also tested with adaptive and non-adaptive transmission ranges and scalable number of nodes to see the impact on energy consumption and number of hops. Simulation results show that the proposed protocol performs better than other existing techniques or in terms of parameters used in this scheme.

The Impact of Deployment Pattern and Routing Scheme on the Lifetime in Multi-Sink Wireless Sensor Network

Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.

A Hybrid Multicast Routing for Large Scale Sensor Networks with Holes

In this article, we present RE $^2$ MR, the first hybrid multicast routing protocol that builds on the strengths of existing topology-based, hierarchical and geographic multicast solutions, while addressing their limitations. In RE $^2$ MR, the multicast path search problem is formulated as the capacitated concentrator location problem (CCLP) which yields the network topology that minimizes the sum of path lengths from the multicast root to multicast members. Furthermore, its trajectory-based lightweight hole detection (THLD) discovers deployment area irregularities (i.e., network holes) that affect its solution and autonomously take them into account to generate updated routing paths, and its Energy-efficient Packet Forwarding (EPF) and Multi-level Facility Computation (MFC) reduce computational and communication overheads. We implement RE $^2$ MR in TinyOS and evaluate it extensively using TOSSIM for relatively large-scale simulations (400 nodes); we also implement RE $^2$ MR on real-hardware and perform experiments on a testbed consisting of 42 TelosB motes. Through the simulations and experiments on real-hardware, we demonstrate that RE $^2$ MR reduces the energy consumption by up to 57 percent and the end-to-end delay by up to 8 percent, when compared with the state-of-the-art multicast routing protocols.

Queueing analysis of optical and electronic combined buffer for optical packet switches

Optical packet switching provides high-speed and energy-efficient packet forwarding. Fiber delay line (FDL)-based buffer is one practical solution to avoid packet contention in optical packet switches. However, the FDL buffer suffers from scalability problems, and thus, cannot accommodate a large volume of network traffic at a time. An optical and electronic combined (OE) buffer architecture alleviates the scalability issues. This architecture uses supplementary electronic RAM buffers when the traffic volume increases. We then propose an analytical model of the OE buffer to estimate the blocking probability and the average delay. We find that complex OE combined model can be simply modeled by combination of an existing analytic model of the FDL buffer and an M/M/1/K queueing system. Comparing analytical results with packet-level simulation results, we demonstrate that our analytical results display characteristics similar to the simulation results. This analysis enables to determine appropriate setting of the OE buffer such as the buffer size and use policy.

Fading-aware reliable and energy efficient routing in wireless sensor networks

In this paper, we introduce two fading-aware reliability based routing algorithms for wireless sensor networks (WSNs) with lossy radio links. The proposed algorithms are able to find optimal multi-hop paths in polynomial complexity, over lossy links, which are modeled by using standard fading models (e.g. Rayleigh and Rice fading). These algorithms minimize the energy consumption and ensure reliable packet transmission to the base station ( BS) at the same time. A reliable path is defined in terms of successful packet transfer to the BS despite the lossy links. More precisely, the probability of correct reception of the packet at the BS must exceed a predefined threshold. The first algorithm minimizes the total energy consumption sending a packet over the selected path to the BS. On the other hand, the second algorithm selects a path which maximizes the minimum remaining energy on the node closest to exhaustion and, as a result, balances the energy consumption yielding high longevity. In both cases, reliable and energy efficient packet forwarding in WSN can be reduced to a constrained optimization problem. By using a specific link metrics, these problems can then be mapped into shortest path problems solved in polynomial time. Thus the obtained results ensure the selection of reliable paths which also guarantee minimum energy consumption in real time.