Geographic Dijkstra-Based Multicast Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 17 (1-2) ◽  
pp. 33-46
Author(s):  
Bartosz Musznicki ◽  
Mikołaj Tomczak ◽  
Piotr Zwierzykowski
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Multicast Routing ◽  
Shortest Paths ◽  
Careful Consideration ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Bandwidth Utilization ◽  
Radio Communication

Abstract. Limited resources in Wireless Sensor Networks (WSNs) are the key concern that needs to be given a careful consideration when studying virtually any aspect of a sensor network. Therefore, energy demands and radio bandwidth utilization should be addressed, especially in one-to-many communication. It is evident that a need for centralized networkwide topology knowledge can jeopardize scarce energy resources of a sensor network. Thus, localized geographic multicast relies solely on locally available information about the position of current node, other nodes within the radio range and the location of destination group members. Greedy multicast routing procedures often transport messages along paths that may be far from being optimal. Therefore, Dijkstrabased Localized Energy-Efficient Multicast Algorithm (DLEMA) is presented, described with pseudocode, and discussed. DLEMA focuses on discovering energy shortest paths leading through nodes that provide the maximum geographical advance towards desired destinations. Local routes are followed owing to the use of a source routing technique. Additionally, the algorithm takes advantage of the broadcast nature of omnidirectional radio communication and utilizes perimeter routing to find a solution for local optimum situations. The analysis of the simulation results confirms interesting characteristics of the proposed algorithm

scholarly journals Intelligent energy optimization for advanced IoT analytics edge computing on wireless sensor networks

2020 ◽  
Vol 16 (7) ◽  
pp. 155014772090877
Author(s):  
Israel Edem Agbehadji ◽  
Samuel Ofori Frimpong ◽  
Richard C Millham ◽  
Simon James Fong ◽  
Jason J Jung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Energy Optimization ◽  
Base Station ◽  
Wireless Sensor ◽  
Optimal Time ◽  
Local Optimum

The current dispensation of big data analytics requires innovative ways of data capturing and transmission. One of the innovative approaches is the use of a sensor device. However, the challenge with a sensor network is how to balance the energy load of wireless sensor networks, which can be achieved by selecting sensor nodes with an adequate amount of energy from a cluster. The clustering technique is one of the approaches to solve this challenge because it optimizes energy in order to increase the lifetime of the sensor network. In this article, a novel bio-inspired clustering algorithm was proposed for a heterogeneous energy environment. The proposed algorithm (referred to as DEEC-KSA) was integrated with a distributed energy-efficient clustering algorithm to ensure efficient energy optimization and was evaluated through simulation and compared with benchmarked clustering algorithms. During the simulation, the dynamic nature of the proposed DEEC-KSA was observed using different parameters, which were expressed in percentages as 0.1%, 4.5%, 11.3%, and 34% while the percentage of the parameter for comparative algorithms was 10%. The simulation result showed that the performance of DEEC-KSA is efficient among the comparative clustering algorithms for energy optimization in terms of stability period, network lifetime, and network throughput. In addition, the proposed DEEC-KSA has the optimal time (in seconds) to send a higher number of packets to the base station successfully. The advantage of the proposed bio-inspired technique is that it utilizes random encircling and half-life period to quickly adapt to different rounds of iteration and jumps out of any local optimum that might not lead to an ideal cluster formation and better network performance.

scholarly journals Performance metrics in wireless sensor networks :a survey and outlook

2018 ◽  
Vol 7 (2.26) ◽  
pp. 25
Author(s):  
E Ramya ◽  
R Gobinath
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Performance Metrics ◽  
Resource Constraints ◽  
Sensor Data ◽  
Wireless Sensor

Data mining plays an important role in analysis of data in modern sensor networks. A sensor network is greatly constrained by the various challenges facing a modern Wireless Sensor Network. This survey paper focuses on basic idea about the algorithms and measurements taken by the Researchers in the area of Wireless Sensor Network with Health Care. This survey also catego-ries various constraints in Wireless Body Area Sensor Networks data and finds the best suitable techniques for analysing the Sensor Data. Due to resource constraints and dynamic topology, the quality of service is facing a challenging issue in Wireless Sensor Networks. In this paper, we review the quality of service parameters with respect to protocols, algorithms and Simulations. 

scholarly journals Searching Algorithm of Dormant Node in Wireless Sensor Networks

2017 ◽  
Vol 13 (05) ◽  
pp. 122 ◽  
Author(s):  
Bo Feng ◽  
Wei Tang ◽  
Guofa Guo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Network ◽  
Delaunay Triangulation ◽  
Base Station ◽  
Wireless Sensor ◽  
Effective Mechanism ◽  
Dormant State ◽  
Important Nodes

