Exploiting Synergies Between Exact and Heuristic Methods in Optimization: An Application to the Relay Placement Problem in Wireless Sensor Networks

2014 ◽  
pp. 250-265 ◽  
Author(s):  
Eduardo Feo Flushing ◽  
Gianni A. Di Caro
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Heuristic Methods ◽  
Placement Problem ◽  
Relay Placement

A constraint programming approach to the additional relay placement problem in wireless sensor networks

Constraints ◽  
2015 ◽  
Vol 20 (4) ◽  
pp. 433-451 ◽  
Author(s):  
Luis Quesada ◽  
Lanny Sitanayah ◽  
Kenneth N. Brown ◽  
Barry O’Sullivan ◽  
Cormac J. Sreenan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Constraint Programming ◽  
Wireless Sensor ◽  
Programming Approach ◽  
Placement Problem ◽  
Relay Placement

Exploring Coverage within Wireless Sensor Networks through Evolutionary Computations

2010 ◽  
pp. 191-200
Author(s):  
Sami Habib
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Search Space ◽  
Service Area ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Evolutionary Computations ◽  
Placement Problem ◽  
Sensor Devices ◽  
Computationally Intensive

The evolutionary search approach has demonstrated its effectiveness in many real world applications, such as the coverage problem in wireless sensor networks. It is to place sensor devices in a service area so that the entire service area is covered. We have modeled the coverage problem as two sub-problems: floorplan and placement. The floorplan problem is to partition the service area into well-defined geometric cells, where the placement problem is to assign the sensor devices into a set of cells. Even though the search space has been transformed from continuous into discrete, the complexity of the coverage problem is computationally intensive. The objective function is to maximize the coverage of the service area while not exceeding a given budget. The merged optimization problem has been coded into the genetic algorithm (GA) and the experimental results reveal the versatility of GA to adapt and find a good solution in a short time.

Voronoi-based relay placement scheme for wireless sensor networks

2009 ◽  
Vol 3 (4) ◽  
pp. 530 ◽  
Author(s):  
J.-S. Li ◽  
H.-C. Kao ◽  
J.-D. Ke
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Relay Placement

Bi-criteria Gateway Placement Problem in Wireless Sensor Networks

2010 ◽  
Vol 56 (3) ◽  
pp. 215-222 ◽  
Author(s):  
Maria Czajko ◽  
Jacek Wojciechowski
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cost Effective ◽  
Wireless Sensor ◽  
Placement Problem ◽  
Connection Management ◽  
Gateway Placement ◽  
Network Operation ◽  
Random Manner ◽  
Gateway Deployment

Bi-criteria Gateway Placement Problem in Wireless Sensor NetworksOver the last few years, wireless sensor networks (WSNs) have started to play more and more important role in civil and military applications. A typical sensor network consists of resource-constrained sensing nodes, which monitor environment and send the data to more powerful gateway nodes. The goal of gateway nodes is to aggregate, process and send the data to other gateways or directly to sink nodes. The proper placement of nodes is needed to provide good network operation. Sensing nodes are often placed in a random manner unlike gateways. Gateways, due to their role and cost, are installed rather in a controlled way. In this paper, a bi-criteria gateway placement problem is introduced. The problem is shown to be NP-hard. We formulate it as a linear programming problem, then we develop the Multi-criteria Simulated Allocation (MSAL) heuristic algorithm, for the purpose of cost-effective gateway deployment and power-effective wireless connection management. Finally, we evaluate the efficiency of the algorithm by comparison with the exact method.

Sign in / Sign up

Export Citation Format

Share Document