文献知网节
  • 记笔记
摘要:In this paper, we consider a multi-hop wireless sensor network, where the network topology is a tree, time division multiple access (TDMA) is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to others in performance. However, solving the scheduling problem for TDMA is difficult, especially, in large-scale multi-hop sensor networks. In this paper, based on graph theory, we propose new formulation for the TDMA scheduling problem.
会议名称:

第九届运筹学及其应用国际研讨会

会议时间:

2010-08-19

会议地点:

中国四川成都、中国四川九寨沟

  • 专辑:

    信息科技

  • 专题:

    电信技术; 自动化技术

  • 分类号:

    TP212.9;TN929.5

  • 手机阅读
    即刻使用手机阅读
    第一步

    扫描二维码下载

    "移动知网-全球学术快报"客户端

    第二步

    打开“全球学术快报”

    点击首页左上角的扫描图标

    第三步

    扫描二维码

    手机同步阅读本篇文献

  • CAJ下载
  • PDF下载

下载手机APP用APP扫此码同步阅读该篇文章

下载:3 页码:396-403 页数:8 大小:260k

引文网络
  • 参考文献
  • 引证文献
  • 共引文献
  • 同被引文献
  • 二级参考文献
  • 二级引证文献
  • 批量下载
相关推荐
  • 相似文献
  • 读者推荐
  • 相关基金文献
  • 相关法规
  • 关联作者
  • 相关视频