Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks

Vinh Tran-Quang, Phat Nguyen Huu, Takumi Miyoshi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationICCE 2010 - 3rd International Conference on Communications and Electronics
Pages18-23
Number of pages6
DOIs
Publication statusPublished - 2010
Event3rd International Conference on Communications and Electronics, ICCE 2010 - Nha Trang
Duration: 2010 Aug 112010 Aug 13

Other

Other3rd International Conference on Communications and Electronics, ICCE 2010
CityNha Trang
Period10/8/1110/8/13

Fingerprint

Image compression
Wireless sensor networks
Sensor nodes
Energy utilization
Communication
Dynamic programming
Base stations
Costs
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Tran-Quang, V., Huu, P. N., & Miyoshi, T. (2010). Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks. In ICCE 2010 - 3rd International Conference on Communications and Electronics (pp. 18-23). [5670674] https://doi.org/10.1109/ICCE.2010.5670674

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.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tran-Quang, V, Huu, PN & Miyoshi, T 2010, Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks. in ICCE 2010 - 3rd International Conference on Communications and Electronics., 5670674, pp. 18-23, 3rd International Conference on Communications and Electronics, ICCE 2010, Nha Trang, 10/8/11. https://doi.org/10.1109/ICCE.2010.5670674
Tran-Quang V, Huu PN, Miyoshi T. Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks. In ICCE 2010 - 3rd International Conference on Communications and Electronics. 2010. p. 18-23. 5670674 https://doi.org/10.1109/ICCE.2010.5670674
Tran-Quang, Vinh ; Huu, Phat Nguyen ; Miyoshi, Takumi. / Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks. ICCE 2010 - 3rd International Conference on Communications and Electronics. 2010. pp. 18-23
@inproceedings{70b1ab3b65184f86b4760e6ac1f3bd15,
title = "Adaptive transmission range assignment algorithm for in-routing image compression on wireless sensor networks",
abstract = "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.",
author = "Vinh Tran-Quang and Huu, {Phat Nguyen} and Takumi Miyoshi",
year = "2010",
doi = "10.1109/ICCE.2010.5670674",
language = "English",
isbn = "9781424470587",
pages = "18--23",
booktitle = "ICCE 2010 - 3rd International Conference on Communications and Electronics",

}

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

SN - 9781424470587

SP - 18

EP - 23

BT - ICCE 2010 - 3rd International Conference on Communications and Electronics

ER -