標題: 在蜂巢網路的物聯網通訊網路下之能量效益群組傳輸
Energy-Efficient Group Based Algorithm for Internet of Things in Cellular Networks
作者: 曾士華
黃經堯
Tseng, Shih-Hua
Huang, Ching-Yao
電子工程學系 電子研究所
關鍵字: 分群;物聯網;grouping;clustering;M2M;IOT
公開日期: 2016
摘要: 在網路通訊中,群組傳輸系統被廣泛用來解決降低能量消耗、資源分配以及提升服務品質等問題。在未來的物聯網網路通訊中,我們可以藉由分群演算法去尋找出適合的協調者達到較佳傳輸路徑。目前提出的演算法考慮了一種擁有群組傳輸也同時具備直接傳輸的複合式系統並且利用裝置的位置做結構式分群,每個裝置先根據環紋公式決定是否進行直接傳輸,不直接傳輸的裝置則利用演算法找到適合裝置的協調者,藉由每個裝置皆找到適合自己的傳輸路徑,進而使系統達到較佳的結果。在這篇論文中,由於裝置皆靠裝備的電池供應能量,所以主要關注的議題為系統的能量消耗,並且提出演算法解決之前的問題以及降低系統的能量消耗。另外,群組數量為分群演算法大難題之一,然而此演算法可令系統在分組的過程中自行收斂到一個特定的組數,此數依系統中的裝置數量以及裝置分布而定。
In the wireless communication network, group based system is used for energy saving, resource allocation and quality of service. In the internet of things network, we can use grouping algorithm to let the machine find the suitable coordinator by itself. We consider a hybrid system with direct transmission and group transmission and do hierarchical grouping based on the position of the devices. Each device decide if transmit data directly based on the ring pattern formulation. The devices which locate outside the ring will find the suitable coordinator by the grouping algorithm. With each devices finding the suitable transmission path, the system will get the better performance. In the thesis, each device consumes the energy which is provided by equipped battery. That means, the energy is limited, so we focus on the system energy consumption and propose the algorithm to solve the previous problem and reduce the system energy consumption. Further, the amount of the group is one of the major problems in grouping algorithm. However, the algorithm can let the system decide the exact group number by itself based on the number and distribution of devices.
URI: http://etd.lib.nctu.edu.tw/cdrfb3/record/nctu/#GT070250296
http://hdl.handle.net/11536/142040
Appears in Collections:Thesis