scholarly journals Secure and Shortest Path Routing Bypassing Attackers in Wireless Sensor Networks

2021 ◽  
Vol 12 (3) ◽  
pp. 4428-4442
Author(s):  
K Pavan Kumar Reddy Et.al
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Shortest Path Routing ◽  
Trust Value ◽  
Network Life Time ◽  
Node Compromise

In wireless sensor networks (WSNs), energy constraint of node is the major issue, as the sensor may be deployed in the area where energy backup or quick replacements may not be available. In such cases, preserving the node energy and prolonging the network life time play crucial role in wireless sensor networks. Similarly, sensor nodes are highly vulnerable to attacks, attackers can easily tamper the sensor node and compromise it. Thus to overcome above stated two problems, the proposed work ensures shortest path routing, which ensures network life time of sensor nodes and the trust based routing, which avoids node compromise attacks. The proposed shortest path routing algorithms takes route through multi-hop nodes to corresponding sink. The shortest path based on the geographical routing strategy chooses the nodes nearest to the routing node and sink node. The novel routing framework proposed in this work considered shortest path with trust based routes. The node's energy is considered to taking reliable node on the routing path, which ensure the packet delivery and avoids any node failure due to less energy. The node's trust value is evaluated with three type, which ensure that the paths created are more reliable

scholarly journals A secure and energy saving protocol for wireless sensor networks

2021 ◽  
Vol 10 (6) ◽  
pp. 3353-3360
Author(s):  
Aso Ahmed Majeed ◽  
Baban Ahmed Mahmood ◽  
Ahmed Chalak Shakir
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Saving ◽  
Key Management ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Battery Life ◽  
Network Life Time ◽  
Time And Energy

The research domain for wireless sensor networks (WSN) has been extensively conducted due to innovative technologies and research directions that have come up addressing the usability of WSN under various schemes. This domain permits dependable tracking of a diversity of environments for both military and civil applications. The key management mechanism is a primary protocol for keeping the privacy and confidentiality of the data transmitted among different sensor nodes in WSNs. Since node's size is small; they are intrinsically limited by inadequate resources such as battery life-time and memory capacity. The proposed secure and energy saving protocol (SESP) for wireless sensor networks) has a significant impact on the overall network life-time and energy dissipation. To encrypt sent messsages, the SESP uses the public-key cryptography’s concept. It depends on sensor nodes' identities (IDs) to prevent the messages repeated; making security goals- authentication, confidentiality, integrity, availability, and freshness to be achieved. Finally, simulation results show that the proposed approach produced better energy consumption and network life-time compared to LEACH protocol; sensors are dead after 900 rounds in the proposed SESP protocol. While, in the low-energy adaptive clustering hierarchy (LEACH) scheme, the sensors are dead after 750 rounds.

scholarly journals Performance Analysis of Q-Leach Algorithm in WSN

2020 ◽  
Vol 5 (10) ◽  
pp. 1-4
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Short Range ◽  
Sensor Node ◽  
Life Time ◽  
Time Span ◽  
Sensor Nodes ◽  
Wireless Sensor

Sensor nodes are exceedingly energy compelled instrument, since it is battery operated instruments. In wsn network, every node is liable to the data transmission through the wireless mode [1]. Wireless sensor networks (WSN) is made of a huge no. of small nodes with confined functionality. The essential theme of the wireless sensor network is energy helpless and the WSN is collection of sensor. Every sensor terminal is liable to sensing, store and information clan and send it forwards into sink. The communication within the node is done via wireless network [3].Energy efficiency is the main concentration of a desining the better routing protocol. LEACH is a protocol. This is appropriate for short range network, since imagine that whole sensor node is capable of communication with inter alia and efficient to access sink node, which is not always correct for a big network. Hence, coverage is a problem which we attempt to resolve [6]. The main focus within wireless sensor networks is to increase the network life-time span as much as possible, so that resources can be utilizes efficiently and optimally. Various approaches which are based on the clustering are very much optimal in functionality. Life-time of the network is always connected with sensor node’s energy implemented at distant regions for stable and defect bearable observation [10].

scholarly journals Improving the Quality of Service and Privacy by Integrating Dijkstra‟s, SafeQ and Extended Watchdog Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 5409-5414
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Shortest Path ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Hop Count

The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.

Energy Efficient Image Compression and Transmission in WSN

2016 ◽  
pp. 67-78
Author(s):  
Wajeeha Aslam ◽  
Muazzam A. Khan ◽  
M. Usman Akram ◽  
Nazar Abbas Saqib ◽  
Seungmin Rho
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Image Compression ◽  
Sensor Network ◽  
Image Data ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Battery Life

Wireless sensor networks are greatly habituated in widespread applications but still yet step behind human intelligence and vision. The main reason is constraints of processing, energy consumptions and communication of image data over the sensor nodes. Wireless sensor network is a cooperative network of nodes called motes. Image compression and transmission over a wide ranged sensor network is an emerging challenge with respect to battery, life time constraints. It reduces communication latency and makes sensor network efficient with respect to energy consumption. In this paper we will have an analysis and comparative look on different image compression techniques in order to reduce computational load, memory requirements and enhance coding speed and image quality. Along with compression, different transmission methods will be discussed and analyzed with respect to energy consumption for better performance in wireless sensor networks.

scholarly journals Enhancing Clustering in Wireless Sensor Networks with Energy Heterogeneity

2013 ◽  
pp. 259-273
Author(s):  
Femi A. Aderohunmu ◽  
Jeremiah D. Deng ◽  
Martin Purvis
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Research Question ◽  
Energy Levels ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Complex Functions

While wireless sensor networks (WSN) are increasingly equipped to handle more complex functions, in-network processing still requires the battery-powered sensors to judiciously use their constrained energy so as to prolong the elective network life time. There are a few protocols using sensor clusters to coordinate the energy consumption in a WSN, but how to deal with energy heterogeneity remains a research question. The authors propose a modified clustering algorithm with a three-tier energy setting, where energy consumption among sensor nodes is adaptive to their energy levels. A theoretical analysis shows that the proposed modifications result in an extended network stability period. Simulation has been conducted to evaluate the new clustering algorithm against some existing algorithms under different energy heterogeneity settings, and favourable results are obtained especially when the energy levels are significantly imbalanced.

Sign in / Sign up

Export Citation Format

Share Document