Energy-Efficient and Secure Data Forwarding Mechanism for Balancing Cluster Lifetime for Huge Size Wireless Sensor Networks

2019 ◽  
Vol 16 (9) ◽  
pp. 3961-3964
Author(s):  
Charu Sharma ◽  
Rohit Vaid

In designing Wireless Sensor Networks, energy efficiency and security should be considered very critically. Energy efficiency is achieved through data aggregation which eliminates the transmission of redundant data while security is achieved by preserving confidentiality among sensor node and the base station. In this paper, an energy efficient and secure cluster based aggregation mechanism is presented. In this model, for energy efficiency the network is divided into tracks and sectors so the cluster head’s are uniformly selected from the whole network. To achieve security the cluster head’s perform data aggregation with the help of some pattern codes and only distinctive data is transmitted from sensor nodes in encrypted form. To perform aggregation, the sensor nodes do not need to know about the actual sensor data therefore there is no need to use any encryption or decryption schemes between nodes and cluster head. Performance evaluation shows proposed model works better to enhance the network lifetime, security, average residual energy, and average packet transmission ratio than conventional data aggregation models.

Author(s):  
Karuna Babber

Background: The advent of wireless sensor networks makes it possible to track the events even in the remotest areas that too without human intervention. But severe resource constraints, generally energy of sensor nodes push researchers worldwide to develop energy efficient protocols in order to accomplish the application objectives of these networks. Objective: However, till date there is no energy efficient routing protocol which provides uniformity with maximum resource utilization for WSNs. Methods: In this paper, a Uniform Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (UCAEE) has been proposed. UCAEE is a base station controlled algorithm where entire sensing area is partitioned into uniform clusters. The motive of the algorithm is to split the sensing area into uniform clusters and to select cluster heads and gate-way nodes within each cluster so that the network energy can be balanced in a best possible way. Conclusion: UCAEE achieves minimum energy consumption during data transmission and reception. Results: Simulation results indicate that proposed UCAEE algorithm conserves more energy than its contemporary clustering algorithms like LEACH, PEGASIS and SECA and promises better network lifetime of wireless sensor networks.


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


2017 ◽  
Vol 2 (1) ◽  
Author(s):  
Palak Aggarwal ◽  
Santosh Kumar ◽  
Neha Garg ◽  
Sumeshwar Singh

Energy and security are very important issues in Wireless Sensor Networks (WSN) which need to be handled. These issues are interrelated because of limited energy there are some restrictions on implementation of security. Insider packet drop attack is one of the dangerous attacks for wireless sensor network that causes a heavy damage to WSN functionalities by dropping packets. It becomes necessary to identify such attack for secure routing of data in WSN. To detect this attack, trust mechanism has been proven as a successful technique. In this mechanism, each node verifies the trustworthiness of its neighbor node before packet transmission so that packets can only be transmitted to trustworthy nodes. But there is a problem of False Alarm with such trust-aware scheme. False alarm occurs when a good node’s trust value goes down due to natural packet dropping and being eliminated from the routing paths. This wastes network’s resources that further shortens network lifetime. In this paper, we have proposed a system for identification and recovery of false alarms (IRFA) which is the optimization of existing trust based system. But security solution needs to be energy efficient due to scarcity of energy resources in WSN. To provide energy efficiency, we have implemented proposed IRFA system in cluster based environment which detects insider packet drop attackers in an energy efficient manner. We have conducted OMNET++ simulation and results demonstrate that the proposed system performance is better than existing trust-based system in terms of packet delivery rate and energy efficiency which improves network lifetime.


2014 ◽  
Vol 573 ◽  
pp. 407-411
Author(s):  
Chelliah Pandeeswaran ◽  
Natrajan Papa ◽  
Sundar G. Jayesh

MAC protocol design in Wireless sensor networks becomes vibrant research field for the past several years. In this paper an EE-Hybrid MAC protocol (Energy efficient hybrid Medium Access Control) has been proposed, which is energy efficient and low latency MAC protocol, which uses interrupt method to assign priority for certain wireless sensor nodes assumed to be present in critical loops of industrial process control domain. EE-Hybrid MAC overcomes some of the limitations in the existing approaches. Industrial wireless sensor network require a suitable MAC protocol which offers energy efficiency and capable of handling emergency situations in industrial automation domain. Time critical and mission critical applications demands not only energy efficiency but strict timeliness and reliability. Harsh environmental condition and dynamic network topologies may cause industrial sensor to malfunction, so the developed protocol must adapt to changing topology and harsh environment. Most of the existing MAC protocols have number of limitations for industrial application domain In industrial automation scenario, certain sensor loops are found to be time critical, where data’s have to be transferred without any further delay. The proposed EE-Hybrid MAC protocol is simulated in NS2 environment, from the result it is observed that proposed protocol provides better performance compared to the conventional MAC protocols.


Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>


