Analysis of optimal relay selection in IEEE 802.16 multihop relay networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Processing continuous top-k data collection queries in lifetime-constrained wireless sensor networks
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
A multi-objective memetic algorithm for relay node placement in wireless sensor network
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Relay node positioning in wireless sensor networks by means of evolutionary techniques
AIS'12 Proceedings of the Third international conference on Autonomous and Intelligent Systems
Quantifying connectivity in wireless sensor networks with grid-based deployments
Journal of Network and Computer Applications
Wireless Sensor Node Placement Using Hybrid Genetic Programming and Genetic Algorithms
International Journal of Intelligent Information Technologies
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Deployment strategy of WSN based on minimizing cost per unit area
Computer Communications
| Hi-index | 0.01 |
Device placement is a fundamental factor in determining the coverage, connectivity, cost and lifetime of a wireless sensor network (WSN). In this paper, we explore the problem of relay node placement in heterogeneous WSN. We formulate a generalized node placement optimization problem aimed at minimizing the network cost with constraints on lifetime and connectivity. Depending on the constraints, two representative scenarios of this problem are described. We characterize the first problem, where relay nodes are not energy constrained, as a minimum set covering problem. We further consider a more challenging scenario, where all nodes are energy limited. As an optimal solution to this problem is difficult to obtain, a two-phase approach is proposed, in which locally optimal design decisions are taken. The placement of the first phase relay nodes (FPRN), which are directly connected to sensor nodes (SN), is modeled as a minimum set covering problem. To ensure the relaying of the traffic from the FPRN to the base station, three heuristic schemes are proposed to place the second phase relay nodes (SPRN). Furthermore, a lower bound on the minimum number of SPRN required for connectivity is provided. The efficiency of our proposals is investigated by numerical examples.