Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks.
ABSTRACT Providing efficient and reliable communication in wireless sensor networks is a challenging problem. To recover from corrupted packets, previous approaches have tried to use retransmissions and FEC mechanisms. The energy efficiency of these mechanisms, however, is very sensitive to unreliable links. In this paper, we present cluster-based forwarding, where each node forms a cluster such that any node in the next-hop's cluster can take forwarding responsibility. This architecture, designed specifically for wireless sensor networks, achieves better energy-efficiency by reducing retransmissions. Cluster-based forwarding is not a routing protocol. Rather, it is designed as an extension layer that can augment existing routing protocols. Using simulations, we demonstrate that cluster-based forwarding is effective in improving both end-to-end energy efficiency and latency of current routing protocols.
SourceAvailable from: Amir Ehsani Zonouz[Show abstract] [Hide abstract]
ABSTRACT: Wireless sensor networks (WSNs) bring significant advantages over traditional communications in today's applications, such as environmental monitoring, homeland security, and health care. However, harsh and complex environments pose great challenges in the reliability of WSN communications. To achieve reliable wireless communications within WSNs, it is essential to have a reliable routing protocol and to have a means to evaluate the reliability performance of different routing protocols. In this paper, we first model the reliability of two different types of sensor nodes: 1) energy harvesting sensor nodes and 2) battery-powered sensor nodes. We then present wireless link reliability models for each type of sensor nodes, where effects of different parameters, such as battery life-time, shadowing, noise, and location uncertainty, are considered for analyzing the wireless link reliability. Based on the sensor node and wireless link reliability models, we compare the performance of different routing algorithms in terms of end-to-end path reliability and number of hops. A dynamic routing approach is then proposed to achieve the most reliable end-to-end path in WSNs. Furthermore, to facilitate a fair and comprehensive comparison among different routing algorithms, a cost function approach that integrates the end-to-end path reliability and number of hops is proposed, providing an indicator of quality of service of applications running on WSNs.IEEE Sensors Journal 01/2014; 14(11):4059-4068. DOI:10.1109/JSEN.2014.2332296 · 1.85 Impact Factor
Conference Paper: Energy efficient routing protocol for wireless sensor network[Show abstract] [Hide abstract]
ABSTRACT: Nowadays Wireless Sensor Networks WSNs are playing a vital role in several application areas ranging health to battlefield Wireless sensor networks are easy to deploy due to its unique characteristics of size and self-organizing networks. Wireless sensor nodes contain small unchangeable and not chargeable batteries. It is a resource constraint type network Routing in WSN is most expensive task as it utilizes more power resources. This paper is intended to introduce energy efficient routing protocol known as Position Responsive Routing Protocol (PRRP) to enhance energy efficiency of WSN. Position responsive routing protocol differs in several ways than other existing routing techniques. Position response routing protocol approach allows fair distribution of gatewaycluster head selection, maximum possible distance minimization among nodes and gatewayscluster heads to utilize less energy. Position responsive routing protocol shows significant improvement of 45% in energy efficiency of wireless sensor network life time as a whole by increasing battery life of individual nodes. Furthermore PRRP shows drastic increases for data throughput and provide better solution to routing energy hole due to it fair distributed approach of gateway selection.2014 16th International Conference on Advanced Communication Technology (ICACT); 02/2014
[Show abstract] [Hide abstract]
ABSTRACT: Being deployed in narrow but long area, strip wireless sensor networks (SWSNs) have drawn much attention in applications such as coal mines, pipeline and structure monitoring. One of typical characteristics of SWSNs is the large hop counts, which leads to long end-to-end delivery delay in low-duty-cycle SWSNs. To reduce the delay, pipeline scheduling is a promising technique, which assigns sensor nodes sequential active time slots along the data forwarding path. However, pipeline scheduling is prone to failure when communication links are unreliable. In this paper, we propose an opportunistic pipeline scheduling algorithm (OPS) for SWSNs, based on the observation that sensor nodes in SWSNs can overhear data transmissions passing by them. OPS exploits nodes outside the data forwarding path to opportunistically provide links when transmission failure happens, and hence maintains the pipeline forwarding instead of retransmission in the next duty cycle. Theoretical calculation shows that the expectation delay of OPS is always smaller than that of existing methods when the link quality isWireless Networks 12/2014; DOI:10.1007/s11276-014-0807-x · 1.06 Impact Factor