A constraint programming approach to the additional relay placement problem in wireless sensor networks

A Wireless Sensor Network (WSN) is composed of many sensor nodes which transmit their data wirelessly over a multi-hop network to data sinks. Since WSNs are subject to node failures, the network topology should be robust, so that when a failure does occur, data delivery can continue from all survivi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Constraints : an international journal Ročník 20; číslo 4; s. 433 - 451
Hlavní autoři:	Quesada, Luis, Sitanayah, Lanny, Brown, Kenneth N., O’Sullivan, Barry, Sreenan, Cormac J.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2015
Témata:	Artificial Intelligence Computer Science Operations Research/Decision Theory Optimization Node disjoint paths Wireless sensor networks Constraint optimisation problem Network deployment planning Relay placement
ISSN:	1383-7133, 1572-9354
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	A Wireless Sensor Network (WSN) is composed of many sensor nodes which transmit their data wirelessly over a multi-hop network to data sinks. Since WSNs are subject to node failures, the network topology should be robust, so that when a failure does occur, data delivery can continue from all surviving nodes. A WSN is k -robust if an alternate length-constrained route to a sink is available for each surviving node after the failure of up to k -1 nodes. A WSN is strongly k -robust if there are k disjoint length-constrained routes to a sink for each node. Determining whether a network is k -robust is polynomial. However, determining whether a network is strongly k -robust is an NP-complete problem. We develop a Constraint Programming (CP) approach for deciding strongly k-robustness that outperforms a Mixed-Integer Programming (MIP) model on larger problems. A network can be made (strongly) robust by deploying extra relay nodes. We extend our CP approach to an optimisation approach by using QuickXplain to search for a minimal set of relays, and compare it to a state-of-the-art local search approach.
AbstractList	A Wireless Sensor Network (WSN) is composed of many sensor nodes which transmit their data wirelessly over a multi-hop network to data sinks. Since WSNs are subject to node failures, the network topology should be robust, so that when a failure does occur, data delivery can continue from all surviving nodes. A WSN is k -robust if an alternate length-constrained route to a sink is available for each surviving node after the failure of up to k -1 nodes. A WSN is strongly k -robust if there are k disjoint length-constrained routes to a sink for each node. Determining whether a network is k -robust is polynomial. However, determining whether a network is strongly k -robust is an NP-complete problem. We develop a Constraint Programming (CP) approach for deciding strongly k-robustness that outperforms a Mixed-Integer Programming (MIP) model on larger problems. A network can be made (strongly) robust by deploying extra relay nodes. We extend our CP approach to an optimisation approach by using QuickXplain to search for a minimal set of relays, and compare it to a state-of-the-art local search approach.
Author	Quesada, Luis Sreenan, Cormac J. O’Sullivan, Barry Sitanayah, Lanny Brown, Kenneth N.
Author_xml	– sequence: 1 givenname: Luis surname: Quesada fullname: Quesada, Luis email: luis.quesada@insight-centre.org organization: CTVR and Insight Centre for Data Analytics, Department of Computer Science, University College Cork – sequence: 2 givenname: Lanny surname: Sitanayah fullname: Sitanayah, Lanny organization: CTVR and Mobile & Internet Systems Laboratory, Department of Computer Science, University College Cork – sequence: 3 givenname: Kenneth N. surname: Brown fullname: Brown, Kenneth N. organization: CTVR and Insight Centre for Data Analytics, Department of Computer Science, University College Cork – sequence: 4 givenname: Barry surname: O’Sullivan fullname: O’Sullivan, Barry organization: CTVR and Insight Centre for Data Analytics, Department of Computer Science, University College Cork – sequence: 5 givenname: Cormac J. surname: Sreenan fullname: Sreenan, Cormac J. organization: CTVR and Mobile & Internet Systems Laboratory, Department of Computer Science, University College Cork
BookMark	eNp9kM1OwzAMgCM0JLbBA3DLCwSSplmb4zTxJ03iAufKS90uo02qJGja29OqnDhwsi37s-xvRRbOOyTkXvAHwXnxGAXfcMG4UEyLsmTlFVkKVWRMS5UvxlyWkhVCyhuyivHEOdeFzJek3VLjXUwBrEt0CL4N0PfWtRSGsQJzpMnTdEQKdW2T9Q46GrCDCx06MNjjjB067Kl19GzHJsZII7roA3WYzj58xVty3UAX8e43rsnn89PH7pXt31_edts9M1KViTWFwY0pVWG01KjVoeAmV4Ay47VGYwRHZQB1znnTNBlADkrqzSFrcshUXss1Kea9JvgYAzaVsQmmu6cXu0rwavJVzb6q0Vc1-arKkRR_yCHYHsLlXyabmTjOuhZDdfLfYVQU_4F-AAkkgok
CitedBy_id	crossref_primary_10_1177_1550147716684840
Cites_doi	10.1109/TMC.2009.161 10.1109/TCSI.2006.869907 10.1016/j.jpdc.2005.12.007 10.1016/j.disopt.2010.09.009 10.1007/s10601-007-9040-x 10.1007/BF02019432 10.3390/s110302899 10.1002/wcm.638 10.1016/0167-6377(89)90002-3 10.1007/BF01096763 10.1145/1062689.1062729 10.1109/INFOCOM.2008.65 10.1145/1644038.1644040 10.1109/IWQOS.2006.250454 10.1109/WD.2011.6098176
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2015
Copyright_xml	– notice: Springer Science+Business Media New York 2015
DBID	AAYXX CITATION
DOI	10.1007/s10601-015-9188-8
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1572-9354
EndPage	451
ExternalDocumentID	10_1007_s10601_015_9188_8
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .86 .VR 06D 0VY 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU 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 ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP 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 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP 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 ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z83 Z88 Z8M Z8R Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION
ID	FETCH-LOGICAL-c358t-f7ce6c857c939e95b70c45ae320d9ecc10e5cae9400fff2aa4a5396b2f4a254d3
IEDL.DBID	RSV
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000363027300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1383-7133
IngestDate	Sat Nov 29 04:16:03 EST 2025 Tue Nov 18 22:24:56 EST 2025 Fri Feb 21 02:33:35 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Node disjoint paths Wireless sensor networks Constraint optimisation problem Network deployment planning Relay placement
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c358t-f7ce6c857c939e95b70c45ae320d9ecc10e5cae9400fff2aa4a5396b2f4a254d3
PageCount	19
ParticipantIDs	crossref_citationtrail_10_1007_s10601_015_9188_8 crossref_primary_10_1007_s10601_015_9188_8 springer_journals_10_1007_s10601_015_9188_8
PublicationCentury	2000
PublicationDate	2015-10-01
PublicationDateYYYYMMDD	2015-10-01
PublicationDate_xml	– month: 10 year: 2015 text: 2015-10-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationSubtitle	An International Journal
PublicationTitle	Constraints : an international journal
PublicationTitleAbbrev	Constraints
PublicationYear	2015
Publisher	Springer US
Publisher_xml	– name: Springer US
References	Beldiceanu, Flener, Lorca (CR1) 2008; 13 CR4 Lovász, Neumann-Lara, Plummer (CR12) 1978; 9 CR3 CR5 Pu, Xiong, Lu (CR14) 2008; 9 CR8 Zeng, Sreenan, Sitanayah, Xiong, Park, Zheng (CR18) 2011; 11 Boukerche, Pazzi, Araujo (CR2) 2006; 66 CR16 CR15 CR13 CR11 Feo, Resende (CR6) 1989; 8 Golovach, Thilikos (CR9) 2011; 8 Feo, Resende (CR7) 1995; 6 Han, Cao, Lloyd, Shen (CR10) 2010; 9 Xiao, Thulasiraman, Xue (CR17) 2006; 53 PA Golovach (9188_CR9) 2011; 8 TA Feo (9188_CR7) 1995; 6 9188_CR13 J Pu (9188_CR14) 2008; 9 9188_CR16 9188_CR8 9188_CR15 9188_CR11 N Beldiceanu (9188_CR1) 2008; 13 TA Feo (9188_CR6) 1989; 8 L Lovász (9188_CR12) 1978; 9 A Boukerche (9188_CR2) 2006; 66 X Han (9188_CR10) 2010; 9 Y Xiao (9188_CR17) 2006; 53 9188_CR3 9188_CR5 9188_CR4 Y Zeng (9188_CR18) 2011; 11
References_xml	– volume: 9 start-page: 643 issue: 5 year: 2010 end-page: 656 ident: CR10 article-title: Fault-tolerant relay node placement in heterogeneous wireless sensor networks publication-title: IEEE Transactions on Mobile Computing doi: 10.1109/TMC.2009.161 – volume: 53 start-page: 1174 issue: 5 year: 2006 end-page: 1187 ident: CR17 article-title: Constrained shortest link-disjoint paths selection: A network programming based approach publication-title: IEEE Trans Circuits and Systems I: Regular Papers doi: 10.1109/TCSI.2006.869907 – ident: CR3 – ident: CR4 – ident: CR15 – ident: CR16 – volume: 66 start-page: 586 issue: 4 year: 2006 end-page: 599 ident: CR2 article-title: fault-tolerant wireless sensor network routing protocols for the supervision of contex-aware physical environments publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2005.12.007 – ident: CR13 – ident: CR11 – volume: 8 start-page: 72 issue: 1 year: 2011 end-page: 86 ident: CR9 article-title: Paths of bounded length and their cuts: Parameterized complexity and algorithms publication-title: Discrete Optimization doi: 10.1016/j.disopt.2010.09.009 – volume: 13 start-page: 459 issue: 4 year: 2008 end-page: 489 ident: CR1 article-title: Combining tree partitioning, precedence, and incomparability constraints publication-title: Constraints doi: 10.1007/s10601-007-9040-x – volume: 9 start-page: 269 issue: 4 year: 1978 end-page: 276 ident: CR12 article-title: Mengerian theorems for paths of bounded length publication-title: Periodica Mathematica Hungarica doi: 10.1007/BF02019432 – ident: CR5 – ident: CR8 – volume: 11 start-page: 2899 issue: 3 year: 2011 end-page: 2919 ident: CR18 article-title: An emergency-adaptive routing scheme for wireless sensor networks for building fire hazard monitoring publication-title: Sensors doi: 10.3390/s110302899 – volume: 9 start-page: 909 issue: 7 year: 2008 end-page: 919 ident: CR14 article-title: Fault-tolerant deployment with k-connectivity and partial k-connectivity in sensor networks publication-title: Wireless Communications and Mobile Computing doi: 10.1002/wcm.638 – volume: 8 start-page: 67 year: 1989 end-page: 71 ident: CR6 article-title: A probabilistic heuristic for a computationally difficult set covering problem publication-title: Operations Research Letters doi: 10.1016/0167-6377(89)90002-3 – volume: 6 start-page: 109 year: 1995 end-page: 133 ident: CR7 article-title: Greedy randomized adaptive search procedures publication-title: Journal of Global Optimization doi: 10.1007/BF01096763 – volume: 11 start-page: 2899 issue: 3 year: 2011 ident: 9188_CR18 publication-title: Sensors doi: 10.3390/s110302899 – ident: 9188_CR3 doi: 10.1145/1062689.1062729 – volume: 9 start-page: 643 issue: 5 year: 2010 ident: 9188_CR10 publication-title: IEEE Transactions on Mobile Computing doi: 10.1109/TMC.2009.161 – volume: 9 start-page: 909 issue: 7 year: 2008 ident: 9188_CR14 publication-title: Wireless Communications and Mobile Computing doi: 10.1002/wcm.638 – volume: 13 start-page: 459 issue: 4 year: 2008 ident: 9188_CR1 publication-title: Constraints doi: 10.1007/s10601-007-9040-x – volume: 8 start-page: 72 issue: 1 year: 2011 ident: 9188_CR9 publication-title: Discrete Optimization doi: 10.1016/j.disopt.2010.09.009 – ident: 9188_CR13 doi: 10.1109/INFOCOM.2008.65 – volume: 53 start-page: 1174 issue: 5 year: 2006 ident: 9188_CR17 publication-title: IEEE Trans Circuits and Systems I: Regular Papers doi: 10.1109/TCSI.2006.869907 – ident: 9188_CR8 doi: 10.1145/1644038.1644040 – volume: 66 start-page: 586 issue: 4 year: 2006 ident: 9188_CR2 publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2005.12.007 – ident: 9188_CR15 – ident: 9188_CR5 – ident: 9188_CR4 doi: 10.1109/IWQOS.2006.250454 – volume: 9 start-page: 269 issue: 4 year: 1978 ident: 9188_CR12 publication-title: Periodica Mathematica Hungarica doi: 10.1007/BF02019432 – ident: 9188_CR11 – volume: 6 start-page: 109 year: 1995 ident: 9188_CR7 publication-title: Journal of Global Optimization doi: 10.1007/BF01096763 – volume: 8 start-page: 67 year: 1989 ident: 9188_CR6 publication-title: Operations Research Letters doi: 10.1016/0167-6377(89)90002-3 – ident: 9188_CR16 doi: 10.1109/WD.2011.6098176
SSID	ssj0009734
Score	2.040705
Snippet	A Wireless Sensor Network (WSN) is composed of many sensor nodes which transmit their data wirelessly over a multi-hop network to data sinks. Since WSNs are...
SourceID	crossref springer
SourceType	Enrichment Source Index Database Publisher
StartPage	433
SubjectTerms	Artificial Intelligence Computer Science Operations Research/Decision Theory Optimization
Title	A constraint programming approach to the additional relay placement problem in wireless sensor networks
URI	https://link.springer.com/article/10.1007/s10601-015-9188-8
Volume	20
WOSCitedRecordID	wos000363027300004&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-9354 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009734 issn: 1383-7133 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/eLvHCXMwnV1JS8QwFA46evDiuOK48Q6elECnabbjIA6eBnFjbiVNUhkYOzKtgv_epE0dB1TQ-2vTviUvL2_5EDrLTcYUtwxTay12SsGwYJZiQhy5TWJDTVaDTfDRSIzH8ib0cZdttXubkqx36i_NbqwOfT22oBOvWEVrztsJb423d4-LSbu8SSW70Av7CKxNZX73imVntJwJrR3MsPuvT9tCm-E8CYNGAbbRii12ULfFaoBgurvoaQDaHwU9IkQFoSrr2S0C7VRxqGbgToPgK4yaC0LwjS7vUJdt-UtECOgzMCnAjzieul0SShcHz-ZQNOXk5R56GF7dX17jALKANaGiwjnXlmlBuZZEWkkzHumEKkviyEgn335kqZOax0_P8zxWKlGUSJbFeaJccGnIPuoUs8IeIOhzomgshSIiT4whyjhHwH1vbkaszGQPRS23Ux0mkPvfnqaL2cmekaljZOoZmYoeOv985KUZv_Eb8UUrnjRYYvkz9eGfqI_QRuzlW5fxHaNONX-1J2hdv1WTcn5aa-AHjmXYXA
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90Cvri_MT5mQeflEJtmiZ5HOKYOIfolL2VNEllMDtZq-B_b9KmzoEK-n5t2rskl8v97n4AJ6lKIkF15BGttWcmReSxSBMPYyOuw0ARlZRkE7TfZ8Mhv3V13HmNdq9TkuVO_aXYLSpDX8staMzLFmEpNA7L4vju7h9nnXZplUo2oZdnI7A6lfndK-ad0XwmtHQwnea_Pm0d1tx5ErWrCbABCzrbhGbN1YDc0t2CpzaS9ihoGSEK5FBZz2YQVHcVR8UEmdMgsgij6oIQ2UKXd1TCtuwlInLsM2iUIdvieGx2SZSbOHgyRVkFJ8-34aFzObjoeo5kwZOYsMJLqdSRZIRKjrnmJKG-DInQOPAVN_Y99zUxVrP86WmaBkKEgmAeJUEaChNcKrwDjWyS6V1A5xQLEnAmMEtDpbBQxhFQW5ubYM0T3gK_1nYsXQdy-9vjeNY72SoyNoqMrSJj1oLTz0deqvYbvwmf1eaJ3UrMf5be-5P0Max0Bze9uHfVv96H1cDauoT0HUCjmL7qQ1iWb8Uonx6Vs_EDvDzbQA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZS8NAEF60ivhiPbGe8-CTEkyz2ST7WNSiKKXgQd_CZg8p1LQ0UfDfu5PDWlBBfJ9cM7OZnZ2Z7yPkxKgkEKEOHKa1dqxTBE4UaOZQasW17ymmkoJsIuz1osGA9yue06zudq9LkuVMA6I0pfn5RJnzL4NvQZEGI8-gNXW0SJZ85AzCdP3-aYa6G5ZlZZuGOZiN1WXN724xH5jmq6JFsOk2__2a62St2mdCp3SMDbKg003SrDkcoFrSW-S5AxK3iMgUkUPVrfViHwg12jjkY7C7RMDOo_LgEHAA5h2Kdi48XISKlQaGKSD08cj-PSGz-fF4CmnZZp5tk8fu1cPFtVORLziSsih3TCh1ICMWSk655iwJXekzoannKm7t3nY1s9ZEXnVjjCeELxjlQeIZX9ikU9Ed0kjHqd4l0A6pYB6PBI2MrxQVygaIEGd2E6p5wlvErTUfywqZHD97FM8wlVGRsVVkjIqMoxY5_bxkUsJy_CZ8VpsqrlZo9rP03p-kj8lK_7Ib3930bvfJqoemLjr9Dkgjn77qQ7Is3_JhNj0qHPMDWjrkJA
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=A+constraint+programming+approach+to+the+additional+relay+placement+problem+in+wireless+sensor+networks&rft.jtitle=Constraints+%3A+an+international+journal&rft.au=Quesada%2C+Luis&rft.au=Sitanayah%2C+Lanny&rft.au=Brown%2C+Kenneth+N.&rft.au=O%E2%80%99Sullivan%2C+Barry&rft.date=2015-10-01&rft.issn=1383-7133&rft.eissn=1572-9354&rft.volume=20&rft.issue=4&rft.spage=433&rft.epage=451&rft_id=info:doi/10.1007%2Fs10601-015-9188-8&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10601_015_9188_8
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1383-7133&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1383-7133&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1383-7133&client=summon