A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit <a rel="external noopener" href="http://nms.citi.sinica.edu.tw:80/paper/submodular.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2n2fyi4qgfa53mwrtarkk6ysnm" style="color: black;">2013 Proceedings IEEE INFOCOM</a>
In this paper, we investigate the wireless network deployment problem, which seeks the best deployment of a given limited number of wireless routers. We found that many goals for network deployment, such as maximizing the number of covered users or areas, or the total throughput of the network, can be modelled with the submodular set function. Specifically, given a set of routers, the goal is to find a set of locations S, each of which is equipped with a router, such that S maximizes a<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2013.6566998">doi:10.1109/infcom.2013.6566998</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/infocom/KuoLT13.html">dblp:conf/infocom/KuoLT13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7c7mjvu6ebbsdkol2iduqb2s3a">fatcat:7c7mjvu6ebbsdkol2iduqb2s3a</a> </span>
more »... d submodular set function. However, this deployment problem is more difficult than the traditional maximum submodular set function problem, e.g., the maximum coverage problem, because it requires all the deployed routers to form a connected network. In addition, deploying a router in different locations might consume different costs. To address these challenges, this paper introduces two approximation algorithms, one for homogeneous deployment cost scenarios and the other for heterogeneous deployment cost scenarios. Our simulations, using synthetic data and real traces of census in Taipei, show that the proposed algorithms achieve a better performance than other heuristics.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131124123006/http://nms.citi.sinica.edu.tw:80/paper/submodular.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/94/67/94672e3c49d1adaa3165c411b58c8f26318d6f7b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2013.6566998"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>