M-ATTEMPT: A New Energy-Efficient Routing Protocol for Wireless Body Area Sensor Networks

In this paper, we propose a new routing protocol for heterogeneous Wireless Body Area Sensor Networks (WBASNs); Mobility-supporting Adaptive Threshold-based Thermal-aware Energy-efficientMulti-hop ProTocol (M-ATTEMPT). A prototype is defined for employing heterogeneous sensors on human body. Direct communication is used for real-time traffic (critical data) or on-demand data while Multi-hop communication is used for normal data delivery. One of the prime challenges in WBASNs is sensing of the heat generated by the implanted sensor nodes. The proposed routing algorithm is thermal-aware which senses the link Hot-spot and routes the data away from these links. Continuous mobility of human body causes disconnection between previous established links. So, mobility support and energy-management is introduced to overcome the problem. Linear Programming (LP) model for maximum information extraction and minimum energy consumption is presented in this study. MATLAB simulations of proposed routing algorithm are performed for lifetime and successful packet delivery in comparison with Multi-hop communication. The results show that the proposed routing algorithm has less energy consumption and more reliable as compared to Multi-hop communication.Comment: arXiv admin note: substantial text overlap with arXiv:1208.609

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

AM-DisCNT: Angular Multi-hop DIStance based Circular Network Transmission Protocol for WSNs

The nodes in wireless sensor networks (WSNs) contain limited energy resources, which are needed to transmit data to base station (BS). Routing protocols are designed to reduce the energy consumption. Clustering algorithms are best in this aspect. Such clustering algorithms increase the stability and lifetime of the network. However, every routing protocol is not suitable for heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy efficient protocol for wireless sensor networks. AM-DisCNT uses circular deployment for even consumption of energy in entire wireless sensor network. Cluster-head selection is on the basis of energy. Highest energy node becomes CH for that round. Energy is again compared in the next round to check the highest energy node of that round. The simulation results show that AM-DisCNT performs better than the existing heterogeneous protocols on the basis of network lifetime, throughput and stability of the system.Comment: IEEE 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

Reliable routing scheme for indoor sensor networks

Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may create long hops routes, and the high quality paths will be frequently used. This leads to shorter lifetime of such paths; thereby the entire network's lifetime will be significantly minimized. This paper briefly presents a reliable load-balanced routing (RLBR) scheme for indoor ad hoc wireless sensor networks, which integrates routing information from different layers. The proposed scheme aims to redistribute the relaying workload and the energy usage among relay sensor nodes to achieve balanced energy dissipation; thereby maximizing the functional network lifetime. RLBR scheme was tested and benchmarked against the TinyOS-2.x implementation of MintRoute on an indoor testbed comprising 20 Mica2 motes and low power listening (LPL) link layer provided by CC1000 radio. RLBR scheme consumes less energy for communications while reducing topology repair latency and achieves better connectivity and communication reliability in terms of end-to-end packets delivery performance

Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach