1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Conference Papers and Proceedings
Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/30214
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHeal, Maheren_UK
dc.contributor.authorLi, Jingpengen_UK
dc.contributor.editorArai, Ken_UK
dc.contributor.editorBhatia, Ren_UK
dc.date.accessioned2019-10-02T00:01:42Z-
dc.date.available2019-10-02T00:01:42Z-
dc.date.issued2020en_UK
dc.identifier.urihttp://hdl.handle.net/1893/30214-
dc.description.abstractIn this work we compare two models to calculate the capacity of multihop wireless networks. The first model utilizes the maximal independent sets of the conflict graph. The problem in that model is formulated as a linear program. The second model in our comparison utilizes the maximal cliques of the conflict graph using integer programming. We see the second model is much more efficient in calculating the capacity for larger networks. We make no assumption on the interference models and we only model it by assuming a conflict matrix. First, we prove there is a periodic schedule for the flow, by using that we formulate our integer programming model to attain maximum capacity for the network. We consider one source of data and one destination i.e. a single commodity network.en_UK
dc.language.isoenen_UK
dc.publisherSpringer International Publishing Companyen_UK
dc.relationHeal M & Li J (2020) Comparison between Maximal Independent Sets and Maximal Cliques Models to Calculate the Capacity of Multihop Wireless Networks. In: Arai K & Bhatia R (eds.) Advances in Information and Communication. FICC 2019. Lecture Notes in Networks and Systems, 70. FICC 2019: Future of Information and Communication Conference, San Francisco, CA, USA, 14.03.2019-15.03.2019. Cham, Switzerland: Springer International Publishing Company, pp. 603-615. https://doi.org/10.1007/978-3-030-12385-7_44en_UK
dc.relation.ispartofseriesLecture Notes in Networks and Systems, 70en_UK
dc.rightsThis item has been embargoed for a period. During the embargo please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. This is a post-peer-review, pre-copyedit version of a paper published in Arai K & Bhatia R (eds.) Advances in Information and Communication. FICC 2019. Lecture Notes in Networks and Systems, 70. FICC 2019: Future of Information and Communication Conference, San Francisco, CA, USA, 14.03.2019-15.03.2019. Cham, Switzerland: Springer International Publishing Company, pp. 603-615. The final authenticated version is available online at: https://doi.org/10.1007/978-3-030-12385-7_44en_UK
dc.rights.urihttps://storre.stir.ac.uk/STORREEndUserLicence.pdfen_UK
dc.subjectMaximal independent seten_UK
dc.subjectMaximal cliqueen_UK
dc.subjectLinear programmingen_UK
dc.subjectBinary programmingen_UK
dc.subjectMaximum throughputen_UK
dc.titleComparison between Maximal Independent Sets and Maximal Cliques Models to Calculate the Capacity of Multihop Wireless Networksen_UK
dc.typeConference Paperen_UK
dc.rights.embargodate2020-02-03en_UK
dc.rights.embargoreason[paper.pdf] Publisher requires embargo of 12 months after formal publication.en_UK
dc.identifier.doi10.1007/978-3-030-12385-7_44en_UK
dc.citation.jtitleLecture Notes in Networks and Systems; Advances in Information and Communicationen_UK
dc.citation.issn2367-3389en_UK
dc.citation.issn2367-3370en_UK
dc.citation.issn2367-3370en_UK
dc.citation.spage603en_UK
dc.citation.epage615en_UK
dc.citation.publicationstatusPublisheden_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.author.emailjli@cs.stir.ac.uken_UK
dc.citation.btitleAdvances in Information and Communication. FICC 2019en_UK
dc.citation.conferencedates2019-03-14 - 2019-03-15en_UK
dc.citation.conferencelocationSan Francisco, CA, USAen_UK
dc.citation.conferencenameFICC 2019: Future of Information and Communication Conferenceen_UK
dc.citation.date02/02/2019en_UK
dc.citation.isbn9783030123840en_UK
dc.citation.isbn9783030123857en_UK
dc.publisher.addressCham, Switzerlanden_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.identifier.scopusid2-s2.0-85062910728en_UK
dc.identifier.wtid1454842en_UK
dc.contributor.orcid0000-0002-6758-0084en_UK
dc.date.accepted2019-02-02en_UK
dcterms.dateAccepted2019-02-02en_UK
dc.date.filedepositdate2019-10-01en_UK
rioxxterms.apcnot requireden_UK
rioxxterms.typeConference Paper/Proceeding/Abstracten_UK
rioxxterms.versionAMen_UK
local.rioxx.authorHeal, Maher|en_UK
local.rioxx.authorLi, Jingpeng|0000-0002-6758-0084en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.contributorArai, K|en_UK
local.rioxx.contributorBhatia, R|en_UK
local.rioxx.freetoreaddate2020-02-03en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||2020-02-02en_UK
local.rioxx.licencehttps://storre.stir.ac.uk/STORREEndUserLicence.pdf|2020-02-03|en_UK
local.rioxx.filenamepaper.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source9783030123857en_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
paper.pdfFulltext - Accepted Version367.77 kBAdobe PDFView/Open


This item is protected by original copyright

View License
Show simple item record


Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.