Optimizing Participant Selection for Fault-Tolerant Decision Making in Orbit Using Mixed Integer Linear Programming

IF 4.7 2区 地球科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Robert Cowlishaw;Annalisa Riccardi;Ashwin Arulselvan
{"title":"Optimizing Participant Selection for Fault-Tolerant Decision Making in Orbit Using Mixed Integer Linear Programming","authors":"Robert Cowlishaw;Annalisa Riccardi;Ashwin Arulselvan","doi":"10.1109/JSTARS.2024.3459630","DOIUrl":null,"url":null,"abstract":"In challenging environments such as space, where decisions made by a network of satellites can be prone to inaccuracies or biases, leveraging smarter systems for onboard data processing, decision making is becoming increasingly common. To ensure fault tolerance within the network, consensus mechanisms play a crucial role. However, in a dynamically changing network topology, achieving consensus among all satellites can become excessively time consuming. To address this issue, the practical Byzantine fault-tolerance algorithm is employed, utilizing satellite trajectories as input to determine the time required for achieving consensus across a subnetwork of satellites. To optimize the selection of subsets for consensus, a mixed integer linear programming approach is developed. This method is then applied to analyze the characteristics of optimal subsets using satellites from the International Charter: Space and Major Disasters (ICSMD) over a predefined maximum time horizon. Results indicate that consensus within these satellites can be reached in less than 3.3 h in half of cases studied. Two satellites that are within the maximum communication range at all times are oversubscribed for taking part in the subnetwork. A further analysis has been completed to analyze which are the best set of orbital parameters for taking part in a consensus network as part of the ICSMD.","PeriodicalId":13116,"journal":{"name":"IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing","volume":null,"pages":null},"PeriodicalIF":4.7000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10678934","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10678934/","RegionNum":2,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

In challenging environments such as space, where decisions made by a network of satellites can be prone to inaccuracies or biases, leveraging smarter systems for onboard data processing, decision making is becoming increasingly common. To ensure fault tolerance within the network, consensus mechanisms play a crucial role. However, in a dynamically changing network topology, achieving consensus among all satellites can become excessively time consuming. To address this issue, the practical Byzantine fault-tolerance algorithm is employed, utilizing satellite trajectories as input to determine the time required for achieving consensus across a subnetwork of satellites. To optimize the selection of subsets for consensus, a mixed integer linear programming approach is developed. This method is then applied to analyze the characteristics of optimal subsets using satellites from the International Charter: Space and Major Disasters (ICSMD) over a predefined maximum time horizon. Results indicate that consensus within these satellites can be reached in less than 3.3 h in half of cases studied. Two satellites that are within the maximum communication range at all times are oversubscribed for taking part in the subnetwork. A further analysis has been completed to analyze which are the best set of orbital parameters for taking part in a consensus network as part of the ICSMD.
利用混合整数线性规划优化轨道容错决策的参与者选择
在太空等充满挑战的环境中,卫星网络做出的决策很容易出现误差或偏差,利用更智能的系统进行机载数据处理、做出决策变得越来越普遍。为了确保网络内部的容错性,共识机制发挥着至关重要的作用。然而,在动态变化的网络拓扑结构中,在所有卫星之间达成共识可能会耗费大量时间。为解决这一问题,我们采用了实用的拜占庭容错算法,利用卫星轨迹作为输入,确定在卫星子网络中达成共识所需的时间。为优化共识子集的选择,开发了一种混合整数线性编程方法。然后,利用《国际宪章:空间与重大灾害》(ICSMD)中的卫星,在预定的最长时间跨度内应用该方法分析最佳子集的特征。结果表明,在半数研究案例中,这些卫星可在 3.3 小时内达成共识。两颗始终处于最大通信范围内的卫星因超额认购而无法参与子网络。还完成了进一步的分析,以分析哪套轨道参数最适合参加作为国际空间碎片协 调理事会一部分的共识网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
9.30
自引率
10.90%
发文量
563
审稿时长
4.7 months
期刊介绍: The IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing addresses the growing field of applications in Earth observations and remote sensing, and also provides a venue for the rapidly expanding special issues that are being sponsored by the IEEE Geosciences and Remote Sensing Society. The journal draws upon the experience of the highly successful “IEEE Transactions on Geoscience and Remote Sensing” and provide a complementary medium for the wide range of topics in applied earth observations. The ‘Applications’ areas encompasses the societal benefit areas of the Global Earth Observations Systems of Systems (GEOSS) program. Through deliberations over two years, ministers from 50 countries agreed to identify nine areas where Earth observation could positively impact the quality of life and health of their respective countries. Some of these are areas not traditionally addressed in the IEEE context. These include biodiversity, health and climate. Yet it is the skill sets of IEEE members, in areas such as observations, communications, computers, signal processing, standards and ocean engineering, that form the technical underpinnings of GEOSS. Thus, the Journal attracts a broad range of interests that serves both present members in new ways and expands the IEEE visibility into new areas.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信