Abstract
We consider in this letter the problem of constrained relay node (RN) placement where sensor nodes must be connected to base stations by using a minimum number of RNs. The latter can only be deployed at a set of predefined locations, and the two-tiered topology is considered where only RNs are responsible for traffic forwarding. We propose a one-step constrained RN placement (OSRP) algorithm which yields a network tree. The performance of OSRP in terms of the number of added RNs is investigated in a simulation study by varying the network density, the number of sensor nodes, and the number of candidate RN positions. The results show that OSRP outperforms the only algorithm in the literature for two-tiered constrained RNs placement.
| Original language | English |
|---|---|
| Pages (from-to) | 448-451 |
| Number of pages | 4 |
| Journal | IEEE Wireless Communications Letters |
| Volume | 5 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Aug 2016 |
| MoE publication type | A1 Journal article-refereed |
Funding
This work was supported in part by the HOME Project through the Research Council of Norway under Idea Laboratory Program NFR 238848/O70, in part by the CERIST's Smart Building Project through the Algerian Ministry of Higher Education and Scientific Research and the DGRSDT, and in part by the European Research Consortium for Informatics and Mathematics "Alain Bensoussan" Fellowship Programme. The associate editor coordinating the review of this paper and approving it for publication was H. Yomo.
Keywords
- Constrained relay node placement
- two-tiered topology
- wireless sensor network
Fingerprint
Dive into the research topics of 'One-Step Approach for Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver