國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

分散式無線感測器工作排程-使用賽局理論 = Distributed Wo...

國立高雄大學資訊工程學系碩士班

分散式無線感測器工作排程-使用賽局理論 = Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory

紀錄類型:	書目-語言資料,印刷品 : 單行本
並列題名:	Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory
作者:	林哲民,
其他團體作者:	國立高雄大學
出版地:	[高雄市]
出版者:	撰者;
出版年:	民100
面頁冊數:	64葉圖，表格 : 30公分;
標題:	無線感測網路
標題:	Wireless sensor network
電子資源:	http://handle.ncl.edu.tw/11296/ndltd/75909041669035496926
附註:	參考書目：葉55
摘要註:	在無線感測網路中，存在數個感測器與目標物，目標物必須被感測器持續地監控。每個目標物都會有被感測器覆蓋的等級需求，但同一時間並不需要所有感測器都開啟也能滿足需求。這篇論文主要研究感測器如何進行工作排程而達到節省能源與延長整體系統壽命的目的。傳統的方法多數是使用貪婪法則(Greedy)為主的啟發式(Heuristic)演算法來求解。這裡我們利用賽局理論(Game Theory)，由感測器自行選擇應該開啟電源，或者進行休眠節省電源。我們證明了定義的賽局可以收斂至穩定狀態，效能模擬實驗證實可以有效增加網路壽命。但賽局收斂至穩定狀態的時間必須視為一種成本，因此我們提出兩種方法使賽局更快達到穩定狀態。由實驗結果可得知快速達到穩定狀態只會使網路壽命稍微降低，效果非常好。 In wireless sensor network, there are several sensors and targets. All targets have to be monitored by sensors. Each target has a coverage level requirement. The targets can satisfy requirements by opening a part of the sensors. The paper research how to schedule the sensors. The power consumption can be reduced, and the network life time can be extended. The traditional methods almost use the greedy methods and the heuristic algorithms to solve the problem. In this paper, we employ Game Theory to solve it. The sensor selects whether to open the power or not. We prove that the game we defined can converge to a stable state, and the simulation result show it can extend the network life time. But the time that a game converges to a stable state has to be regarding as a cost. We propose two solutions to get the stable state more quickly. By simulation result, reaching stable state quickly leads to the little reduction of the network life time. The result is very good.

分散式無線感測器工作排程-使用賽局理論 = Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory
林, 哲民

分散式無線感測器工作排程-使用賽局理論 = Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory / 林哲民撰 - [高雄市] : 撰者, 民100. - 64葉 ; 圖，表格 ; 30公分.
參考書目：葉55.
無線感測網路Wireless sensor network

分散式無線感測器工作排程-使用賽局理論 = Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory
LDR:03025nam0a2200277 450 001 300432
005 20170214090656.0
009 300432
010 0 $b 精裝
010 0 $b 平裝
100 $a 20170214d2011 k y0chiy50 e
101 1 $a chi $d chi $d eng
102 $a tw
105 $a ak am 000yy
200 1 $a 分散式無線感測器工作排程-使用賽局理論 $d Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory $z eng $f 林哲民撰
210 $a [高雄市] $c 撰者 $d 民100
215 0 $a 64葉 $c 圖，表格 $d 30公分
300 $a 參考書目：葉55
314 $a 指導教授：嚴力行博士
328 $a 碩士論文--國立高雄大學資訊工程學系碩士班
330 $a 在無線感測網路中，存在數個感測器與目標物，目標物必須被感測器持續地監控。每個目標物都會有被感測器覆蓋的等級需求，但同一時間並不需要所有感測器都開啟也能滿足需求。這篇論文主要研究感測器如何進行工作排程而達到節省能源與延長整體系統壽命的目的。傳統的方法多數是使用貪婪法則(Greedy)為主的啟發式(Heuristic)演算法來求解。這裡我們利用賽局理論(Game Theory)，由感測器自行選擇應該開啟電源，或者進行休眠節省電源。我們證明了定義的賽局可以收斂至穩定狀態，效能模擬實驗證實可以有效增加網路壽命。但賽局收斂至穩定狀態的時間必須視為一種成本，因此我們提出兩種方法使賽局更快達到穩定狀態。由實驗結果可得知快速達到穩定狀態只會使網路壽命稍微降低，效果非常好。 In wireless sensor network, there are several sensors and targets. All targets have to be monitored by sensors. Each target has a coverage level requirement. The targets can satisfy requirements by opening a part of the sensors. The paper research how to schedule the sensors. The power consumption can be reduced, and the network life time can be extended. The traditional methods almost use the greedy methods and the heuristic algorithms to solve the problem. In this paper, we employ Game Theory to solve it. The sensor selects whether to open the power or not. We prove that the game we defined can converge to a stable state, and the simulation result show it can extend the network life time. But the time that a game converges to a stable state has to be regarding as a cost. We propose two solutions to get the stable state more quickly. By simulation result, reaching stable state quickly leads to the little reduction of the network life time. The result is very good.
510 1 $a Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory $z eng
610 0 $a 無線感測網路 $a 賽局理論 $a 潛力賽局
610 1 $a Wireless sensor network $a Game theory $a Potential game $a k-Coverage $a Coverage problem
681 $a 008M/0019 $b 464103 4457 $v 2007年版
700 1 $a 林 $b 哲民 $4 撰 $3 499971
712 0 2 $a 國立高雄大學 $b 資訊工程學系碩士班 $3 353878
801 0 $a tw $b NUK $c 20111102 $g CCR
856 7 $z 電子資源 $2 http $u http://handle.ncl.edu.tw/11296/ndltd/75909041669035496926