抄録
Analyzing each constituent task involved in wireless sensor network image compression and communication processes revealed a considerable difference in energy consumption rates among these tasks, shortening the network lifetime, which is defined as the time interval to the death of the first sensor node. To overcome this problem, we proposed an adaptive transmission range assignment algorithm for in-routing image compression (ARIC) for wireless sensor networks. ARIC uses collaborative image compression to distribute the computational cost among the sensor nodes involved in routing paths between source nodes and base stations. T he energy distribution involved in ARIC is formulated here as a mathematical optimization problem that can be mapped to a 0-1 Multiple Choice Knapsack Problem (0-1 MCKP); we then present a dynamic programming method to solve for the optimization solution. T his method allows the source sensor nodes to dynamically assign compression and communication tasks to appropriate sensor nodes according to their residual energy. To verify ARIC's efficacy, we then conducted computational experiments on the optimization problem; these show that ARIC effectively balances the total energy consumption among sensor nodes thereby increasing the overall network lifetime.
| 元の言語 | English |
|---|---|
| ホスト出版物のタイトル | ICCE 2010 - 3rd International Conference on Communications and Electronics |
| ページ | 18-23 |
| ページ数 | 6 |
| DOI | |
| 出版物ステータス | Published - 2010 |
| イベント | 3rd International Conference on Communications and Electronics, ICCE 2010 - Nha Trang 継続期間: 2010 8 11 → 2010 8 13 |
Other
| Other | 3rd International Conference on Communications and Electronics, ICCE 2010 |
|---|---|
| 市 | Nha Trang |
| 期間 | 10/8/11 → 10/8/13 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
これを引用
Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks. / Tran-Quang, Vinh; Huu, Phat Nguyen; Miyoshi, Takumi.
ICCE 2010 - 3rd International Conference on Communications and Electronics. 2010. p. 18-23 5670674.研究成果: Conference contribution
}
TY - GEN
T1 - Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks
AU - Tran-Quang, Vinh
AU - Huu, Phat Nguyen
AU - Miyoshi, Takumi
PY - 2010
Y1 - 2010
N2 - Analyzing each constituent task involved in wireless sensor network image compression and communication processes revealed a considerable difference in energy consumption rates among these tasks, shortening the network lifetime, which is defined as the time interval to the death of the first sensor node. To overcome this problem, we proposed an adaptive transmission range assignment algorithm for in-routing image compression (ARIC) for wireless sensor networks. ARIC uses collaborative image compression to distribute the computational cost among the sensor nodes involved in routing paths between source nodes and base stations. T he energy distribution involved in ARIC is formulated here as a mathematical optimization problem that can be mapped to a 0-1 Multiple Choice Knapsack Problem (0-1 MCKP); we then present a dynamic programming method to solve for the optimization solution. T his method allows the source sensor nodes to dynamically assign compression and communication tasks to appropriate sensor nodes according to their residual energy. To verify ARIC's efficacy, we then conducted computational experiments on the optimization problem; these show that ARIC effectively balances the total energy consumption among sensor nodes thereby increasing the overall network lifetime.
AB - Analyzing each constituent task involved in wireless sensor network image compression and communication processes revealed a considerable difference in energy consumption rates among these tasks, shortening the network lifetime, which is defined as the time interval to the death of the first sensor node. To overcome this problem, we proposed an adaptive transmission range assignment algorithm for in-routing image compression (ARIC) for wireless sensor networks. ARIC uses collaborative image compression to distribute the computational cost among the sensor nodes involved in routing paths between source nodes and base stations. T he energy distribution involved in ARIC is formulated here as a mathematical optimization problem that can be mapped to a 0-1 Multiple Choice Knapsack Problem (0-1 MCKP); we then present a dynamic programming method to solve for the optimization solution. T his method allows the source sensor nodes to dynamically assign compression and communication tasks to appropriate sensor nodes according to their residual energy. To verify ARIC's efficacy, we then conducted computational experiments on the optimization problem; these show that ARIC effectively balances the total energy consumption among sensor nodes thereby increasing the overall network lifetime.
UR - http://www.scopus.com/inward/record.url?scp=78751493648&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78751493648&partnerID=8YFLogxK
U2 - 10.1109/ICCE.2010.5670674
DO - 10.1109/ICCE.2010.5670674
M3 - Conference contribution
AN - SCOPUS:78751493648
SN - 9781424470587
SP - 18
EP - 23
BT - ICCE 2010 - 3rd International Conference on Communications and Electronics
ER -