Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Simon Fraser University

$30,000.00

Network structure and communications

FY 2006-07

Summary
I propose to work in the general area of network structure and communication problems.     Over the past 6 years, my research has concentrated in three general problem areas:   broadcasting, graph spanners, and ad hoc and sensor networks.  I will continue to work in these three areas. "Broadcasting" is a particular problem in which a message is to be disseminated  from an originator to all members of a network.  By making various assumptions about the technologies involved, this problem is modelled as a problem in graphs.  Questions of interest include how to broadcast efficiently in given network structures and determining network structures that allow efficient broadcast.  Related network communications problems, such as gossiping (in which every member has a message to  be disseminated across the network), give rise to similar questions. The study of "graph spanners" concerns the construction of substructures of networks  in which distances are approximately the same as in the original networks.  In other words, a spanner is a smaller structure that mimics the original.  In this area, questions of interest involved finding good spanners of specific structures, creating algorithms to find such good spanners, and finding sets of distinct spanners within the same structure.   "Ad hoc networks" are networks of mobile members communicating with multihop wireless  technology. "Sensor networks" are networks of stationary members communicating wirelessly. In the former, the mobility of the members causes complications for message routing.   In the latter, the members have limited power supplies and making energy expenditure an important constraint.  In both types of networks, interesting communication problems arise.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
1734-2006
Name nom
Liestman, Arthur
Department département
Computing Science
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
30000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
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
2704
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Distributed and parallel processing
Research subject fr
Traitement réparti et simultané
Partie
1
Nb partie
5
Application title
Network structure and communications
Keyword
NA
Application summary
I propose to work in the general area of network structure and communication problems.     Over the past 6 years, my research has concentrated in three general problem areas:   broadcasting, graph spanners, and ad hoc and sensor networks.  I will continue to work in these three areas. "Broadcasting" is a particular problem in which a message is to be disseminated  from an originator to all members of a network.  By making various assumptions about the technologies involved, this problem is modelled as a problem in graphs.  Questions of interest include how to broadcast efficiently in given network structures and determining network structures that allow efficient broadcast.  Related network communications problems, such as gossiping (in which every member has a message to  be disseminated across the network), give rise to similar questions. The study of "graph spanners" concerns the construction of substructures of networks  in which distances are approximately the same as in the original networks.  In other words, a spanner is a smaller structure that mimics the original.  In this area, questions of interest involved finding good spanners of specific structures, creating algorithms to find such good spanners, and finding sets of distinct spanners within the same structure.   "Ad hoc networks" are networks of mobile members communicating with multihop wireless  technology. "Sensor networks" are networks of stationary members communicating wirelessly. In the former, the mobility of the members causes complications for message routing.   In the latter, the members have limited power supplies and making energy expenditure an important constraint.  In both types of networks, interesting communication problems arise.