Radar placement along banks of river

Zhang, Zhao; Du, Ding‐Zhu

doi:10.1007/s10898-011-9704-3

Cited by 7 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, for the continuous case, where the cost of each sensor is given by a function ( ) = , the polynomialtime algorithm presented by them is an approximated one. Reference [18] presents an ( 9 ) dynamic programming algorithm for the radar placement and power assignment problem, where is the number of crucial points to be monitored. However, the proposed method often suffers from the curse of dimensionality just the same as classic dynamic programming does.…”

Section: Solving Methodsmentioning

confidence: 99%

A Novel Separable Model and Decomposition Method for Sensor Locational Decision Problem

Yang

Li²

2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

This paper proposes a new separable model for the sensor locational decision problem covering a line (SLDPCL). By decomposing a multivariate function into several univariate functions, a separable outer approximation methodology that can be used to improve the outer approximation of classical convex programming technique is presented. A novel outer approximation method (OAM) for this proposed separable model is proposed. The algorithm alternates between solving a mixed integer linear program and a convex nonlinear program (NLP). An improved interior point method based on optimal centering parameter is employed to solve the NLP subproblem. The simulation results for test instances that range in size from 10 to 20000 sensors show that the proposed method is fast and robust, and the method is very promising for large-scale SLDPCL problems due to its excellent scalability.

show abstract

Section: Solving Methodsmentioning

confidence: 99%

A Novel Separable Model and Decomposition Method for Sensor Locational Decision Problem

Yang

Li²

2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…They propose a branch-and-bound algorithm and a heuristic algorithm for non-homogeneous sensors. Zhang et al [26] radars placement problem. Radars are deployed on the banks of river which is modeled as piece-wise line segments.…”

Section: Related Workmentioning

confidence: 99%

Approximation Algorithms for Road Coverage Using Wireless Sensor Networks for Moving Objects Monitoring

Dash

2020

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

Coverage problem in wireless sensor networks measures how well a region or parts of it is sensed by the deployed sensors. Definition of coverage metric depends on its applications for which sensors are deployed. In this paper, we introduce a new quality control metric/measure called road coverage. It will be used for measuring efficiency of a sensor network, which is deployed for tracking moving/mobile objects in a road network. A road segment is a sub-part of a road network. A road segment is said to be road covered if an object travels through the entire road segment then it must be detected somewhere on the road segment by a sensor. First, we propose different definitions of road coverage metrics. Thereafter, algorithms are proposed to measure those proposed road coverage metrics. It is shown that the problem of deploying minimum number of sensors to road cover a set of road segments is NP-hard. Constant factor approximation algorithms are proposed for road covering axis-parallel road segments. Experimental performance analysis of our algorithms are evaluated through simulations.

show abstract

“…Many scholars studied scheduling switch of sensor of the network, in order to reduce the consumption of battery, so as to longer the whole use cycle of system, such as Ditian [8]. Zhaozhang [9] provided dynamic programming algorithm in order to monitor some important points along the river. The objective is to mininize energy consumption.…”

Section: Hongying Wumentioning

confidence: 99%

SSR Surveillance Network Optimization With Terrain Masking and Lake Effect Consideration

Guan¹,

Qi²,

2014

Proceedings of the International Conference on Logistics, Engineering, Management and Computer Science

View full text Add to dashboard Cite

In this paper, SSR surveillance network covering problem with obstructing affected by surface features and lakes was studied.The purpose is to improve the performance of SSR surveillance network, thus ensure the efficiency and safety management in airspace. The objective is to minimize the number of radar and the decision variable is the site of radar. Firstly, radar network covering problem without obstructing affect is studied. An approximation UFC algorithm was provided. Secondly, covering problem with shelter influence was taken into account. Additional notations were given and SFC algorithm was excuted for this problem.Finally, SSR surveillance network covering problem with obstructing affected by mountains and lakes was studied. We conclude the performance of our algorithm combined with an easy heuristic is stable and can always save one or two radar in the whole system compared to the easy heuristic algorithm.

show abstract

Radar placement along banks of river

Cited by 7 publications

References 14 publications

A Novel Separable Model and Decomposition Method for Sensor Locational Decision Problem

A Novel Separable Model and Decomposition Method for Sensor Locational Decision Problem

Approximation Algorithms for Road Coverage Using Wireless Sensor Networks for Moving Objects Monitoring

SSR Surveillance Network Optimization With Terrain Masking and Lake Effect Consideration

Contact Info

Product

Resources

About