Academic & Scientific Articles

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

Browse

Author: search.filters.author.Balasingham, IlangkoSubject: search.filters.subject.wireless sensor network

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 Minimum Spanning Tree for Survivable WSN with Minimum Relay Node Addition
    (CERIST, 2016-08-31) Djenouri, Djamel; Bagaa, Miloud; Ali, Chelli; Balasingham, Ilangko
    Survivable wireless sensor networks that take advantage of green energy resources from the environment is considered in this paper. The particular problem of constrained relay nodes (RNs) placement to ensure communication coverage in the single-tiered topology while taking advantage of the energy harvesting potentials of sensor nodes (SNs) is dealt with. The contribution is to consider a realistic energy harvesting model where harvesting potentials may vary from one node to another. Without loss of generality, the energy model used in this paper is appropriate to wireless charging, but the proposed solution can be extended to the use of any energy harvesting technology. Based on this model, we propose a heuristic based on spanning tree calculation in an edge weighted graph model where the traffic routed at every node is proportional to its effective energy. RNs are added to help non-leaf nodes in the tree that cannot meet the defined survivability condition. A lower-bound of the proposed model is derived using integer linear programming. The proposed solution is compared by simulation to the single solution from the literature that treats the problem of RNs placement while considering energy harvesting capacity of SNs. A simplified model is used in the simulation to allow comparison. The performance results show that the proposed solution ensures survivability by adding a lower number of RNs.