Tentative Route Selection aApproach for Irregular Clustered Wireless Sensor Networks

2017 ◽  
Vol 8 (3) ◽  
pp. 715
Author(s):  
Mahendra Sharma ◽  
Santhosh Kumar Singh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Simulation Analysis ◽  
Initial Step ◽  
Base Station ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Selection Approach ◽  
And Control ◽  
Crucial Part

Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.

Estimation of Secured Wireless Sensor Networks and Its Significant Observation for Improving Energy Efficiency Using Cross-Learning Algorithms

2021 ◽  
pp. 450-467
Author(s):  
Sirasani Srinivasa Rao ◽  
K. Butchi Raju ◽  
Sunanda Nalajala ◽  
Ramesh Vatambeti
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Learning Algorithms ◽  
Base Station ◽  
Wireless Sensor ◽  
Control Applications ◽  
Symmetric Key ◽  
And Control ◽  
The Ideal

Wireless sensor networks (WSNs) have as of late been created as a stage for various significant observation and control applications. WSNs are continuously utilized in different applications, for example, therapeutic, military, and mechanical segments. Since the WSN is helpless against assaults, refined security administrations are required for verifying the information correspondence between hubs. Because of the asset limitations, the symmetric key foundation is considered as the ideal worldview for verifying the key trade in WSN. The sensor hubs in the WSN course gathered data to the base station. Despite the fact that the specially appointed system is adaptable with the variable foundation, they are exposed to different security dangers. Grouping is a successful way to deal with vitality productivity in the system. In bunching, information accumulation is utilized to diminish the measure of information that streams in the system.

scholarly journals Exploration of Attacks Originate by Clone Node in Wireless Sensor Network

2019 ◽  
Vol 8 (12) ◽  
pp. 3833-3838
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Packet Loss ◽  
Base Station ◽  
Wireless Sensor ◽  
Layer By Layer ◽  
Network Simulator ◽  
Processing Power ◽  
Normal Network ◽  
The Impact

Wireless sensor networks are used today in numerous applications. Due to the limited battery, storage and processing power, the sensor node absorbs the environment and sends data to the base station. Wireless sensor networks are vulnerable to various attacks due to their limited functionality. Clone node is the attack where adversary physically grabs the node from its location & generates various nodes by using secret information and reflects them on the network. Due to node cloning, various attacks can easily occur in WSN. In this paper, we describe the layer by layer attacks generated by the clone node in WSN. We compare the network scenarios in Network Simulator 2 in which first scenario are normal network & second scenario has the clone nodes which produce the attack inside network. We estimate the impact of clone node in form of packet loss and also compare packet loss rate in normal network and clone node containing network in 8 different scenarios.

scholarly journals Energy efficient multi-hop routing protocol for smart vehicle monitoring using intelligent sensor networks

2021 ◽  
Vol 17 (12) ◽  
pp. 155014772110391
Author(s):  
Yuvaraja Teekaraman ◽  
Hariprasath Manoharan ◽  
Ramya Kuppusamy ◽  
Shabana Urooj ◽  
Fadwa Alrowais
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transfer ◽  
Network Reliability ◽  
Path Loss ◽  
Base Station ◽  
Reporting Rate ◽  
Base Stations ◽  
Wireless Sensor ◽  
Network Simulator

This article focuses on intensifying in-vehicle biological wireless sensor networks for the persistence of monitoring the information on a precise vehicle. The wireless sensor networks will have enormous amount of nodules which are interrelated with each other. Therefore, these wireless sensor networks can be installed on a vehicle not only for monitoring perseverance but also for corroborating security with the support of a Global Positioning System expedient. In addition, the projected work focuses on reliable communiqué which is defined in terms of network reliability with discrepancy in reporting rate at each base station. To validate the efficiency of the proposed scheme, the simulation has been abetted using network simulator (NS2) and the outcomes indicate that when the sensors are installed, a robust system can be obtained with improved data transfer between the base stations. Moreover, a fortified in-vehicular sensor can be fixed in each vehicle with minimized path loss.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

