Academic & Scientific Articles

Permanent URI for this communityhttp://dl.cerist.dz/handle/CERIST/3

Browse

Subject: search.filters.subject.Relay node placement

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Optimal Placement of Relay Nodes Over Limited Positions in Wireless Sensor Networks
    (IEEE, 2017-04) Bagaa, Miloud; Cheli, Ali; Djenouri, Djamel; Taleb, Tarik; Balasingham, Ilangko; Kansanen, Kimmo
    This paper tackles the challenge of optimally placing relay nodes (RNs) in wireless sensor networks given a limited set of positions. The proposed solution consists of: 1) the usage of a realistic physical layer model based on a Rayleigh blockfading channel; 2) the calculation of the signal-to-interferenceplus- noise ratio (SINR) considering the path loss, fast fading, and interference; and 3) the usage of a weighted communication graph drawn based on outage probabilities determined from the calculated SINR for every communication link. Overall, the proposed solution aims for minimizing the outage probabilities when constructing the routing tree, by adding a minimum number of RNs that guarantee connectivity. In comparison to the state-of-the art solutions, the conducted simulations reveal that the proposed solution exhibits highly encouraging results at a reasonable cost in terms of the number of added RNs. The gain is proved high in terms of extending the network lifetime, reducing the end-to-end- delay, and increasing the goodput.
  • Thumbnail Image
    Item
    Energy Harvesting Aware Relay Node Addition for Power-Efficient Coverage in Wireless Sensor Networks
    (CERIST, 2015-01-11) Djenouri, Djamel; Bagaa, Miloud
    This paper deals with power-efficient coverage in wireless sensor networks (WSN) by taking advantage of energyharvesting capabilities. A general scenario is considered for deployed networks with two types of sensor nodes, harvesting enabled nodes (HNs), and none-harvesting nodes (NHNs). The aim is to use only the HNs for relaying packets, while NHNs use will be limited to sensing and transmitting their own readings. The problem is modeled using graph theory and reduced to finding the minimum weighted connected dominating set in a vertex weighted graph. A limited number of relay nodes is added at the positions close to the NHNs in the resulted set. The weight function ensures minimizing the number of NHNs in the set, and thus reducing the relay nodes to be added. Our contribution is to consider relay node placement (addition) in energy harvesting WSN, where only HNs are used to forward packets. This is to preserve the limited energy of NHNs. Extensive simulation results show that the proposed relay node addition strategy prolongs the network lifetime, from the double, to factors of several tens of times. This is at a reasonable cost in terms of the number of relay nodes added, which is compared to a lower-bound derived in the paper.