A Queueing Game for Cognitive Radio Access with Buffer-Preserving Interruptions and Catastrophic Resets

A Queueing Game for Cognitive Radio Access with Buffer-Preserving Interruptions and Catastrophic Resets | 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 Queueing Game for Cognitive Radio Access with Buffer-Preserving Interruptions and Catastrophic Resets Mohamed Boualem, Karima Adel-Aissanou This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9255810/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 6 You are reading this latest preprint version Abstract This paper studies a queue-length unobservable, mode-observable queueing game for cognitive-radio access in which primary-user (PU) activity has two qualitatively distinct effects: buffer-preserving interruptions and catastrophic resets. A PU arrival during secondary-user (SU) service mode may either suspend SU service while preserving the SU queue or clear all SU packets and switch the base station to PU service mode. This distinction is crucial because interruptions primarily affect delay, whereas catastrophic resets affect both delay and the probability of eventual service completion. We model the system as a two-mode continuous-time Markov chain and derive its stationary balance equations together with a closed recurrence for the stationary probabilities, which reveals how the catastrophic-reset rate governs the geometric decay of the stationary distribution. We then analyze a tagged SU and obtain explicit expressions for its conditional success probability and conditional time to departure, leading to the conditional entry payoff. Under the queue-length unobservable information structure, we derive the expected entry payoff by averaging over the arrival-seen queue-length distribution conditional on SU-service mode. This framework allows us to characterize both the individual equilibrium and the social optimum. In particular, social welfare must be defined in terms of successfully served SU throughput rather than admitted demand, and we prove that the expected entry payoff is monotone in the joining probability, implying uniqueness of the individual equilibrium. Numerical results illustrate the impact of catastrophic resets on equilibrium behavior, congestion, successful throughput, and welfare loss. MSC Classification: 60K25 , 60J27 , 90B22 , 91A10 Cognitive radio networks queueing game catastrophic resets continuous-time Markov chain unobservable queue social welfare Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviewers agreed at journal 05 Apr, 2026 Reviewers agreed at journal 05 Apr, 2026 Reviewers invited by journal 03 Apr, 2026 Editor assigned by journal 29 Mar, 2026 Submission checks completed at journal 29 Mar, 2026 First submitted to journal 28 Mar, 2026 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-9255810","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":617961168,"identity":"bcd80638-baf9-401e-baf4-e811d0c4021b","order_by":0,"name":"Mohamed Boualem","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABPElEQVRIie2QMUvDQBTH3yE4BVwvJLWfQLhyEISWfhGXhEBdctJJnPRCIF0iWeO3EITMCQd1CZlT7FKETh2CU0GxXoM4eEXpJpIfx3vw7n78uQfQ0vIn0ZqKON62McCRbNn2II44wOFvCgHQ+d4KyZpB9nmtKieT2/xl5g063AimeE0GZ7RiudBgfnwwEX4Nl9ffFasoXYOlI8rN6UiPyIil1YUtlSVFkRNgKJUYq/KIVITDsWdhjQipeCS/exeOz+UQhdoOhb6ydNMo+hvZsIdEKgmIGz9eBGsU4h2KJVOyRjE0krF77JGsBmGjxAllClH/Ulh9lro0NKdu3yQuS4rVVln2/GQRntqlrSiPEX1i6bATG0E+W10NWTzxaG3DvNuLz5+rWt3YF+r+e1wWJeNHunu9bmlpafnHfADbS3nLcXczywAAAABJRU5ErkJggg==","orcid":"","institution":"University of Bejaia","correspondingAuthor":true,"prefix":"","firstName":"Mohamed","middleName":"","lastName":"Boualem","suffix":""},{"id":617961169,"identity":"d350019e-6b45-4392-a11c-75a5f239a30f","order_by":1,"name":"Karima Adel-Aissanou","email":"","orcid":"","institution":"University of Bejaia","correspondingAuthor":false,"prefix":"","firstName":"Karima","middleName":"","lastName":"Adel-Aissanou","suffix":""}],"badges":[],"createdAt":"2026-03-29 01:38:28","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-9255810/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9255810/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":106959729,"identity":"582d4298-6df9-4d8a-9b22-a86b8a1bbaa5","added_by":"auto","created_at":"2026-04-15 09:14:05","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":531936,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptBoualemMCAP.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9255810/v1_covered_bbb8a543-7fe7-4524-a857-f4982ef8ab09.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A Queueing Game for Cognitive Radio Access with Buffer-Preserving Interruptions and Catastrophic Resets","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"methodology-and-computing-in-applied-probability","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"mcap","sideBox":"Learn more about [Methodology and Computing in Applied Probability](http://link.springer.com/journal/11009)","snPcode":"11009","submissionUrl":"https://submission.nature.com/new-submission/11009/3","title":"Methodology and Computing in Applied Probability","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Cognitive radio networks, queueing game, catastrophic resets, continuous-time Markov chain, unobservable queue, social welfare","lastPublishedDoi":"10.21203/rs.3.rs-9255810/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9255810/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis paper studies a queue-length unobservable, mode-observable queueing game for cognitive-radio access in which primary-user (PU) activity has two qualitatively distinct effects: buffer-preserving interruptions and catastrophic resets. A PU arrival during secondary-user (SU) service mode may either suspend SU service while preserving the SU queue or clear all SU packets and switch the base station to PU service mode. This distinction is crucial because interruptions primarily affect delay, whereas catastrophic resets affect both delay and the probability of eventual service completion. We model the system as a two-mode continuous-time Markov chain and derive its stationary balance equations together with a closed recurrence for the stationary probabilities, which reveals how the catastrophic-reset rate governs the geometric decay of the stationary distribution. We then analyze a tagged SU and obtain explicit expressions for its conditional success probability and conditional time to departure, leading to the conditional entry payoff. Under the queue-length unobservable information structure, we derive the expected entry payoff by averaging over the arrival-seen queue-length distribution conditional on SU-service mode. This framework allows us to characterize both the individual equilibrium and the social optimum. In particular, social welfare must be defined in terms of successfully served SU throughput rather than admitted demand, and we prove that the expected entry payoff is monotone in the joining probability, implying uniqueness of the individual equilibrium. Numerical results illustrate the impact of catastrophic resets on equilibrium behavior, congestion, successful throughput, and welfare loss.\u003c/p\u003e\n\u003cp\u003eMSC Classification: 60K25 , 60J27 , 90B22 , 91A10\u003c/p\u003e","manuscriptTitle":"A Queueing Game for Cognitive Radio Access with Buffer-Preserving Interruptions and Catastrophic Resets","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-04-09 20:26:26","doi":"10.21203/rs.3.rs-9255810/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"reviewerAgreed","content":"101290954831122038026648090100765336029","date":"2026-04-06T02:42:37+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"250032497389596220786823102928992156561","date":"2026-04-05T14:42:43+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-04-03T07:40:39+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-03-30T01:11:46+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-03-30T01:11:38+00:00","index":"","fulltext":""},{"type":"submitted","content":"Methodology and Computing in Applied Probability","date":"2026-03-29T01:22:00+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"methodology-and-computing-in-applied-probability","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"mcap","sideBox":"Learn more about [Methodology and Computing in Applied Probability](http://link.springer.com/journal/11009)","snPcode":"11009","submissionUrl":"https://submission.nature.com/new-submission/11009/3","title":"Methodology and Computing in Applied Probability","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"6d54e01a-5fdc-447e-b1df-a1f54b42262d","owner":[],"postedDate":"April 9th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-04-09T20:26:26+00:00","versionOfRecord":[],"versionCreatedAt":"2026-04-09 20:26:26","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9255810","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9255810","identity":"rs-9255810","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}