Groupes de recherche

| S3 | IC2 | RMS | MIC2 |

Catégories

Archives

Se connecter



Pages spéciales

2009/12/18 – Abdou Almamou : « Structured Routing in Wireless Sensor Network »

18 décembre 2009
15:00au17:00

Soutenance de thèse

Lieu : amphithéâtre Jade à Télécom ParisTech (46, rue Barrault – 75013 Paris)

Membres du jury :

  • Prof. André-Luc Beylot Université de Toulouse (rapporteur)
  • Prof. Kun-Mean Hou Université Blaise Pascal (rapporteur)
  • Prof. Khaldoun Al-Agha Université Paris-Sud (examinateur)
  • Prof. Philippe Godlewski Télécom ParisTech (examinateur)
  • Maitre de Conférence – HDR Houda Labiod Télécom ParisTech (directeur de thèse)
  • Prof. Jochen Schiller – Freie Universität – Berlin (directeur de thèse)

Title : Structured Routing in Wireless Sensor Network

The research field of structured routing in wireless sensor networks (WSNs) combines two pre-existing technologies, Distributed Hash Table (DHT) and wireless sensor network (WSN). The term structured routing encompasses all the Peer to Peer overlay systems that use the DHT. Using DHT over WSNs has gained a lot of attention in the research area in the last years. In WSN’s world, the most important issue in routing is to gather the routed information coming from sensor nodes to the sink node regardless of the identity of the donating one. The problem in this context is to locate efficiently the sensor node, which holds the data item or locate the receive node that demands data with the minimum number of intermediate hops to save network energy. From another view point, using a DHT has proven the ability of network to adapt with the arriving and leaving nodes. Some traditional ad hoc routing protocols do not take into account that a sensor node has limited capacities, e.g. computation and energy. Therefore, they perform the sensing task regardless of the maximum number of hops and the duration that it takes. In WSNs, this routing solution is inconvenient; thus, a proposed solution to resolve this problem is to bring the DHT which is basically implemented over the Internet to be used for this purpose. This thesis presents ScatterDHT, a routing overlay explicitly designed for WSNs.

ScatterDHT exploits the P2P functionality features and applies them over the ScatterWeb sensor nodes. The first part of this thesis describes the ScatterDHT overlay routing and figures out the performance evaluation of the implemented prototype. The second part of the thesis gives a detailed study of performance evaluation of two MANETs routing protocols (B.A.T.M.A.N and OLSR) over the WSN. This work has been achieved to give a comprehensive performance evaluation on the characteristics of the chosen routing protocols. Results show that ScatterDHT outperforms the other protocols considering a few important metrics in the wireless sensor network. It has a higher delivery ratio than B.A.T.M.A.N and OLSR for all network sizes (5 Nodes, 10 Nodes, 50 Nodes, 100 Nodes, and 200 Nodes). It also outperforms the other protocols regarding the metric Control Traffic Overhead. The most important metric where Scatter-DHT outperforms other ones, is the energy consumption. Since the control traffic overhead generated by ScatterDHT is less than others, it is obvious that it requires less energy consumption

Commentaires clos.