Loading…

Energy-delay tradeoffs for data collection in TDMA-based sensor networks

We consider a wireless sensor network where the nodes have limited energy. We first analyze the delay performance of a transmission scheme based on time division multiple access (TDMA). We propose a simple link scheduling algorithm to find the minimum-delay schedule given the slot lengths for all th...

Full description

Saved in:
Bibliographic Details
Main Authors: Shuguang Cui, Madan, R., Goldsmith, A., Lall, S.
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 3284 Vol. 5
container_issue
container_start_page 3278
container_title
container_volume 5
creator Shuguang Cui
Madan, R.
Goldsmith, A.
Lall, S.
description We consider a wireless sensor network where the nodes have limited energy. We first analyze the delay performance of a transmission scheme based on time division multiple access (TDMA). We propose a simple link scheduling algorithm to find the minimum-delay schedule given the slot lengths for all the links. We then combine these results with our previous work on energy-optimal cross-layer design to minimize the delay in transferring a fixed number of bits from the source nodes to the sink, in an energy-constrained manner. We also study the tradeoff between the total energy consumption and delay. Pareto optimal energy-delay curves are computed by solving a series of convex optimization problems where each objective function is a weighted sum of the delay and the total energy consumption. The computation is done for networks with and without link adaptation capabilities.
doi_str_mv 10.1109/ICC.2005.1495029
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1495029</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1495029</ieee_id><sourcerecordid>1495029</sourcerecordid><originalsourceid>FETCH-LOGICAL-i105t-5e57de51f2ea698ee4cec8a8e2dc9dc7ed90144d181a3f63e698602da6956e993</originalsourceid><addsrcrecordid>eNotkM1OwzAQhC1-JNrCHYmLX8Bh144T-1iFllYq4lLOlbHXKBASZEdCeXsi0dNIM9_MYRi7RygQwT7um6aQALrA0mqQ9oIt0Coj0Bh1yZZQG1BmNuqrOdAahKqgvmHLnD_nlrQKF2y36Sl9TCJQ5yY-JhdoiDHzOCQe3Oi4H7qO_NgOPW97fnx6WYt3lynwTH2eoZ7G3yF95Vt2HV2X6e6sK_a23RybnTi8Pu-b9UG0CHoUmnQdSGOU5CpriEpP3jhDMngbfE3BApZlQINOxUrRDFUgwwzriqxVK_bwv9sS0ekntd8uTafzA-oPsntNlA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Energy-delay tradeoffs for data collection in TDMA-based sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Shuguang Cui ; Madan, R. ; Goldsmith, A. ; Lall, S.</creator><creatorcontrib>Shuguang Cui ; Madan, R. ; Goldsmith, A. ; Lall, S.</creatorcontrib><description>We consider a wireless sensor network where the nodes have limited energy. We first analyze the delay performance of a transmission scheme based on time division multiple access (TDMA). We propose a simple link scheduling algorithm to find the minimum-delay schedule given the slot lengths for all the links. We then combine these results with our previous work on energy-optimal cross-layer design to minimize the delay in transferring a fixed number of bits from the source nodes to the sink, in an energy-constrained manner. We also study the tradeoff between the total energy consumption and delay. Pareto optimal energy-delay curves are computed by solving a series of convex optimization problems where each objective function is a weighted sum of the delay and the total energy consumption. The computation is done for networks with and without link adaptation capabilities.</description><identifier>ISSN: 1550-3607</identifier><identifier>ISBN: 0780389387</identifier><identifier>ISBN: 9780780389380</identifier><identifier>EISSN: 1938-1883</identifier><identifier>DOI: 10.1109/ICC.2005.1495029</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cross layer design ; Delay ; Energy consumption ; Hardware ; Intelligent networks ; Performance analysis ; Routing ; Scheduling algorithm ; Time division multiple access ; Wireless sensor networks</subject><ispartof>IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005, Vol.5, p.3278-3284 Vol. 5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1495029$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1495029$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Shuguang Cui</creatorcontrib><creatorcontrib>Madan, R.</creatorcontrib><creatorcontrib>Goldsmith, A.</creatorcontrib><creatorcontrib>Lall, S.</creatorcontrib><title>Energy-delay tradeoffs for data collection in TDMA-based sensor networks</title><title>IEEE International Conference on Communications, 2005. ICC 2005. 2005</title><addtitle>ICC</addtitle><description>We consider a wireless sensor network where the nodes have limited energy. We first analyze the delay performance of a transmission scheme based on time division multiple access (TDMA). We propose a simple link scheduling algorithm to find the minimum-delay schedule given the slot lengths for all the links. We then combine these results with our previous work on energy-optimal cross-layer design to minimize the delay in transferring a fixed number of bits from the source nodes to the sink, in an energy-constrained manner. We also study the tradeoff between the total energy consumption and delay. Pareto optimal energy-delay curves are computed by solving a series of convex optimization problems where each objective function is a weighted sum of the delay and the total energy consumption. The computation is done for networks with and without link adaptation capabilities.</description><subject>Cross layer design</subject><subject>Delay</subject><subject>Energy consumption</subject><subject>Hardware</subject><subject>Intelligent networks</subject><subject>Performance analysis</subject><subject>Routing</subject><subject>Scheduling algorithm</subject><subject>Time division multiple access</subject><subject>Wireless sensor networks</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>0780389387</isbn><isbn>9780780389380</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotkM1OwzAQhC1-JNrCHYmLX8Bh144T-1iFllYq4lLOlbHXKBASZEdCeXsi0dNIM9_MYRi7RygQwT7um6aQALrA0mqQ9oIt0Coj0Bh1yZZQG1BmNuqrOdAahKqgvmHLnD_nlrQKF2y36Sl9TCJQ5yY-JhdoiDHzOCQe3Oi4H7qO_NgOPW97fnx6WYt3lynwTH2eoZ7G3yF95Vt2HV2X6e6sK_a23RybnTi8Pu-b9UG0CHoUmnQdSGOU5CpriEpP3jhDMngbfE3BApZlQINOxUrRDFUgwwzriqxVK_bwv9sS0ekntd8uTafzA-oPsntNlA</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Shuguang Cui</creator><creator>Madan, R.</creator><creator>Goldsmith, A.</creator><creator>Lall, S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>Energy-delay tradeoffs for data collection in TDMA-based sensor networks</title><author>Shuguang Cui ; Madan, R. ; Goldsmith, A. ; Lall, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i105t-5e57de51f2ea698ee4cec8a8e2dc9dc7ed90144d181a3f63e698602da6956e993</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Cross layer design</topic><topic>Delay</topic><topic>Energy consumption</topic><topic>Hardware</topic><topic>Intelligent networks</topic><topic>Performance analysis</topic><topic>Routing</topic><topic>Scheduling algorithm</topic><topic>Time division multiple access</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Shuguang Cui</creatorcontrib><creatorcontrib>Madan, R.</creatorcontrib><creatorcontrib>Goldsmith, A.</creatorcontrib><creatorcontrib>Lall, S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shuguang Cui</au><au>Madan, R.</au><au>Goldsmith, A.</au><au>Lall, S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Energy-delay tradeoffs for data collection in TDMA-based sensor networks</atitle><btitle>IEEE International Conference on Communications, 2005. ICC 2005. 2005</btitle><stitle>ICC</stitle><date>2005</date><risdate>2005</risdate><volume>5</volume><spage>3278</spage><epage>3284 Vol. 5</epage><pages>3278-3284 Vol. 5</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><isbn>0780389387</isbn><isbn>9780780389380</isbn><abstract>We consider a wireless sensor network where the nodes have limited energy. We first analyze the delay performance of a transmission scheme based on time division multiple access (TDMA). We propose a simple link scheduling algorithm to find the minimum-delay schedule given the slot lengths for all the links. We then combine these results with our previous work on energy-optimal cross-layer design to minimize the delay in transferring a fixed number of bits from the source nodes to the sink, in an energy-constrained manner. We also study the tradeoff between the total energy consumption and delay. Pareto optimal energy-delay curves are computed by solving a series of convex optimization problems where each objective function is a weighted sum of the delay and the total energy consumption. The computation is done for networks with and without link adaptation capabilities.</abstract><pub>IEEE</pub><doi>10.1109/ICC.2005.1495029</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1550-3607
ispartof IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005, Vol.5, p.3278-3284 Vol. 5
issn 1550-3607
1938-1883
language eng
recordid cdi_ieee_primary_1495029
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Cross layer design
Delay
Energy consumption
Hardware
Intelligent networks
Performance analysis
Routing
Scheduling algorithm
Time division multiple access
Wireless sensor networks
title Energy-delay tradeoffs for data collection in TDMA-based sensor networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T05%3A54%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Energy-delay%20tradeoffs%20for%20data%20collection%20in%20TDMA-based%20sensor%20networks&rft.btitle=IEEE%20International%20Conference%20on%20Communications,%202005.%20ICC%202005.%202005&rft.au=Shuguang%20Cui&rft.date=2005&rft.volume=5&rft.spage=3278&rft.epage=3284%20Vol.%205&rft.pages=3278-3284%20Vol.%205&rft.issn=1550-3607&rft.eissn=1938-1883&rft.isbn=0780389387&rft.isbn_list=9780780389380&rft_id=info:doi/10.1109/ICC.2005.1495029&rft_dat=%3Cieee_6IE%3E1495029%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i105t-5e57de51f2ea698ee4cec8a8e2dc9dc7ed90144d181a3f63e698602da6956e993%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1495029&rfr_iscdi=true