Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interference-plus-noise ratio) constraints. We propose a column generation based algorithm that finds the optimal schedules and transmit powers. T...
Uložené v:
| Vydané v: | IEEE transactions on wireless communications Ročník 9; číslo 3; s. 1186 - 1197 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
IEEE
01.03.2010
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 1536-1276, 1558-2248 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interference-plus-noise ratio) constraints. We propose a column generation based algorithm that finds the optimal schedules and transmit powers. The column generation method decomposes a complex linear optimization problem into a restricted master problem and a pricing problem. We develop a new formulation of the pricing problem using the Perron-Frobenius eigenvalue condition, which enables us to integrate link scheduling with power control in a single framework. This new formulation reduces the complexity of the pricing problem, and thus improves the overall efficiency of the column generation method significantly - for example, the average runtime is reduced by 99.86% in 18-link networks compared with the traditional column generation method. Furthermore, we propose a branch-and-price method that combines column generation with the branch-and-bound technique to tackle the integer constraints on time slot allocation. We develop a new branching rule in the branch-and-price method that maintains the size of the pricing problem after each branching. Our branch-and-price method can obtain optimal integer solutions efficiently for example, the average runtime is reduced by 99.72% in 18-link networks compared with the traditional branch-and-price method. We further suggest efficient heuristic algorithms based on the structure of the optimal algorithms. Simulation results show that the heuristic algorithms can reach solutions within 10% of optimality for networks with less than 30 links. |
|---|---|
| AbstractList | This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus- noise ratio) constraints. We propose a column generation based algorithm that finds the optimal schedules and transmit powers. The column generation method decomposes a complex linear optimization problem into a restricted master problem and a pricing problem. We develop a new formulation of the pricing problem using the Perron-Frobenius eigenvalue condition, which enables us to integrate link scheduling with power control in a single framework. This new formulation reduces the complexity of the pricing problem, and thus improves the overall efficiency of the column generation method significantly ¿ for example, the average runtime is reduced by 99.86% in 18- link networks compared with the traditional column generation method. Furthermore, we propose a branch-and-price method that combines column generation with the branch-and-bound technique to tackle the integer constraints on time slot allocation. We develop a new branching rule in the branch-and-price method that maintains the size of the pricing problem after each branching. Our branch-and-price method can obtain optimal integer solutions efficiently ¿ for example, the average runtime is reduced by 99.72% in 18-link networks compared with the traditional branch-and-price method. We further suggest efficient heuristic algorithms based on the structure of the optimal algorithms. Simulation results show that the heuristic algorithms can reach solutions within 10% of optimality for networks with less than 30 links. This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interference-plus-noise ratio) constraints. We propose a column generation based algorithm that finds the optimal schedules and transmit powers. The column generation method decomposes a complex linear optimization problem into a restricted master problem and a pricing problem. We develop a new formulation of the pricing problem using the Perron-Frobenius eigenvalue condition, which enables us to integrate link scheduling with power control in a single framework. This new formulation reduces the complexity of the pricing problem, and thus improves the overall efficiency of the column generation method significantly - for example, the average runtime is reduced by 99.86% in 18-link networks compared with the traditional column generation method. Furthermore, we propose a branch-and-price method that combines column generation with the branch-and-bound technique to tackle the integer constraints on time slot allocation. We develop a new branching rule in the branch-and-price method that maintains the size of the pricing problem after each branching. Our branch-and-price method can obtain optimal integer solutions efficiently for example, the average runtime is reduced by 99.72% in 18-link networks compared with the traditional branch-and-price method. We further suggest efficient heuristic algorithms based on the structure of the optimal algorithms. Simulation results show that the heuristic algorithms can reach solutions within 10% of optimality for networks with less than 30 links. This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus- noise ratio) constraints. We propose a column generation based algorithm that finds the optimal schedules and transmit powers. The column generation method decomposes a complex linear optimization problem into a restricted master problem and a pricing problem. We develop a new formulation of the pricing problem using the Perron-Frobenius eigenvalue condition, which enables us to integrate link scheduling with power control in a single framework. This new formulation reduces the complexity of the pricing problem, and thus improves the overall efficiency of the column generation method significantly [iquest] for example, the average runtime is reduced by 99.86% in 18- link networks compared with the traditional column generation method. Furthermore, we propose a branch-and-price method that combines column generation with the branch-and-bound technique to tackle the integer constraints on time slot allocation. We develop a new branching rule in the branch-and-price method that maintains the size of the pricing problem after each branching. Our branch-and-price method can obtain optimal integer solutions efficiently [iquest] for example, the average runtime is reduced by 99.72% in 18-link networks compared with the traditional branch-and-price method. We further suggest efficient heuristic algorithms based on the structure of the optimal algorithms. Simulation results show that the heuristic algorithms can reach solutions within 10% of optimality for networks with less than 30 links. |
| Author | Liew, Soung Chang Fu, Liqun Huang, Jianwei |
| Author_xml | – sequence: 1 givenname: Liqun surname: Fu fullname: Fu, Liqun email: lqfu6@ie.cuhk.edu.hk organization: Chinese University of Hong Kong – sequence: 2 givenname: Soung Chang surname: Liew fullname: Liew, Soung Chang email: soung@ie.cuhk.edu.hk organization: Chinese University of Hong Kong – sequence: 3 givenname: Jianwei surname: Huang fullname: Huang, Jianwei email: jwhuang@ie.cuhk.edu.hk organization: Chinese University of Hong Kong |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22728698$$DView record in Pascal Francis |
| BookMark | eNp9kU1rXCEUhqUk0Hz0D7QboZSu7lSPeu91WYakDQ10k5ClOM65iVNHp-ow9N_Xy6RdZJGVCs_z4jnvOTmJKSIh7zlbcM70l7uH5QJYezGxYJqNIN-QM67U2AHI8WS-i77jMPRvyXkpG8b40Ct1Rn5c21KpDY8p-_q0LXRKmW6Sj5Xu0gEzdSnWnAK1cU2Le8L1Pvj4SH2kB58xYCk0Yj2k_KtcktPJhoLvns8Lcn99dbf83t3-_Haz_HrbOaGG2qEDp3pAyeUAK7Z2QltExxlKp51EnMaVXE2a8dWkUMNk0TndK83BtWGEuCCfj7m7nH7vsVSz9cVhCDZi2hcztFmFVnomP74gN2mfY_uc4QwGLiUD1qhPz5QtzoYp2-h8Mbvstzb_MQADjL0eGzceOZdTKRkn43y11c8bsj60SDOXYVoZZi7DMGGOZTQVXqj_0l-VPhwlj4j_BSVhkIqJv9Kol4o |
| CODEN | ITWCAX |
| CitedBy_id | crossref_primary_10_1109_TMC_2014_2320275 crossref_primary_10_1109_TWC_2014_2318036 crossref_primary_10_1109_TWC_2017_2762680 crossref_primary_10_1109_JSAC_2012_121109 crossref_primary_10_1109_TMC_2014_2314107 crossref_primary_10_1007_s11432_015_5468_6 crossref_primary_10_1109_LCOMM_2012_072012_120500 crossref_primary_10_1109_JIOT_2020_2997342 crossref_primary_10_1002_ett_2616 crossref_primary_10_1145_2677955 crossref_primary_10_1109_JIOT_2023_3273482 crossref_primary_10_3233_JIFS_189028 crossref_primary_10_1109_TVT_2012_2222683 crossref_primary_10_1016_S1874_1029_11_60306_6 crossref_primary_10_1109_TVT_2012_2217994 crossref_primary_10_1111_itor_12327 crossref_primary_10_1109_JIOT_2018_2853661 crossref_primary_10_1109_TGCN_2018_2883523 crossref_primary_10_1109_TWC_2015_2411602 crossref_primary_10_1007_s41650_018_0010_9 crossref_primary_10_1049_iet_spr_2014_0265 crossref_primary_10_1016_j_adhoc_2016_08_010 crossref_primary_10_1109_WCL_2014_012114_130807 crossref_primary_10_1002_wcm_2359 crossref_primary_10_1109_ACCESS_2023_3262116 crossref_primary_10_1109_TWC_2012_030812_111341 crossref_primary_10_3390_s19040785 crossref_primary_10_1002_wcm_2613 |
| Cites_doi | 10.1109/TVT.2006.883734 10.1109/25.260766 10.1109/TWC.2006.05058 10.1287/opre.46.3.316 10.1109/TVT.2006.873836 10.1145/938990.938993 10.1109/18.825799 10.1017/CBO9780511840371 10.1109/SAHCN.2006.288418 10.1287/opre.1050.0234 10.1109/25.120145 10.1109/TWC.2003.819032 10.1145/1288107.1288122 10.1109/90.879345 10.1109/INFCOM.2005.1498458 10.1109/CISS.2008.4558576 10.1109/TIT.2005.860471 10.1109/TIT.2006.883617 10.1109/18.21215 10.1109/TWC.2006.1611067 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2010 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2010 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TWC.2010.03.090824 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis 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 Applied Sciences |
| EISSN | 1558-2248 |
| EndPage | 1197 |
| ExternalDocumentID | 2716464411 22728698 10_1109_TWC_2010_03_090824 5427450 |
| Genre | orig-research |
| GroupedDBID | -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IES IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c357t-ec2c562e41472b0dc39aeec10e4c9c4eef8b4bf901bf5e92faecc965912c24833 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 40 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000277146000041&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1536-1276 |
| IngestDate | Thu Oct 02 11:47:56 EDT 2025 Mon Jun 30 10:17:28 EDT 2025 Mon Jul 21 09:13:10 EDT 2025 Sat Nov 29 02:54:59 EST 2025 Tue Nov 18 20:49:22 EST 2025 Wed Aug 27 05:50:40 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Performance evaluation Optimal algorithm Branch and bound method Wireless telecommunication branch-and-price Teletraffic Eigenvalue SINR constraints column generation Scheduling Joint Optimization Time slot assignment Algorithm performance Simulation Power control Optimal solution Pricing Heuristic method Wireless network Optimal planning Tariffication Fast algorithm Signal to interference plus noise ratio |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c357t-ec2c562e41472b0dc39aeec10e4c9c4eef8b4bf901bf5e92faecc965912c24833 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| PQID | 1027144020 |
| PQPubID | 105736 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1109_TWC_2010_03_090824 proquest_miscellaneous_753639593 proquest_journals_1027144020 pascalfrancis_primary_22728698 ieee_primary_5427450 crossref_primary_10_1109_TWC_2010_03_090824 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-03-01 |
| PublicationDateYYYYMMDD | 2010-03-01 |
| PublicationDate_xml | – month: 03 year: 2010 text: 2010-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on wireless communications |
| PublicationTitleAbbrev | TWC |
| PublicationYear | 2010 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref15 ref14 bertsimas (ref23) 1997 ref11 ref10 ref2 ref1 ref16 cruz (ref17) 2003 ref19 mitra (ref25) 1993 ref18 behzad (ref7) 2005 l fberg (ref28) 2004 sharma (ref3) 2006 wang (ref6) 2006 ref24 ref26 ref20 ref22 ref21 ref27 ref8 ref4 brar (ref9) 2006 ref5 |
| References_xml | – year: 2005 ident: ref7 article-title: Optimum integrated link scheduling and power control for ad hoc wireless networks publication-title: Proc IEEE WIMOB – ident: ref20 doi: 10.1109/TVT.2006.883734 – ident: ref19 doi: 10.1109/25.260766 – ident: ref8 doi: 10.1109/TWC.2006.05058 – ident: ref27 doi: 10.1287/opre.46.3.316 – year: 2006 ident: ref6 article-title: Efficient interference-aware TDMA link scheduling for static wireless networks publication-title: Proc ACM MobiCom – ident: ref16 doi: 10.1109/TVT.2006.873836 – year: 1997 ident: ref23 publication-title: Introduction to Linear Optimization – ident: ref5 doi: 10.1145/938990.938993 – ident: ref1 doi: 10.1109/18.825799 – ident: ref24 doi: 10.1017/CBO9780511840371 – ident: ref12 doi: 10.1109/SAHCN.2006.288418 – ident: ref22 doi: 10.1287/opre.1050.0234 – ident: ref18 doi: 10.1109/25.120145 – ident: ref10 doi: 10.1109/TWC.2003.819032 – ident: ref4 doi: 10.1145/1288107.1288122 – year: 2006 ident: ref9 article-title: Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks publication-title: Proc ACM MobiCom – ident: ref26 doi: 10.1109/90.879345 – year: 1993 ident: ref25 article-title: An asynchronous distributed algorithm for power control in cellular radio systems publication-title: Proc 4th WINLAB Workshop – ident: ref15 doi: 10.1109/INFCOM.2005.1498458 – ident: ref13 doi: 10.1109/CISS.2008.4558576 – ident: ref21 doi: 10.1109/TIT.2005.860471 – year: 2004 ident: ref28 article-title: Yalmip: a toolbox for modeling and optimization in MATLAB publication-title: Proc CACSD Conference – year: 2003 ident: ref17 article-title: Optimal routing, link scheduling and power control in multi-hop wireless networks publication-title: Proc IEEE InfoCom – year: 2006 ident: ref3 article-title: On the complexity of scheduling in wireless networks publication-title: Proc ACM MobiCom – ident: ref14 doi: 10.1109/TIT.2006.883617 – ident: ref2 doi: 10.1109/18.21215 – ident: ref11 doi: 10.1109/TWC.2006.1611067 |
| SSID | ssj0017655 |
| Score | 2.185345 |
| Snippet | This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1186 |
| SubjectTerms | Algorithms Applied sciences branch-and-price column generation Columns (structural) Communication system traffic control Exact sciences and technology Heuristic algorithms Links Networks Optimal scheduling Optimization Power control Power generation Pricing Runtime Scheduling Scheduling algorithm Signal to noise ratio SINR constraints Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Wireless communication Wireless networks |
| Title | Fast algorithms for joint power control and scheduling in wireless networks |
| URI | https://ieeexplore.ieee.org/document/5427450 https://www.proquest.com/docview/1027144020 https://www.proquest.com/docview/753639593 |
| Volume | 9 |
| WOSCitedRecordID | wos000277146000041&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-2248 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017655 issn: 1536-1276 databaseCode: RIE dateStart: 20020101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT9wwEB1R1EN7AAqt2BaQD71BILG9cXxEiBUSCPVAC7fIH-N2q22CNtn-_o6TbARqhdRbJMdyNGN7ZjJv5gF8LrxM0QSVGDIniQwiJMZlNvHBKFE4MkhdFf-3G3V7Wzw86C8bcDLWwiBiBz7D0_jY5fJ97VbxV9nZVFIMFQP0V0rlfa3WmDFQecdwSgc48sqofF0gk-qzu_uLAcMlTtNI8S2fGaGOVSViIk1DYgk9n8VfV3Nnb2bb__elO7A1-JXsvN8I72ADq114-6Tb4B5cz0zTMrP4Xi_n7Y9fDSN_lf2s51XLHiNXGhtg68xUnlHQS0Yo1qqzecViQ-MF3Yms6lHjzXv4Oru8u7hKBi6FxImpahN03JGrgzKTitvUO6ENostSlE47iRgKK20g78CGKWoeDOk2NhvMuOOyEOIDbFZ1hfvAuOHOCZEGH7wUXpC6rTbGWsudzb2cQLYWbumGRuOR72JRdgFHqktSSBkVUqai7BUygeNxzmPfZuPFt_eiyMc3B2lP4OiZDsdxzhUvcl1M4GCt1HI4qg0tw1XMcHOaz8ZhOmQxc2IqrFdNSTEdeXJTLT7-e-VP8KZHFURs2gFstssVHsJr97udN8ujbqP-Aaub548 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB5VBQl64FVQF0rxgRukdWxnHR9Rxaqoy4rDAr1ZfpZFS1Jtsvx-xkk2ogIhcYvkWI5mbM9M5pv5AF6XXtBgoswMmpNMRB4z43Kb-WgkLx0apK6K_8tcLhbl1ZX6tAdvx1qYEEIHPgun6bHL5fvabdOvsrNCYAyVAvQ7hRCM9tVaY85ATjuOUzzCiVlGTnclMlSdLb-eDygufkoTybe4ZYY6XpWEijQNCib2jBZ_XM6dxZk9_L9vfQQPBs-SvOu3wmPYC9UTOPit3-AhXM5M0xKzvq43q_bbj4agx0q-16uqJTeJLY0MwHViKk8w7EUzlKrVyaoiqaXxGm9FUvW48eYpfJ69X55fZAObQuZ4IdssOObQ2QkiF5JZ6h1XJgSX0yCcciKEWFphI_oHNhZBsWhQu6ndYM4cEyXnz2C_qqtwBIQZ5hznNProBfccFW6VMdZa5uzUiwnkO-FqN7QaT4wXa92FHFRpVIhOCtGU614hE3gzzrnpG2388-3DJPLxzUHaEzi5pcNxnDHJyqkqJ3C8U6oeDmuDyzCZctwM55NxGI9Zyp2YKtTbRmNUh75cofjzv6_8Cu5dLD_O9fzD4vIF3O8xBgmpdgz77WYbXsJd97NdNZuTbtP-AtmS6tY |
| 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=Fast+algorithms+for+joint+power+control+and+scheduling+in+wireless+networks&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Fu%2C+Liqun&rft.au=Liew%2C+Soung+Chang&rft.au=Huang%2C+Jianwei&rft.date=2010-03-01&rft.pub=IEEE&rft.issn=1536-1276&rft.volume=9&rft.issue=3&rft.spage=1186&rft.epage=1197&rft_id=info:doi/10.1109%2FTWC.2010.03.090824&rft.externalDocID=5427450 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1276&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1276&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1276&client=summon |