STORRE
STORRE: Stirling Online Research Repository
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/30214| Appears in Collections: | Computing Science and Mathematics Conference Papers and Proceedings |
| Author(s): | Heal, Maher Li, Jingpeng |
| Contact Email: | jli@cs.stir.ac.uk |
| Title: | Comparison between Maximal Independent Sets and Maximal Cliques Models to Calculate the Capacity of Multihop Wireless Networks |
| Editor(s): | Arai, K Bhatia, R |
| Citation: | Heal 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_44 |
| Issue Date: | 2020 |
| Date Deposited: | 1-Oct-2019 |
| Series/Report no.: | Lecture Notes in Networks and Systems, 70 |
| Conference Name: | FICC 2019: Future of Information and Communication Conference |
| Conference Dates: | 2019-03-14 - 2019-03-15 |
| Conference Location: | San Francisco, CA, USA |
| Abstract: | In 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. |
| Status: | AM - Accepted Manuscript |
| Rights: | This 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_44 |
| Licence URL(s): | https://storre.stir.ac.uk/STORREEndUserLicence.pdf |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| paper.pdf | Fulltext - Accepted Version | 367.77 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
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.