Loading…
Multi-Round Message Scheduling for Fast GNSS Packet Broadcasting
Global navigation satellite systems (GNSSs) may transmit data to provide additional services. Since the resources reserved for these data are typically fixed and the message rate is low, we propose to split long messages into shorter packets and properly schedule their transmission from the entire c...
Saved in:
Published in: | IEEE transactions on aerospace and electronic systems 2023-04, p.1-12 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-c1061-5d9c4568205a9e4fd175441c312313be915d972ed8ac75c253002c96eb253af3 |
container_end_page | 12 |
container_issue | |
container_start_page | 1 |
container_title | IEEE transactions on aerospace and electronic systems |
container_volume | |
creator | Ardizzon, Francesco Laurenti, Nicola Tomasin, Stefano |
description | Global navigation satellite systems (GNSSs) may transmit data to provide additional services. Since the resources reserved for these data are typically fixed and the message rate is low, we propose to split long messages into shorter packets and properly schedule their transmission from the entire constellation of satellites. Considering an efficient data transmission (useful for example for search and rescue messages), we aim at the scheduling of packets on the satellites on multiple rounds with two objectives: either a) the minimization of the maximum latency among all receivers, or b) the maximization of the average received packets per round. We first derive bounds on the performance of any GNSS single or multi-round scheduling solution, on which the proposed scheduling solutions are based. Then we introduce the scheduling problems that turn out to be integer linear programming (ILP) problems. Lastly, we assess their performance, showing that our solution minimizes the maximum latency, while the scheduling targeting the average latency outperforms existing literature solutions. |
doi_str_mv | 10.1109/TAES.2023.3269411 |
format | article |
fullrecord | <record><control><sourceid>crossref_ieee_</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TAES_2023_3269411</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10107478</ieee_id><sourcerecordid>10_1109_TAES_2023_3269411</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1061-5d9c4568205a9e4fd175441c312313be915d972ed8ac75c253002c96eb253af3</originalsourceid><addsrcrecordid>eNpNkMtOwzAQRS0EEqHwAUgs_AMJHj_ieEep2oLUAiLZR64zKYHQIDtZ8PckahesZubq3FkcQm6BJQDM3BfzZZ5wxkUieGokwBmJQCkdm5SJcxIxBllsuIJLchXC53jKTIqIPGyHtm_i9244VHSLIdg90tx9YDW0zWFP687TlQ09Xb_kOX2z7gt7-ug7W7kxHYlrclHbNuDNac5IsVoWi6d487p-Xsw3sQOWQqwq46RKM86UNSjrCrSSEpwALkDs0MBIaI5VZp1WjivBGHcmxd242lrMCBzfOt-F4LEuf3zzbf1vCaycDJSTgXIyUJ4MjJ27Y6dBxH88MC11Jv4AEwdVyg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Multi-Round Message Scheduling for Fast GNSS Packet Broadcasting</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Ardizzon, Francesco ; Laurenti, Nicola ; Tomasin, Stefano</creator><creatorcontrib>Ardizzon, Francesco ; Laurenti, Nicola ; Tomasin, Stefano</creatorcontrib><description>Global navigation satellite systems (GNSSs) may transmit data to provide additional services. Since the resources reserved for these data are typically fixed and the message rate is low, we propose to split long messages into shorter packets and properly schedule their transmission from the entire constellation of satellites. Considering an efficient data transmission (useful for example for search and rescue messages), we aim at the scheduling of packets on the satellites on multiple rounds with two objectives: either a) the minimization of the maximum latency among all receivers, or b) the maximization of the average received packets per round. We first derive bounds on the performance of any GNSS single or multi-round scheduling solution, on which the proposed scheduling solutions are based. Then we introduce the scheduling problems that turn out to be integer linear programming (ILP) problems. Lastly, we assess their performance, showing that our solution minimizes the maximum latency, while the scheduling targeting the average latency outperforms existing literature solutions.</description><identifier>ISSN: 0018-9251</identifier><identifier>EISSN: 1557-9603</identifier><identifier>DOI: 10.1109/TAES.2023.3269411</identifier><identifier>CODEN: IEARAX</identifier><language>eng</language><publisher>IEEE</publisher><subject>Codes ; Global navigation satellite system ; Measurement ; Receivers ; Satellite broadcasting ; Satellites ; Scheduling</subject><ispartof>IEEE transactions on aerospace and electronic systems, 2023-04, p.1-12</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1061-5d9c4568205a9e4fd175441c312313be915d972ed8ac75c253002c96eb253af3</cites><orcidid>0000-0001-6066-7550 ; 0000-0003-3253-6793</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10107478$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Ardizzon, Francesco</creatorcontrib><creatorcontrib>Laurenti, Nicola</creatorcontrib><creatorcontrib>Tomasin, Stefano</creatorcontrib><title>Multi-Round Message Scheduling for Fast GNSS Packet Broadcasting</title><title>IEEE transactions on aerospace and electronic systems</title><addtitle>T-AES</addtitle><description>Global navigation satellite systems (GNSSs) may transmit data to provide additional services. Since the resources reserved for these data are typically fixed and the message rate is low, we propose to split long messages into shorter packets and properly schedule their transmission from the entire constellation of satellites. Considering an efficient data transmission (useful for example for search and rescue messages), we aim at the scheduling of packets on the satellites on multiple rounds with two objectives: either a) the minimization of the maximum latency among all receivers, or b) the maximization of the average received packets per round. We first derive bounds on the performance of any GNSS single or multi-round scheduling solution, on which the proposed scheduling solutions are based. Then we introduce the scheduling problems that turn out to be integer linear programming (ILP) problems. Lastly, we assess their performance, showing that our solution minimizes the maximum latency, while the scheduling targeting the average latency outperforms existing literature solutions.</description><subject>Codes</subject><subject>Global navigation satellite system</subject><subject>Measurement</subject><subject>Receivers</subject><subject>Satellite broadcasting</subject><subject>Satellites</subject><subject>Scheduling</subject><issn>0018-9251</issn><issn>1557-9603</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><recordid>eNpNkMtOwzAQRS0EEqHwAUgs_AMJHj_ieEep2oLUAiLZR64zKYHQIDtZ8PckahesZubq3FkcQm6BJQDM3BfzZZ5wxkUieGokwBmJQCkdm5SJcxIxBllsuIJLchXC53jKTIqIPGyHtm_i9244VHSLIdg90tx9YDW0zWFP687TlQ09Xb_kOX2z7gt7-ug7W7kxHYlrclHbNuDNac5IsVoWi6d487p-Xsw3sQOWQqwq46RKM86UNSjrCrSSEpwALkDs0MBIaI5VZp1WjivBGHcmxd242lrMCBzfOt-F4LEuf3zzbf1vCaycDJSTgXIyUJ4MjJ27Y6dBxH88MC11Jv4AEwdVyg</recordid><startdate>20230421</startdate><enddate>20230421</enddate><creator>Ardizzon, Francesco</creator><creator>Laurenti, Nicola</creator><creator>Tomasin, Stefano</creator><general>IEEE</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-6066-7550</orcidid><orcidid>https://orcid.org/0000-0003-3253-6793</orcidid></search><sort><creationdate>20230421</creationdate><title>Multi-Round Message Scheduling for Fast GNSS Packet Broadcasting</title><author>Ardizzon, Francesco ; Laurenti, Nicola ; Tomasin, Stefano</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1061-5d9c4568205a9e4fd175441c312313be915d972ed8ac75c253002c96eb253af3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Codes</topic><topic>Global navigation satellite system</topic><topic>Measurement</topic><topic>Receivers</topic><topic>Satellite broadcasting</topic><topic>Satellites</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ardizzon, Francesco</creatorcontrib><creatorcontrib>Laurenti, Nicola</creatorcontrib><creatorcontrib>Tomasin, Stefano</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Xplore Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) Online</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><jtitle>IEEE transactions on aerospace and electronic systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ardizzon, Francesco</au><au>Laurenti, Nicola</au><au>Tomasin, Stefano</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multi-Round Message Scheduling for Fast GNSS Packet Broadcasting</atitle><jtitle>IEEE transactions on aerospace and electronic systems</jtitle><stitle>T-AES</stitle><date>2023-04-21</date><risdate>2023</risdate><spage>1</spage><epage>12</epage><pages>1-12</pages><issn>0018-9251</issn><eissn>1557-9603</eissn><coden>IEARAX</coden><abstract>Global navigation satellite systems (GNSSs) may transmit data to provide additional services. Since the resources reserved for these data are typically fixed and the message rate is low, we propose to split long messages into shorter packets and properly schedule their transmission from the entire constellation of satellites. Considering an efficient data transmission (useful for example for search and rescue messages), we aim at the scheduling of packets on the satellites on multiple rounds with two objectives: either a) the minimization of the maximum latency among all receivers, or b) the maximization of the average received packets per round. We first derive bounds on the performance of any GNSS single or multi-round scheduling solution, on which the proposed scheduling solutions are based. Then we introduce the scheduling problems that turn out to be integer linear programming (ILP) problems. Lastly, we assess their performance, showing that our solution minimizes the maximum latency, while the scheduling targeting the average latency outperforms existing literature solutions.</abstract><pub>IEEE</pub><doi>10.1109/TAES.2023.3269411</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0001-6066-7550</orcidid><orcidid>https://orcid.org/0000-0003-3253-6793</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0018-9251 |
ispartof | IEEE transactions on aerospace and electronic systems, 2023-04, p.1-12 |
issn | 0018-9251 1557-9603 |
language | eng |
recordid | cdi_crossref_primary_10_1109_TAES_2023_3269411 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Codes Global navigation satellite system Measurement Receivers Satellite broadcasting Satellites Scheduling |
title | Multi-Round Message Scheduling for Fast GNSS Packet Broadcasting |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T23%3A52%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multi-Round%20Message%20Scheduling%20for%20Fast%20GNSS%20Packet%20Broadcasting&rft.jtitle=IEEE%20transactions%20on%20aerospace%20and%20electronic%20systems&rft.au=Ardizzon,%20Francesco&rft.date=2023-04-21&rft.spage=1&rft.epage=12&rft.pages=1-12&rft.issn=0018-9251&rft.eissn=1557-9603&rft.coden=IEARAX&rft_id=info:doi/10.1109/TAES.2023.3269411&rft_dat=%3Ccrossref_ieee_%3E10_1109_TAES_2023_3269411%3C/crossref_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1061-5d9c4568205a9e4fd175441c312313be915d972ed8ac75c253002c96eb253af3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=10107478&rfr_iscdi=true |