Gathering In Sensor Information Systems Research Articles

Energy Optimization of Routing Protocols in Wireless Sensor Networks

The hierarchical routing of data in WSNs is a specific class of routing protocols it encompasses solutions that take a restructuring of the physical network in a logical hierarchy system for the optimization of the consum-ption of energy. Several hierarchical routing solutions proposed, namely: the protocol LEACH (Low Energy Adaptive Clustering Hierarchy) consist of dividing the network in distributed clusters at one pop in order of faster data delivery and PEGASIS protocol (Power-Efficient Gathering in Sensor Information Systems) which uses the principle of constructing a chain’s sensor node. Our contribution consists of a hierarchical routing protocol, which is the minimization of the energy consumption by reducing the transmission distance of data and reducing the data delivery time. Our solution combines the two hierarchical routing approaches: chain based approach and the cluster based approach. Our approach allows for multi-hop communications, intra- and intercluster, and a collaborative aggregation of data in each Cluster, and a collaborative aggregation of data at each sensor node<strong>.</strong>

Energy-efficient routing protocol via chain formation in gaussian distributed wireless sensor networks

ABSTRACTTraditional routing algorithms have aimed to reduce energy consumption in wireless sensor networks by minimising the transmission distance among member nodes while ensuring sufficient throughput of the network. Efforts in this direction include the power-efficient gathering in sensor information systems, energy-efficient chain formation (EECF), distance-based routing protocols, etc. One of the approaches to reducing the communication distance between nodes is a chain formation in the network. The chains essentially form routes to the base station (BS) and eliminate the need for each individual node to transmit their data to the BS directly. This paper proposes new routing-chains protocol for energy-efficient networks in Gaussian and uniformly distributed sensor networks. For Gaussian distributed sensor networks, given name of the protocol is Gaussian routing-chains protocol for energy-efficient networks (GREEN) and for the uniformly distributed sensor network is uniformly distributed routing-chain protocol for energy-efficient networks (UDREEN).We have also presented a comparative analysis between the proposed GREEN and UDREEN with existing protocol EECF.

Effective Chain-Based Routing Algorithm for Wireless Sensor Networks

Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. In this paper, we propose a new routing algorithm for WSNs called Chain-based Routing (CRA). CRA solves the main problems in Power Efficient Gathering in Sensor Information Systems (PEGASIS) algorithm. CRA minimizes the energy dissipation and maximizes the network lifetime of WSNs by introducing new chain construction method and new chain leader election algorithm. The simulation results show that our proposed algorithm outperforms the existing algorithms LEACH, PEGASIS, COSEN, and IECBSN in terms of network lifetime and energy consumption minimization.

Comparison of Wireless Sensor Network Routing Protocols under Gamma Radiation for Nuclear and Space Applications

With the advancement of computer and communication technologies, wireless sensor networks (WSNs) are increasingly used in nuclear and space applications, both of which may require operation in a high-intensity radiation environment. Gamma rays’ damaging mechanisms in semiconductor devices are described as, and specifically linked to, semiconductor property changes in detectors, transistors, and integrated circuits. Radiation damage is cumulative and can result in the premature failure of WSN nodes. Failed WSN nodes decrease the quality of service of the entire WSN and then delay immediate response to severe accidents. This paper focuses on evaluating the performance of WSN routing protocols in a gamma-ray radiation environment. The probability density function of a Weibull distribution was used to model failures of individual nodes in simulated WSNs. The distribution parameters are based on results of radiation damage tests performed on semiconductor devices in the Gamma-220 facility (60Co source) at the Canadian Nuclear Laboratories. Simulation of the routing protocols [LEACH (Low Energy Adaptive Clustering Hierarchy), LEACH-C (LEACH-Centralized), Stat-Clus (Static Clustering), MTE (Minimum Transmission Energy), and PEGASIS (Power-Efficient Gathering in Sensor Information Systems)] through NS2 (Network Simulator 2) and the resulting performance analyses could provide useful design insights and considerations for nuclear and space applications. The performance of WSN routing protocols is evaluated for the first time in a gamma-ray radiation environment for nuclear and space applications.

