scholarly journals Attack Prediction By Using Greedy Algorithm For Diminishing The Drop And Delay In Wireless Sensor Networks

2021 ◽  
Vol 12 (6) ◽  
pp. 1072-1082
Author(s):  
Dr. B.Shadaksharappa, Et. al.
Keyword(s):  
Data Transmission ◽  
Packet Delay ◽  
Link Quality ◽  
Sensor Nodes ◽  
Buffer Size ◽  
Destination Node ◽  
Target Node ◽  
Data Packets ◽  
Simulation Results ◽  
Packet Drop

The essential constraint of the internet is that forwarding the data packets of data among the restricted and trustworthy data nodes. If the receiver node is attacker node then it'll drop the data rather than forwarding the data to ensuing neighbor node. Therefore, efficient and secure data transmission is extremely necessary within the network data transmission. Each router node within the network can accept the data packets up to its buffer size only. Once the queue value reached the buffer threshold value then congestion can occur at the node. Once congestion happens then it would lose the data packets. By sending the data packets to the next neighbour node this problem will be resolved. This congestion will be handled by the Fully Distributed Congestion Control FDCC and Cooperative and Memory Efficient Token Bucket (CMTB) algorithms. Because the data is transmitted to the next neighbour node predicting the node behavior is extremely necessary because it is an attacker or the conventional transmitter node because it has to transmit the efficient data securely to the destination node. In this paper, the node behavior will be predicted by analyzing the trace file. The simulation results show that this proposed method would provide a lot of security in data transmission. The WSN comprises a group of sensor nodes that are disseminated on the network. These sensor nodes initially exchange their data packets to the near nodes to send the data packets to the target node. During the transmission of these data packets some data packets drop may also happen inside the network. This packet drop should be kept up as low as feasible for correct data transmission to the target node or destination node. This algorithm highlights the routes with high link quality, low packet delay and with low packet drop. Simulation results show that this proposed algorithm can provide the most effective path for transmitting the data to the destination meanwhile it reduces the packet drop and packet delay.

scholarly journals Maximization of Lifetime of Wireless Sensor Network with Sensitive Power Dynamic Protocol

2018 ◽  
Vol 7 (3.12) ◽  
pp. 380
Author(s):  
Manish Bhardwaj ◽  
Anil Ahlawat ◽  
Nidhi Bansal
Keyword(s):  
Routing Protocol ◽  
Steering System ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Power Efficient ◽  
Data Packets ◽  
And Performance ◽  
Energy Balanced Routing ◽  
Power Balancing

A vitality effective protocol configuration is a key testing issue in a network of Wireless Sensor. A portion of the few existing vitality effective protocols plots dependably forward the bundles through the base vitality based ideal course to the sink to limit vitality utilization. It causes a disturbed dispersion of remaining vitality between sensor nodes, which prompts partitioning of the network. The prime objective of this method is to pass the data packets to destination node through the vitality denser range within Sensor Networks Lifetime. The current procedure Energy Balanced Routing Protocol (EBRP) neglects to accomplish Throughput, Delay part, keeping in mind the end goal to enhance the Network Lifetime and Performance so the proficient steering convention is required with the abilities of both the Power Efficient and Power Balancing. To resolve this problem, this manuscript proposed Impediment Sensitive Power Unbiased Dynamic Routing Protocol (ISPUDRP). The proposed steering system accomplishes as far as End-to-End Delay, Throughput and Lifetime of network. This manuscript shows that proposed calculation accomplishes better execution performance than the current strategies.   

scholarly journals Detection and Countermeasure of Node Misbehaviour in Clustered Wireless Sensor Network

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Meenakshi Tripathi ◽  
M. S. Gaur ◽  
V. Laxmi ◽  
P. Sharma
Keyword(s):  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Environment Monitoring ◽  
Detection Scheme ◽  
Data Packets ◽  
Battery Power ◽  
Processing Power ◽  
Simulation Results

Wireless sensor networks are widely used in many applications like battlefield monitoring, environment monitoring, and so forth. In all of these applications the cooperation among various sensor nodes is needed to forward the data packets to the base station. However, it expends the various resources of a sensor node such as battery power, storage, and processing power. Therefore, to conserve its own resources a node may become selfish by not forwarding the data to the others. This kind of attack has serious consequences if the attacker node is the leader of a cluster. In the presence of attack the base station will not be able to get the data from the victimized cluster while resources of the member of that cluster are being consumed. In this paper we propose a scheme called window based scheme (WBS) to detect this kind of misbehavior in WSN. Our detection scheme is energy efficient because most of the computations are done at base station only. Simulation results prove that our method detects and removes the attacker effectively and efficiently.

scholarly journals On the Use of Graphs for Node Connectivity in Wireless Sensor Networks for Hostile Environments

2019 ◽  
Vol 2019 ◽  
pp. 1-22
Author(s):  
Emmanuel García-González ◽  
Juan C. Chimal-Eguía ◽  
Mario E. Rivero-Angeles ◽  
Vicent Pla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Packet Delay ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Buffer Size ◽  
Distributed Data ◽  
Node Connectivity ◽  
Hostile Environments

