Energy-Aware Constrained Relay Node Deployment for Sustainable Wireless Sensor Networks

dc.contributor.authorDjenouri, Djamel
dc.contributor.authorBagaa, Miloud
dc.date.accessioned2017-12-17T13:07:07Z
dc.date.available2017-12-17T13:07:07Z
dc.date.issued2017-03
dc.description.abstractThis paper considers the problem of communication coverage for sustainable data forwarding in wireless sensor networks, where an energy-aware deployment model of relay nodes (RNs) is proposed. The model used in this paper considers constrained placement and is different from the existing one-tiered and two-tiered models. It supposes two different types of sensor nodes to be deployed, i) energy rich nodes (ERNs), and ii) energy limited nodes (ELNs). The aim is thus to use only the ERNs for relaying packets, while ELN’s use will be limited to sensing and transmitting their own readings. A minimum number of RNs is added if necessary to help ELNs. This intuitively ensures sustainable coverage and prolongs the network lifetime. The problem is reduced to the traditional problem of minimum weighted connected dominating set (MWCDS) in a vertex weighted graph. It is then solved by taking advantage of the simple form of the weight function, both when deriving exact and approximate solutions. Optimal solution is derived using integer linear programming (ILP), and a heuristic is given for the approximate solution. Upper bounds for the approximation of the heuristic (versus the optimal solution) and for its runtime are formally derived. The proposed model and solutions are also evaluated by simulation. The proposed model is compared with the one-tiered and two-tiered models when using similar solution to determine RNs positions, i.e., minimum connected dominating set (MCDS) calculation. Results demonstrate the proposed model considerably improves the network life time compared to the one-tiered model, and this by adding a lower number of RNs compared to the two-tiered model. Further, both the heuristic and the ILP for the MWCDS are evaluated and compared with a state-of-the-art algorithm. The results show the proposed heuristic has runtime close to the ILP while clearly reducing the runtime compared to both ILP and existing heuristics. The results also demonstrate scalability of the proposed solution.fr_FR
dc.identifier.issn2377-3782fr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/903
dc.publisherIEEEfr_FR
dc.relation.ispartofseriesIEEE Transactions on Sustainable computing;2(1)
dc.relation.pages30-42fr_FR
dc.structureRéseaux de capteurs et Applicationsfr_FR
dc.subjectwireless networksfr_FR
dc.subjectrelay node placementfr_FR
dc.subjectenergy efficient deploymentfr_FR
dc.subjectenergy harvestingfr_FR
dc.titleEnergy-Aware Constrained Relay Node Deployment for Sustainable Wireless Sensor Networksfr_FR
dc.typeArticle
Files