A Boltzmann Machine Optimizing Dynamic Routing for FANETs

A Boltzmann Machine Optimizing Dynamic Routing for FANETs | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A Boltzmann Machine Optimizing Dynamic Routing for FANETs Xing WEI, WenTao HUANG, Hua YANG This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1105512/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 4 You are reading this latest preprint version Abstract Routing optimization for FANETs is a kind of NP-hard in the field of combinatorial optimization that describes simple and difficult to handle. The quality of routing has a direct impact on the network quality of FANETs, and the design of routing protocols becomes a very challenging topic in FANETs. In this paper, we study the characteristics of dynamic routing, combine the characteristics of FANETs themselves, use the energy of nodes, bandwidth, link stability, etc. as the metric of routing, and use Boltzmann machine for routing search to form an optimized dynamic routing protocol. The NS3 simulation simulator is used to compare and study with traditional MANET dynamic routing AODV and DSR, and the simulation results show that the routes obtained by using Boltzmann machine search are better than AODV and DSR in many aspects such as end-to-end average delay, average route survival time and control overhead. Software Engineering FANET Boltzmann machine Dynamic routing Routing optimization Figures Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Full Text Tables Due to technical limitations, table 1 is only available as a download in the Supplemental Files section. Supplementary Files table.docx Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 27 Nov, 2021 Reviewers invited by journal 26 Nov, 2021 Editor assigned by journal 26 Nov, 2021 First submitted to journal 22 Nov, 2021 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-1105512","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":66157299,"identity":"87516d18-3c70-4bd0-833a-ca5e257d1e27","order_by":0,"name":"Xing WEI","email":"","orcid":"","institution":"Guangxi Normal University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Xing","middleName":"","lastName":"WEI","suffix":""},{"id":66157300,"identity":"afff7bf5-4b04-4c30-9fe0-fe96efcffcf0","order_by":1,"name":"WenTao HUANG","email":"","orcid":"","institution":"Guangxi Normal University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"WenTao","middleName":"","lastName":"HUANG","suffix":""},{"id":66157301,"identity":"6e6f62f8-d990-4e86-ae5e-33498a26d1e5","order_by":2,"name":"Hua YANG","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA0klEQVRIiWNgGAWjYDACdgYGZoYKKIeHKC3MIHQGyGAjSQtjGyla5J0Z2KQL59Um9s9vYHzwto1B3pyQFsPDQC0ztx1PnHGMgdlwbhuD4c4GQlqa+b9J8247lthwDKiXt40hweAAQS0glXOOJc4/xsD+mygt8swgLQ01iRuAtjATpcWAmYHZmufYAeONxxKbJeeckzDcQNCW9gbG2zw1dbLzDh8++OFNmY08YVsOMLBIMDAcBjIZG4CEBAH1IFsaGJg/MDDUEVY5CkbBKBgFIxcAAAw6OXcetWTQAAAAAElFTkSuQmCC","orcid":"https://orcid.org/0000-0002-0650-5240","institution":"GUAT: Guilin University of Aerospace Technology","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Hua","middleName":"","lastName":"YANG","suffix":""}],"badges":[],"createdAt":"2021-11-23 03:33:01","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1105512/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1105512/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":15972778,"identity":"345ee4ce-99b0-46e4-892d-9c852c49d3b6","added_by":"auto","created_at":"2021-11-29 16:21:55","extension":"png","order_by":1,"title":"Figure 1","display":"","copyAsset":false,"role":"figure","size":12284,"visible":true,"origin":"","legend":"The structure of Boltzmann machine network","description":"","filename":"Onlinefloatimage1.png","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1/d85b8360196c5b5fc21e6f4d.png"},{"id":15973054,"identity":"0f63d7e8-169f-4ae1-ad34-b3800dbb85f4","added_by":"auto","created_at":"2021-11-29 16:24:55","extension":"jpeg","order_by":2,"title":"Figure 2","display":"","copyAsset":false,"role":"figure","size":115970,"visible":true,"origin":"","legend":"The average delay when the number of communication source nodes varies","description":"","filename":"floatimage2.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1/b9268d65733dbe4f793eb25f.jpeg"},{"id":15972782,"identity":"5737d56c-89ad-464c-933a-d2e714ba9cc0","added_by":"auto","created_at":"2021-11-29 16:21:55","extension":"jpeg","order_by":3,"title":"Figure 3","display":"","copyAsset":false,"role":"figure","size":121239,"visible":true,"origin":"","legend":"The control overhead when the number of communication source nodes varies","description":"","filename":"floatimage3.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1/71b5d3bab94daf357891e682.jpeg"},{"id":15972783,"identity":"0b9fc5d1-cbd7-43ed-a63f-51c3db79375f","added_by":"auto","created_at":"2021-11-29 16:21:56","extension":"jpeg","order_by":4,"title":"Figure 4","display":"","copyAsset":false,"role":"figure","size":100703,"visible":true,"origin":"","legend":"The average delay when node movement speed varies","description":"","filename":"floatimage4.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1/0413ff5ddc3c065e8f62524b.jpeg"},{"id":15972781,"identity":"89f1d9a8-4384-4773-b41f-5927620b3257","added_by":"auto","created_at":"2021-11-29 16:21:55","extension":"jpeg","order_by":5,"title":"Figure 5","display":"","copyAsset":false,"role":"figure","size":96708,"visible":true,"origin":"","legend":"The control overhead when node movement speed varies","description":"","filename":"floatimage5.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1/30036f84b096897b2b3323ce.jpeg"},{"id":15972779,"identity":"c472fea9-683f-4ea7-b809-834c313bea33","added_by":"auto","created_at":"2021-11-29 16:21:55","extension":"jpeg","order_by":6,"title":"Figure 6","display":"","copyAsset":false,"role":"figure","size":108211,"visible":true,"origin":"","legend":"The average route lifetime when node movement speed varies\n\n","description":"","filename":"floatimage6.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1/65b324040ab0b1dd0a06141a.jpeg"},{"id":15973055,"identity":"bd34ee7f-30ee-48bc-9fe4-9b02575b3168","added_by":"auto","created_at":"2021-11-29 16:25:07","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":681605,"visible":true,"origin":"","legend":"","description":"","filename":"ABoltzmannmachineoptimizingdynamicroutingforFANETs.pdf","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1_covered.pdf"},{"id":15972776,"identity":"cbfef8ef-56f5-4b29-a38a-de2f8c353bc8","added_by":"auto","created_at":"2021-11-29 16:21:54","extension":"docx","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":19347,"visible":true,"origin":"","legend":"","description":"","filename":"table.docx","url":"https://assets-eu.researchsquare.com/files/rs-1105512/v1/9f473646eb209e033f8664b1.docx"}],"financialInterests":"","formattedTitle":"\u003cp\u003eA Boltzmann Machine Optimizing Dynamic Routing for FANETs\u003c/p\u003e","fulltext":[{"header":"Full Text","content":"This preprint is available for \u003ca href='/article/rs-1105512/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e."},{"header":"Tables","content":"\u003cp\u003eDue to technical limitations, table 1 is only available as a download in the Supplemental Files section.\u003c/p\u003e"}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":true,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"soft-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"soco","sideBox":"Learn more about [Soft Computing](https://www.springer.com/journal/500)","snPcode":"500","submissionUrl":"https://submission.nature.com/new-submission/500/3","title":"Soft Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"FANET, Boltzmann machine, Dynamic routing, Routing optimization","lastPublishedDoi":"10.21203/rs.3.rs-1105512/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1105512/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eRouting optimization for FANETs is a kind of NP-hard in the field of combinatorial optimization that describes simple and difficult to handle. The quality of routing has a direct impact on the network quality of FANETs, and the design of routing protocols becomes a very challenging topic in FANETs. In this paper, we study the characteristics of dynamic routing, combine the characteristics of FANETs themselves, use the energy of nodes, bandwidth, link stability, etc. as the metric of routing, and use Boltzmann machine for routing search to form an optimized dynamic routing protocol. The NS3 simulation simulator is used to compare and study with traditional MANET dynamic routing AODV and DSR, and the simulation results show that the routes obtained by using Boltzmann machine search are better than AODV and DSR in many aspects such as end-to-end average delay, average route survival time and control overhead.\u003c/p\u003e","manuscriptTitle":"A Boltzmann Machine Optimizing Dynamic Routing for FANETs","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2021-11-29 16:21:46","doi":"10.21203/rs.3.rs-1105512/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2021-11-27T05:19:35+00:00","index":0,"fulltext":""},{"type":"reviewersInvited","content":"","date":"2021-11-26T13:29:25+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2021-11-26T06:25:49+00:00","index":"","fulltext":""},{"type":"submitted","content":"Soft Computing","date":"2021-11-22T22:32:21+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"soft-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"soco","sideBox":"Learn more about [Soft Computing](https://www.springer.com/journal/500)","snPcode":"500","submissionUrl":"https://submission.nature.com/new-submission/500/3","title":"Soft Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"def319e6-d70b-48ba-9b26-3ddb66d16a57","owner":[],"postedDate":"November 29th, 2021","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[{"id":8796696,"name":"Software Engineering"}],"tags":[],"updatedAt":"2022-04-01T08:11:19+00:00","versionOfRecord":[],"versionCreatedAt":"2021-11-29 16:21:46","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-1105512","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1105512","identity":"rs-1105512","version":["v1"]},"buildId":"FbvkV6FR0MCFSLy54lSbu","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}