scholarly journals Edge Computing through Virtual Force for Detecting Trustworthy Values

2020 ◽  
Vol 2 (2) ◽  
pp. 84-91
Author(s):  
Dr. Dhaya R. ◽  
Dr. Kanthavel R.
Keyword(s):  
Sensor Networks ◽  
Edge Computing ◽  
Sensor Nodes ◽  
Trust Value ◽  
Computing Paradigm ◽  
Virtual Force ◽  
Resource Requirements ◽  
Noticeable Improvement ◽  
Different Dimensions ◽  
Best Fit

As the advancement of IoT (Internet of Things) and other emerging mobile application continues, it is an accepted fact that Edge Computing paradigm is considered to be the best fit in terms of fulfilling the resource requirements. Moreover, it is a fact that the data collected by the sensor networks serves as the base for the IoT applications as well as the systems. However, due to advancement in cybercrimes, there is a possibility that the data collected through the sensor networks are vulnerable to attacks which may result in serious consequences. The proposed work focuses on a new model which is used to gather trustworthy data using edge computing in IoT. In order to get the accurately quantified trust values, the sensor nodes are analyzed and found from different dimensions. Moreover, with the help of trust value obtained, it is possible to find the best mobility path which carries the highest value of trust. This data is gathered from the sensors with the help of mobile edge data collector. This analysis shows that for a trustworthy data collection model of IoT, there is noticeable improvement in terms of energy conservation and system security, thereby improving the performance of the system.

scholarly journals Efficient Interference Estimation with Accuracy Control for Data-Driven Resource Allocation in Cloud-RAN

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 3000 ◽  
Author(s):  
Yanchao Zhao ◽  
Jie Wu ◽  
Wenzhong Li ◽  
Sanglu Lu
Keyword(s):  
Resource Allocation ◽  
Network Architecture ◽  
Measurement Data ◽  
Network Size ◽  
Base Station ◽  
Edge Computing ◽  
Sensor Nodes ◽  
Data Driven ◽  
Accuracy Control ◽  
Computing Paradigm

The emerging edge computing paradigm has given rise to a new promising mobile network architecture, which can address a number of challenges that the operators are facing while trying to support growing end user’s needs by shifting the computation from the base station to the edge cloud computing facilities. With such powerfully computational power, traditional unpractical resource allocation algorithms could be feasible. However, even with near optimal algorithms, the allocation result could still be far from optimal due to the inaccurate modeling of interference among sensor nodes. Such a dilemma calls for a measurement data-driven resource allocation to improve the total capacity. Meanwhile, the measurement process of inter-nodes’ interference could be tedious, time-consuming and have low accuracy, which further compromise the benefits brought by the edge computing paradigm. To this end, we propose a measurement-based estimation solution to obtain the interference efficiently and intelligently by dynamically controlling the measurement and estimation through an accuracy-driven model. Basically, the measurement cost is reduced through the link similarity model and the channel derivation model. Compared to the exhausting measurement method, it can significantly reduce the time cost to the linear order of the network size with guaranteed accuracy through measurement scheduling and the accuracy control process, which could also balance the tradeoff between accuracy and measurement overhead. Extensive experiments based on real data traces are conducted to show the efficiency of the proposed solutions.

scholarly journals On virtual-force algorithms for coverage-optimal node deployment in mobile sensor networks via the two-dimensional Yukawa crystal

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771986488
Author(s):  
Rongxin Tang ◽  
Xin Qian ◽  
Xiangyu Yu
Keyword(s):  
Sensor Networks ◽  
Crystalline Structure ◽  
Pair Correlation ◽  
Minimum Energy ◽  
Mobile Sensor Networks ◽  
Fixed Number ◽  
Sensor Nodes ◽  
Mobile Sensor ◽  
Node Deployment ◽  
Virtual Force

As theoretical proof has shown that a hexagonal topology can obtain maximal coverage with a fixed number of sensor nodes, node deployment for mobile sensor networks has the objective of forming a hexagonal network topology while consuming minimum energy. Using virtual-force algorithms to move initially randomly distributed nodes into a target topology is one of the widely studied methods for achieving this goal. In this work, a novel virtual-force algorithm based on physical laws in a dusty plasma system (i.e. VFA-DP) was applied within a mobile sensor network deployment scenario. The VFA-DP force has a central attracting force which can provide a screening effect via exponential decay. Here, to evaluate how perfect the final grids become from virtual-force algorithms, we introduce a performance metric based on the pair correlation function in a crystalline structure. Via simulation studies, we determined that the topology resulting from the VFA-DP is much closer to a hexagon. The analysis also indicated that the VFA-DP converges faster than another virtual-force algorithm based on the Lennard-Jones potential (VFA-LJ), resulting in lower communication-related energy costs in real deployment scenarios. The method developed in this article is derived from studies of crystalline structure from condensed matter physics and shows clear evidence of when the regular lattice is ready. It will provide some guidance for engineering by aiding deployment in complex geometric areas or those recovering from disaster.

