课题基金 / 基金详情

Theoretical aspects and algorithms for architectural design and communication in current networks

Theoretical aspects and algorithms for architectural design and communication in current networks
当前网络中的架构设计和通信的理论方面和算法
批准号:
261542-2012
负责人:
Stacho, Ladislav
金额:
$2.04万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2015
资助国家:
加拿大
项目状态:
已结题
起止时间:
2015-01-01 至 2016-12-31

项目摘要

项目成果

Stacho, Ladislav的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
The mathematical structure inherent in problems originated in design and administration of sensor networks has made them central to the theoretical computer science community as they utilize different techniques from areas like graph theory, computational geometry, design theory, and algebraic combinatorics. My goal is to build on my expertise and to answer some of the emerging questions in the area of ad-hoc and sensor networks: I propose to study and better understand the potential of geometric information in computation. The classical theory of graph algorithms was developed for offline models and is not sufficient for many modern applications where we are dealing with huge networks and we have only access to some local part of it at a time. It is more and more apparent that geometric information is useful to handle these settings. High connectivity is a fundamental criteria on communication network and it has been attacked in several research works where a planar subgraph of UDG with higher connectivity was build by adding/deleting edges to/from planar graph/UDG. However, existing results do not give complete understanding of tradeoffs here. Central question, which I would like to attack, is whether for some class of UDGs a similar technique as Gabriel Test or Relative Neighborhood Graph can result in a planar subgraph with higher (2-4) connectivity (vertex or edge). Today we know that for higher than 1-connectivity this cannot be the whole class of UDGs without extra conditions, and perhaps some topological requirements are necessary. Directional antennae are widely being used in wireless networks not only for reducing energy consumption and interference, but also for improving routing efficiency and security. The tradeoffs are studied between number of antennae and transmission range necessary to establish connected network. Existing results only partially address the issue of stretch factor. Also the effect of various technology limiting requirements such as allowed number of antennae at each node or allowed total number of antennae have to be better understood. I plan to attack some of these problems.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Algorithmic problems emerging in new networking technologies
  • 批准号:
    RGPIN-2018-03900
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $4.08万
  • 财政年份:
    2022
  • 负责人:
    Stacho, Ladislav
  • 依托单位:
Algorithmic problems emerging in new networking technologies
  • 批准号:
    RGPIN-2018-03900
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $2.04万
  • 财政年份:
    2021
  • 负责人:
    Stacho, Ladislav
  • 依托单位:
Algorithmic problems emerging in new networking technologies
  • 批准号:
    RGPIN-2018-03900
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $2.04万
  • 财政年份:
    2020
  • 负责人:
    Stacho, Ladislav
  • 依托单位:
Algorithmic problems emerging in new networking technologies
  • 批准号:
    RGPIN-2018-03900
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $2.04万
  • 财政年份:
    2019
  • 负责人:
    Stacho, Ladislav
  • 依托单位:
国内基金
海外基金
基于构件软件的面向可靠安全Aspects建模和一体化开发方法研究