Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Concordia University

$20,000.00

Routing and communication algorithms in ad-hoc networks

EF 2012-13

Résumé
Communication algorithms for position based ad-hoc and sensor networks will be investigated. An ad hoc network is a self-organizing network of autonomous nodes equipped with wireless transmitters without a pre-established communication infrastructure. A sensor network is an ad-hoc network made of small, battery-operated sensor nodes, called motes, that can gather sensory information, do some data processing, and communicate wirelessly with neighboring nodes. More specifically, I want to find better routing algorithms for ad-hoc networks in which destination node can be mobile and the location of the destination is not known. Improved routings in 3 dimensional ad-hoc networks of known general topology will be also studied an new methods for routing in nano networks will be considered. Another communication problem that is proposed is improved local algorithms for connected dominating sets. These sets are used for data collection and data distribution in sensor networks. I want to obtain algorithms that produce better approximations of optimum solutions and algorithms that can produce disjoint connected dominating sets using only a fixed-sized neighborhood of each node. Finally several optimization problems related to an automated deployment of sensor networks in harsh environments using mobile motes will be studied.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
3048-2010
Name nom
Opatrny, Jaroslav
Department département
Computer Science and Software Engineering
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2010
Award amount
20000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2721
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Multimedia systems and networks
Research subject fr
Systèmes et réseaux multimédias
Partie
3
Nb partie
5
Application title
Routing and communication algorithms in ad-hoc networks
Keyword
NSERC
Application summary
Communication algorithms for position based ad-hoc and sensor networks will be investigated. An ad hoc network is a self-organizing network of autonomous nodes equipped with wireless transmitters without a pre-established communication infrastructure. A sensor network is an ad-hoc network made of small, battery-operated sensor nodes, called motes, that can gather sensory information, do some data processing, and communicate wirelessly with neighboring nodes. More specifically, I want to find better routing algorithms for ad-hoc networks in which destination node can be mobile and the location of the destination is not known. Improved routings in 3 dimensional ad-hoc networks of known general topology will be also studied an new methods for routing in nano networks will be considered. Another communication problem that is proposed is improved local algorithms for connected dominating sets. These sets are used for data collection and data distribution in sensor networks. I want to obtain algorithms that produce better approximations of optimum solutions and algorithms that can produce disjoint connected dominating sets using only a fixed-sized neighborhood of each node. Finally several optimization problems related to an automated deployment of sensor networks in harsh environments using mobile motes will be studied.