scholarly journals Diversity Teams in Soccer League Competition Algorithm for Wireless Sensor Network Deployment Problem

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 445 ◽  
Author(s):  
Yu Qiao ◽  
Thi-Kien Dao ◽  
Jeng-Shyang Pan ◽  
Shu-Chuan Chu ◽  
Trong-The Nguyen
Keyword(s):  
Global Optimization ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Team Member ◽  
Trading Strategy ◽  
Experimental Results ◽  
The Other ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Applied Optimization

The drawback of several metaheuristic algorithms is the dropped local optimal trap in the solution to complicated problems. The diversity team is one of the promising ways to enhance the exploration of searching solutions in algorithm to avoid the local optimum trap. This paper proposes a diversity-team soccer league competition algorithm (DSLC) based on updating team member strategies for global optimization and its applied optimization of Wireless sensor network (WSN) deployment. The updating team consists of trading, drafting, and combining strategies. The trading strategy considers player transactions between groups after the ending season. The drafting strategy takes advantage of draft principles in real leagues to bring new players to the association. The combining strategy is a hybrid policy of trading and drafting one. Twenty-one benchmark functions of CEC2017 are used to test the performance of the proposed algorithm. The experimental results of the proposed algorithm compared with the other algorithms in the literature show that the proposed algorithm outperforms the competitors in terms of having an excellent ability to achieve global optimization. Moreover, the proposed DSLC algorithm is applied to solve the problem of WSN deployment and achieved excellent results.

The Algorithmic Aspects of Creating and Using Wireless Sensor Network Key Spaces Based on Combinatorial Block Diagrams

Vestnik MEI ◽  
2021 ◽  
Vol 2 (2) ◽  
pp. 108-118
Author(s):  
Aleksandr B. Frolov ◽  
◽  
Natalya P. Kochetova ◽  
Anton O. Klyagin ◽  
Dmitriy Yu. Temnikov ◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Block Diagram ◽  
The Other ◽  
Wireless Sensor ◽  
Algorithmic Approach ◽  
Network Nodes ◽  
Rule Sets ◽  
Independent Calculation ◽  
Do So

Algorithmic approach principles relating to development and use of wireless sensor network (WSS) key spaces are formulated based on an analysis of the keys management peculiarities. The formulated principles, which meet certain requirements for the WSS key spaces, have been elaborated proceeding from the assumption that their structure corresponds to one of the varieties of combinatorial block diagrams: cyclic or acyclic projective plane, linear or quadratic transversal block diagrams. Owing to the WSS having a distributed configuration, it becomes possible to avoid the need to construct a combinatorial block diagram in full scope, and the required blocks are computed, whenever necessary, in scaling the network (in adding new nodes) or when determining, in a decentralized manner, the switching parameters of specific nodes. To do so, it is necessary to have algorithms for computing the blocks of the combinatorial block diagram (as the sets of key numbers allocated to a given node) and dual blocks (as the sets of the numbers of nodes to which keys are assigned with the numbers coinciding with the numbers of dual blocks), as well as algorithms for solving derived problems: computing of the key numbers common to two nodes and the number of the node that has a common key with one of two nodes and, possibly, another key with the other one. These problems are solved by using the numbering of elements, blocks and dual blocks in accordance with the proposed duality rule: sets of elements and dual blocks are in one-to-one correspondence by numbering; the dual block with a specified number contains the numbers of blocks containing elements with this number. Distributed (independent) calculation of blocks is carried out on the basis of algebraic identifiers computed by block numbers. In addition to the possible absence of a physical connection between the nodes, the inadmissibility of using separate (compromised) keys is taken into account, and the incomplete furnishing of the network nodes with keys, as well as the incompleteness of the system implementation as a whole. Algorithms for computing the switching parameters of two nodes in designing the WSS and an algorithm for computer modeling of the calculation of such parameters during the WSS operation subject to the specified constraints and in using any of the above types of combinatorial block diagrams are presented.

scholarly journals Lifetime Optimization of a Multiple Sink Wireless Sensor Network through Energy Balancing

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Tapan Kumar Jain ◽  
Davinder Singh Saini ◽  
Sunil Vidya Bhooshan
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Maximum Energy ◽  
The Other ◽  
Wireless Sensor ◽  
Energy Balancing ◽  
Multiple Sink ◽  
Lifetime Optimization

The wireless sensor network consists of small limited energy sensors which are connected to one or more sinks. The maximum energy consumption takes place in communicating the data from the nodes to the sink. Multiple sink WSN has an edge over the single sink WSN where very less energy is utilized in sending the data to the sink, as the number of hops is reduced. If the energy consumed by a node is balanced between the other nodes, the lifetime of the network is considerably increased. The network lifetime optimization is achieved by restructuring the network by modifying the neighbor nodes of a sink. Only those nodes are connected to a sink which makes the total energy of the sink less than the threshold. This energy balancing through network restructuring optimizes the network lifetime. This paper depicts this fact through simulations done in MATLAB.

Wireless Sensor Network Routing Optimization Based on Improved Shuffled Frog Leaping Algorithm

2014 ◽  
Vol 681 ◽  
pp. 253-257
Author(s):  
Yong Chun Ma ◽  
Hua Gang Shao
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Routing ◽  
Route Optimization ◽  
Path Optimization ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Optimization Strategy ◽  
Shuffled Frog Leaping Algorithm ◽  
Shuffled Frog Leaping

