PEGASIS Protocol Research Articles

Energy-Efficient Route Protocols to Minimize Holes in Wireless Sensor Networks Using Probability Enhancement Algorithm

Wireless sensor networks are widely utilized. In the network of wireless sensors, the nodes of sensors normally disseminated arbitrarily are conditional on the method preferred to realize the sensor network. Primarily, the lifespan of a sensor node depends on the active node numbers along with the network connectivity. When a sensor node runs out of power, the sensor node dies too early, affecting network performance. Therefore, an energy hole will be formed with the network. To avoid the problem of energy holes, a number of rules are already proposed. This paper proposed a new method to resolve the problem of energy holes in wireless sensor networks and maximizes the useful life of the network through a different way of cluster head selection using asymmetrical clustering method. This paper proposed PE (probability enhancement) method for choosing the cluster head, which gives improved output compared to LEACH as well as PEGASIS protocol. The result of simulation is performed with MATLAB, and it appears that the projected scheme works better than the previous scheme.

Enhanced Energy Efficient Routing for Wireless Sensor Network Using Extended Power Efficient Gathering in Sensor Information Systems (E-PEGASIS) Protocol

Recent technological advancement in wireless communication and sensors made Wireless Sensor Networks (WSNs) as one of the demanding platforms in the current scenario. In WSN, tiny sensor nodes are collecting and monitoring the biological data or physical data or environmental data and transmitted to the base station (BS) through gateway routers. These data can be accessed anywhere and anytime. Usually sensor nodes have restrained battery power which creates the rigorous lifetime duration issues in WSN. Sensor nodes can communicate with each other using various routing protocols. Data transmission devours more amounts of energy and power. So, energy preservation is an important factor in WSN. There are plenty of researches going on in designing less energy consuming protocols for data transmission which helps to increase the lifetime of WSN. In this paper we have proposed Extended Power Efficient Gathering in Sensor Information Systems (E-PEGASIS) protocol for enhanced energy efficient data transmission based on PEGASIS protocol. In this proposed method average distance between the sensor nodes are considered as the criterion for chaining and fix the outermost node’s radio range value the base station. Later it chains the related nodes available in the radio range. Consequently, the chained node checks their distance with the next nearest end node to go on with the chaining procedure which will enhance the performance of data transmission between the sensor node and the base station. The simulation of the proposed work shows that lifetime of the network is increased when comparing to the LEACH and PEGASIS protocol.

Design of Mutated Harmony Search Algorithm for Data Dissemination in Wireless Sensor Network

In the recent years, the researcher has to face new challenges due to the complexity of technological an advances in Wireless Sensor Network (WSN). Sensor based networks are a special category of a distributed network that is used to provide communication among the sensor nodes. The wireless sensor network consists of various classes of sensors like thermal, infrared, optical, and seismic for the measurement of temperature, heat, radiation, humidity which requires constant monitoring and detection in specific events. A sensor’s with limited functionality both in computations, battery voltage keeps periodic sensing physical or environmental of ecological factors. Sporadic events such as detecting border intrusion, flood detection and habitat exploration of animals. The design of a WSN depends drastically on continuity and coverage of the network. Connected with that energy constrained is considered as one of the important issues to balance the network load and to extend the network life. An optimal energy efficient cluster based routing algorithm is required for effective data diffusion. Conventional protocol like LEACH, HEED, PEGASIS protocol etc., fails to balance the network load and the coverage area when the sensor nodes are deployed in large scale. In harmony search algorithm (HSA) absence of gradient search leads the parameter search is in the local region where the required optimal solution remains outside the local region. HSA is heuristic algorithm uses random search with constant harmony memory consideration rate. This paper focuses on designing a Meta-heuristic optimized routing protocol for a distributed network using mutated harmony search algorithm (MHSA) to improve the energy efficiency by simultaneously analyzing the cluster patching. Cluster patching is examined for improving network coverage and connectivity thereby to optimize the energy distribution in WSN. MHSA is a refinement of heuristic algorithm in the global search by adjusting the harmony memory consideration rate HMCR. To improve the performance and efficiency exact balancing of diversification and intensification is done by varying the Pitch adjusting rate PAR and bandwidth BW. Parametric results are compared with the standard heuristics algorithm HSA, GA, and PSO. The computational time and the experimental results show the proposed MHSA gives 85% of connectivity improved that ensures the success of cluster formation for an increased number of nodes to increase increases the network lifetime when compared with existing algorithms.

Effect of multiple sink on the lifetime of multiple chain PEGASIS

A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to monitor physical or environmental conditions. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The lifetime of the network depend how much energy spent in each transmission. PEGASIS is a Chain Based hierarchial routing protocol. The PEGASIS (Power-Efficient Gathering in Sensor Information Systems) protocol forms a chain of the sensor nodes and the chain is formed using a greedy approach, starting from the node farthest to the sink node. The nearest node is send the data to the neighbour node and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. In wireless sensor network, sensor nodes have limited power and processing capability. The multichain concept in PEGASIS and sink mobility increases the network lifetime in wireless sensor network. In this project, we are showing a revised multi-chain PEGASIS protocol by using the multiple sinks to maximize the network lifetime. The simulation is done in MATLAB. We have considered different different areas and different no. of nodes for simulation and Multiple sinks and multiple nodes are placed using pegasis protocol.

An Optimized Technique for Chain Head Selection in Pegasis Protocol for WSN

