Content uploaded by Nadeem Javaid
Author content
All content in this area was uploaded by Nadeem Javaid on Feb 09, 2019
Content may be subject to copyright.
A preview of the PDF is not available
CEEC: Centralized Energy Efficient Clustering Routing Protocol for Wireless Sensor Networks
Abstract and Figures
Scalable and energy-aware routing protocol is very essential for Wireless
Sensor Networks (WSNs) in order to increase the network lifetime. Nodes of WSNs
have limited battery resources and it is observed that execution of heterogeneity aware clustering routing protocols in terms of energy utilizes such resources effectively. Heterogeneity-aware clustering routing protocols enhance stability and network lifetime of WSNs as compared to flat, location-based and conventional homogeneous-aware clustering routing protocols. Heterogeneous-aware clustering routing protocols is also facing some challenges like, limited scalability of the network, un-reliable distributed algorithm for selection of Cluster-Heads (CHs) and randomized deployment policy of nodes. In this paper, we propose a Centralized Energy Efficient Clustering (CEEC), a heterogeneity-aware clustering protocols for WSNs to cope with these challenges. Operation of CEEC is based upon an advance central control algorithm, in which Base Station (BS) is responsible for selection of optimal numbers of CHs. BS selects CHs on the basis of value of residual energy, average energy of network and mutual distance between nodes and itself. Execution of CEEC provides scalability, significant stability, extended network lifetime and better control over network operation. In order to enhance scalability of the network, CEEC can be executed in multi-level heterogeneous networks. But initially, we design and simulate CEEC for three level heterogeneous networks. In MCEEC, we design an advance heterogeneous network model, in which whole network area is divided into three equal regions and nodes of same energy level are scattered in one region. Furthermore, nodes can only associate to their own region’s cluster-heads. We
deploy the network’s nodes in ascending order of energy level from the position of BS. We also proposed an extension of CEEC as Multi-hop CEEC. We adopt multihop inter-cluster communication for MCEEC. We simulate our proposed CEEC and MCEEC routing protocol using MATLAB. Results describe that CEEC and MCEEC yield maximum scalability, network lifetime, stability period and throughput as compare to other clustering routing protocols.
Content may be subject to copyright.
... Recently researcher has made exciting progress on energy managing in WSNs. Their research perspectives can be classified into three major categories: energy saving in MAC layer [2], [3], [4], reducing energy by topology control [5], [6], [7], [8], [9], and lowering energy consumption via optimized scheduling [10], [11], [12], [13], [14]. However, none of these researches are concerning IoT deployment with green networking consideration. ...
The Internet of things (IoT) has been realized as one of the most promising networking paradigms that bridges the gap between the cyber and physical world. Developing green deployment scheme for IoT is a challenging issue since IoT achieves larger scale and reaches more complex so that the most of current schemes for deploying Wireless Sensor Networks (WSNs) cannot be reused. This paper addresses this challenging issue and proposes Gemini, a Green deployment scheme for internet of Things, that emphasizes modeling and optimization on green IoT deployment. The contributions made in this paper include: (i) A hierarchical system framework for general IoT deployment. (ii) An optimization model on the basis of proposed system framework to realize the IoT toward green. And (iii) a minimal energy consumption algorithm for solving the optimization model. Through numerical experiments, the results show that the Gemini proposed in this paper can work flexibly and energy-efficiently with both deterministic and random networking settings, thus is applicable to the green IoT deployment.
Wireless Sensor Networks have emerged in the past decade as a result of recent advances in microelectronic system fabrication, wireless communications, integrated circuit technologies, microprocessor hardware and nano-technology, progress in ad-hoc networking routing protocols, distributed signal processing, pervasive computing, and embedded systems. Recent advances in Wireless Sensor Networks have led to many new protocols specifically designed for routing, since routing protocols differ depending on the application and network architecture. Efficient routing in a sensor network requires that the routing protocol must minimize energy dissipation and maximize network life time. In this paper we have implemented a cluster based routing protocol Multihop-LEACH which does inter cluster and intra cluster multi-hoping. The protocol is evaluated using TinyOs and TOSSIM simulator. Evaluation results reveal that Multihop-LEACH protocol utilizes less power and least delay. The connectivity, success rate and power utilization of Multihop-LEACH is further improved by increasing the probability of clustering.
Energy conservation plays a crucial in wireless sensor networks since such networks are designed to be placed in hostile and nonaccessible areas. While battery-driven sensors will run out of battery sooner or later, the use of renewable energy sources such as solar power or gravitation may extend the lifetime of a sensor network. We propose to utilize solar power in wireless sensor networks and extend LEACH a well-known cluster-based protocol for sensor networks to become solar-aware. The presented simulation results show that making LEACH solar-aware significantly extends the lifetime of sensor networks.
This paper presents a cost based comparative study of homogeneous and heterogeneous clustered sensor networks. We focus on the case where the base station is remotely located and the sensor nodes are not mobile. Since we are concerned with the overall network dimensioning problem, we take into account the manufacturing cost of the hardware as well as the battery energy of the nodes. A homogeneous sensor network consists of identical nodes, while a heterogeneous sensor network consists of two or more types of nodes (organized into hierarchical clusters). We first consider single hop clustered sensor networks (nodes use single hopping to reach the cluster heads). We use LEACH as the representative single hop homogeneous network, and a sensor network with two types of nodes as a representative single hop heterogeneous network. For multihop homogeneous networks (nodes use multihopping to reach the cluster head), we propose and analyze a multihop variant of LEACH that we call M-LEACH. We show that M-LEACH has better energy efficiency than LEACH in many cases. We then compare the cost of multihop clustered sensor networks with M-LEACH as the representative homogeneous network, and a sensor network with two types of nodes (that use in-cluster multi-hopping) as the representative heterogeneous network.
This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. For example, our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Span integrates nicely with 802.11 - when run in conjunction with the 802.11 power saving mode, Span improves communication latency, capacity, and system lifetime.
The energy efficiency trade-offs available between centralized and distributed solutions in unattended wireless sensor network deployments such as those that support remote battlefield monitoring remain an open research question. In this paper, we compare the relative energy efficiency of these two approaches in multi-hop wireless sensor networks. We develop a framework that includes both total and per node energy efficiency expressions and apply it to the beamforming class of unattended battlefield monitoring solutions using Mica2, MicaZ and the latest generation Telos sensor motes. A performance threshold is shown to exist between these approaches which can be exploited through the use of preamble sampling.
The clustering Algorithm is a kind of key technique used to reduce energy consumption. It can increase the scalability and lifetime of the network. Energy-efficient clustering protocols should be designed for the characteristic of heterogeneous wireless sensor networks. We propose and evaluate a new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC. In DEEC, the cluster-heads are elected by a probability based on the ratio between residual energy of each node and the average energy of the network. The epochs of being cluster-heads for nodes are different according to their initial and residual energy. The nodes with high initial and residual energy will have more chances to be the cluster-heads than the nodes with low energy. Finally, the simulation results show that DEEC achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.
The hop distance strategy in Wireless Sensor Networks (WSNs) has a major impact on energy consumption of each sensor mote. Long-hop routing minimizes reception cost. However, a substantial power demand is incurred for long distance transmission. Since the transceiver is the major source of power consumption in the node, optimizing the routing for hop length can extend significantly the lifetime of the network. This paper explores when multi-hop routing is more energy efficient than direct transmission to the sink and the conditions for which the two-hop strategy is optimal. Experimental evidence is provided in to support of these conclusions. The tests showed that the superiority of the multi-hop scheme depends on the source-sink distance and reception cost. They also demonstrated that the two-hop strategy is most energy efficient when the relay is at the midpoint of the total transmission radius. Our results may be used in existing routing protocols to select optimal relays or to determine whether it is better to send packets directly to the base station or through intermediate nodes.