2012 ◽  
Vol 04 (03) ◽  
pp. 1250013 ◽  
Author(s):  
YI HONG ◽  
HONGWEI DU ◽  
DEYING LI ◽  
WENPING CHEN

The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.


2014 ◽  
Vol 666 ◽  
pp. 322-326
Author(s):  
Yu Yang Peng ◽  
Jae Ho Choi

Energy efficiency is one of the important hot issues in wireless sensor networks. In this paper, a multi-hop scheme based on a cooperative multi-input multi-outputspatial modulation technique is proposed in order to improve energy efficiency in WSN. In this scheme, the sensor nodes are grouped into clusters in order to achieve a multi-input multi-output system; and a simple forwarding transmission scenario is considered so that the intermediate clusters only forward packets originated from the source cluster down to the sink cluster. In order to verify the performance of the proposed system, the bit energy consumption formula is derived and the optimal number of hopsis determined. By qualitative experiments, the obtained results show that the proposed scheme can deliver the data over multiple hops consuming optimal energy consumption per bit.


Author(s):  
Bahae ABIDI ◽  
Abdelillah JILBAB ◽  
Mohamed EL HAZITI

Even in difficult places to reach, the new networking technique allows the easy deployment of sensor networks, although these wireless sensor networks confront a lot of constraints. The major constraint is related to the quality of information sent by the network. The wireless sensor networks use different methods to achieve data to the base station. Data aggregation is an important one, used by these wireless sensor networks. But this aggregated data can be subject to several types of attacks and provides security is necessary to resist against malicious attacks, secure communication between severely resource constrained sensor nodes while maintaining the flexibility of the topology changes. Recently, several secure data aggregation schemes have been proposed for wireless sensor networks, it provides better security compared with traditional aggregation. In this paper, we try to focus on giving a brief statement of the various approaches used for the purpose of secure data aggregation in wireless sensor networks.


Energies ◽  
2020 ◽  
Vol 13 (16) ◽  
pp. 4072
Author(s):  
Tanzila Saba ◽  
Khalid Haseeb ◽  
Ikram Ud Din ◽  
Ahmad Almogren ◽  
Ayman Altameem ◽  
...  

In recent times, the field of wireless sensor networks (WSNs) has attained a growing popularity in observing the environment due to its dynamic factors. Sensor data are gathered and forwarded to the base station (BS) through a wireless transmission medium. The data from the BS is further distributed to end-users using the Internet for their post analysis and operations. However, all sensors except the BS have limited constraints in terms of memory, energy and computational resources that degrade the network performance concerning the network lifetime and trustworthy routing. Therefore, improving energy efficiency with reliable and secure transmissions is a valuable debate among researchers for critical applications based on low-powered sensor nodes. In addition, security plays a significant cause to achieve responsible communications among sensors due to their unfixed and variable infrastructures. Keeping in view the above-mentioned issues, this paper presents an energy-aware graph clustering and intelligent routing (EGCIR) using a supervised system for WSNs to balance the energy consumption and load distribution. Moreover, a secure and efficient key distribution in a hierarchy-based mechanism is adopted by the proposed solution to improve the network efficacy in terms of routes and links integrity. The experimental results demonstrated that the EGCIR protocol enhances the network throughput by an average of 14%, packet drop ratio by an average of 50%, energy consumption by an average of 13%, data latency by an average of 30.2% and data breaches by an average of 37.5% than other state-of-the-art protocols.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Aaqil Somauroo ◽  
Vandana Bassoo

Due to its boundless potential applications, Wireless Sensor Networks have been subject to much research in the last two decades. WSNs are often deployed in remote environments making replacement of batteries not feasible. Low energy consumption being of prime requisite led to the development of energy-efficient routing protocols. The proposed routing algorithms seek to prolong the lifetime of sensor nodes in the relatively unexplored area of 3D WSNs. The schemes use chain-based routing technique PEGASIS as basis and employ genetic algorithm to build the chain instead of the greedy algorithm. Proposed schemes will incorporate an energy and distance aware CH selection technique to improve load balancing. Clustering of the network is also implemented to reduce number of nodes in a chain and hence reduce delay. Simulation of our proposed protocols is carried out for homogeneous networks considering separately cases for a static base-station inside and outside the network. Results indicate considerable improvement in lifetime over PEGASIS of 817% and 420% for base station inside and outside the network respectively. Residual energy and delay performance are also considered.


Sign in / Sign up

Export Citation Format

Share Document