Against path optimization problem for wireless sensor network, this paper proposes a path optimization strategy for wireless sensor network based on improved shuffled frog leaping algorithm. The shuffled frog leaping algorithm was used as wireless sensor network path optimization main frame, gauss mutation and opposition-based learning were used to overcome the defects of easily trapping into local optimum and low accuracy computation. Simulation results show that the route optimization mechanism can effectively prolongs the network lifetime,reduces energy consumption, and improves the overall network performance.

WSN Localization Algorithm Based on Fast SVM

2013 ◽  
Vol 433-435 ◽  
pp. 750-753 ◽  
Author(s):  
Fang Zhu ◽  
Jun Fang Wei
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Experimental Results ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Svm Algorithm

Localization of sensor nodes is essential for wireless sensor network when it is applied to the special applications.This paper proposed a rang-free localization algorithm based on SVM. In this algorithm, multi-class SVMs are applied. So to improve the performance, a fast SVM algorithm is proposed in this paper.Finally, the experimental results demonstrate the algorithm proposed has small localization error, and it is robust and stable.

The Method to Diminish Data Delivered by Sensor in Wireless Sensor Network

2011 ◽  
Vol 403-408 ◽  
pp. 2791-2794
Author(s):  
Xiang Li Liu ◽  
Zan Li ◽  
Jiang Bo Si ◽  
Ben Jian Hao
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Efficient Algorithm ◽  
Energy Efficient ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Data Delivery ◽  
Affine Transform ◽  
Energy Constraints

Severe energy constraints and limited computing abilities of the nodes in a network present a major challenge in the design and deployment of a wireless sensor network. This thesis aims to present energy efficient algorithm for data delivery in a sensor network. The methodology of data delivery presented in this thesis is based on affine transform and performs coordination compression. Experimental results show that the algorithm can reduce about half of the data amount delivered by the sensor.

Visual Sensor Network Technology and Its Applications

2011 ◽  
pp. 1-19
Author(s):  
Li-minn Ang ◽  
Kah Phooi Seng
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Visual Information ◽  
Image Sensors ◽  
The Other ◽  
Wireless Sensor ◽  
Network Technology ◽  
Visual Sensor ◽  
Visual Sensor Network ◽  
The One

The combination of image sensors with wireless sensor network (WSN) technology has resulted in a new network technology called a visual sensor network (VSN). On the one hand, VSNs can be seen as an extension of traditional WSNs where image sensors have replaced scalar sensors. On the other hand, the use of image sensors in VSNs brings with it a different set of practical and research challenges. This is because image sensors generate a very high amount of data that would have to be processed and transmitted within the network. In this chapter, we present an introduction to VSN technology and provide an overview of research issues and trends. Issues related to energy efficient processing, collaborative processing, and hardware technology will be highlighted. This chapter will also give a brief introduction to the other chapters in the book with a focus on showing how the topics covered in each chapter relate to the overall picture of visual information processing in wireless sensor network environments.

scholarly journals Vehicle-2-Vehicle Communication Based on Wireless Sensor Network

2017 ◽  
Vol 6 (4) ◽  
pp. 364-366
Author(s):  
S. Sinthuja ◽  
S. V. Saravanan
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Ieee 802.15.4 ◽  
Significant Degree ◽  
The Other ◽  
Wireless Sensor ◽  
Single Element ◽  
Trade Data ◽  
Vehicle Communication ◽  
Vehicle To Vehicle

Truck Platooning is a car innovation that permits gathering various trucks into a single element where one truck intently takes after the other that outcomes in an expanded street limit. This kind of detachment allows to a significant degree tight separations and synchronous driving between the vehicles.  Our point is to plan and exhibit a self-ruling truck platooning framework given vehicle-to-vehicle (V2V) correspondence innovation. The structure utilises IEEE 802.15.4 remote convention joined with separation going sensors to enable vehicles inside the company to safely trade data progressively and naturally break and quicken in light of the lead truck. The rapid of remote correspondence permits to a significant degree tight separations and synchronous driving between the platooning vehicles.

scholarly journals HIWAEO: Hybrid Improved Whale Artificial Ecosystem Optimization Algorithm based Energy-Efficient Routing Protocol for Wireless Sensor Network

2021 ◽  
Author(s):  
R. Renuga Devi ◽  
T. Sethukarasi
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Network ◽  
Life Span ◽  
Sensor Network ◽  
Energy Efficient ◽  
Fitness Function ◽  
Residual Energy ◽  
The Other ◽  
Sensor Nodes ◽  
Wireless Sensor

Abstract Wireless Sensor Network (WSN) is a resource constraint network that utilizes more energy for transmitting and receiving the data. Hence energy efficiency is the vital issue faced by the WSN. Besides the packet routing process consumes more energy than the other processes. Moreover, the working of WSN is based on the battery life span of sensor nodes. Thus the constrained energy source affects the life span of the network battery. To tackle this issue, we proposed a novel method known as the Hybrid Improved Whale optimization-based Artificial Ecosystem optimization method (HIWAEO). This enhances the energy efficiency of the WSN and thereby improves the routing of the network. The energy-efficient WSN can be obtained by selecting optimal cluster head (CH) and forward nodes. To select the optimal CH the proposed method estimates the fitness function which includes node degree, space between the sensor nodes and space between the CH and base station (BS), residual energy, and node centrality. This estimated fitness function arranges the sensor nodes based on their increased energy and distance from the BS and the best node is chosen as the CH. Henceforth to obtain the routing efficiency the forward nodes are selected based on their residual energy and distance. The performance of the proposed method is analyzed with the other existing approaches for three conditions of BS alignment and concluded that our proposed method outperforms all the other approaches.

Sign in / Sign up

Export Citation Format

Share Document