Energy efficient geographic routing algorithms in wireless sensor network

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系 > 期刊論文 > Item 987654321/106704

請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106704

題名:	Energy efficient geographic routing algorithms in wireless sensor network
作者:	陳增益;CHEN, TSENG-YI;WEI, HSIN-WEN;LEE, CHE-RUNG;HUANG, FU-NAN;HSU, TASN-SHENG;SHIH, WEI-KUAN
貢獻者:	資訊電機學院資訊工程學系
關鍵詞:	Algorithms;Complexity;Energy consumption;Energy efficiency;Interference;Power consumption;Power efficiency;Remote sensors;Sensors;Wireless networks;Wireless sensor networks
日期:	2013-01-01
上傳時間:	2026-04-23 13:37:03 (UTC+8)
出版者:	World Scientific Publishing Co. Pte Ltd;Singapore: World Scientific Publishing Company
摘要:	摘要： Over the past decade, energy efficiency has consistently been a critical research topic in the field of wireless sensor networks. In wireless networks, signal interference often leads to power waste in a sensor node. Several SINR-based routing algorithms designed for energy efficiency or interference avoidance had been proposed. However, they are either too complex to be useful in practices or may slow in routing computation speed. In this paper, two energy efficient geographic routing algorithms (EEGRA) for wireless sensor network are proposed to address the power consumption issue while considering the routing computation speed. The first algorithm take the value of interference into the routing cost function, and uses it in the routing decision. The second algorithm transforms the problem into a constrained optimization problem, and solves it by searching the optimal discretized interference level. We adopt four geographic routing algorithms: GOAFR+, Face Routing, GPSR, and RandHT, in EEGRA algorithms and compare them with three other routing methods in terms of power consumption and computation cost for the grid and irregular sensor topologies. The experimental result shows that the EEGRA algorithms reduce energy consumption by 30–50% comparing to geographic routing methods. In addition, the time complexity of EEGRA algorithms is similar to the geographic greedy routing methods, which is much faster than the optimal SINR-based algorithm. 出版者： Singapore: World Scientific Publishing Company 出版日期： 2013-03 出處： Journal of interconnection networks, 2013-03, Vol.14 (1), p.1350001 版權： 2013, World Scientific Publishing Company 版權： 2013. World Scientific Publishing Company 識別號： ISSN: 0219-2659 識別號： EISSN: 1793-6713 識別號： DOI: 10.1142/S0219265913500011
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	11	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....