國立虎尾科技大學 |

Data-Driven Optimization for Low-Power Wide-Area Network Planning.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Data-Driven Optimization for Low-Power Wide-Area Network Planning./
作者:	Aarts, Sander.
面頁冊數:	1 online resource (169 pages)
附註:	Source: Dissertations Abstracts International, Volume: 85-03, Section: B.
Contained By:	Dissertations Abstracts International85-03B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798380315623

Data-Driven Optimization for Low-Power Wide-Area Network Planning.
Aarts, Sander.

Data-Driven Optimization for Low-Power Wide-Area Network Planning. - 1 online resource (169 pages)

Source: Dissertations Abstracts International, Volume: 85-03, Section: B.

Thesis (Ph.D.)--Cornell University, 2023.

Includes bibliographical references

Low-Power Wide-Area Networks (LPWANs) are a key technology for connecting Things to the Internet. The LoRaWAN protocol is a particularly popular example, featuring over 300 million connected devices, 5.9 million wireless receivers installed, and nearly 200 public network operators. We consider the design and operation of these networks through the lens of operations research, employing modeling tools, optimization methods, and the mindset of data-driven decision-making, to develop a toolkit for planning and operating LPWANS in a principled approach. First, we formulate learnable models for both wireless connectivity and interference. Our work on interference features a new interpretable subset choice model with strong foundation in random utility theory. Secondly, leaning on data-derived insights, we formulate a wireless receiver placement problem as a covering integer program, which can be stylized as a set cover problem. Motivated by geometric regularities in LoRaWAN connectivity, we develop a new algorithm for geometric set cover, improving the time-complexity of the state-of-the art, while matching the best known asymptotic approximation-ratio with respect to the shallow-cell complexity. Finally, we develop a new provably optimal cost-sharing mechanism for the more general covering integer program that uses duality in a strengthened LP-formulation. We use the mechanism to better understand and guide cost-, and infrastructure-sharing between LPWANs.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798380315623Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

AlgorithmsIndex Terms--Genre/Form:

554714
Electronic books.

Data-Driven Optimization for Low-Power Wide-Area Network Planning.
LDR:02833ntm a22003977 4500 001 1142090
005 20240414211943.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798380315623
035 $a (MiAaPQ)AAI30631424
035 $a AAI30631424
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Aarts, Sander. $3 1466269
245 1 0 $a Data-Driven Optimization for Low-Power Wide-Area Network Planning.
264 0 $c 2023
300 $a 1 online resource (169 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-03, Section: B.
500 $a Advisor: Shmoys, David.
502 $a Thesis (Ph.D.)--Cornell University, 2023.
504 $a Includes bibliographical references
520 $a Low-Power Wide-Area Networks (LPWANs) are a key technology for connecting Things to the Internet. The LoRaWAN protocol is a particularly popular example, featuring over 300 million connected devices, 5.9 million wireless receivers installed, and nearly 200 public network operators. We consider the design and operation of these networks through the lens of operations research, employing modeling tools, optimization methods, and the mindset of data-driven decision-making, to develop a toolkit for planning and operating LPWANS in a principled approach. First, we formulate learnable models for both wireless connectivity and interference. Our work on interference features a new interpretable subset choice model with strong foundation in random utility theory. Secondly, leaning on data-derived insights, we formulate a wireless receiver placement problem as a covering integer program, which can be stylized as a set cover problem. Motivated by geometric regularities in LoRaWAN connectivity, we develop a new algorithm for geometric set cover, improving the time-complexity of the state-of-the art, while matching the best known asymptotic approximation-ratio with respect to the shallow-cell complexity. Finally, we develop a new provably optimal cost-sharing mechanism for the more general covering integer program that uses duality in a strengthened LP-formulation. We use the mechanism to better understand and guide cost-, and infrastructure-sharing between LPWANs.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Statistics. $3 556824
653 $a Algorithms
653 $a Internet of Things
653 $a Optimization
653 $a Wireless networks
653 $a Data-derived insights
655 7 $a Electronic books. $2 local $3 554714
690 $a 0796
690 $a 0984
690 $a 0463
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Cornell University. $b Operations Research and Information Engineering. $3 1466270
773 0 $t Dissertations Abstracts International $g 85-03B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30631424 $z click for full text (PQDT)