In wireless sensor networks, the nodes around the base station have higher energy consumption due to the forwarding task of all the detected data. In order to balance the energy consumption of the nodes around the base station, a reasonable and effective mechanism of node rotation dormancy is put forward. In this way, a large number of redundant nodes in the network are in a dormant state, so as to reduce the load of important nodes around the base station. The problems of the redundant nodes in the sensor network are analyzed, and a new method is proposed to distinguish the redundant nodes based on local Delaunay triangulation and multi node election dormancy mechanism. The experimental results showed that this method could effectively distinguish the redundant nodes in the network; at the same time, through the multi round election mechanism, parts of redundant nodes are made dormant. In summary, they can reduce the network energy consumption on the condition of guaranteeing the original coverage.

scholarly journals An Energy Aware Multipath Routing Algorithm for Wireless Sensor Networks

2017 ◽  
Vol 13 (04) ◽  
pp. 45 ◽  
Author(s):  
Liping LV
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Path Selection ◽  
Low Energy ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Transmission Path

<p class="0abstract"><span lang="EN-US">Wireless sensor network is a new field of computer science and technology research. It has a very broad application prospects. In order to improve the network survival time, it is very important to design efficient energy-constrained routing protocols. In this paper, we studied the characteristics of wireless sensor networks, and analyzed the design criteria of sensor network routing algorithms. In view of the shortcomings of traditional algorithms, we proposed an energy-aware multi-path algorithm. When selecting a data transmission path, the energy-aware multi-path algorithm can avoid nodes with low energy levels. At the same time, it takes the remaining energy of the node and the number of hops as one of the measures of the path selection. The multi-path routing algorithm realized the low energy consumption of the data transmission path, thus effectively prolonging the network lifetime. Compared with the traditional algorithm, the results show that our method has high reliability and energy efficiency.</span></p>

scholarly journals Time Synchronization and Communication Program of Wireless Sensor Network for Online Monitoring of Electrical Equipment

2017 ◽  
Vol 13 (07) ◽  
pp. 36
Author(s):  
Yuxia Shen
Keyword(s):  
Operating System ◽  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Online Monitoring ◽  
Time Synchronization ◽  
Electrical Equipment ◽  
Wireless Sensor ◽  
Zigbee Protocol

<p><span style="font-size: medium;"><span style="font-family: 宋体;">In wireless sensor networks, for improving the time synchronization perfromance of online monitoring and application of ZigBee protocol, a scheme is designed. For this objective, first of all, the ZigBee protocol specification is summarized, a profound analysis of the hardware abstraction architecture of TinyOS operating system is made; the advantages of the ZigBee protocol compared with the traditional radio technology are comparatively analyzed. At the same time, the node design block diagram based on CC2430 and related development system is provided. In the TinyOS2.x operating system, we analyze CC2430 application program abstract architecture, and on this basis, give the realization process of program design. The research results showed that we achieve an on-line monitoring system based on ZigBee protocol, which has realistic significance of applying ZigBee protocol in wireless sensor network of electrical equipment online monitoring. Based on the above research, it is concluded that the online monitoring system can collect the temperature parameters of the monitored object in real time that it can be widely applied in wireless sensor networks.</span></span></p>

scholarly journals Robust and Accurate Trust Establishment Scheme for Wireless Sensor Network

2020 ◽  
Vol 12 (6) ◽  
pp. 14-29
Author(s):  
Audrey NANGUE ◽  
◽  
Elie FUTE TAGNE ◽  
Emmanuel TONYE
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Trust Management ◽  
Wireless Sensor ◽  
Management Systems ◽  
Trust Value ◽  
Direct Trust ◽  
Indirect Trust

The success of the mission assigned to a Wireless Sensor Network (WSN) depends heavily on the cooperation between the nodes of this network. Indeed, given the vulnerability of wireless sensor networks to attack, some entities may engage in malicious behavior aimed at undermining the proper functioning of the network. As a result, the selection of reliable nodes for task execution becomes a necessity for the network. To improve the cooperation and security of wireless sensor networks, the use of Trust Management Systems (TMS) is increasingly recommended due to their low resource consumption. The various existing trust management systems differ in their methods of estimating trust value. The existing ones are very rigid and not very accurate. In this paper, we propose a robust and accurate method (RATES) to compute direct and indirect trust between the network nodes. In RATES model, to compute the direct trust, we improve the Bayesian formula by applying the chaining of trust values, a local reward, a local penalty and a flexible global penalty based on the variation of successful interactions, failures and misbehaviors frequency. RATES thus manages to obtain a direct trust value that is accurate and representative of the node behavior in the network. In addition, we introduce the establishment of a simple confidence interval to filter out biased recommendations sent by malicious nodes to disrupt the estimation of a node's indirect trust. Mathematical theoretical analysis and evaluation of the simulation results show the best performance of our approach for detecting on-off attacks, bad-mouthing attacks and persistent attacks compared to the other existing approaches.

Sign in / Sign up

Export Citation Format

Share Document