A Coverage-Aware Distributed k-Connectivity Maintenance Algorithm for Arbitrarily Large k in Mobile Sensor Networks

Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A <inline-formula> &...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE/ACM transactions on networking Vol. 30; no. 1; pp. 62 - 75
Main Authors:	Akram, Vahid Khalilpour, Dagdeviren, Orhan, Tavli, Bulent
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k -connectivity Algorithms Connectivity connectivity maintenance Conservation distributed algorithm fault tolerance Maintenance Maintenance engineering Mobile sensor networks Network topology Nodes Partitioning algorithms reliability Remote sensors Restoration Robot sensing systems Robotics Sensors Time complexity Topology Upper bound Wireless networks Wireless sensor networks
ISSN:	1063-6692, 1558-2566
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connected network can tolerate at least <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-1 arbitrary node failures without losing its connectivity. In this study, we present a coverage-aware distributed <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active nodes after a node failure to preserve a persistent <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula> value subject to a coverage conservation criterion. The algorithm accepts a coverage conservation ratio (as a trade-off parameter between coverage and movements) and facilitates coverage with the generated movements according to this value. Extensive simulations and testbed experiments reveal that the proposed algorithm restores <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connectivity more efficiently than the existing restoration algorithms. Furthermore, our algorithm can be utilized to maintain <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connectivity without sacrificing the coverage, significantly.
AbstractList	Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connected network can tolerate at least <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-1 arbitrary node failures without losing its connectivity. In this study, we present a coverage-aware distributed <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active nodes after a node failure to preserve a persistent <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula> value subject to a coverage conservation criterion. The algorithm accepts a coverage conservation ratio (as a trade-off parameter between coverage and movements) and facilitates coverage with the generated movements according to this value. Extensive simulations and testbed experiments reveal that the proposed algorithm restores <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connectivity more efficiently than the existing restoration algorithms. Furthermore, our algorithm can be utilized to maintain <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-connectivity without sacrificing the coverage, significantly. Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A [Formula Omitted]-connected network can tolerate at least [Formula Omitted]-1 arbitrary node failures without losing its connectivity. In this study, we present a coverage-aware distributed [Formula Omitted]-connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active nodes after a node failure to preserve a persistent [Formula Omitted] value subject to a coverage conservation criterion. The algorithm accepts a coverage conservation ratio (as a trade-off parameter between coverage and movements) and facilitates coverage with the generated movements according to this value. Extensive simulations and testbed experiments reveal that the proposed algorithm restores [Formula Omitted]-connectivity more efficiently than the existing restoration algorithms. Furthermore, our algorithm can be utilized to maintain [Formula Omitted]-connectivity without sacrificing the coverage, significantly.
Author	Dagdeviren, Orhan Akram, Vahid Khalilpour Tavli, Bulent
Author_xml	– sequence: 1 givenname: Vahid Khalilpour orcidid: 0000-0002-4082-6419 surname: Akram fullname: Akram, Vahid Khalilpour email: vahid.akram@ege.edu.tr organization: International Computer Institute, Ege University, Izmir, Turkey – sequence: 2 givenname: Orhan orcidid: 0000-0001-8789-5086 surname: Dagdeviren fullname: Dagdeviren, Orhan email: orhan.dagdeviren@ege.edu.tr organization: International Computer Institute, Ege University, Izmir, Turkey – sequence: 3 givenname: Bulent orcidid: 0000-0002-9615-1983 surname: Tavli fullname: Tavli, Bulent email: btavli@etu.edu.tr organization: Electrical and Electronics Engineering Department, TOBB University of Economics and Technology, Ankara, Turkey
BookMark	eNp9kD1PwzAQQC0EEm3hByAWS8wpti92kzEqn1IpA2WOnORSTINdbBfUf0-qVgwMTL7hvTv5DcmxdRYJueBszDnLrxfz28VYMMHHwFkKUh2RAZcyS4RU6rifmYJEqVyckmEI74xxYEINSCjo1H2h10tMim_tkd6YEL2pNhEbukqmzlqso_kycUuftLERrbY10qJbOm_i2wdtnaeFr0z02ptuS2faL5GuqLH0yVWmQ_qCNvTQHOO386twRk5a3QU8P7wj8np3u5g-JLPn-8dpMUtqkUNMcmQiQ4BWA8tbXk1UozPJU2wkb3JMWV3LCas0gGxSaATotlagVSbSKtVVBSNytd-79u5zgyGW727jbX-yFErkHECxrKcme6r2LgSPbVmbqKNxtv-Q6UrOyl3hcle43BUuD4V7k_8x1958aL_917ncOwYRf_lc8gyyFH4Aa5uJ6g
CODEN	IEANEP
CitedBy_id	crossref_primary_10_1109_TITS_2024_3350042 crossref_primary_10_1155_2022_2532905 crossref_primary_10_1155_2022_9299564 crossref_primary_10_1016_j_comnet_2025_111607 crossref_primary_10_1145_3579034 crossref_primary_10_26634_jfet_19_2_20481 crossref_primary_10_1038_s41598_022_15689_3 crossref_primary_10_1109_TVT_2022_3219053 crossref_primary_10_1109_TR_2024_3370743 crossref_primary_10_1016_j_csi_2024_103941 crossref_primary_10_1016_j_hcc_2024_100293 crossref_primary_10_1109_JIOT_2022_3188558 crossref_primary_10_1109_MNET_124_2100767 crossref_primary_10_1109_TII_2022_3205368
Cites_doi	10.1109/ICC.2009.5199257 10.1109/ICC.2015.7249337 10.1109/TC.2009.120 10.1016/j.engappai.2012.05.018 10.1016/j.adhoc.2014.07.012 10.1109/TNET.2009.2024941 10.1016/j.adhoc.2018.04.008 10.1145/2611462.2611491 10.1109/TPDS.2010.102 10.1016/j.compeleceng.2016.10.014 10.1002/dac.2819 10.1109/TR.2020.2970268 10.1016/j.jnca.2011.11.016 10.1002/9781119788010.ch6 10.1016/j.adhoc.2016.02.018 10.1109/JCN.2019.000005 10.1109/WONS.2012.6152244 10.1007/s11036-005-1564-y 10.3906/elk-1801-49 10.1109/TMC.2009.161 10.3390/s16101487 10.1016/j.comcom.2017.11.005 10.1016/j.automatica.2009.11.012 10.1016/j.comcom.2019.07.011 10.1016/j.adhoc.2004.03.001 10.1109/TNET.2010.2040191 10.1145/1374618.1374672 10.1007/978-3-642-00312-7_3 10.1109/ROBOT.2008.4543415 10.1109/ICCCN.2004.1401672 10.3390/s18010153 10.1109/LCOMM.2017.2699174 10.1109/ACCESS.2017.2740382 10.1109/TNET.2019.2894749 10.3390/s91007664 10.1016/j.adhoc.2017.12.008 10.1002/nav.3800020109 10.1109/TR.2018.2873917 10.1109/TNET.2016.2531688 10.1006/jagm.1999.1055 10.3390/s16010003 10.1109/JIOT.2019.2953476
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
DOI	10.1109/TNET.2021.3104356
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
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
DatabaseTitleList	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	75
ExternalDocumentID	10_1109_TNET_2021_3104356 9518384
Genre	orig-research
GrantInformation_xml	– fundername: TUBITAK (The Scientific and Technological Research Council of Turkey) grantid: 113E470
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
ID	FETCH-LOGICAL-c293t-9e028e33fa309f1b76da8514ed51d9e40cc570ba335d43d23afc63a6824b4abb3
IEDL.DBID	RIE
ISICitedReferencesCount	22
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000732095600001&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	Sun Jun 29 15:56:02 EDT 2025 Sat Nov 29 03:05:25 EST 2025 Tue Nov 18 22:53:29 EST 2025 Wed Aug 27 02:49:52 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c293t-9e028e33fa309f1b76da8514ed51d9e40cc570ba335d43d23afc63a6824b4abb3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-9615-1983 0000-0002-4082-6419 0000-0001-8789-5086
PQID	2629133608
PQPubID	32020
PageCount	14
ParticipantIDs	proquest_journals_2629133608 crossref_citationtrail_10_1109_TNET_2021_3104356 crossref_primary_10_1109_TNET_2021_3104356 ieee_primary_9518384
PublicationCentury	2000
PublicationDate	2022-Feb. 2022-2-00 20220201
PublicationDateYYYYMMDD	2022-02-01
PublicationDate_xml	– month: 02 year: 2022 text: 2022-Feb.
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE/ACM transactions on networking
PublicationTitleAbbrev	TNET
PublicationYear	2022
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	ref35 ref12 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 ref2 ref1 ref17 ref39 ref16 ref38 ref19 Ranga (ref13); 2015 ref18 ref24 ref23 ref26 ref25 ref20 ref42 ref41 ref22 ref44 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 (ref43) 2020
References_xml	– ident: ref11 doi: 10.1109/ICC.2009.5199257 – ident: ref25 doi: 10.1109/ICC.2015.7249337 – ident: ref21 doi: 10.1109/TC.2009.120 – ident: ref40 doi: 10.1016/j.engappai.2012.05.018 – ident: ref9 doi: 10.1016/j.adhoc.2014.07.012 – ident: ref7 doi: 10.1109/TNET.2009.2024941 – ident: ref15 doi: 10.1016/j.adhoc.2018.04.008 – ident: ref5 doi: 10.1145/2611462.2611491 – ident: ref31 doi: 10.1109/TPDS.2010.102 – ident: ref17 doi: 10.1016/j.compeleceng.2016.10.014 – ident: ref26 doi: 10.1002/dac.2819 – ident: ref34 doi: 10.1109/TR.2020.2970268 – ident: ref38 doi: 10.1016/j.jnca.2011.11.016 – ident: ref42 doi: 10.1002/9781119788010.ch6 – ident: ref8 doi: 10.1016/j.adhoc.2016.02.018 – ident: ref29 doi: 10.1109/JCN.2019.000005 – ident: ref3 doi: 10.1109/WONS.2012.6152244 – ident: ref44 doi: 10.1007/s11036-005-1564-y – ident: ref33 doi: 10.3906/elk-1801-49 – ident: ref12 doi: 10.1109/TMC.2009.161 – ident: ref19 doi: 10.3390/s16101487 – ident: ref4 doi: 10.1016/j.comcom.2017.11.005 – ident: ref24 doi: 10.1016/j.automatica.2009.11.012 – volume-title: Yujinrobot Kobuki year: 2020 ident: ref43 – ident: ref27 doi: 10.1016/j.comcom.2019.07.011 – ident: ref37 doi: 10.1016/j.adhoc.2004.03.001 – ident: ref36 doi: 10.1109/TNET.2010.2040191 – ident: ref35 doi: 10.1145/1374618.1374672 – ident: ref18 doi: 10.1007/978-3-642-00312-7_3 – ident: ref22 doi: 10.1109/ROBOT.2008.4543415 – ident: ref30 doi: 10.1109/ICCCN.2004.1401672 – ident: ref20 doi: 10.3390/s18010153 – ident: ref23 doi: 10.1109/LCOMM.2017.2699174 – ident: ref41 doi: 10.1109/ACCESS.2017.2740382 – ident: ref1 doi: 10.1109/TNET.2019.2894749 – ident: ref39 doi: 10.3390/s91007664 – ident: ref14 doi: 10.1016/j.adhoc.2017.12.008 – ident: ref32 doi: 10.1002/nav.3800020109 – ident: ref6 doi: 10.1109/TR.2018.2873917 – volume: 2015 start-page: 170 volume-title: Proc. Int. Conf. Electron. Commun. Syst. (ECS) ident: ref13 article-title: Relay node placement for lost connectivity restoration in partitioned wireless sensor networks – ident: ref28 doi: 10.1109/TNET.2016.2531688 – ident: ref2 doi: 10.1006/jagm.1999.1055 – ident: ref10 doi: 10.3390/s16010003 – ident: ref16 doi: 10.1109/JIOT.2019.2953476
SSID	ssj0013026
Score	2.477307
Snippet	Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	62
SubjectTerms	<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k -connectivity Algorithms Connectivity connectivity maintenance Conservation distributed algorithm fault tolerance Maintenance Maintenance engineering Mobile sensor networks Network topology Nodes Partitioning algorithms reliability Remote sensors Restoration Robot sensing systems Robotics Sensors Time complexity Topology Upper bound Wireless networks Wireless sensor networks
Title	A Coverage-Aware Distributed k-Connectivity Maintenance Algorithm for Arbitrarily Large k in Mobile Sensor Networks
URI	https://ieeexplore.ieee.org/document/9518384 https://www.proquest.com/docview/2629133608
Volume	30
WOSCitedRecordID	wos000732095600001&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/eLvHCXMwlV1LT9tAEB4B6gEOfQFqaFrtoSfEwtrrrHePEQX1EKJKpBI3ax9jsAhJlYSi_vvOrk3aigqpNx9mbcufPfuN5_EBfMqd0LUWjtcZuphmdNyEXHKrnSkyHEjhU6PwqByP9dWV-boBR-teGERMxWd4HA9TLj_M_X38VXZCbEBLXWzCZlmWba_W74yBSNJqFOFIrpTJuwxmJszJZHw2oUgwzyhAFUQP1F97UBJVeeKJ0_Zy_ur_buw1vOxoJBu2uL-BDZy9hZ0_hgvuwnLITmN9JjkMPnywC2Sf45DcqG-Fgd3yVOLiW_EIdmHj3Ig4fAPZcHo9XzSrmztGhJYu4ZrYmt9Mf7JRLBtnt6yZsYu5I3_CLikKJqNxW0y-3INv52eT0y-8k1jgnvb5FTdI_AKlrK0Ups5cqYIlDlZgGGTBYCG8H5TCWSkHoZAEoq29klbpvHCFdU7uw9ZsPsN3wEqdCTqN8kQJC1F77W2IHZq1x1o6DD0Qjw-98t388SiDMa1SHCJMFXGqIk5Vh1MPDtdLvrfDN54z3o3ArA07THrQf0S26j7PZZWr3FBwroQ--Peq97Cdxz6HVJ7dh63V4h4_wAv_Y9UsFx_Tm_cL1NXXcw
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB6VgkQ5lEepWFrAB04IU8d2vPZx1YeK2I2QWKTeIj8mEHXZRbtbEP8e20mXIhAStxzGSZQvGX-TeXwAL7ljutHM0aZAl9KMjprABbXaGVlgKZjPjcLjYVXpiwvzfgteb3phEDEXn-GbdJhz-WHhr9KvsqPIBrTQ8hbcLqXkRdet9StnwLK4WoxxBFXK8D6HWTBzNK1OpzEW5EUMUVkkCOq3XSjLqvzhi_MGc3b__27tAez2RJKMOuQfwhbOH8G9G-MF92A1IsepQjO6DDr6bpdITtKY3KRwhYFc0lzk4jv5CDKxaXJEGr-BZDT7tFi2689fSKS08RKuTc357ewHGafCcXJJ2jmZLFz0KORDjIOjUdWVk68ew8ez0-nxOe1FFqiPO_2aGowMA4VorGCmKdxQBRtZmMRQFsGgZN6XQ-asEGWQIsJoG6-EVZpLJ61zYh-254s5PgEy1AWLp1E-kkLJGq-9DalHs_HYCIdhAOz6ode-n0CehDBmdY5EmKkTTnXCqe5xGsCrzZKv3fiNfxnvJWA2hj0mAzi8RrbuP9BVzRU3MTxXTD_9-6oXcPd8OhnX47fVuwPY4anrIRdrH8L2enmFz-CO_7ZuV8vn-S38CTAN2ro
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+Coverage-Aware+Distributed+k+-Connectivity+Maintenance+Algorithm+for+Arbitrarily+Large+k+in+Mobile+Sensor+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Akram%2C+Vahid+Khalilpour&rft.au=Dagdeviren%2C+Orhan&rft.au=Tavli%2C+Bulent&rft.date=2022-02-01&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=30&rft.issue=1&rft.spage=62&rft.epage=75&rft_id=info:doi/10.1109%2FTNET.2021.3104356&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TNET_2021_3104356
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