Prolonging the Network Lifetime using Fuzzy logic in Wireless Sensor Network

Wireless sensor networks include deployment of large number of sensor nodes to sense, process and communicate the data to the sink. The small sized sensor nodes are cheap and can be easily deployed in harsh physical environments but the low battery source for the nodes act as a major limitation for the sensor networks to operate efficiently. The protocols have been proposed in recent times to make optimum use of the energy. Power Efficient Gathering in Sensor Information System (PEGASIS) has been considered as an efficient approach as compared to the Low Energy Adaptive Clustering Hierarchy (LEACH). In this paper, a new approach for selecting the leader of the chain has been proposed using Fuzzy Logic in which residual energy and proximity to the base station has been taken as two parameters and combining these two parameters the leader is selected which aggregates and communicates the data further to the sink. The simulation results have shown that this proposed work has improved the performance metrics of the network and thus extended the lifetime of network. General Terms Prolonged Network lifetime in Wireless Sensor Network

Energy Management in Wireless Sensor Network Using PEGASIS

The area of Wireless Sensor Network is one of the fastest growing fields in the communication and engineering world. The main objective of WSN is to sense the crucial information from the environment depending on the type of application for which it is deployed and send this information to its Base Station(BS) so that it can take corrective action. These Sensor Nodes ommunicate with each other through various protocols. The problem of the conventional method is, during gathering of sensed data each node transmits its sensed data directly to the base station for which it will deplete its power quickly. In this project, we propose PEGASIS(Power-Efficient Gathering in Sensor Information System),a near optimal chain-based protocol for extending the lifetime of network. In PEGASIS, each node communicates only with a close neighbour, performing a chain, elect a leader from the chain who collects the data from the neighbours to be transmitted to the base station. As a result the average energy spend by each node per round is reduced and to lower the bandwidth requirement. By using certain algorithm we can propose the shortest path of transmission of data to the base station. As a result less power consumption can be achieved to increase efficiency and life time of the network.

Power Efficient Gathering in Sensor Information Systems based on Ant Colony Optimization (ACO) in WSN

Power Efficient Gathering in Sensor Information Systems based on Ant Colony Optimization (ACO) in WSN

Implementation of Smart Sleep Mechanism and Hybrid Data Collection Technique for Maximizing Network Lifetime in WSN’s

Objectives: The main aim of this paper is to optimize energy of the wireless sensor nodes by applying hybrid data collection and smart sleep mechanism in the sensor network. Methods/Analysis: In energy-constrained wireless sensor networks, energy efficiency is critical for prolonging the network lifetime. The instable dissemination of communication loads often roots nodes in some region to be drained faster than the nodes in other regions. This will affect the network lifetime. Findings: When compared with Power-Efficient Gathering in Sensor Information Systems (PEGASIS), Low Energy Adaptive Clustering Hierarchy (LEACH) and Delay Aware Network Structure (DANS), the simulation outcomes show that proposed achieves its intention of less energy depletion, matching the energy depletion of all the nodes, alleviating the data gathering, and prolonging the network lifetime. Conclusion/Application: The hybrid technique prolongs the network lifetime and thus large amount of data can be easily collected by sensors and then routed to sink. In war fields or in conditions of natural disasters wireless senor networks could be deployed with this proposed technique for maximization of network life time.

Effect of using Mobile Sink on Chain-based Routing Protocols in Wireless Sensor Networks

In this paper, we examine some protocols related to WSNs. To evaluate the efficiency of different routing schemes, we compare six chain based routing protocols; Power Efficient Gathering in Sensor Information Systems (PEGASIS), Power Efficient Gathering in Sensor Information System Extended (PEGASIS-E), Chain Oriented SEnsor Network (COSEN), Energy Efficient Chain Based Sensor Network (ECBSN), Improved Energy Efficient Chain Based Sensor Network (IECBSN), and Energy-Aware PEGASIS-Based Hierarchal Routing Protocol for Wireless Sensor Networks (EAPHRN). Two scenarios are discussed to compare the performances of chain based routing protocols; in the first scenario static sink is used and in the second one mobile sink is used. We perform analytical simulations in terms of network lifetime and average energy consumption.

