scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Wireless Sensor node selection strategies for effective surveillance

12 Jun 2015-pp 924-929
TL;DR: A new algorithm, maximum coverage area algorithm, is introduced and it is shown that it outperforms minimax, lexicographic minimax and greedy forward algorithms in terms of coverage ratio.
Abstract: One of the most prominent applications of Wireless Sensor Networks (WSN) is for the purpose of surveillance. Here, a number of sensor nodes are deployed to monitor a particular area. But these sensors run on limited battery capacity and are also costly. Thus, the sensor node selection technique needs to be optimized so that using minimum number of sensors, maximum possible area can be covered so that the energy is used efficiently and the power consumption is reduced. This paper reviews three existing algorithms: minimax, lexicographic minimax and greedy forward. It also introduces a new algorithm, maximum coverage area algorithm and compares its performance with the three existing algorithms for optimized selection. Performance comparison in terms of coverage ratio has been made between the four algorithms. Coverage ratio is the measure of the area effectively covered with respect to the total area. According to the simulation results, the maximum coverage area algorithm outperforms minimax, lexicographic minimax and greedy forward algorithms.
Citations
More filters
Book ChapterDOI
01 Jan 1982
TL;DR: In this chapter the authors are going to explore games that all have certain similarities: contests between two players that terminate after a finite number of moves and there are no elements of chance involved.
Abstract: In this chapter we are going to explore games that all have certain similarities: a) They are contests between two players. b) They terminate after a finite number of moves. c) There are no elements of chance involved (no dice are used or cards shuffled) . The result is that the game is determined solely by the players’ decisions. d) Both players can freely observe each other’s moves and evaluate the changes that these make in the game.

130 citations

DissertationDOI
01 Jan 2017
TL;DR: This thesis implements sensor placement algorithms in order to obtain the most information about the state of the system and results in a system methodology that periodically monitors the system for faults and brings the system back to safe operation.
Abstract: Title of Thesis: A SYSTEM METHODOLOGY FOR FAULT DETECTION AND FAULT RESTORATION IN DISTRIBUTED ELECTRIC POWER SYSTEMS Estefany Carrillo, Master of Science, 2017 Thesis directed by: Professor Huan Xu Department of Aerospace Engineering Due to advances in electronic technologies, many systems are becoming increasingly dependent on electric power for control and safety critical features [1]. When power failures occur, fault detection and fault restoration processes are essential to reestablishing the proper function of the system. This thesis presents a system methodology that addresses fault detection and fault restoration for distributed electric power systems and a case study on applying the developed methodology to an aircraft electric power system. This thesis implements sensor placement algorithms in order to obtain the most information about the state of the system. These algorithms rely on a state estimation algorithm developed in [21] in order to quantify the information obtained by the sensor measurements. Then, the sensor placement and state estimation algorithms are combined with a controller synthesis method. This results in a system methodology that periodically monitors the system for faults and brings the system back to safe operation. A SYSTEM METHODOLOGY FOR FAULT DETECTION AND FAULT RESTORATION IN DISTRIBUTED ELECTRIC POWER SYSTEMS

Cites background or methods from "Wireless Sensor node selection stra..."

  • ...It is shown in [15] that the combinatorial approach outperforms other algorithms in choosing the optimum sensor locations in a wireless sensor network....

    [...]

  • ...For other applications of sensor placement, [15] and [16] look at the problem of choosing sensors in Wireless Sensor Networks (WSN) with the objective of minimizing the use of constrained resources or maximizing sensor coverage and quality....

    [...]

  • ...The combinatorial algorithm from [15] and the greedy algorithm from [13] are modified and adapted to address the sensor placement problem presented in this work due to their performance and applicability to the sensor placement problem in discrete models of electrical power systems....

    [...]

  • ...For the application of sensor placement in Wireless Sensor Networks (WSN), [15] and [16] seek to choose sensor locations that will minimize the use of constrained resources or maximize sensor coverage and quality....

    [...]

  • ...In this thesis, we take an approach based off the theoretical concepts of the greedy and combinatorial methods explored in [13] and [15] respectively and implement sensor placement algorithms that seek to maximize a given function....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: In this paper, it is shown that the best way to cover a given area with circles of a given radius E is to place the centers of the circles on an equilateral triangle network, i.e., to circumscribe (inscribe) the circles about the hexagons of a regular hexagon network or honeycomb.