An Optimized Technique for Chain Head Selection in Pegasis Protocol for WSN

GA GSA-based Energy Efficient Pegasis Protocol for WSN

GA GSA-based Energy Efficient Pegasis Protocol for WSN

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>

A Survey on Comparison of ABC method with other Optimization methods by using PEGASIS Protocol

A Survey on Comparison of ABC method with other Optimization methods by using PEGASIS Protocol

An Improved PEGASIS Routing Protocol Based on Neural Network and Ant Colony Algorithm

This paper proposes a routing protocol for the Wireless Sensor Network (WSN). It is a protocol based on the PEGASIS protocol but using an improved ant colony algorithm and neural network rather than the greedy algorithm to build the chain. Compared with the original PEGASIS, the ACON-PEG can achieve a global optimization. It forms a chain that makes the path more even-distributed and the total square of transmission distance much less. The protocol uses the thought of neural network algorithm to select the chain head, it utilizes ant colony algorithm to find the best path to send data to the BS and the whole area divided into multiple equal parts. It brings about a balance of energy consumption between nodes. Simulation results have shown that the proposed protocol significantly prolongs the network lifetime.

English

Wireless sensor Networks are very famous these days due to their coverage and enormous benefits. Clustering the sensor nodes efficiently and dynamically with least energy consumption is the current issue in front of researchers, so that lifetime of sensor nodes will be increased. Cooperation among Relay Nodes and Edge Nodes (ENs) along with restrained energy utilization depends upon some protocol such as LEACH for data transmission. In this paper, we propose a Cluster Chain Based Relay Nodes Assignment (CCBRNA) scheme to manage the energy constraints in WSN, which Assigns Relay Nodes (Cluster-Heads) on the basis of energy and distances parameters but priority is always given to the energy value. The primary model of CCBRNA based on LEACH and PEGASIS protocols is redeveloped to enlarge the lifetime span of network nodes. This scheme is sliced into two main steps. In the first step Cluster-Head is selected and then in second step data transmission starts using an internal chain of nodes according to the distances of nodes from Base Station. In data transmission step, data transportation between different clusters takes place and lastly data is sent to the end terminal moving via the nearest Cluster-Head. Simulation in MATLAB verifies the enhanced lifetime of the nodes. We have used the distance as the key parameter while data transmission takes place. The scheme is efficient as when there are large number of nodes, chaining will take very less time and as well as energy to transmit the data to Cluster-Head. We have further applied an external chaining among Cluster-Heads of different clusters. With the applied limitations and suggested resources such as additional processor, it works well in relaying process.

Study of Mine Environment Monitoring System Based on Wireless Sensor Network

There are a large number of sensors to detect information in mine environment system, which provides the original data for the prevention and treatment of mine accidents. According to data flow of data acquisition, data transmission, data storage and data processing, this paper used CC2530 to design the wireless sensor nodes, analyzed the Zigbee network topology underground and designed an optimized PEGASIS protocol. The multi-sensor data fusion method was applied to the multi-parameter and large-scale mine data, solved the nonlinear problems in the multi-feature selection and extraction and also improved the performance of mine monitoring system.

HEEP (Hybrid Energy Efficiency Protocol) based on chain clustering

Wireless Sensor Networks have emerged as a new information-gathering system based on the collaborative efforts of large number of tiny sensors with limited resource. Energy constraints distinguish sensors networks from other wireless communication networks. Energy efficiency and network lifetime have been the focus of many research works on sensor networks, such as energy aware routing. This paper suggests a new routing protocol called HEEP which combines two algorithms: LEACH and PEGASIS. HEEP advise a new network self-organisation approach, that join clusters-based and the chain-based approaches. This new approach is called chains clustering approach. Organising the network nodes in chains clusters avoids the bad energy dissipation in LEACH protocol and reduces the routing delay generated by PEGASIS protocol. The experimental results show that HEEP outperforms LEACH and LEACH-C with more 110% of network lifetime, and reduces the routing delay introduced in PEGASIS by 50%.

An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks

The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively.

서브 클러스터 기법을 이용한 효과적인 USN 라우팅 프로토콜

USN 환경에서 제안된 라우팅 프로토콜 중에서 PEGASIS 프로토콜은 LEACH 프로토콜과 비교해 볼 때 노드의 에너지 소비량 감소에 효과적이다. 하지만, PEGASIS 프로토콜은 센서 네트워크의 특성인 BS 노드의 빈번한 변경으로 인한 센서 네트워크 망 구성의 변화에 취약성을 가지고 있다. 이에 본 논문에서는 이를 해결하기 위해서 작은 단위의 클러스터 헤드를 선출해 중간노드의 역할을 하게 하고자 한다. 이를 통해 PEGASIS 알고리즘이 가지고 있는 취약점을 보완할 수 있음을 보이고 이에 대한 시뮬레이션 결과를 보인다. 【The PEGASIS protocol is more effective about energy consumption more than LEACH in USN environment. However, PEGASIS is weakness enemy in change of sensor network net composition because It changes BS node frequently. Therefore, we propose new routing protocol that use Sub-Cluster Chaining to solve this problem in this paper. It can reduce overhead that happen in election of middle node doing so and reduce energy consumption. Also, It can supplement limitation that PEGASIS has. This is treatise shows that new protocol that propose than existent PEGASIS through simulation is superior.】