Results 1 - 10
of
10
EECS: An energy efficient clustering scheme in wireless sensor networks
- In: Proc. of the IEEE Int’l Performance Computing and Communications Conf
, 2005
"... Data gathering is a common but critical operation in many applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks, which can in ..."
Abstract
-
Cited by 108 (5 self)
- Add to MetaCart
(Show Context)
Data gathering is a common but critical operation in many applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we propose a novel energy efficient clustering schema (EECS) for single-hop wireless sensor networks, which better suits the periodical data gathering applications. Our approach elects cluster heads with more residual energy in a autonomous manner through local radio communication with no iteration while achieving good cluster head distribution; further more, it introduces a novel distance-based method to balance the load among the cluster heads. Simulation results show that EECS prolongs the network lifetime significantly against the other clustering protocols such as LEACH and HEED. Key words: wireless sensor networks(WSN), data gathering, clustering scheme, energy efficient, network lifetime, single-hop.
Extending k-Coverage Lifetime of Wireless Sensor Networks with Surplus Nodes
"... In the wireless sensor network (WSN) for periodically sensing and gathering environmental information uniformly in a vast sensing field, reducing the system operating cost taking into account sensor node installation and WSN lifetime is essential. In this paper, we propose a method to prolong the li ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
In the wireless sensor network (WSN) for periodically sensing and gathering environmental information uniformly in a vast sensing field, reducing the system operating cost taking into account sensor node installation and WSN lifetime is essential. In this paper, we propose a method to prolong the lifetime of such a data gathering WSN, by randomly scattering “surplus ” sensor nodes over the target field. In our method, we assume that each sensor node has three operation modes: sensing, relaying, and sleeping. Each sensing node senses environmental data and sends/relays the data to the sink node via multi-hop wireless communication. Each relaying node just forwards the data received from its uplink node to its downlink nodes. Each sleeping node does nothing and keeps its battery. We propose an algorithm that dynamically changes mode of each sensor node so that the WSN lifetime becomes as long as possible by switching the least number of nodes for achieving k-coverage of the field to sensing mode. Through computer simulations, we confirmed that our method can prolong the WSN lifetime almost proportionally to the number of deployed sensor nodes.
Energy Efficient and Reliable Geographic Routing in Wireless Sensor Networks
"... Abstract—The wireless link can be unreliable in realistic wireless sensor networks (WSNs). Energy efficient and reliable data forwarding is important because each node has limited resources. Therefore, we must suggest an optimal solution that considers using the information of the node’s characteris ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract—The wireless link can be unreliable in realistic wireless sensor networks (WSNs). Energy efficient and reliable data forwarding is important because each node has limited resources. Therefore, we must suggest an optimal solution that considers using the information of the node’s characteristics. Previous routing protocols were unsuited to realistic asymmetric WSNs. In this paper, we propose a Protocol that considers Both sides of Link-quality and Energy (PBLE), an optimal routing protocol that balances modified link-quality, distance and energy. Additionally, we propose a node scheduling method. PBLE achieves a longer lifetime than previous routing protocols and is more energy-efficient. PBLE uses energy, local information and both sides of PRR in a 1-hop distance. We explain how to send data packets to the destination node using the node's information. Simulation shows PBLE improves delivery rate and network lifetime compared to previous schemes. Moreover, we show the improvement in various WSN environments. Keywords—energy-efficient, lifetime, PBLE, unreliable I.
Analysis of Energy Consumption for a Biological Clustering Method in Sensor Networks
"... In this paper we present an analytical model for performance evaluation of a clustered sensor network. We examine the energy required for a single round of clustering for a biologically-inspired extension of the well-known LEACH clustering method. We use methods from stochastic geometry to model the ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
In this paper we present an analytical model for performance evaluation of a clustered sensor network. We examine the energy required for a single round of clustering for a biologically-inspired extension of the well-known LEACH clustering method. We use methods from stochastic geometry to model the locations of the node clusters using a hard-core Matérn cluster process. Based on the computation of the energy consumption of the whole clustering procedure we determine the most energy-efficient setting of the cluster radius. Furthermore, we consider the efficiency of clustering when the sensed data can be compressed at the cluster heads. 1.
Sr. Lecturer Dept.of Electronics & Tele.
"... Presently wireless sensor network (WSN) is very popular in the many of industrial area where the cabling from sensor to sink is difficult. Because of growing use of WSN, it is a emerging topic in the research area. There are various limitation of WSN with high number of node and large area of networ ..."
Abstract
- Add to MetaCart
Presently wireless sensor network (WSN) is very popular in the many of industrial area where the cabling from sensor to sink is difficult. Because of growing use of WSN, it is a emerging topic in the research area. There are various limitation of WSN with high number of node and large area of network. The energy consumption is one of the important aspects of WSN due to limited access of sensor node and limited battery power. There are various research performed to reduce the energy loss in WSN by optimizing the physical layer parameter such that the modulation technique, operating frequency and antenna design. The energy loss also minimize by optimization of communication protocol. There is tradeoff between the reduction of energy consumption using protocol optimization and reliability of communication. The energy loss can be minimizing by reducing the communication overhead but it may lead to information loss during the transient behavior of WSN. The problem of reliability becomes more critical when the sink has mobility. This paper will show the implementation of simulation setup for mobile sink based WSN and performance evaluation of WSN for communication overhead and reliability. Two protocol BBM and cluster based protocol are comparing for performance analysis.
Maximizing Lifetime of Wireless Sensor Networks with Mobile Sensor Nodes
"... In this paper, we propose a new method utilizing mobile sensor nodes to prolong WSN lifetime while maintaining a large sensing area. We formulate this problem as a problem in finding the best positions for mobile sensor nodes to maximize the integral of the sensing area for the remaining lifetime of ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper, we propose a new method utilizing mobile sensor nodes to prolong WSN lifetime while maintaining a large sensing area. We formulate this problem as a problem in finding the best positions for mobile sensor nodes to maximize the integral of the sensing area for the remaining lifetime of WSN. This problem implies the Euclidean Steiner Tree Problem, and is thus an NP-hard problem. We developed a GA(genetic algorithm)-based algorithm to find a near-optimal solution. Through simulations, we confirmed that the proposed method achieves better performance than a general local-search based approximation method. We also confirmed that our method can find solutions within 4.4 % difference from the optimal solution. 1
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
"... In this paper, we propose a decentralized method for max-imizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting other nodes in sleep. We divide a target field into multiple grids and make nodes in each grid locally achieve k-coverage ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper, we propose a decentralized method for max-imizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting other nodes in sleep. We divide a target field into multiple grids and make nodes in each grid locally achieve k-coverage. We can reduce energy consumption of WSN by minimizing the number of active nodes required for k-coverage. However, coverage degree is likely to go to ex-cess beyond k near border between grids when deciding ac-tive nodes in each grid independently. To solve this problem, our method decides the minimal set of active nodes for ad-joined grids at different times so that k-coverage of a grid is achieved taking into account the coverage in its neighboring grids. Through computer simulations, we confirmed that the proposed method achieved distribution of WSN processing with a small decrease of k-coverage lifetime compared to the centralized algorithm.
Self-Organizing Clustering Method for Energy-Efficient Data Gathering in Sensor Networks
, 2005
"... By deploying wireless sensor nodes and composing a sensor network, one can remotely ob-tain information about the behavior, conditions, and positions of entities in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispens-able to prolong ..."
Abstract
- Add to MetaCart
(Show Context)
By deploying wireless sensor nodes and composing a sensor network, one can remotely ob-tain information about the behavior, conditions, and positions of entities in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispens-able to prolong the lifetime of a sensor network as long as possible. A sensor node consumes energy in observing its surroundings, transmitting data, and receiving data. Especially, energy consumption in data transmission scales proportionally to the n-th power of the radius of the radio signal. Therefore, cluster-based data gathering mechanisms effectively save energy. In cluster-based data gathering, since each node can save transmission power and the number of collisions is also reduced, sensor networks can live for longer period. In clustering, however, we need to consider that a cluster-head consumes more energy than the other nodes in receiving data from cluster members, fusing data to reduce the size, and sending the aggregated data to a base station. In this study, first, we propose a novel clustering method where energy-efficient clusters are organized in a distributed way through local communication among neighboring sensor nodes. Our clustering method is based on the idea of ANTCLUST, a clustering algorithm which applies a
Coverage-driven Energy-efficient Deployment and Self-organization in Sensor Networks
, 2008
"... Supervised by ..."
(Show Context)
