Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. T...
Saved in:
| Published in: | IEEE/ACM transactions on networking Vol. 20; no. 4; pp. 1054 - 1067 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.08.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 1063-6692, 1558-2566 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing some theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon two key intermediate results. In the first result, we show that a time-dependent joint base station movement and flow routing problem can be transformed into a location-dependent problem. In the second result, we show that, for (1- \varepsilon) optimality, the infinite possible locations for base station movement can be reduced to a finite set of locations via several constructive steps [i.e., discretization of energy cost through a geometric sequence, division of a disk into a finite number of subareas, and representation of each subarea with a fictitious cost point (FCP)]. Subsequently, for each FCP, we can obtain the optimal sojourn time for the base station (as well as the corresponding location-dependent flow routing) via a simple linear program. We prove that the proposed solution can guarantee the achieved network lifetime is at least (1- \varepsilon) of the maximum (unknown) network lifetime, where \varepsilon can be made arbitrarily small depending on the required precision. |
|---|---|
| AbstractList | The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing some theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon two key intermediate results. In the first result, we show that a time-dependent joint base station movement and flow routing problem can be transformed into a location-dependent problem. In the second result, we show that, for (1- \varepsilon) optimality, the infinite possible locations for base station movement can be reduced to a finite set of locations via several constructive steps [i.e., discretization of energy cost through a geometric sequence, division of a disk into a finite number of subareas, and representation of each subarea with a fictitious cost point (FCP)]. Subsequently, for each FCP, we can obtain the optimal sojourn time for the base station (as well as the corresponding location-dependent flow routing) via a simple linear program. We prove that the proposed solution can guarantee the achieved network lifetime is at least (1- \varepsilon) of the maximum (unknown) network lifetime, where \varepsilon can be made arbitrarily small depending on the required precision. The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing some theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon two key intermediate results. In the first result, we show that a time-dependent joint base station movement and flow routing problem can be transformed into a location-dependent problem. In the second result, we show that, for [Formula Omitted] optimality, the infinite possible locations for base station movement can be reduced to a finite set of locations via several constructive steps [i.e., discretization of energy cost through a geometric sequence, division of a disk into a finite number of subareas, and representation of each subarea with a fictitious cost point (FCP)]. Subsequently, for each FCP, we can obtain the optimal sojourn time for the base station (as well as the corresponding location-dependent flow routing) via a simple linear program. We prove that the proposed solution can guarantee the achieved network lifetime is at least [Formula Omitted] of the maximum (unknown) network lifetime, where [Formula Omitted] can be made arbitrarily small depending on the required precision. The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing some theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon two key intermediate results. In the first result, we show that a time-dependent joint base station movement and flow routing problem can be transformed into a location-dependent problem. In the second result, we show that, for ( 1 - epsilon ) optimality, the infinite possible locations for base station movement can be reduced to a finite set of locations via several constructive steps [i.e., discretization of energy cost through a geometric sequence, division of a disk into a finite number of subareas, and representation of each subarea with a fictitious cost point (FCP)]. Subsequently, for each FCP, we can obtain the optimal sojourn time for the base station (as well as the corresponding location-dependent flow routing) via a simple linear program. We prove that the proposed solution can guarantee the achieved network lifetime is at least ( 1 - epsilon ) of the maximum (unknown) network lifetime, where epsilon can be made arbitrarily small depending on the required precision. |
| Author | Shi, Yi Hou, Y. Thomas |
| Author_xml | – sequence: 1 givenname: Yi surname: Shi fullname: Shi, Yi organization: Bradley Dept. of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA – sequence: 2 givenname: Y. Thomas surname: Hou fullname: Hou, Y. Thomas organization: Bradley Dept. of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA |
| BookMark | eNp9kE1LxDAQhoOs4OcPEC8BL166ZpI0TY4quyqsH7irHkvanUK1bTRpFf-9WVY87MG5zAw87zA8e2TUuQ4JOQI2BmDmbHE3WYw5AxhzyMAYtkV2IU11wlOlRnFmSiRKGb5D9kJ4ZQwE42qXPM9di3Q6dEvbYtfbhj5iGJo-UNfRCxuQznvb13G5dZ-4QuiDd0WDLa2cpy-1xwZDoHPsQtzvsP9y_i0ckO3KNgEPf_s-eZpOFpfXyez-6ubyfJaUgqs-UbKyUgvADIpYtjTSwNIuM1MKKKXmlTUCC15oYxAUSK0rW_DMCqE5l1Lsk9P13XfvPgYMfd7WocSmsR26IeQAQolMG6EjerKBvrrBd_G7HJiQkqeSs0hla6r0LgSPVV7WawG9t3UT0XzlO1_5zle-81_fMQkbyXdft9Z__5s5XmdqRPzjFVOaq1T8ABuWjOU |
| CODEN | IEANEP |
| CitedBy_id | crossref_primary_10_1109_TVT_2016_2625806 crossref_primary_10_1007_s42045_019_00025_7 crossref_primary_10_1016_j_comnet_2014_08_020 crossref_primary_10_1109_JSAC_2015_2391631 crossref_primary_10_1109_TMC_2016_2603152 crossref_primary_10_3390_s17081881 crossref_primary_10_1109_TMC_2014_2307335 crossref_primary_10_1007_s11276_017_1539_5 crossref_primary_10_1109_JSAC_2015_2391689 crossref_primary_10_1109_TVT_2015_2391119 crossref_primary_10_3390_s150101676 crossref_primary_10_1007_s11277_013_1119_7 crossref_primary_10_1016_j_comnet_2018_05_029 crossref_primary_10_1109_COMST_2015_2388779 crossref_primary_10_1109_TNET_2017_2684159 crossref_primary_10_1155_2012_902862 crossref_primary_10_3390_s18092913 crossref_primary_10_3390_s20236954 crossref_primary_10_1109_TNET_2014_2303979 crossref_primary_10_1007_s12083_016_0496_6 crossref_primary_10_1007_s11036_015_0603_6 crossref_primary_10_1007_s11277_017_3991_z crossref_primary_10_15406_iratj_2017_02_00040 crossref_primary_10_1109_ACCESS_2019_2925423 |
| Cites_doi | 10.1007/BFb0038202 10.1145/1030194.1015484 10.1109/INFCOM.2001.916634 10.1109/INFOCOM.2008.9 10.1109/ICC.2006.255617 10.1145/1614379.1614384 10.1109/ROBOT.2002.1014697 10.1109/TNET.2009.2033472 10.1109/INFCOM.2005.1498454 10.1109/71.969123 10.1109/ICBN.2005.1589677 10.1109/98.878532 10.1145/938985.939015 10.1145/1374618.1374650 10.1109/49.779917 10.1109/GLOCOM.2003.1258265 10.1145/501416.501434 10.1109/INFCOM.2004.1356995 10.1109/VETECF.2003.1286165 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2012 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2012 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TNET.2011.2171990 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2566 |
| EndPage | 1067 |
| ExternalDocumentID | 2740344921 10_1109_TNET_2011_2171990 6068265 |
| Genre | orig-research |
| GroupedDBID | -DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c326t-64fa4831e71bbbbac9491dad79c31c482fa93eb2b899e161488fab27a33822443 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 29 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000307895100006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1063-6692 |
| IngestDate | Thu Oct 02 06:52:11 EDT 2025 Sun Nov 30 04:49:44 EST 2025 Sat Nov 29 03:05:16 EST 2025 Tue Nov 18 22:13:15 EST 2025 Tue Aug 26 17:02:34 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c326t-64fa4831e71bbbbac9491dad79c31c482fa93eb2b899e161488fab27a33822443 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 1034425420 |
| PQPubID | 32020 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_6068265 proquest_journals_1034425420 crossref_citationtrail_10_1109_TNET_2011_2171990 proquest_miscellaneous_1136378938 crossref_primary_10_1109_TNET_2011_2171990 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-08-01 |
| PublicationDateYYYYMMDD | 2012-08-01 |
| PublicationDate_xml | – month: 08 year: 2012 text: 2012-08-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE/ACM transactions on networking |
| PublicationTitleAbbrev | TNET |
| PublicationYear | 2012 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref12 ref15 ref14 luo (ref10) 2010; 18 ref2 ref1 ref17 ref16 ref18 singh (ref19) 1998 chang (ref3) 2000 zhao (ref26) 2005 ref24 ref23 heinzelman (ref7) 2000 ref25 ref20 ref22 ref21 rappaport (ref13) 1996 ref8 ref9 luo (ref11) 2010 ref6 ref5 (ref4) 2005 |
| References_xml | – ident: ref23 doi: 10.1007/BFb0038202 – year: 2005 ident: ref4 publication-title: DARPA Grand Challenge – ident: ref8 doi: 10.1145/1030194.1015484 – start-page: 181 year: 1998 ident: ref19 article-title: Power-aware routing in mobile ad hoc networks publication-title: Proc ACM MobiCom – start-page: 553 year: 2010 ident: ref11 publication-title: Theoretical Aspects of Distributed Computing in Sensor Networks – year: 1996 ident: ref13 publication-title: Wireless Communications Principles and Practice – ident: ref22 doi: 10.1109/INFCOM.2001.916634 – ident: ref17 doi: 10.1109/INFOCOM.2008.9 – year: 2000 ident: ref7 publication-title: Application-specific protocol architectures for wireless networks – ident: ref1 doi: 10.1109/ICC.2006.255617 – ident: ref16 doi: 10.1145/1614379.1614384 – ident: ref18 doi: 10.1109/ROBOT.2002.1014697 – volume: 18 start-page: 871 year: 2010 ident: ref10 article-title: Joint sink mobility and routing to maximize the lifetime of wireless sensor networks: The case of constrained mobility publication-title: IEEE/ACM Trans Netw doi: 10.1109/TNET.2009.2033472 – ident: ref9 doi: 10.1109/INFCOM.2005.1498454 – ident: ref21 doi: 10.1109/71.969123 – ident: ref5 doi: 10.1109/ICBN.2005.1589677 – ident: ref20 doi: 10.1109/98.878532 – ident: ref12 doi: 10.1145/938985.939015 – start-page: 1407 year: 2005 ident: ref26 article-title: Controlling the mobility of multiple data transport ferries in a delay-tolerant network publication-title: Proc IEEE InfoCom – ident: ref24 doi: 10.1145/1374618.1374650 – ident: ref14 doi: 10.1109/49.779917 – start-page: 22 year: 2000 ident: ref3 article-title: Energy conserving routing in wireless ad-hoc networks publication-title: Proc IEEE InfoCom – ident: ref6 doi: 10.1109/GLOCOM.2003.1258265 – ident: ref2 doi: 10.1145/501416.501434 – ident: ref15 doi: 10.1109/INFCOM.2004.1356995 – ident: ref25 doi: 10.1109/VETECF.2003.1286165 |
| SSID | ssj0013026 |
| Score | 2.2413602 |
| Snippet | The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1054 |
| SubjectTerms | Algorithms Approximation algorithm Base stations Computer networks Energy consumption lifetime Mathematical analysis mobile base station Mobile communication Mobile computing Movement Networks Operations research Optimization Robot sensing systems Routing Routing (telecommunications) sensor networks Sensors Stations Studies theory |
| Title | Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks |
| URI | https://ieeexplore.ieee.org/document/6068265 https://www.proquest.com/docview/1034425420 https://www.proquest.com/docview/1136378938 |
| Volume | 20 |
| WOSCitedRecordID | wos000307895100006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS-QwEB5UfDgf_C23dyoRfJLr2TRp0zzeiYsvLuKuh28lTadwsNeK7fr3O0nqKngI9qmlSVoyzcw3nck3AKdxajBRmkfO-EYSS9KDBIuiitBoVkub2tT4YhNqMsnv7_XNCvxY7oVBRJ98hj_dqY_lV61duF9l5wS2CQ2nq7CqlAp7tV4jBrEvrUYejoiyTCdDBJPH-nw2uZwFsk7C39yr3zc2yBdVeaeJvXkZb33uxbZhc4CR7FeQ-w6sYLMLG2_IBffgz7T9h2zsdnoEAn92i91i3nesbdhvMl5sGsLw7Lr1pOE9uwnVZRgBWebSYuekBtmUHF26noR88W4f7saXs4uraKiiEFmCZn2UydrIXHBUvKTDWC01r0yltBXcyjypjRbkX5fkeSF3vKB5bcpEGXJeyb5LcQBrTdvgV2A20xVXOcal5tJIYWqBmajzquJxjXk6gvhlXgs7UIy7ShfzwrsasS6cKAonimIQxQjOll0eAr_GR4333NwvGw7TPoLDF-EVwwrsaBAhSR_JhHqdLG_T2nEBEdNgu6A2XGRCEWLLv_1_5O_whZ6fhIS_Q1jrHxd4BOv2qf_bPR77D_AZe2fX1w |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED-VgcR44GtMdAxmpD0hwuLY-fAjoFZFa6OJdmhvkeNcpEldgpaUv39nOyuVQEjkKVHsyPLZd7_LnX8HcBrGGqNU8cAa30BiSXqQYFFQERpNamliE2tXbCLN8-zqSl2M4OP2LAwiuuQz_GRvXSy_as3G_io7I7BNaDh-AA9jKSPuT2v9jhmErrga-TgiSBIVDTFMHqqzVT5ZebpOQuDcKeAdK-TKqvyhi52BmT77v6E9h6cDkGSfveRfwAibl_Bkh17wAH4s2xtkU3vWw1P4s-_YbdZ9x9qGfSHzxZY-EM8WraMN79mFry_DCMoymxi7JkXIluTq0nPuM8a7V3A5nay-zoKhjkJgCJz1QSJrLTPBMeUlXdooqXilq1QZwY3MolorQR52Sb4XcssMmtW6jFJN7itZeCkOYa9pG3wNzCSq4mmGYam41FLoWmAi6qyqeFhjFo8hvJ_Xwgwk47bWxbpwzkaoCiuKwoqiGEQxhg_bLj89w8a_Gh_Yud82HKZ9DMf3wiuGPdjRRwStklhG1Ov99jXtHhsS0Q22G2rDRSJSwmzZ0d-_fAKPZ6vFvJh_y8_fwD6NJfLpf8ew199u8C08Mr_66-72nVuMd9yL2x4 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Some+Fundamental+Results+on+Base+Station+Movement+Problem+for+Wireless+Sensor+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Shi%2C+Yi&rft.au=Hou%2C+Y.+Thomas&rft.date=2012-08-01&rft.pub=IEEE&rft.issn=1063-6692&rft.volume=20&rft.issue=4&rft.spage=1054&rft.epage=1067&rft_id=info:doi/10.1109%2FTNET.2011.2171990&rft.externalDocID=6068265 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon |