Ali Chelli
One-step approach for two-tiered constrained relay node placement in wireless sensor networks
Chelli, Ali; Bagaa, Miloud; Djenouri, Djamel; Balasingham, Ilangko; Taleb, Tarik
Authors
Miloud Bagaa
Dr Djamel Djenouri Djamel.Djenouri@uwe.ac.uk
Associate Professor in Computer Science
Ilangko Balasingham
Tarik Taleb
Abstract
© 2012 IEEE. 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.
Journal Article Type | Article |
---|---|
Acceptance Date | Jun 15, 2016 |
Online Publication Date | Jun 21, 2016 |
Publication Date | Aug 1, 2016 |
Deposit Date | Jan 21, 2020 |
Publicly Available Date | Jan 23, 2020 |
Journal | IEEE Wireless Communications Letters |
Print ISSN | 2162-2337 |
Publisher | Institute of Electrical and Electronics Engineers |
Peer Reviewed | Peer Reviewed |
Volume | 5 |
Issue | 4 |
Pages | 448-451 |
DOI | https://doi.org/10.1109/LWC.2016.2583426 |
Public URL | https://uwe-repository.worktribe.com/output/5199791 |
Publisher URL | https://ieeexplore.ieee.org/document/7496836 |
Files
One-Step Approach for Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks
(425 Kb)
PDF
Licence
http://www.rioxx.net/licenses/all-rights-reserved
Publisher Licence URL
http://www.rioxx.net/licenses/all-rights-reserved
Copyright Statement
(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
You might also like
A gradual solution to detect selfish nodes in mobile ad hoc networks
(2010)
Journal Article
Towards immunizing MANET's source routing protocols against packet droppers
(2009)
Journal Article
On eliminating packet droppers in MANET: A modular solution
(2008)
Journal Article
Struggling against selfishness and black hole attacks in MANETs
(2007)
Journal Article
Distributed low-latency data aggregation scheduling in wireless sensor networks
(2015)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search