Node deployment in wireless sensor networks using the new multi‐objective Levy flight bee algorithm
14
Citation
26
Reference
10
Related Paper
Citation Trend
Abstract:
Wireless sensor networks (WSNs) play a prominent role in the world of computer networks. WSNs rely on deployment as a basic requirement and an effective factor on the basic network services. In deployment, creating a balance between conflicting optimisation factors, e.g. connectivity and coverage, is a challenging and sophisticated issue, so that deployment turns into an NP-complete problem. The majority of existing researches has attempted to tackle this problem by applying classic single-objective metaheuristic algorithms in 2D small-scale uniform environments. In this study, a new hybrid multi-objective optimisation algorithm, which is constructed by the combination of multi-objective bee algorithms and Levy flight (LF) random walk is proposed to deal with the deployment problem in WSNs. For this purpose, two of the most important criteria, connectivity and coverage, have been considered as objectives. A series of experiments are carried out in large-scale non-uniform 3D environments, despite the fact that most of the present methods are applicable in small-scale uniform 2D environments. This study completely takes into account the stochastic behaviour of swarms, something that other papers do not consider. The evaluation results show that the multi-objective LF bee algorithm, in most cases, surpasses NSGAII, IBEA and SPEA2 algorithms.One fundamental issue in wireless sensor networks(WSNs)is sensor deployment,which affects the performance and effectiveness of WSNs.Deployment problem in WSNs includes coverage,connectivity and energy efficiency.These issues of deployment are discussed in detail.The taxonomy and comparison are presented.Some recent novel theories and algorithms for deployment problem in WSNs are reviewed.The evaluation standards of performances on coverage and connectivity are proposed and analyzed.
Cite
Citations (3)
This paper considers a sensor deployment problem of a hierarchical cluster-based Wireless Sensor Network (WSN), which consists of sensor clusters scattered over a sensing region. We formulated the sensor deployment as a network optimization problem called the OSCDP (Optimum Sensor Cluster Deployment Problem). Given a fixed quantity of total energy power of sensors for deployment and a static routing scheme, the OSCDP aims to determine the amount of energy deployed in each cluster, such that the network lifetime expectation will be maximized. We propose an exact algorithm to provide the optimum solution to the OSCDP. The simulation results show that this solution performed better in prolonging the network lifetime of a WSN, compared to other conventional deployment schemes.
Cite
Citations (5)
Sensor web
Visual sensor network
Cite
Citations (0)
A Wireless Sensor Network (WSN) is a group of a densely distributed sensor nodes that monitors physical environmental information and send data to one or many base stations (BS) through wireless links.Node deployment is a fundamental issue which is to be solved in Wireless Sensor Networks (WSNs).Node deployment can be random or deterministic in nature.A proper node deployment scheme not only reduces the network cost but also increases degree, coverage and lifetime of a WSN with the reduction in delay.In this paper an overview of existing node deployment schemes are discussed then different parameters that enhance the efficiency are also highlighted.On the basis of that a new deployment scheme is proposed in which sensing area is divided into small circles and nodes are placed at the center and at the ends of the diameter.This pattern has two-coverage and has a degree of four.Simulation results show that proposed pattern uses fewer nodes and provides better coverage and degree than other schemes such as triangle, square and hexagon.In addition to this it is an efficient energy saver which provides minimum delay as compared to other schemes.
Cite
Citations (9)
Deployment is a fundamental issue in wireless sensor networks. Usually the sensor locations are precomputed based on a "perfect" sensor coverage model, whereas sensors may not always provide reliable information, either due to operational tolerance levels or environmental factors. Therefore, it is imperative to have practical considerations at the design stage to anticipate this sensing behavior. In this paper, we address four different forms of static wireless sensor networks deployment while considering an evidence-based sensor coverage model. The four problems are formalized as combinatorial optimization problems, which are NP-complete. We propose, E2BDA (Efficient Evidence-Based sensor Deployment Algorithm), a polynomial-time uncertainty-aware deployment algorithm based on a dynamic programming approach. E2BDA is able to determine the minimum number of sensors and their locations to achieve both coverage and connectivity. We compare our proposal to the state-of-the-art deployment strategies, the obtained results show that E2BDA obtains the best performances.
Cite
Citations (17)
Shared resource
Distributed Computing Environment
Cite
Citations (2)
In wireless sensor network (WSN) applications, information of detection location for sensing changes in the environment is very important. Sequence-based Localization (SBL) is a well-known localization mechanism for WSN that can be deployed quickly and utilized right after deployment. In our previous study, we have already designed and developed a deployment strategy for the sensor nodes that can effectively reduce location error in SBL. In this paper we further consider the condition when the target is used to moving in specific paths in the sensing environment. We can then deploy sensor nodes to optimize the location error along the paths.
Sequence (biology)
Sensor node
Cite
Citations (6)
Cite
Citations (69)
Deployment of the sensor nodes is a major aspect in the designing of wireless sensor networks. The coverage, connectivity and lifetime o0f a wireless sensor network is directly affected by the quality of the deployment. In this paper, an optimal sensor deployment algorithm (OSDA) has been presented to cover all the targets with the minimum number of sensors. Starting with a randomly chosen location for the first sensor, the locations for deploying the subsequent sensors are chosen on the basis of the number of targets expected to be covered by deploying the sensor at the selected location. The ability of OSDA to minimize the number of sensors required for covering all the targets has been evaluated under various scenarios and compared with that of random deployment.
Cite
Citations (0)
Sensor node
Sensor web
Sink (geography)
Visual sensor network
Cite
Citations (2)