Wireless sensor networks (WSNs) have been extensively studied in the literature. However, in hostile environments where node connectivity is severely compromised, the system performance can be greatly affected. In this work, we consider such a hostile environment where sensor nodes cannot directly communicate to some neighboring nodes. Building on this, we propose a distributed data gathering scheme where data packets are stored in different nodes throughout the network instead to considering a single sink node. As such, if nodes are destroyed or damaged, some information can still be retrieved. To evaluate the performance of the system, we consider the properties of different graphs that describe the connections among nodes. It is shown that the degree distribution of the graph has an important impact on the performance of the system. A teletraffic analysis is developed to study the average buffer size and average packet delay. To this end, we propose a reference node approach, which entails an approximation for the mathematical modeling of these networks that effectively simplifies the analysis and approximates the overall performance of the system.

scholarly journals Detecting malicious nodes using data aggregation protocols in wireless sensor networks

2017 ◽  
Vol 7 (1.1) ◽  
pp. 594
Author(s):  
P. Balamurugan ◽  
M. Shyamala Devi ◽  
V. Sharmila
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Aggregation ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Malicious Nodes ◽  
Secured Data

At present scenario, sensor devices are used in various fields for gathering information so all those data should be secured safely. Securing data is an important role in Wireless Sensor Networks (WSN). WSN is extremely essential for the purpose of reducing the complete redundancy and energy consumption during gathering data among sensor nodes. Optimized data aggregation is needed at cluster head and Base Station (BS) for secured data transmission. Data aggregation is performed in all routers while forwarding data from source to destination node. The complete life time of sensor networks is reducing because of using energy inefficient nodes for the purpose of aggregation. So this paper introduces the optimized methods for securing data (OMSD) which is trust based weights and also completely about the attacks and some methods for secured data transmission. 

scholarly journals An Enhanced routing Technique to improve the Network Lifetime of Cognitive Sensor Network

2021 ◽  
Author(s):  
V Jyothi ◽  
M.V. Subramanyam
Keyword(s):  
Sensor Network ◽  
Power Dissipation ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Energy Efficient Routing ◽  
Data Packets ◽  
Buffer Overflows ◽  
Routing Policy ◽  
Surrounding Environment ◽  
Packet Drop

Abstract In terms of using the technology of Cognitive Radio (CR), a Cognitive Sensor Network (CSN) is varied from the conventional Wireless Sensor Networks (WSNs). According to the interaction with the surrounding environment, the transmitter parameters can be modified in the sensor nodes of CSN adaptively. In CSNs, routing is one of the important components. Based on the capability of spectrum-aware, the schemes of routing of CSNs are district from other networks. The changeable spectrum resource dynamically should be understood by the routing scheme to establish a path of reliable forwarding by the adjustment of routing policy adaptively. In CSNs, reliable routing is an essential thing but still not a well-explored problem in CSNs. Packet drops due to spectrum unavailability and buffer overflows seriously affects the connectivity of the nodes. The whole network’s lifetime and the data delivery rate are impacted by the prolonging packet drops. To increase the nodes’ lifetime, the addressing of this drawback in the phase of routing should be done. Before the making of routing decisions, a new routing technique is proposed named as Drop factor based energy efficient routing technique (DFBEER) with the use of packet drop ratio and power dissipation metric of the spectrum links. With the total number of users in the routing path, the drop factor is computed. Power dissipation is calculated based on the transmitted data packets versus the amount of total consumed energy. This method reduces the drop ratio by avoiding the high drop factor nodes from being participating in the routing process. It always ensures that the data would be handled by the low dropping ratio nodes, thus the network’s lifetime is improved.

scholarly journals The channel for hidden data transmission in WSN

2017 ◽  
Vol 63 (2) ◽  
pp. 209-216
Author(s):  
Radosław O. Schoeneich ◽  
Marcin Golański ◽  
Michał Kucharski ◽  
Marek Franciszkiewicz ◽  
Dawid Zgid
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Aggregation ◽  
Additional Data ◽  
Wireless Sensor ◽  
Covert Channel ◽  
Data Packets ◽  
Simulation Results ◽  
Hidden Data

Abstract This paper describes an idea and realisation of hidden data transmision using Tiny Aggregation Covert Channel (TAGCC)in Wireless Sensor Networks. Our solution uses data aggregation mechanism called Tiny Aggregation (TAG). The protocol is based on idea of hidden messages sending without generate additional data packets and encryption. The paper describes details of proposed algorithm and simulation results obtained during testing of the sensor networks with hidden channel TAGCC.

A Data Transmission Strategy Proposed for Subsea Surveillance

2013 ◽  
Vol 475-476 ◽  
pp. 851-855
Author(s):  
Wei Hao Xie ◽  
Bin Zhou ◽  
Xiao Ling Sun ◽  
Guang Xu ◽  
Lei Yang
Keyword(s):  
Energy Consumption ◽  
Data Transmission ◽  
Transmission Probability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Transmission Strategy ◽  
Observation Network ◽  
The Common ◽  
Area Surveillance ◽  
Simulation Results

