• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

A message-optimal sink mobility model for Wireless Sensor Networks

Thumbnail
Date
2009
Link to item file
http://hal.archives-ouvertes.fr/hal-00271581/en/
Dewey
Informatique générale
Sujet
random walk; sensor; networks; mobile sink; cover time
DOI
http://doi.ieeecomputersociety.org/10.1109/ICN.2009.53
Conference name
Eighth International Conference on Networks
Conference date
03-2009
Conference city
Gosier (Guadeloupe)
Conference country
France
Book title
2009 Eighth International Conference on Networks. Proceedings
Publisher
IEEE Computer Society
Year
2009
URI
https://basepub.dauphine.fr/handle/123456789/6007
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Giannakos, Aristotelis
Karagiorgos, Gregory
Stavrakakis, Ioannis
Type
Communication / Conférence
Item number of pages
287-291
Abstract (EN)
The paper proposes an algorithm for collecting data from a wireless sensor network modeled as a random geometric graph in the unit square. The sensors are supposed to work in an asychronous communication mode (they store the measures they perform and transmit a message containing the data, upon receival of a trigger signal). The model assumes a mobile sink passing near the sensors, and asking the sensors to transmit their data. The algorithm defines a route for the sink such that the number of messages that a sensor needs to transmit be as low as possible.We also present a kind of “controled” random walk in a(connected) random geometric graph that is based upon the main idea of the sink routing algorithm, reducing the graph cover time to Θ(n log log n) instead of Θ(n log n) needed when a simple random walk is performed.The model can be generalized for the case of more than one mobile sink, and the algorithm can be modified to deal with locally uniform density of sensors deployed in the field.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.