Comparison of Energy Efficient Data Transmission Approaches for Flat Wireless Sensor Networks

In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks, its precise usage is highly desirable both for the faithful performance of network and to increase the network life time. For this work, we have considered a flat network topology where every node has the same responsibility and capability. We have compared two energy efficient algorithms and analyzed their performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with increase in number of nodes, time rounds and node failures. Wireless sensor networks consist of number of small nodes deployed in an area under supervision. Each node has limited storage, computational and sensing capability and limited energy resource, as nodes are battery operated. Since energy is the main concern in wireless sensor networks (WSN) to maximize the performance and to increase the lifetime of a network, various approaches are implemented to reduce energy consumption in a network. Most of the energy is consumed during idle period and during transmission of data from one node to another i.e. routing. An efficient media access control (MAC) and routing protocol should be designed to save energy. While MAC protocol targets at reduction of energy in scanning and accessing the channel, routing protocol helps to reduce the energy requirement for end-to-end transmission. In WSN, there are number of routing protocols that have been proposed for different network criteria. Based on the network topology WSN protocols have been categorized as - flat network protocols and hierarchical protocols as shown in Figure 1. Protocols that fall under hierarchical class select one head amongst all and form a hierarchy (1). This hierarchy may be a cluster, a chain or a grid. Cluster head or a leader collects the information from all the other nodes in its region and sends it to the sink node or gateway node. Some examples are low energy adaptive clustering hierarchy (LEACH), power efficient gathering in sensor information systems (PEGASIS), virtual grid architecture (VGA), etc. The work presented in this paper considers flat protocols and thus we are not including descriptions of hierarchical protocols and will only be

A Survey on Delay-Aware Network Structure for Wireless Sensor Networks with Consecutive Data Collection Processes

A Wireless Sensor Network (WSN) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, pressure,etc. In sensing applications, data packets are flowing from sensor nodes to base station. In data collection processes, bottom up approach is used. In bottom up approach, all nodes send their sensed data packets to base station directly. In this approach will lead to increased delay, which will lead to higher energy consumption. To reduce the energy consumption of sensor nodes,Clustering Algorithm and Low-Energy Adaptive Clustering Hierarchy (LEACH) are being used. Efficient gathering in Wireless Sensor information systems, Power Efficient Gathering in Sensor Information System (PEGASIS) is being used. There are lot of research issues in Wireless Sensor Networks such as delay, lifetime of network, energy dissipation which needs to be resolved.

Comparative Study of PEGASIS Protocols in Wireless Sensor Network

The area of Wireless Sensor Networks (WSNs) is one of the fast growing and emerging field in the scientific and engineering world. It is an ad-hoc network that consists of small nodes with sensing, computing and communicating wireless abilities. These sensor nodes are densely deployed in the sensor field environments. The environment can be an Information Technological framework, a physical world, or a biological system.The main objective of WSN is to sense the crucial information from the environment depending on the type of application for which it is deployed and send this information to its Base Station (BS) so that it can take corrective actions. These Sensor Nodes communicate with each other via various Routing Protocols. Protocols in WSNs are broadly classified as Flat, Hierarchical and Location Based routing protocols. This paper presentshierarchical routing protocol, Power Efficient Gathering in Sensor Information Systems (PEGASIS) and a comparative study on various versions of PEGASIS protocols.

Survey Paper on PEGASIS: Energy Conservation in Heterogeneous Environment