As a promising way to the certain area surveillance, the application of wireless sensor network on the unknown subsea observation is becoming more significant. After placing the sensor nodes, each sensor node will generate a common communication frame and choose the next hop neighbor node randomly, which could results in redundant energy consumption. In this paper, a data transmission strategy is proposed including routing scheme, frame format and the corresponding topology structure. By considering the transmitting distance, energy consumption and transmission probability, the introduced strategy can reduce the redundant energy consumption, balance the network payload and prolong the subsea observation network lifetime. The simulation results show that the strategy is more efficient than the common one.

scholarly journals Enhanced Routing for Low Power and Lossy Network Based on Link Quality Estimation

2019 ◽  
Vol 8 (3) ◽  
pp. 3401-3406
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Performance Metrics ◽  
Average Energy ◽  
Base Station ◽  
Link Quality ◽  
Sensor Nodes ◽  
Quality Estimation ◽  
Packet Drop ◽  
Link Quality Estimation

Internet of Things (IoT) network is designed using a set of wireless sensor nodes connected together through a Base station. The sensor nodes capture the data about the surrounding environment and forward it to the base station (BS) along with the geotag and timestamp. For a better quality of service in a IoT network the intelligent routing becomes essential factor. The routing protocol must be energy efficient to prevent packet loss or packet drop, and early dying of certain nodes. Hence it also becomes necessary to balance the energy spending in the network by implementing optimal routing decisions derived from intelligent machine learning techniques. Many researchers have provided solutions for energy efficient routing in IoT network. However the solutions provided need to be enhanced or redesigned to address other challenges and issues in an IoT network. This paper proposes a link quality estimation mechanism when a node is considering it neighboring node as a parent node. Based upon the experiments conducted in this research by implementing the proposed routing protocol it is observed that the routing algorithm exhibits better performance with respect to the following performance metrics including average energy consumption, packet drop rate, overall network life time, and average end to end delay.

scholarly journals Multivariate Weighted Isotonic Regressive Modest Adaptive Boosting Based Resource-Aware Routing In WSN

2021 ◽  
Author(s):  
N. Muruganandam ◽  
V. Venkatraman ◽  
R. Venkatesan
Keyword(s):  
Packet Loss ◽  
Data Transmission ◽  
Loss Rate ◽  
Packet Loss Rate ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Adaptive Boosting ◽  
Data Packets ◽  
Packet Delivery ◽  
Resource Aware

Abstract WSN includes a scenario where huge amount of sensor nodes are distributed to monitor environmental conditions with route collected data towards sinks via the internet. WSNs efficiently manage the wider network with available resources, such as residual energy and wireless channel bandwidth. Therefore, routing algorithm is important to enhance battery-constrained networks. Many existing techniques are developed for balancing consumption of energy but efficient routing was not achieved. Multivariate Weighted Isotonic Regressive Modest Adaptive Boosting based Resource Aware Routing (MWIRMAB-RAR) technique is introduced for enhancing routing. The MWIRMAB-RAR technique includes a different process namely resource-aware node selection, route path discovery, and data transmission. Initially, the MWIRMAB-RAR technique uses the Modest Adaptive Boosting technique uses the Multivariate Weighted Isotonic Regression function for detecting resource-efficient sensor nodes for effective data transmission. After that, multiple route paths are established based on the time of flight method. After establishes route path, source node sends data packets to sink node via resource-efficient nodes. The data delivery was enhanced and minimizes packet loss as well as delay. The simulation analysis is carried out on certain performance factors such as energy consumption, packet delivery ratio, packet loss rate, and delay with number of data packets and sensor nodes. The obtained evaluation indicates MWIRMAB-RAR outperforms well in terms of increasing data packet delivery and reduces consumption of energy, packet loss rate, and delay.

scholarly journals Correlation Techniques to Measure the Degree of Association Between Nodes of Different Protocols in MANETs, In Terms of Their Energy Consumption in Data Transmission

2019 ◽  
pp. 131-135
Author(s):  
Dasaka VSS Subrahmanyam ◽  
T. Ch. Malleswara Rao
Keyword(s):  
Energy Consumption ◽  
Data Transmission ◽  
Energy Efficient ◽  
Rank Correlation ◽  
Life Time ◽  
Destination Node ◽  
Data Sets ◽  
Data Packets ◽  
Consumption Data ◽  
Degree Of Association

Several protocols have been using in networks, especially in MANETs, to increase efficiency in energy consumption of intermediate nodes while transmitting data packets to the destination node. Several protocols like energy efficient and energy consumption protocols are introduced in MANETs to increase the overall life time of MANETs. MANETs can’t survive for longer times without the property of energy consumption, as the available battery resources are very limited. Different protocols are implemented and tested, by simulation like NS2, on the basis of their energy consumption levels. To know the fairness and reliability of data obtained from different protocols, several statistical analysis methods are suggested. Finding the coefficient of correlation and rank correlation methods are very popular among them. These methods help to know the actual existing relation between the considered energy consumption data sets of intermediate nodes of two different protocols. This information will be very helpful to MANETs in estimating the required future energy consumption levels of its intermediate nodes and the degree of fairness between them.

Sign in / Sign up

Export Citation Format

Share Document