Skip navigation
  • 中文
  • English

DSpace CRIS

  • DSpace logo
  • 首頁
  • 研究成果檢索
  • 研究人員
  • 單位
  • 計畫
  • 分類瀏覽
    • 研究成果檢索
    • 研究人員
    • 單位
    • 計畫
  • 機構典藏
  • SDGs
  • 登入
  • 中文
  • English
  1. National Taiwan Ocean University Research Hub

Energy Efficient Rendezvous and Broadcast Protocols Design in Arbitrary-Duty-Cycled Wireless Sensor Networks

瀏覽統計 Email 通知 RSS Feed

  • 簡歷

基本資料

Project title
Energy Efficient Rendezvous and Broadcast Protocols Design in Arbitrary-Duty-Cycled Wireless Sensor Networks
Code/計畫編號
NSC102-2221-E019-017-MY3
Translated Name/計畫中文名
任意工作週期無線感測網路碰面及廣播省電協定設計
 
Project Coordinator/計畫主持人
Chih-Min Chao
Funding Organization/主管機關
National Science and Technology Council
 
Department/Unit
Department of Computer Science and Engineering
Website
https://www.grb.gov.tw/search/planDetail?id=8115554
Year
2014
 
Start date/計畫起
01-08-2014
Expected Completion/計畫迄
31-07-2015
 
Bugetid/研究經費
798千元
 
ResearchField/研究領域
資訊工程--硬體工程
 

Description

Abstract
如何省電以延長網路生命週期一直是無線感測網路環境中相當重要的研究議 題。採用低工作週期,也就是讓感測節點大部分的時間處於耗電較少的睡眠模式, 是相當常見的省電策略。然而,在節點可各自選擇其工作週期的環境下,若未妥善 規劃節點醒睡的排程,很可能讓某些節點無法同時切換至運作模式,以致無法碰面 溝通。為解決此排程問題,本計畫的第一年,我們擬利用中國餘式定理,設計出交 錯式變換瞬間工作週期的排程協定,在感測節點可自由選擇其目標工作週期的前提 下,保證不同節點能直接溝通且使不同節點的平均碰面次數最大化。 廣播是感測網路中一個重要的功能。本計畫第一年所設計的協定,是保證任兩 個節點一定能直接碰面溝通,並未處理廣播問題。現存可運作於具工作週期環境的 廣播協定複雜度都過高,因此,在本計畫第二年中,我們將設計一個可運作於第一 年計畫所設計排程協定的低複雜度廣播方法,我們的目標是能以最省電的方式達到 廣播目的。 無線傳輸的訊號會因距離或地形等因素衰減,傳送端每次傳輸並不能保證一定 能被接收端正確接收,也就是不同節點的傳送成功率會因連線狀態的不同而有差異。 在本計畫第三年中,我們將在網路中各連線有不同連線品質的環境下,以第二年的 設計為基礎,再提出一個新的廣播協定,我們的目標是以最省電的方式,讓每個節 點收到封包的期望值都超過一個給定的門檻值。 Prolonging network lifetime is always a critical issue in wireless sensor networks (WSNs). To reduce energy consumption, utilizing duty cycling, i.e., sensor nodes switching to sleeping mode for most of the time, is a common strategy. However, without properly scheduled, sensor nodes may not be able to stay awake simultaneously to communicate with each other. That is, nodes may not have a rendezvous to each other. To solve this problem, in the first year of this project, we use the Chinese remainder theorem to design a scheduling protocol. By adjusting each node’s instantaneous duty cycle in a staggered way, the proposed solution allows each sensor node to choose its target duty cycle independently and guarantees that any two nodes have a rendezvous. The proposed protocol also maximizes the number of rendezvous among different nodes. Broadcast is one of the fundamental services in wireless sensor networks. The protocol we designed in the first year does not provide efficient broadcasting. Existing broadcasting protocols for duty-cycled WSNs suffer from high complexity. In the second year of this project, we will design an energy efficient and low complexity broadcasting protocol in arbitrary-duty -cycled WSNs. Enlarged transmission distance and obstacles cause signal loss which may result in transmission failure. That is, a successful transmission significantly depends on link quality between transmission pairs. In the third year of this project, considering the link quality issue, we will design a new energy efficient broadcast protocol in arbitrary-duty -cycled WSNs. Our goal is to provide a scheme that enables each node receiving each broadcast packet with a probability larger than a pre-defined threshold.
 
 
瀏覽
  • 機構典藏
  • 研究成果檢索
  • 研究人員
  • 單位
  • 計畫
DSpace-CRIS Software Copyright © 2002-  Duraspace   4science - Extension maintained and optimized by NTU Library Logo 4SCIENCE 回饋