Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks

Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the sum of the transmit powers of all the sensors is minimum subject to the constraint that the resulting topology containing only bidirectional links is strongly connected....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization Jg. 30; H. 4; S. 1077 - 1094
Hauptverfasser:	Panda, B. S., Pushparaj Shetty, D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2015
Schlagworte:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Wireless sensor network NP-hard APX-hard Topology control problem Approximation algorithm Transmission power assignment Graph algorithm
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the sum of the transmit powers of all the sensors is minimum subject to the constraint that the resulting topology containing only bidirectional links is strongly connected. This problem is known to be NP-hard. However, most of the wireless sensor networks are hierarchical in nature, where shorter path lengths are preferred for communication between any two nodes. Given a set of sensors and a specified sensor, say r , the strong minimum energy 2 -hop rooted topology problem ( 2 h-SMERT) is to assign transmit power to each sensor such that the sum of the transmit powers of all the sensors is minimum subject to the constraints that the resulting topology containing only bidirectional links is strongly connected and the length of the path from r to any other node is at most 2 . We prove that the 2 h-SMERT problem is NP-hard. We also prove that 2 h-SMERT problem is APX-hard. We then show that 2 h-SMERT problem is not approximable within a factor of 1 2 ( 1 - ϵ ) ln n unless NP ⊆ D T I M E ( n log log n ) . On the positive side, we propose a 2 ( 1 + ln n ) -approximation algorithm for the 2 h-SMERT problem. We also study two special cases of the 2 h-SMERT problem, namely, the d -rest- 2 h-SMERT problem and the k -int- 2 h-SMERT problem. We propose a 2 ( 1 + ln d ) -approximation algorithm for the d -rest- 2 h-SMERT problem. The k -int- 2 h-SMERT problem is NP-hard for arbitrary k . However, for fixed constant k , we propose a k + 1 2 -approximation algorithm for the k -int- 2 h-SMERT problem and obtain a polynomial time optimal algorithm for the k -int- 2 h-SMERT problem for k = 2 .
AbstractList	Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the sum of the transmit powers of all the sensors is minimum subject to the constraint that the resulting topology containing only bidirectional links is strongly connected. This problem is known to be NP-hard. However, most of the wireless sensor networks are hierarchical in nature, where shorter path lengths are preferred for communication between any two nodes. Given a set of sensors and a specified sensor, say r , the strong minimum energy 2 -hop rooted topology problem ( 2 h-SMERT) is to assign transmit power to each sensor such that the sum of the transmit powers of all the sensors is minimum subject to the constraints that the resulting topology containing only bidirectional links is strongly connected and the length of the path from r to any other node is at most 2 . We prove that the 2 h-SMERT problem is NP-hard. We also prove that 2 h-SMERT problem is APX-hard. We then show that 2 h-SMERT problem is not approximable within a factor of 1 2 ( 1 - ϵ ) ln n unless NP ⊆ D T I M E ( n log log n ) . On the positive side, we propose a 2 ( 1 + ln n ) -approximation algorithm for the 2 h-SMERT problem. We also study two special cases of the 2 h-SMERT problem, namely, the d -rest- 2 h-SMERT problem and the k -int- 2 h-SMERT problem. We propose a 2 ( 1 + ln d ) -approximation algorithm for the d -rest- 2 h-SMERT problem. The k -int- 2 h-SMERT problem is NP-hard for arbitrary k . However, for fixed constant k , we propose a k + 1 2 -approximation algorithm for the k -int- 2 h-SMERT problem and obtain a polynomial time optimal algorithm for the k -int- 2 h-SMERT problem for k = 2 .
Author	Panda, B. S. Pushparaj Shetty, D.
Author_xml	– sequence: 1 givenname: B. S. surname: Panda fullname: Panda, B. S. email: bspanda@maths.iitd.ac.in organization: Computer Science and Applications Group, Department of Mathematics, Indian Institute of Technology Delhi – sequence: 2 givenname: D. surname: Pushparaj Shetty fullname: Pushparaj Shetty, D. organization: Computer Science and Applications Group, Department of Mathematics, Indian Institute of Technology Delhi
BookMark	eNotkNtqAjEYhEOxULV9gN7lBdL-Oe0ml0V6EIRetF6HGP_VtWsiyYrUp--KvZphBmbgm5BRTBEJeeTwxAHq58LB1IYBl8xWRrLzDRlzXUsmjKlGg5dGsMqCviOTUnYAMHg1JsuvPqe4ofs2tvvjnmLEvPmlgm3TgeaUelzTPh1Sl4a0SZluW8w-h20bfEdPbcYOS6EFYxnKiP0p5Z9yT24b3xV8-NcpWb69fs8-2OLzfT57WbDCuTyzIFVQTdUorz1vuLe2lrVaB6GCFsp4QBBBabUSUghdGeGtMtqAsmBXiFxOibjulkNu4waz26VjjsOl4-AuYNwVjBvAuAsYd5Z_t5FZkQ
Cites_doi	10.1007/978-3-642-58412-1 10.1023/B:MONE.0000048543.95178.f5 10.1145/332833.332838 10.1016/j.orl.2004.05.005 10.1109/TMC.2003.1233530 10.1007/s10878-005-6858-2 10.1111/j.1475-3995.1999.tb00176.x 10.1016/j.tcs.2008.03.004
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2013
Copyright_xml	– notice: Springer Science+Business Media New York 2013
DOI	10.1007/s10878-013-9683-z
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Mathematics
EISSN	1573-2886
EndPage	1094
ExternalDocumentID	10_1007_s10878_013_9683_z
GroupedDBID	-5D -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 29K 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9R PF0 PT4 PT5 QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 ZMTXR
ID	FETCH-LOGICAL-s113z-c34c4f6f4a5a1f1a997374dc24c5248a0e02c454b23225682a9485804909bee13
IEDL.DBID	RSV
ISSN	1382-6905
IngestDate	Fri Feb 21 02:33:45 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Wireless sensor network NP-hard APX-hard Topology control problem Approximation algorithm Transmission power assignment Graph algorithm
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-s113z-c34c4f6f4a5a1f1a997374dc24c5248a0e02c454b23225682a9485804909bee13
PageCount	18
ParticipantIDs	springer_journals_10_1007_s10878_013_9683_z
PublicationCentury	2000
PublicationDate	20151100
PublicationDateYYYYMMDD	2015-11-01
PublicationDate_xml	– month: 11 year: 2015 text: 20151100
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Journal of combinatorial optimization
PublicationTitleAbbrev	J Comb Optim
PublicationYear	2015
Publisher	Springer US
Publisher_xml	– name: Springer US
References	Alfandari, Paschos (CR1) 1999; 6 Jia, Kim, Makki, Wan, Yi (CR12) 2005; 9 CR3 Cheng, Narahari, Simha, Cheng, Liu (CR7) 2003; 2 CR6 Pottie, Kaiser (CR15) 2000; 43 Ausiello, Crescenzi, Gambosi, Kann, Marchetti-Speccamela, Protasi (CR4) 1999 CR8 Althaus, Funke, Har-peled, Ramos, Skutella (CR2) 2005; 33 CR9 Bilò, Proietti (CR5) 2008; 402 CR14 CR11 Lloyd, Liu, Marathe, Ramanathan, Ravi (CR13) 2005; 10 CR10
References_xml	– year: 1999 ident: CR4 publication-title: Complexity and approximation doi: 10.1007/978-3-642-58412-1 – volume: 10 start-page: 19 year: 2005 end-page: 34 ident: CR13 article-title: Algorithmic aspects of topology control problems for ad hoc networks publication-title: Mob Netw Appl doi: 10.1023/B:MONE.0000048543.95178.f5 – volume: 43 start-page: 51 issue: 5 year: 2000 end-page: 58 ident: CR15 article-title: Wireless integrated network sensors publication-title: Commun ACM doi: 10.1145/332833.332838 – volume: 33 start-page: 115 year: 2005 end-page: 120 ident: CR2 article-title: Approximating -hop minimum spanning trees publication-title: Oper Res Lett doi: 10.1016/j.orl.2004.05.005 – ident: CR3 – ident: CR14 – ident: CR10 – ident: CR11 – volume: 2 start-page: 248 issue: 3 year: 2003 end-page: 256 ident: CR7 article-title: Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics publication-title: IEEE Trans Mob Computing doi: 10.1109/TMC.2003.1233530 – ident: CR9 – ident: CR6 – volume: 9 start-page: 213 issue: 2 year: 2005 end-page: 222 ident: CR12 article-title: Power assignment for k-connectivity in wireless ad hoc networks publication-title: J Comb Optim doi: 10.1007/s10878-005-6858-2 – volume: 6 start-page: 607 year: 1999 end-page: 622 ident: CR1 article-title: Approximating minimum spanning tree of depth two publication-title: Int Trans Oper Res doi: 10.1111/j.1475-3995.1999.tb00176.x – ident: CR8 – volume: 402 start-page: 43 year: 2008 end-page: 55 ident: CR5 article-title: On the complexity of minimizing interference in ad-hoc and sensor networks publication-title: Theor Comput Sci doi: 10.1016/j.tcs.2008.03.004
SSID	ssj0009054
Score	2.046918
Snippet	Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the sum of the transmit powers...
SourceID	springer
SourceType	Publisher
StartPage	1077
SubjectTerms	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation
Title	Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks
URI	https://link.springer.com/article/10.1007/s10878-013-9683-z
Volume	30
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-2886 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009054 issn: 1382-6905 databaseCode: RSV dateStart: 19970301 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELagMMDAG_GWBzZkKY7txB4RomKAClFadYtsxwEkmlZNi0R_Pec8aCVYYIwSRdGdz_ddzvd9CF0qqJKVTS0JrAs8qXZAlLGMZNpBfktNKkvRvv593OnIwUA91nPcRXPavWlJljv10rCb9GywlBEVSUbmq2gNsp300fjU7S-YdgNRKdkCdITSTzStzN9e8aP9WWaV9va_vmcHbdUgEl9XXt9FKy7fQ5tL1IJw9fDNx1rso17X__F-wZ5IZDgbYldO_OGQvI7GGLAzwE48reQSPjHAWOwVssseA7gQezrjd9gRcQE1L9zMq6PjxQHqtW-fb-5ILahACkrZnFjGLc-ijGuhaUa1UjGLeWpDbkXIpQ5cEFrwlwl9mEcy1J47RvrmoDLOUXaIWvkod0cIZ0xQa7RIA5ZxQ6WxKvJi5WCSlGkeH6OrxmpJHRVFsqBI9qZLwHSJN10yP_nT06doA2CLqCYCz1BrOpm5c7RuP6ZvxeSiXA1fwb2yXw
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF60CurBt_h2D95kIZvdJLtHEUvFtoh90FvYbDZVsKk0rWB_vbN52IJe9BgSQpjZ3fkmM_N9CF1LyJKljjVxtHEsqbZDZKQZSZSB-BZHschF-_rNoN0Wg4F8Kue4s6rbvSpJ5if10rCbsGywlBHpC0bmq2iNQ8CyfXzPnf6CadfxCiVbgI6Q-nlVKfO3V_wof-ZRpb7zr-_ZRdsliMS3hdf30IpJ99HWErUgXLW--VizA9Tr2D_eQ2yJREazETb5xB92ycv4HQN2BtiJp4VcwicGGIutQnZeYwAXYktn_AYnIs4g54WbadE6nh2iXv2-e9cgpaACyShlc6IZ1zzxE648RROqpAxYwGPtcu25XCjHOK4Gf0Wu3ea-cJXljhG2OCgjYyg7QrV0nJpjhBPmUR0pL3ZYwiMqIi19K1YOJomZ4sEJuqmsFpa7IgsXFMnWdCGYLrSmC-enf3r6Cm00uq1m2HxoP56hTYAwXjEdeI5q08nMXKB1_TF9zSaX-cr4AipVtUM
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1dS8MwFA06RfTBb_HbPPgmYU2TtsmjqENxjsHc2FtJ01QF1421E9yv96Zd3UBfxMeSEspN0pybk3sOQpcSsmSpY00cbRwrqu0QGWlGEmVgf4ujWBSmfb1m0GqJfl-2Zz6nWXXbvaIky5oGq9KU5vVRnNQXCt-EVYaljEhfMDJdRivcegbZdL3Tm6vuOl7pagswEtJAr6I1f-viBxVa7DCNrX9_2zbanIFLfF3Ohh20ZNJdtLEgOQhPT986rdke6nbsSfgLtgIjg8kAm6ISELvkdTjCgKkBjuK8tFH4xABvsXXOLrgHGFpsZY7f4U-JM8iFoTEtr5Rn-6jbuHu-uSczowWSUcqmRDOueeInXHmKJlRJGbCAx9rl2nO5UI5xXA3jGLl2-fvCVVZTRljSUEbGUHaAaukwNYcIJ8yjOlJe7LCER1REWvrWxBxCEjPFgyN0VUUwnK2WLJxLJ9vQhRC60IYunB7_6e0LtNa-bYTNh9bjCVoHZOOVRYOnqJaPJ-YMreqP_C0bnxeT5Au_Y74n
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=Strong+minimum+energy+2-hop+rooted+topology+for+hierarchical+wireless+sensor+networks&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Panda%2C+B.+S.&rft.au=Pushparaj+Shetty%2C+D.&rft.date=2015-11-01&rft.pub=Springer+US&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=30&rft.issue=4&rft.spage=1077&rft.epage=1094&rft_id=info:doi/10.1007%2Fs10878-013-9683-z&rft.externalDocID=10_1007_s10878_013_9683_z
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-6905&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-6905&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-6905&client=summon