Node Deployment Using Virtual Force with Particle Swarm Optimization in WSN

2018 ◽  
Vol 24 (8) ◽  
pp. 6017-6019 ◽  
Author(s):  
K. S Umadevi ◽  
Virti Shah ◽  
Unnati Desai
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Particle Swarm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Swarm Optimization ◽  
Node Deployment ◽  
Virtual Force

Sensor nodes are always considered in wireless sensor networks. So deployments of these sensor nodes are considerable, but proper deployment can decrease the complication of problems in wireless sensor networks. During such communication, data routing must be done efficiently in order to reduce the complexity. In addition, it minimizes energy consumption and thus extends the lifetime of Network. An attempt is made using Virtual Force and Particle Swarm Optimization for effective node deployment. First step, Virtual Force Algorithm is used for placement of nodes. Secondly, the result is provided to Particle Swarm Optimization to optimize the best fit between the neighbor nodes. The result depicts the proper deployment of nodes done in wireless sensor networks and improves the efficiency by minimal energy consumption.

Node Placement Strategy in Wireless Sensor Network

2013 ◽  
Vol 5 (2) ◽  
pp. 18-31 ◽  
Author(s):  
Puteri Azwa Ahmad ◽  
M. Mahmuddin ◽  
Mohd Hasbullah Omar
Keyword(s):  
Sensor Networks ◽  
Region Of Interest ◽  
Target Position ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Node Placement ◽  
Random Deployment ◽  
Virtual Force ◽  
Coverage And Connectivity

The performance and quality of services in wireless sensor networks (WSNs) depend on coverage and connectivity. Node placement is a fundamental issue closely related to the coverage and connectivity in sensor networks. Node placement influences the target position, coverage area, and connectivity in sensor networks. In random deployment, sensor nodes are deployed randomly in a non-invasive way. The deployment process may cause issues like coverage holes, overlapping, and connectivity failure. Enhancing coverage and connectivity are important for sensor networks to provide a reliable communication within sensing. Placing many sensor nodes in a WSN application region area is not the best solution due to cost and it results in multiple sensors used. Mobile sensor node is used as an alternative to overcome the random deployment problem. The virtual force based self node deployment is used in the mobility sensor to improve the coverage and connectivity area. Virtual Force Algorithm (VFA) approach using virtual repulsive and attractive forces is used to find the optimal node placement to minimize the problems. Simulation results proofed that a uniform deployment achieved using VFA approach with an optimal sensing range to cover the region of interest.

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 An Enhanced Virtual Force Algorithm for Diverse k-Coverage Deployment of 3D Underwater Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (16) ◽  
pp. 3496 ◽  
Author(s):  
Wenming Wang ◽  
Haiping Huang ◽  
Fan He ◽  
Fu Xiao ◽  
Xin Jiang ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Sensor Networks ◽  
Underwater Wireless Sensor Networks ◽  
Typical Application ◽  
Equivalent Radius ◽  
Virtual Force ◽  
Special Cases

The combination of Wireless Sensor Networks (WSNs) and edge computing not only enhances their capabilities, but also motivates a series of new applications. As a typical application, 3D Underwater Wireless Sensor Networks (UWSNs) have become a hot research issue. However, the coverage of underwater sensor networks problem must be solved, for it has a great significance for the network’s capacity for information acquisition and environment perception, as well as its survivability. In this paper, we firstly study the minimal number of sensor nodes needed to build a diverse k-coverage sensor network. We then propose a k-Equivalent Radius enhanced Virtual Force Algorithm (called k-ERVFA) to achieve an uneven regional coverage optimization for different k-coverage requirements. Theoretical analysis and simulation experiments are carried out to demonstrate the effectiveness of our proposed algorithm. The detailed performance comparisons show that k-ERVFA acquires a better coverage rate in high k-coverage sub-regions, thus achieving a desirable diverse k-coverage deployment. Finally, we perform sensitivity analysis of the simulation parameters and extend k-ERVFA to special cases such as sensor-sparse regions and time-variant situations.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Deterministic Deployment for Wireless Image Sensor Nodes

2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Visual Information ◽  
Image Sensor ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Effective Coverage ◽  
Area Of Interest ◽  
Key Issues

Wireless sensor networks composed of camera enabled source nodes can provide visual information of an area of interest, potentially enriching monitoring applications. The node deployment is one of the key issues in the application of wireless sensor networks. In this paper, we take the effective coverage and connectivity as the evaluation indices to analyze the effect of the perceivable angle and the ratio of communication radius and sensing radius for the deterministic circular deployment. Experimental results demonstrate that the effective coverage area of the triangle deployment is the largest when using the same number of nodes. When the nodes are deployed in the same monitoring area in the premise of ensuring connectivity, rhombus deployment is optimal when √2 < rc / rs < √3 . The research results of this paper provide an important reference for the deployment of the image sensor networks with the given parameters.

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Sign in / Sign up

Export Citation Format

Share Document