Reliable data delivery in low energy ad hoc sensor networks

Reliable delivery of data is a classical design goal for reliability-oriented collection routing protocols for ad hoc wireless sensor networks (WSNs). Guaranteed packet delivery performance can be ensured by careful selection of error free links, quick recovery from packet losses, and avoidance of overloaded relay sensor nodes. Due to limited resources of individual senor nodes, there is usually a trade-off between energy spending for packets transmissions and the appropriate level of reliability. Since link failures and packet losses are unavoidable, sensor networks may tolerate a certain level of reliability without significantly affecting packets delivery performance and data aggregation accuracy in favor of efficient energy consumption. However a certain degree of reliability is needed, especially when hop count increases between source sensor nodes and the base station as a single lost packet may result in loss of a large amount of aggregated data along longer hops. An effective solution is to jointly make a trade-off between energy, reliability, cost, and agility while improving packet delivery, maintaining low packet error ratio, minimizing unnecessary packets transmissions, and adaptively reducing control traffic in favor of high success reception ratios of representative data packets. Based on this approach, the proposed routing protocol can achieve moderate energy consumption and high packet delivery ratio even with high link failure rates. The proposed routing protocol was experimentally investigated on a testbed of Crossbow's TelosB motes and proven to be more robust and energy efficient than the current implementation of TinyOS2.x MultihopLQI

Routing efficiency in wireless sensor-actor networks considering semi-automated architecture

Wireless networks have become increasingly popular and advances in wireless communications and electronics have enabled the development of different kind of networks such as Mobile Ad-hoc Networks (MANETs), Wireless Sensor Networks (WSNs) and Wireless Sensor-Actor Networks (WSANs). These networks have different kind of characteristics, therefore new protocols that fit their features should be developed. We have developed a simulation system to test MANETs, WSNs and WSANs. In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model and Shadowing model for lattice and random topologies. We study the routing efficiency and compare the performance of two protocols for different scenarios. By computer simulations, we found that for large number of nodes when we used TwoRayGround model and random topology, the DSR protocol has a better performance. However, when the transmission rate is higher, the routing efficiency parameter is unstable.Peer ReviewedPostprint (published version

An optimal clustering algorithm based distance-aware routing protocol for wireless sensor networks

Wireless Sensors Networks (WSN) consist of low power devices that are deployed at different geographical isolated areas to monitor physical event. Sensors are arranged in clusters. Each cluster assigns a specific and vital node which is known as a cluster head (CH). Each CH collects the useful information from its sensor member to be transmitted to a sink or Base Station (BS). Sensor have implemented with limited batteries (1.5V) that cannot have replaced. To resolve this issue and improve network stability, the proposed scheme adjust the transmission range between CHs and their members. The proposed approach is evaluated via simulation experiments and compared with some references existing algorithms. Our protocol seemed improved performance in terms of extended lifetime and achieved more than 35% improvements in terms of energy consumptio

Cooperative Hyper-Scheduling based improving Energy Aware Life Time Maximization in Wireless Body Sensor Network Using Topology Driven Clustering Approach

The Wireless Body Sensor Network (WBSN) is an incredible developing data transmission network for modern day communication especially in Biosensor device networks. Due to energy consumption in biomedical data transfer have impacts of sink nodes get loss information on each duty cycle because of Traffic interruptions. The reason behind the popularity of WBSN characteristics contains number of sensor nodes to transmit data in various dense regions. Due to increasing more traffic, delay, bandwidth consumption, the energy losses be occurred to reduce the lifetime of the WBSN transmission. So, the sensor nodes are having limited energy or power, by listening to the incoming signals, it loses certain amount of energy to make data losses because of improper route selection. To improve the energy aware lifetime maximization through Traffic Aware Routing (TAR) based on scheduling. Because the performance of scheduling is greatly depending on the energy of nodes and lifetime of the network. To resolve this problem, we propose a Cooperative Hyper-scheduling (CHS) based improving energy aware life time maximization (EALTM) in Wireless Body sensor network using Topology Driven Clustering Approach (TDCA).Initially the method maintains the traces of transmission performed by different Bio-sensor nodes in different duty cycle. The method considers the energy of different nodes and history of earlier transmission from the Route Table (RT) whether the transmission behind the Sink node. Based on the RT information route discovery was performed using Traffic Aware Neighbors Discovery (TAND) to estimate Data Transmission Support Measure (DTSM) on each Bio-sensor node which its covers sink node. These nodes are grouped into topology driven clustering approach for route optimization. Then the priority is allocated based on The Max-Min DTSM, the Cooperative Hyper-scheduling was implemented to schedule the transmission with support of DTSM to reduce the energy losses in WBSN. This improves the energy level to maximization the life time of data transmission in WBSN than other methods to produce best performance in throughput energy level

Unified clustering and communication protocol for wireless sensor networks

In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service

Renormalization group theory for percolation in time-varying networks

Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memory-less Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.Comment: 8 pages, 3 figure

An Energy Driven Architecture for Wireless Sensor Networks

Most wireless sensor networks operate with very limited energy sources-their batteries, and hence their usefulness in real life applications is severely constrained. The challenging issues are how to optimize the use of their energy or to harvest their own energy in order to lengthen their lives for wider classes of application. Tackling these important issues requires a robust architecture that takes into account the energy consumption level of functional constituents and their interdependency. Without such architecture, it would be difficult to formulate and optimize the overall energy consumption of a wireless sensor network. Unlike most current researches that focus on a single energy constituent of WSNs independent from and regardless of other constituents, this paper presents an Energy Driven Architecture (EDA) as a new architecture and indicates a novel approach for minimising the total energy consumption of a WS