File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 1336 -
dc.citation.number 4 -
dc.citation.startPage 1325 -
dc.citation.title IEEE-ACM TRANSACTIONS ON NETWORKING -
dc.citation.volume 22 -
dc.contributor.author Sinha, Prasun -
dc.contributor.author Shroff, Ness B -
dc.contributor.author Chen, Shengbo -
dc.contributor.author Joo, Changhee -
dc.date.accessioned 2023-12-22T02:16:08Z -
dc.date.available 2023-12-22T02:16:08Z -
dc.date.created 2014-09-24 -
dc.date.issued 2014-08 -
dc.description.abstract In this paper, we investigate the utility maximization problem for a sensor network with energy replenishment. Each sensor node consumes energy in its battery to generate and deliver data to its destination via multihop communications. Although the battery can be replenished from renewable energy sources, the energy allocation should be carefully designed in order to maximize system performance, especially when the replenishment profile is unknown in advance. In this paper, we address the joint problem of energy allocation and routing to maximize the total system utility, without prior knowledge of the replenishment profile. We first characterize optimal throughput of a single node under general replenishment profile and extend our idea to the multihop network case. After characterizing the optimal network utility with an upper bound, we develop a low-complexity online solution that achieves asymptotic optimality. Focusing on long-term system performance, we can greatly simplify computational complexity while maintaining high performance. We also show that our solution can be approximated by a distributed algorithm using standard optimization techniques. In addition, we show that the required battery size O(in(1/xi))is to constrain the performance of our scheme within xi-neighborhood of the optimum. Through simulations with replenishment profile traces for solar and wind energy, we numerically evaluate our solution, which outperforms a state-of-the-art scheme that is developed based on the Lyapunov optimization technique. -
dc.identifier.bibliographicCitation IEEE-ACM TRANSACTIONS ON NETWORKING, v.22, no.4, pp.1325 - 1336 -
dc.identifier.doi 10.1109/TNET.2013.2273830 -
dc.identifier.issn 1063-6692 -
dc.identifier.scopusid 2-s2.0-84907599613 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/6410 -
dc.identifier.url http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84907599613 -
dc.identifier.wosid 000340944200023 -
dc.language 영어 -
dc.publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC -
dc.title A Simple Asymptotically Optimal Joint Energy Allocation and Routing Scheme in Rechargeable Sensor Networks -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Hardware & Architecture; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Telecommunications -
dc.relation.journalResearchArea Computer Science; Engineering; Telecommunications -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.