Wireless sensor network is vast area for research. Because of scarce resources, energy consumption and battery lifetime is crucial aspects in WSN. So with the help of routing protocol, improvement can be done. More energy can be conserved and network lifetime can be improved by modifying the existing protocols. Power Efficient GAthering in Sensor Information System (PEGASIS) is an improvement of hierarchical protocol. It mainly focuses on network lifetime. It uses chaining construction and data gathering approach to communicate. Aggregated data will pass on to the head node and it will pass the data to the base station. This paper introduces the PEGASIS, discusses the related previous work. New aspect of PEGASIS in heterogeneous environment is proposed. The new scheme is proposed in order to conserve energy.

A new hybrid architecture with an intersection-based coverage algorithm in wireless sensor networks

Energy is limited in wireless sensor networks (WSNs) so that energy consumption is very important. In this paper, we propose a hybrid architecture based on power-efficient gathering in sensor information system (PEGASIS) and low-energy adaptive clustering hierarchy (LEACH). This architecture can achieve an average distribution of energy loads, and reduced energy consumption in transmission. To further extend the system lifetime, we combine the intersection-based coverage algorithm (IBCA) with LEACH architecture and the hybrid architecture to prolong the system lifetime that introducing sensor nodes to enter sleep mode when inactive. This step can save more energy consumption. Simulation results show that the performance of our proposed LEACH architecture with IBCA and the hybrid architecture with IBCA perform better than LEACH architecture with PBCA in terms of energy efficiency, surviving nodes and sensing areas.

Efficient and secure routing protocol for wireless sensor networks through SNR based dynamic clustering mechanisms

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

Improved Enhanced Chain Based Energy Efficient Wireless Sensor Network

In this paper, we have proposed an energy efficient chain based protocol which is an improvement over ECBSN (Energy Efficient Chain Based Sensor Network). ECBSN protocol has certain deficiencies like the non optimal selection of leader nodes in rounds, aggregation and transmission of data by head nodes that leads to unbalanced energy consumption. Aiming at these problems, an improved chain based protocol is proposed. IECBSN adopts a new method of selection of leader nodes based on selection value (SV) parameter .To lower energy consumption further, one more level of hierarchy has been added with a head leader node, which will aggregate data from the leader nodes and pass it to the base station. IECBSN shows an improvement of 20% - 35% as compare to PEGASIS (Power Efficient Gathering in Sensor Information System) and 5% t to 7% from ECBSN on energy consumption and improves network lifetime.

CREEC: Chain routing with even energy consumption

A convergecast is a popular routing scheme in wireless sensor networks (WSNs) in which every sensor node periodically forwards measured data along configured routing paths to a base station (BS). Prolonging lifetimes in energy-limited WSNs is an important issue because the lifetime of a WSN influences on its quality and price. Low-energy adaptive clustering hierarchy (LEACH) was the first attempt at solving this lifetime problem in convergecast WSNs, and it was followed by other solutions including power efficient gathering in sensor information systems (PEGASIS) and power efficient data gathering and aggregation protocol (PEDAP). Our solution-chain routing with even energy consumption (CREEC)-solves this problem by achieving longer average life-times using two strategies: i) Maximizing the fairness of energy distribution at every sensor node and ii) running a feedback mechanism that utilizes a preliminary simulation of energy consumption to save energy for depleted sensor nodes. Simulation results confirm that CREEC outperforms all previous solutions such as LEACH, PEGASIS, PEDAP, and PEDAP-power aware (PA) with respect to the first node death and the aver- age lifetime. CREEC performs very well at all WSN sizes, BS distances and battery capacities with an increased convergecast delay.

Parameterized Affect of Transmission-Range on Lost of Network Connectivity (LNC) of Wireless Sensor Networks

