Sökning: onr:"swepub:oai:DiVA.org:liu-205438" > Service Time Maximi...
Fältnamn | Indikatorer | Metadata |
---|---|---|
000 | 03339naa a2200337 4500 | |
001 | oai:DiVA.org:liu-205438 | |
003 | SwePub | |
008 | 240626s2024 | |||||||||||000 ||eng| | |
024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2054382 URI |
024 | 7 | a https://doi.org/10.1109/TIV.2023.32876292 DOI |
040 | a (SwePub)liu | |
041 | a engb eng | |
042 | 9 SwePub | |
072 | 7 | a ref2 swepub-contenttype |
072 | 7 | a art2 swepub-publicationtype |
100 | 1 | a Dandapat, Jyotirindrau IIT Delhi, India4 aut |
245 | 1 0 | a Service Time Maximization for Data Collection in Multi-UAV-Aided Networks |
264 | 1 | b IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC,c 2024 |
338 | a print2 rdacarrier | |
500 | a Funding Agencies|Department of Science and Technology [DST/INSPIRE/04/2016/001127, CRG/2020/005749]; IIT Ropar ISIRD [9-362/2018/IITRPR/1590] | |
520 | a Unmanned aerial vehicles (UAVs) have been enormously gaining attention to offload traffic or collect data in wireless networks due to their key attributes, such as mobility, flexibility, and cost-effective deployment. However, the limited onboard energy inhibits the UAV from serving for a longer duration. Therefore, this article studies a UAV-aided network where multiple UAVs are launched to collect data from the mobile nodes. In particular, we aim to maximize the service time of the UAVs by jointly optimizing the three-dimensional (3D) trajectory of the UAVs and resources allocated to each node by the UAVs such that each mobile node receives a minimum specified data rate. To facilitate a solution, we construct an equivalent problem that considers the UAV's energy consumption. In particular, we minimize the maximum energy consumed by the UAVs in each time slot. To solve the problem, an iterative approach is presented that decouples the problem into two sub-problems. The optimal location of the UAVs is computed in the first sub-problem, while resource allocation is carried out in the second sub-problem. These two sub-problems are solved in an iterative manner using the alternating optimization approach. We show that the proposed approach improves the service time of the network by 20% on average compared to the existing approaches. | |
650 | 7 | a TEKNIK OCH TEKNOLOGIERx Elektroteknik och elektronikx Kommunikationssystem0 (SwePub)202032 hsv//swe |
650 | 7 | a ENGINEERING AND TECHNOLOGYx Electrical Engineering, Electronic Engineering, Information Engineeringx Communication Systems0 (SwePub)202032 hsv//eng |
653 | a Trajectory; Mobile nodes; Autonomous aerial vehicles; Wireless networks; Resource management; Data collection; Energy consumption; Energy management; mobile nodes; Multi-UAV-aided wireless networks; multi-UAV trajectory; resource management | |
700 | 1 | a Gupta, Nishantu Linköpings universitet,Kommunikationssystem,Tekniska fakulteten4 aut0 (Swepub:liu)nisgu99 |
700 | 1 | a Agarwal, Satyamu IIT Ropar, India4 aut |
700 | 1 | a Kumbhani, Brijeshu IIT Ropar, India4 aut |
710 | 2 | a IIT Delhi, Indiab Kommunikationssystem4 org |
773 | 0 | t IEEE Transactions on Intelligent Vehiclesd : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCg 9:1, s. 328-337q 9:1<328-337x 2379-8858x 2379-8904 |
856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-205438 |
856 | 4 8 | u https://doi.org/10.1109/TIV.2023.3287629 |
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
Kopiera och spara länken för att återkomma till aktuell vy