Grant: Discovery Grants Program - Individual
Carleton University
$33,000.00
Algorithmic methods in wireless network computing
FY 2011-12
Summary
This proposal is concerned with the design of ``algorithmic methodologies'' in wireless network computing in
order to enhance communication efficiency and reliability of wireless networks. Algorithmic methodologies
are common in all areas of computer science. On the one hand, wireless networking arises when connectivity is
the result of devices transmitting in unguided media, and on the other network computing refers to computers
working together and interacting over a network. It is of interest to explore how network computing principles
can lead to improved wireless network design. Questions underlying the efficiency of communication in
wireless networks involve a combination of topological, architectural, methodological and coordination
paradigms. More specifically, some of the questions to be investigated include: 1) How are network
parameters such as diameter, connectivity and degree affected by random dependent (node and/or edge) faults?
What is the impact of the probability distribution of the faults on the connectivity and diameter of the fault-free
part of the network? 2) How much receiver interference is caused by the transmission range and beam breadth
of a sensor, how does it affect the quality of communication and how can extreme value analysis illuminate the
limitations of antenna design? 3) Can we improve the efficiency of sensor networks by judicious employment
of directional antennae and establish rigorous trade-offs involving a) robustness of network connectivity, b)
antenna characteristics (directional versus omni-directional) and parameters (length of antennae range and
beam breadth), and c) overall network energy consumption when substituting omnidirectional by directional
antennae? 4) In what way can the use of mobile, co-operating agents take advantage of opportunistic and
delay-tolerant situations in order to establish a more reliable, mobile ad hoc network that attains good
connectivity and coverage characteristics? How can the coordination of wireless nodes with mobile agents be
used to establish secure network boundaries?
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
122227-2011
Name nom
Kranakis, Evangelos
Department département
Computer Science, School of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2011
Award amount
33000
Program id
RGPIN
Program nane 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
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
5
Application title
Algorithmic methods in wireless network computing
Keyword
NSERC
Application summary
This proposal is concerned with the design of ``algorithmic methodologies'' in wireless network computing in
order to enhance communication efficiency and reliability of wireless networks. Algorithmic methodologies
are common in all areas of computer science. On the one hand, wireless networking arises when connectivity is
the result of devices transmitting in unguided media, and on the other network computing refers to computers
working together and interacting over a network. It is of interest to explore how network computing principles
can lead to improved wireless network design. Questions underlying the efficiency of communication in
wireless networks involve a combination of topological, architectural, methodological and coordination
paradigms. More specifically, some of the questions to be investigated include: 1) How are network
parameters such as diameter, connectivity and degree affected by random dependent (node and/or edge) faults?
What is the impact of the probability distribution of the faults on the connectivity and diameter of the fault-free
part of the network? 2) How much receiver interference is caused by the transmission range and beam breadth
of a sensor, how does it affect the quality of communication and how can extreme value analysis illuminate the
limitations of antenna design? 3) Can we improve the efficiency of sensor networks by judicious employment
of directional antennae and establish rigorous trade-offs involving a) robustness of network connectivity, b)
antenna characteristics (directional versus omni-directional) and parameters (length of antennae range and
beam breadth), and c) overall network energy consumption when substituting omnidirectional by directional
antennae? 4) In what way can the use of mobile, co-operating agents take advantage of opportunistic and
delay-tolerant situations in order to establish a more reliable, mobile ad hoc network that attains good
connectivity and coverage characteristics? How can the coordination of wireless nodes with mobile agents be
used to establish secure network boundaries?