Wireless Sensor Networks, referred to as WSNs, are made up of various types of sensor nodes. Recent developments in micro electro-mechanical technology have given rise to new integrated circuitry, microprocessor hardware and nano technology, wireless technology, and advanced networking routing protocols. Hospitals and health service facilities, the armed forces, and even residential customers represent a potential huge market for these devices. The problem is that existing sensor network nodes are incapable of providing the support needed to maximize usage of wireless technology. For this reason, there are many novel routing protocols for the wireless sensor networks proposed recently. One is Hierarchical or cluster-based routing. In this paper, we analyze three different types of hierarchical routing protocols: Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), and Virtual Grid Architecture (VGA). We tried to analyze the performance of these protocols, including the power consumption and overall network performance. We also compared the routing protocol together. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. The simulation results, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA. Furthermore, the paper investigates the power consumption for all protocols. On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased. Using homogeneous nodes can greatly prolong sensor network’s life time. Also, The network lifetime increases as the number of clusters decreases

Cluster-Based Data Aggregation and Transmission Protocol for Wireless Sensor Networks

PDF HTML阅读 XML下载 导出引用 引用提醒 基于分簇的无线传感器网络数据汇聚传送协议 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National High-Tech Research and Development Plan of China under Grant No.2005AA121130 (国家高技术研究发展计划(863)) Cluster-Based Data Aggregation and Transmission Protocol for Wireless Sensor Networks Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:提出了一种基于分簇的无线传感器网络数据汇聚传送协议CDAT(a cluster-based data aggregation and transmission protocol for wireless sensor networks).CDAT 通过均衡能耗的分簇方法及数据预测传送机制,可以有效 延长网络的生命期.在簇头选取阶段,利用应用期望的无缝覆盖率与所需簇头数的数学关系,限制节点竞选簇头的初 始概率,并联合节点的度和剩余能量来选取簇头;在数据聚合阶段,簇头广播消息,接收所有加入该簇的成员节点,然后对簇内数据进行聚合;在数据传送阶段,利用数据在时间上的相关性,簇头在满足传送精度的要求下,采用预测传 送机制将数据传送给基站,通过该机制,网络有效地减少了数据传送的次数.理论分析和模拟实验结果表明,CDAT 协 议在满足应用期望的服务质量要求下,通过均衡能耗、减少数据传送次数,使得网络生命期优于LEACH(low-energy adaptive clustering hierarchy),PEGASIS(power-efficient gathering in sensor information systems)等协议. Abstract:A cluster-based data aggregation and transmission protocol (CDAT) for wireless sensor networks (WSNs) is proposed. CDAT achieves a good performance in terms of lifetime by a clustering method of balancing energy consumption and data prediction transmission strategy. In clustering phase, the initial probability of node for cluster head election is derived from mathematical relation between application’s seamless coverage ratio and numbers of required cluster heads, and residual energy and node degree are also employed to elect cluster head. In data aggregation phase, Cluster heads broadcast message for node joining and aggregate sampling data after clustering. According to the temporal correlation of sampling data, cluster heads send data to base station using prediction transmission strategy while satisfying transmission precision in the data transmission phase, and the lifetime of WSNs is prolonged with this strategy. Theoretical analysis and simulation results show that CDAT outperforms LEACH (low-energy adaptive clustering hierarchy) and PEGASIS (power-efficient gathering in sensor information systems) in terms of network lifetime by balancing energy consumption and decrease of transmission while satisfying desired Qos (quality of service) of application. 参考文献 相似文献 引证文献

Energy equalizing routing for fast data gathering in wireless sensor networks

Energy saving and fast responding of data gathering are two crucial factors for the performance of wireless sensor networks. A dynamic tree based energy equalizing routing scheme (DTEER) was proposed to make an effort to gather data along with low energy consumption and low time delay. DTEER introduces a dynamic multi-hop route selecting scheme based on weight-value and height-value to form a dynamic tree and a mechanism similar to token passing to elect the root of the tree. DTEER can simply and rapidly organize all the nodes with low overhead and is robust enough to the topology changes. When compared with power-efficient gathering in sensor information systems (PEGASIS) and the hybrid, energy- efficient, distributed clustering approach (HEED), the simulation results show that DTEER achieves its intention of consuming less energy, equalizing the energy consumption of all the nodes, alleviating the data gathering delay, as well as extending the network lifetime perfectly.