Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

A Self-Adaptive Listen-Time Sleeping Algorithm Based on the Number of Neighbor Nodes for Wireless Mesh Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5123-5128
Author(s):  
Jun Feng Hao ◽  
Jing Fan ◽  
Wen Yu Shi
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Heavy Traffic ◽  
Power Saving ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Mesh ◽  
End To End Delay ◽  
Low Traffic

Power saving is a very critical issue in wireless sensor network. Many schemes for power saving can be found in the literature, but these schemes barely consider different topology of nodes. In this paper, based on S-MAC algorithm, NALS-MAC algorithm is designed and combined with the characters of application background of wireless mesh sensor networks. According to the number of neighbor nodes, sensor nodes self-adaptively generate the listen-time during a period respectively. The node with more neighbors will have longer listen-time, because more neighbors means higher probability of heavy traffic. The nodes need longer time to deal with information than nodes with low traffic. The results show that the sensor nodes adjusting the listen-time self-adaptively in proper way achieves the reduction of end-to-end delay and enhance throughout.

scholarly journals Optimal Message Bundling with Delay and Synchronization Constraints in Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 4027 ◽  
Author(s):  
Xintao Huan ◽  
Kyeong Soo Kim ◽  
Sanghyuk Lee ◽  
Moon Keun Kim
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Time Synchronization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
End To End Delay ◽  
End To End ◽  
Optimal Approach ◽  
Synchronization Accuracy

Energy efficiency and end-to-end delay are two of the major requirements for the monitoring and detection applications based on resource-constrained wireless sensor networks (WSNs). As new advanced technologies for accurate monitoring and detection—such as device-free wireless sensing schemes for human activity and gesture recognition—have been developed, time synchronization accuracy becomes an important requirement for those WSN applications too. Message bundling is considered one of the effective methods to reduce the energy consumption for message transmissions in WSNs, but bundling more messages increases the transmission interval of bundled messages and thereby their end-to-end delays; the end-to-end delays need to be maintained within a certain value for time-sensitive applications like factory monitoring and disaster prevention, while the message transmission interval affects time synchronization accuracy when the bundling includes synchronization messages as well. Taking as an example a novel WSN time synchronization scheme recently proposed for energy efficiency, we investigate an optimal approach for message bundling to reduce the number of message transmissions while maintaining the user-defined requirements on end-to-end delay and time synchronization accuracy. Formulating the optimal message bundling problem as integer linear programming, we compute a set of optimal bundling numbers for the sensor nodes to constrain their link-level delays, thereby achieving and maintaining the required end-to-end delay and synchronization accuracy. Extensive experimental results based on a real WSN testbed using TelosB sensor nodes demonstrate that the proposed optimal bundling could reduce the number of message transmissions about 70% while simultaneously maintaining the required end-to-end delay and time synchronization accuracy.

scholarly journals Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Packet Delivery

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

A NEW ENERGY-EFFICIENT NEIGHBOR DISCOVERY AND LOAD BALANCING PROTOCOL FOR MOBILE SENSOR NETWORKS

2014 ◽  
Vol 23 (07) ◽  
pp. 1450100 ◽  
Author(s):  
RIDHA OUNI ◽  
ABDULLAH AL-DHELAAN ◽  
RAFIK LOUATI
Keyword(s):  
Sensor Networks ◽  
Load Distribution ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Neighbor Discovery ◽  
New Energy ◽  
Working Together ◽  
Save Energy ◽  
Specific Duty ◽  
Important Design

The wireless sensor networks (WSNs) are formed by a large number of sensor nodes working together to provide a specific duty. However, the low energy capacity assigned to each node prompts users to look at an important design challenge which is lifetime maximization. Especially the availability of nodes, the sensor coverage, and the connectivity have been included in discussions on network lifetime. Therefore, designing effective techniques that conserve scarce energy resources is a critical issue in WSNs. In this regard, we are interested in developing various mechanisms to save energy based on the constraints involved for energy consumption in WSNs. Three mechanisms are proposed to reduce the number of control packets responsible for path discovery, optimize diffusion area, and balance the load distribution in the network.

scholarly journals Bayesian Compressive Sensing Based Optimized Node Selection Scheme in Underwater Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2568 ◽  
Author(s):  
Ruisong Wang ◽  
Gongliang Liu ◽  
Wenjing Kang ◽  
Bo Li ◽  
Ruofei Ma ◽  
...  
Keyword(s):  
Sensor Networks ◽  
Compressed Sensing ◽  
Bayesian Estimation ◽  
Sensor Node ◽  
Optimization Problem ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Node Selection ◽  
Selection Scheme ◽  
Error Covariance