PERFORMANCE EVALUATION ANALYSIS OF WIRELESS SENSOR NETWORKS ROUTING PROTOCOLS IN SMART GRIDS

2016 ◽  
Vol 26 (1) ◽  
pp. 17
Author(s):  
Carlos Deyvinson Reges Bessa
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Smart Grids ◽  
Network Routing ◽  
Base Station ◽  
Wireless Sensor ◽  
Delay Jitter ◽  
La Red

ABSTRACTThis work aims to study which wireless sensor network routing protocol is more suitable for Smart Grids applications, through simulation of AODV protocols, AOMDV, DSDV and HTR in the NS2 simulation environment. Was simulated a network based on a residential area with 47 residences, with one node for each residence and one base station, located about 25m from the other nodes. Many parameters, such as packet loss, throughput, delay, jitter and energy consumption were tested.  The network was increased to 78 and 93 nodes in order to evaluate the behavior of the protocols in larger networks. The tests proved that the HTR is the routing protocol that has the best results in performance and second best in energy consumption. The DSDV had the worst performance according to the tests.Key words.- Smart grid, QoS analysis, Wireless sensor networks, Routing protocols.RESUMENEste trabajo tiene como objetivo estudiar el protocolo de enrutamiento de la red de sensores inalámbricos es más adecuado para aplicaciones de redes inteligentes, a través de la simulación de protocolos AODV, AOMDV, DSDV y HTR en el entorno de simulación NS2. Se simuló una red basada en una zona residencial con 47 residencias, con un nodo para cada residencia y una estación base, situada a unos 25 metros de los otros nodos. Muchos parámetros, tales como la pérdida de paquetes, rendimiento, retardo, jitter y el consumo de energía se probaron. La red se incrementó a 78 y 93 nodos con el fin de evaluar el comportamiento de los protocolos de redes más grandes. Las pruebas demostraron que el HTR es el protocolo de enrutamiento que tiene los mejores resultados en el rendimiento y el segundo mejor en el consumo de energía. El DSDV tuvo el peor desempeño de acuerdo a las pruebas.Palabras clave.- redes inteligentes, análisis de calidad de servicio, redes de sensores inalámbricas, protocolos de enrutamiento.

The Debris Flow Disaster Faster-Than-Early Forecast System (DFS) with Multi-Sensors Integrated Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 975-979
Author(s):  
Rong Zhao ◽  
Cai Hong Li ◽  
Yun Jian Tan ◽  
Jun Shi ◽  
Fu Qiang Mu ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Debris Flow ◽  
Real Time ◽  
Debris Flows ◽  
Base Station ◽  
Base Stations ◽  
Wireless Sensor ◽  
Forecast System ◽  
Debris Flow Disaster

This paper presents a Debris Flow Disaster Faster-than-early Forecast System (DFS) with wireless sensor networks. Debris flows carrying saturated solid materials in water flowing downslope often cause severe damage to the lives and properties in their path. Faster-than-early or faster-than-real-time forecasts are imperative to save lives and reduce damage. This paper presents a novel multi-sensor networks for monitoring debris flows. The main idea is to let these sensors drift with the debris flow, to collect flow information as they move along, and to transmit the collected data to base stations in real time. The Raw data are sent to the cloud processing center from the base station. And the processed data and the video of the debris flow are display on the remote PC. The design of the system address many challenging issues, including cost, deployment efforts, and fast reaction.

scholarly journals Mobile Device Based Dynamic Key Management Protocols for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Chin-Ling Chen ◽  
Chih-Cheng Chen ◽  
De-Kui Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Direct Access ◽  
Session Key ◽  
Dynamic Key Management ◽  
Dynamic Key

In recent years, wireless sensor network (WSN) applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.

Sign in / Sign up

Export Citation Format

Share Document