logo EDITE Ichrak AMDOUNI
Identité
Ichrak AMDOUNI
État académique
Thèse soutenue le 2013-02-14
Sujet: Réseaux sans fil auto-adaptatifs et écologiques: efficacité énergétique et réutilisation spatiale
Direction de thèse:
Laboratoire:
Voisinage
Ellipse bleue: doctorant, ellipse jaune: docteur, rectangle vert: permanent, rectangle jaune: HDR. Trait vert: encadrant de thèse, trait bleu: directeur de thèse, pointillé: jury d'évaluation à mi-parcours ou jury de thèse.
Productions scientifiques
oai:hal.archives-ouvertes.fr:hal-00728871
TRASA: TRaffic Aware Slot Assignment Algorithm in Wireless Sensor Networks
In data gathering applications which is a typical application paradigm in wireless sensor networks, sensor nodes may have different traffic demands. Assigning equal channel access to each node may lead to congestion, inefficient use of the bandwidth and decrease of the application performance. In this paper, we prove that the time slot assignment problem is NP-complete when p-hop nodes are not assigned the same slot, with 1 <= p <= h for any strictly positive integer h. We propose TRASA, a TRaffic Aware time Slot Assignment algorithm able to allocate slots to sensors proportionally to their demand. We evaluate the performance of TRASA for different heuristics and prove that it provides an optimized spatial reuse and a minimized cycle length.
The 2nd International Conference On Communications and Information Technology: ICCIT 2012article in peer-reviewed journal 2012
oai:hal.inria.fr:hal-00729051
Node Coloring in Wireless Networks: Complexity Results and Grid Coloring
Coloring is used in wireless networks to improve communication efficiency, mainly in terms of bandwidth, energy and possibly end-to-end delays. In this paper, we define the h-hop node coloring problem, with h any positive integer, adapted to two types of applications in wireless networks. We specify both general mode for general applications and strategic mode for data gathering applications.We prove that the associated decision problem is NP-complete. We then focus on grid topologies that constitute regular topologies for large or dense wireless networks. We consider various transmission ranges and identify a color pattern that can be reproduced to color the whole grid with the optimal number of colors. We obtain an optimal periodic coloring of the grid for the considered transmission range. We then present a 3-hop distributed coloring algorithm, called SERENA. Through simulation results, we highlight the impact of node priority assignment on the number of colors obtained for any network and grids in particular. We then compare these optimal results on grids with those obtained by SERENA and identify directions to improve SERENA.
IFIP Wireless and Mobile Networking Conference WMNC 2011article in peer-reviewed journal 2011
oai:hal.inria.fr:inria-00582457
Node coloring for dense wireless sensor networks
Coloring is used in wireless networks to improve communication efficiency, mainly in terms of bandwidth, energy and possibly end-to-end delays. In this research report, we define the h-hop node coloring problem, with h any positive integer. We prove that the associated decision problem is NP-complete. We then present a 3-hop distributed coloring algorithm that is optimized for dense networks: a node does not need to exchange the priorities and colors of its 2-hop neighbors. Through simulation results, we highlight the impact of priority assignment on the number of colors obtained for any network. We then focus on grids and identify a color pattern that can be reproduced to color the whole grid. We show how the coloring algorithm can use regularity properties to obtain a periodic color pattern with the optimal number of colors. We then consider grids with holes and study how to extend our results.
research report 2011-03-25
oai:hal.inria.fr:hal-00757349
Delay Optimized Time Slot Assignment for Data Gathering Applications in Wireless Sensor Networks
Wireless sensor networks, WSNs, are an efficient way to deal with low-rate communications in confined environments such as mines or nuclear power plants because of their simplicity of deployment and low cost. In these application domains, WSNs are used to gather data from sensor nodes towards a sink in a multi-hop convergecast structure. In this paper, we focus on a traffic-aware time slot assignment minimizing the schedule length for tree topologies and for two special deployments (i.e. linear and multi-linear) representative of unusual environments. We formalize the problem as a linear program and provide results on the optimal number of slots. We then propose a delay optimized algorithm with two heuristics that minimize on the one hand the energy consumption and on the other hand the storage capacity as secondary criteria.
Third IEEE International Conference on Wireless Communications in Unusual and Confined Areas, ICWCUCA2012 ICWCUCA 2012 - Third International Conference on Wireless Communications in Unusual and Confined Areasconference proceeding 2012
Soutenance
Thèse: Réseaux sans fil auto-adaptatifs: efficacité énergétique et réutilisation spatiale
Soutenance: 2013-02-14