Information acquisition in underwater sensor networks is usually limited by energy and bandwidth. Fortunately, the received signal can be represented sparsely on some basis. Therefore, a compressed sensing method can be used to collect the information by selecting a subset of the total sensor nodes. The conventional compressed sensing scheme is to select some sensor nodes randomly. The network lifetime and the correlation of sensor nodes are not considered. Therefore, it is significant to adjust the sensor node selection scheme according to these factors for the superior performance. In this paper, an optimized sensor node selection scheme is given based on Bayesian estimation theory. The advantage of Bayesian estimation is to give the closed-form expression of posterior density function and error covariance matrix. The proposed optimization problem first aims at minimizing the mean square error (MSE) of Bayesian estimation based on a given error covariance matrix. Then, the non-convex optimization problem is transformed as a convex semidefinite programming problem by relaxing the constraints. Finally, the residual energy of each sensor node is taken into account as a constraint in the optimization problem. Simulation results demonstrate that the proposed scheme has better performance than a conventional compressed sensing scheme.

scholarly journals An Energy Efficient Secure Data Aggregation in Wireless Sensor Networks

2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Aggregated Data

Abstract In Wireless sensor network, the major issues are security and energy consumption. There may be several numbers of malicious nodes present in sensor networks. Several techniques have been proposed by the researchers to identify these malicious nodes. WSNs contain many sensor nodes that sense their environment and also transmit their data via multi-hop communication schemes to the base station. These sensor nodes provides power supply using battery and the energy consumption of these batteries must be low. Securing the data is to avoid attacks on these nodes and data communication. The aggregation of data helps to minimize the amount of messages transmitted within the network and thus reduces overall network energy consumption. Moreover, the base station may distinguish the encrypted and aggregated data based on the encryption keys during the decryption of the aggregated data. In this paper, two aspects of the problem is concerned, we investigate the efficiency of data aggregation: first, how to develop cluster-based routing algorithms to achieve the lowest energy consumption for aggregating data, and second, security issues in wsn. By using Network simulator2 (NS2) this scheme is simulated. In the proposed scheme, energy consumption, packet delivery ratio and throughput is analyzed. The proposed clustering, routing, and protection protocol based on the MCSDA algorithm shows significant improvement over the state-of - the-art protocol.

scholarly journals End-To-End Delay Optimization in Wireless Sensor Network (WSN)

2012 ◽  
pp. 247-251
Author(s):  
Shweta K. Kanhere ◽  
Mahesh Goudar ◽  
Vijay M. Wadhai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Central System ◽  
Neighboring Node ◽  
Packet Delivery ◽  
End To End

In this paper, we are interested in optimizing the delay of event-driven wireless sensor networks, for which events does not occur frequently. In such systems, most of the energy is consumed when the radios are on, waiting for an arrival to occur. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of this energy constrained wireless sensor networks by optimization of the delay in the network but this scheme could result in substantial delays because a transmitting node needs to wait for its next-hop relay node to wake up. An attempt has been made to reduce these delays by developing new method of packet forwarding schemes, where each nod opportunistically forwards a packet to the its neighboring node that wakes up among multiple candidate nodes. In this paper, the focus is to study how to optimize the packet forwarding schemes by optimization of the expected packet-delivery delays from the sensor nodes to the sink. Based on optimized delay scheme result, we then provide a solution to the central system about how to optimally control the system parameters of the sleep-wake scheduling protocol and the packet forwarding protocol to maximize the network lifetime, subject to a constraint on the expected end-to-end packet delivery delay. Our numerical results indicate that the proposed solution can outperform prior heuristic solutions in the literature, especially under the practical scenarios where there are obstructions, e.g., a lake or a mountain, in the area of wireless sensor networks.

scholarly journals Analisis Optimasi Kinerja Protokol Routing AODV dan AOMDV dengan Menggunakan Metode RFAP untuk Mencegah RREQ Flooding Attacks pada Jaringan MANET

2019 ◽  
Vol 1 (1) ◽  
pp. 9-18
Author(s):  
Andy Hidayat Jatmika ◽  
I Made Windra Yudistiana ◽  
Ariyan Zubaidi
Keyword(s):  
Destination Node ◽  
Malicious Nodes ◽  
End To End Delay ◽  
Flooding Attacks ◽  
End To End ◽  
Prevention Method ◽  
Prevention Methods ◽  
Bandwidth Capacity ◽  
Route Request ◽  
Better Than

One sector that greatly influences it is in terms of network security. This is due to the characteristics of the MANET network that are dynamic so that the MANET network is very easily disturbed by irresponsible parties. One of the attacks that can occur in MANET network is Route Request (RREQ) Flooding Attacks. In RREQ flooding attacks in the form of fake nodes that are outside the area of the network and broadcast RREQ to the destination node in the network, so that it meets the bandwidth capacity which results in a decrease in quality in determining the route of sending data or information to the destination node. To prevent the occurrence of RREQ flooding attacks, a prevention method for these attacks is required, namely the RREQ Flooding Attacks Prevention (RFAP). This method works by finding nodes that are likely to be malicious nodes then isolated from the network to be restored to normal nodes. This research will optimize the AODV and AOMDV routing protocols by adding RFAP prevention methods and knowing the performance of the two protocols in terms of throughput, average end-to-end delay and normalized routing load. Based on the results of the simulation, that the application of the method RFAP on AODV routing protocol can produce network quality is better than AOMDV protocol, both in terms of throughput, average end-to-end delay and normalized routing load.

Sign in / Sign up

Export Citation Format

Share Document