Abstract: It is well known that the " best " way to cover a given area with circles of a given radius E, or to pack such circles within a given region is to place the centers of the circles on an equilateral triangle network, i. e., to circumscribe (inscribe) the circles about the hexagons of a regular hexagon network or honeycomb. This, of course, is not a precise statement, and, in fact, it is difficult to make a precise statement in this direction that is true. Roughly, the statement becomes more true as E is taken smaller in relation to the area of the given region. The most usual 1 precise statement of this fact is that the densest plane Punktgitter is that of the equilateral triangle. This statement avoids the difficulties caused by the boundedness of the bounded region but is less general than might be desired in that permissible packings or coverings are limited to those in which the centers of the circles form a Punktgitter. The object of the present paper is to give, a new aiid elementary proof of a precise statement in this direction; a statement involving no restriction on the nature of permissible coverings or on the nature of the given region. Specifically the statement to be proved is the following:

547 citations

Journal ArticleDOI
TL;DR: The context, content, and nature of the research and the factors that led to early implementation successes in emergency response systems are looked at and the extent to which these original models are still affecting decision making inEmergency response systems is tracked.
Abstract: While the goal of OR/MS is to aid decision makers, implementation of published models occurs less frequently than one might hope. However, one area that has been significantly impacted by management science is emergency response systems. Dozens of papers on emergency service management appeared in the OR/MS literature in the 1970s alone, many of which were published inManagement Science. Three of these papers won major prizes. More importantly, many of these papers led to the implementation of substantially new policies and practices, particularly in policing and firefighting. Much of this work originated in New York City, though many other cities subsequently adopted the resulting models and strategies. In this paper, we look at the context, content, and nature of the research and the factors that led to these early implementation successes. We then track the extent to which these original models are still affecting decision making in emergency response systems. We also examine the pace of development of new OR/MS models and applications in the area. Finally, we look at issues in emergency responsiveness that have emerged recently as a result of the national focus on terrorism and discuss the potential for future OR/MS modeling and application.

181 citations

01 Jan 2004
TL;DR: In this article, the authors look at the context, content, and nature of the research and the factors that led to these early implementation successes and track the extent to which these original models are still affecting decision making in emergency response systems.
Abstract: W the goal of OR/MS is to aid decision makers, implementation of published models occurs less frequently than one might hope. However, one area that has been significantly impacted by management science is emergency response systems. Dozens of papers on emergency service management appeared in the OR/MS literature in the 1970s alone, many of which were published in Management Science. Three of these papers won major prizes. More importantly, many of these papers led to the implementation of substantially new policies and practices, particularly in policing and firefighting. Much of this work originated in New York City, though many other cities subsequently adopted the resulting models and strategies. In this paper, we look at the context, content, and nature of the research and the factors that led to these early implementation successes. We then track the extent to which these original models are still affecting decision making in emergency response systems. We also examine the pace of development of new OR/MS models and applications in the area. Finally, we look at issues in emergency responsiveness that have emerged recently as a result of the national focus on terrorism and discuss the potential for future OR/MS modeling and application.

174 citations

Journal ArticleDOI
TL;DR: It is shown that the lexicographic minimax approach complies with both the Pareto-optimality (efficiency) principle and the principle of transfers (essential for equity measures) whereas the standard minimax approaches may violate both these principles.

133 citations

Book ChapterDOI
01 Jan 1982
TL;DR: In this chapter the authors are going to explore games that all have certain similarities: contests between two players that terminate after a finite number of moves and there are no elements of chance involved.
Abstract: In this chapter we are going to explore games that all have certain similarities: a) They are contests between two players. b) They terminate after a finite number of moves. c) There are no elements of chance involved (no dice are used or cards shuffled) . The result is that the game is determined solely by the players’ decisions. d) Both players can freely observe each other’s moves and evaluate the changes that these make in the game.

130 citations