Black Widow Optimization Algorithm and Similarity Index Based Adaptive Scheduled Partitioning Technique for Reliable Emergency Message Broadcasting in VANET | 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 Black Widow Optimization Algorithm and Similarity Index Based Adaptive Scheduled Partitioning Technique for Reliable Emergency Message Broadcasting in VANET M Ramya Devi, I Jasmine Selvakumari Jeya This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-309575/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 01 Nov, 2022 Read the published version in Automatika → Version 1 posted You are reading this latest preprint version Abstract The vehicular ad hoc network (VANET) topology will change the mobility of the nodes and the data delivery will be efficient in the vehicle environment. This technique uses the density, mobility, dissemination in the requirements of emergency message broadcasting. The emergency message is broadcast on the road causes many issues like reliability, latency and scalability. Beacons are used in the VANET to broadcast messages and get the information from neighbours. When more vehicles transmit the messages in equal time lead a frequent broadcast storm the vehicles are faced the message delivery failure. Adaptive Scheduled Partitioning and Broadcasting technique (ASPBT) is used in our paper for message reliability, and the transmission efficiency will adjust the partitions and beacon automatically for reducing retransmissions. The partition size is determined using the density of network transmission of each partition schedule is estimated using the Black Widow Optimization (BWOA). The emergency message gets low delay and redundancy of the message is reducing, ASPBT include the forwarding of novel with the selection of optimal partition. The performance analysis is done with the existing methods for the determination of efficiency, redundancy, collision, and delay. The efficiency of proposed technique as 98% comparing with existing broadcast schemes of VANET. Systems and Networking Technical Communication Vehicular ad hoc network (VANET) Broadcasting messages Beacon black widow optimization adaptive partition scheme network Figures Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7 Figure 8 Figure 9 Figure 10 Figure 11 Figure 12 Figure 13 Full Text Due to technical limitations, full-text HTML conversion of this manuscript could not be completed. However, the manuscript can be downloaded and accessed as a PDF. Tables Table 1 Simulation setup Parameter Value MAC layer 802.11 p Transmission range 200 m Transmission power 0.98mW Bit rate 18Mbps Beacon size 32Mbps Propagation model Two-way interference Number of repetitions 33 Time slot 16µs RTB max. slot 100 bytes Cite Share Download PDF Status: Published Journal Publication published 01 Nov, 2022 Read the published version in Automatika → Version 1 posted 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-309575","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research","associatedPublications":[],"authors":[{"id":19541314,"identity":"5ba69748-98af-4bff-880f-bb6309e85919","order_by":0,"name":"M Ramya Devi","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABD0lEQVRIiWNgGAWjYLADCRDBDyISCkjRItkA0mJAihaDA2AStyrz9tNpEj9zDucbnF/88MaPP3Z5xudXJ354YMAgzy92AKsWmTO52yR7tx223HDjmbFlb1tysdmNt5slgA4znDk7AYdbcrdJ8G47bGBw44CZBG8Dc+K2G2c3gLQkGNzGoYX/7TbJv2Atx79J/vlTn7h5xtnNP/BqkcjdJg225XyPmTQP2+HEDfy92/DbIvF2s7XstnQDyRs8xdaybccTZ9zg3WaRYCCB2y/8uRtvvt1mbcB3/vjGm2/+VCf295/dfPNHhY08vzR2LUDAIgHRDFMAYUjgUg4CzB/AFP8BKB/OGAWjYBSMglEAAQCglWdVSSng5gAAAABJRU5ErkJggg==","orcid":"https://orcid.org/0000-0002-6155-0474","institution":"Hindusthan college of Engineering and Technology","correspondingAuthor":true,"prefix":"","firstName":"M","middleName":"Ramya","lastName":"Devi","suffix":""},{"id":19541315,"identity":"94b23d45-819c-433f-853b-f4190b6c9ee4","order_by":1,"name":"I Jasmine Selvakumari Jeya","email":"","orcid":"","institution":"Hindusthan College of Engineering and Technology","correspondingAuthor":false,"prefix":"","firstName":"I","middleName":"Jasmine Selvakumari","lastName":"Jeya","suffix":""}],"badges":[],"createdAt":"2021-03-08 11:08:58","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-309575/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-309575/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1080/00051144.2022.2140392","type":"published","date":"2022-11-02T00:00:00+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":7669178,"identity":"e86e44f4-806b-4747-bcf1-7923df8839be","added_by":"auto","created_at":"2021-04-05 14:41:32","extension":"png","order_by":1,"title":"Figure 1","display":"","copyAsset":false,"role":"figure","size":135537,"visible":true,"origin":"","legend":"Message broadcast","description":"","filename":"Fig01.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/a58a6c7c09f407772154747b.png"},{"id":7669146,"identity":"f506b956-7a10-4174-a4f8-b9682e2f12be","added_by":"auto","created_at":"2021-04-05 14:41:30","extension":"png","order_by":2,"title":"Figure 2","display":"","copyAsset":false,"role":"figure","size":6121,"visible":true,"origin":"","legend":"RTB packet format","description":"","filename":"Fig02.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/6b7b2e6863a6ca647b688440.png"},{"id":7669841,"identity":"d315f71f-69d7-4a9f-8f3c-20bd70331ec7","added_by":"auto","created_at":"2021-04-05 14:47:34","extension":"png","order_by":3,"title":"Figure 3","display":"","copyAsset":false,"role":"figure","size":132438,"visible":true,"origin":"","legend":"Partition length estimation","description":"","filename":"Fig03.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/fb9f56f3f64a05730ec0b77d.png"},{"id":7669563,"identity":"7efb6dc5-cd43-4c42-bf54-2dc3635007f0","added_by":"auto","created_at":"2021-04-05 14:44:30","extension":"png","order_by":4,"title":"Figure 4","display":"","copyAsset":false,"role":"figure","size":36211,"visible":true,"origin":"","legend":"Partition length versus network density","description":"","filename":"Fig04.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/50aef86f38dc735ab9febdb5.png"},{"id":7669149,"identity":"63a2c3dc-9036-4f63-8928-a8fc5d59fab1","added_by":"auto","created_at":"2021-04-05 14:41:30","extension":"png","order_by":5,"title":"Figure 5","display":"","copyAsset":false,"role":"figure","size":22923,"visible":true,"origin":"","legend":"Basic block of black widow optimization","description":"","filename":"Fig05.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/fe997e90756755fa038222a0.png"},{"id":7669840,"identity":"c6d001bf-35f6-4743-b68b-3a47dd4c868d","added_by":"auto","created_at":"2021-04-05 14:47:31","extension":"png","order_by":6,"title":"Figure 6","display":"","copyAsset":false,"role":"figure","size":5958,"visible":true,"origin":"","legend":"Mutation","description":"","filename":"Fig06.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/2a1616fdf1abbac8f2e6dafa.png"},{"id":7669153,"identity":"c511b12b-6de1-402e-a854-0f533f8599ce","added_by":"auto","created_at":"2021-04-05 14:41:31","extension":"png","order_by":7,"title":"Figure 7","display":"","copyAsset":false,"role":"figure","size":10325,"visible":true,"origin":"","legend":"Success rate","description":"","filename":"Fig07.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/b4ff8f98629fc098919d1415.png"},{"id":7669568,"identity":"ab20a5ef-a25c-451b-b694-0ad9d0b101fb","added_by":"auto","created_at":"2021-04-05 14:44:32","extension":"png","order_by":8,"title":"Figure 8","display":"","copyAsset":false,"role":"figure","size":11779,"visible":true,"origin":"","legend":"Propagation distance","description":"","filename":"Fig08.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/0d59213e71367de881d769e3.png"},{"id":7669175,"identity":"566f888d-e2ab-4f51-a8c3-764859b044ab","added_by":"auto","created_at":"2021-04-05 14:41:32","extension":"png","order_by":9,"title":"Figure 9","display":"","copyAsset":false,"role":"figure","size":14833,"visible":true,"origin":"","legend":"Number of beacons","description":"","filename":"Fig09.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/1fa8a5372671f9f807e7aa05.png"},{"id":7669176,"identity":"a11f1640-ee37-4932-a71f-415e4199c7e3","added_by":"auto","created_at":"2021-04-05 14:41:32","extension":"png","order_by":10,"title":"Figure 10","display":"","copyAsset":false,"role":"figure","size":13391,"visible":true,"origin":"","legend":"Delay","description":"","filename":"Fig10.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/0b7b8c5bc2beb73fd069cd62.png"},{"id":7669172,"identity":"78b30065-5e30-4a83-ab27-7d37635f2115","added_by":"auto","created_at":"2021-04-05 14:41:31","extension":"png","order_by":11,"title":"Figure 11","display":"","copyAsset":false,"role":"figure","size":14230,"visible":true,"origin":"","legend":"Redundancy rate","description":"","filename":"Fig11.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/95f414ada54b243ad8e2dbe4.png"},{"id":7669564,"identity":"d7bbe314-3d4c-40ef-9175-dcd8fc3b7f17","added_by":"auto","created_at":"2021-04-05 14:44:30","extension":"png","order_by":12,"title":"Figure 12","display":"","copyAsset":false,"role":"figure","size":14867,"visible":true,"origin":"","legend":"Collision rate","description":"","filename":"Fig12.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/c09ea0c676f3721d3b90cd69.png"},{"id":7669170,"identity":"cb6bf29a-7470-4407-86ab-e49ea76e2f1a","added_by":"auto","created_at":"2021-04-05 14:41:31","extension":"png","order_by":13,"title":"Figure 13","display":"","copyAsset":false,"role":"figure","size":15368,"visible":true,"origin":"","legend":"Dissemination Efficiency","description":"","filename":"Fig13.png","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1/f2a9a8d64d36a59068273c07.png"},{"id":28920957,"identity":"ce10bca7-be69-4456-ae26-051ccad31c07","added_by":"auto","created_at":"2022-11-10 21:26:42","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":688470,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptBlackWidowOptimizationAlgorithmEurasip.pdf","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1_covered.pdf"},{"id":13617850,"identity":"d6597e6d-7740-4f36-ab40-97fd4c621492","added_by":"auto","created_at":"2021-09-17 06:54:37","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":683724,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptBlackWidowOptimizationAlgorithmEurasip.pdf","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1_covered.pdf"},{"id":7669842,"identity":"b32d48eb-452a-4989-bbd9-008040eefd23","added_by":"auto","created_at":"2021-04-05 14:47:39","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":763262,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptBlackWidowOptimizationAlgorithmEurasip.pdf","url":"https://assets-eu.researchsquare.com/files/rs-309575/v1_stamped.pdf"}],"financialInterests":"","formattedTitle":"\u003cp\u003eBlack Widow Optimization Algorithm and Similarity Index Based Adaptive Scheduled Partitioning Technique for Reliable Emergency Message Broadcasting in VANET\u003c/p\u003e","fulltext":[{"header":"Full Text","content":"\u003cp\u003eDue to technical limitations, full-text HTML conversion of this manuscript could not be completed. However, the manuscript can be downloaded and accessed as a PDF.\u003c/p\u003e"},{"header":"Tables","content":"\u003cp\u003e\u003cstrong\u003eTable 1 Simulation setup\u003c/strong\u003e\u003c/p\u003e\n\u003ctable border=\"1\"\u003e\n\u003ctbody\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e\u003cstrong\u003eParameter\u003c/strong\u003e\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e\u003cstrong\u003eValue\u003c/strong\u003e\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eMAC layer\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e802.11 p\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eTransmission range\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e200 m\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eTransmission power\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e0.98mW\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eBit rate\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e18Mbps\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eBeacon size\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e32Mbps\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003ePropagation model\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eTwo-way interference\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eNumber of repetitions\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e33\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eTime slot\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e16\u0026micro;s\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003eRTB max. slot\u003c/p\u003e\n\u003c/td\u003e\n\u003ctd width=\"319\"\u003e\n\u003cp\u003e100 bytes\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\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":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Vehicular ad hoc network (VANET), Broadcasting messages, Beacon, black widow optimization, adaptive partition scheme, network","lastPublishedDoi":"10.21203/rs.3.rs-309575/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-309575/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThe vehicular ad hoc network (VANET) topology will change the mobility of the nodes and the data delivery will be efficient in the vehicle environment. This technique uses the density, mobility, dissemination in the requirements of emergency message broadcasting. The emergency message is broadcast on the road causes many issues like reliability, latency and scalability. Beacons are used in the VANET to broadcast messages and get the information from neighbours. When more vehicles transmit the messages in equal time lead a frequent broadcast storm the vehicles are faced the message delivery failure. Adaptive Scheduled Partitioning and Broadcasting technique (ASPBT) is used in our paper for message reliability, and the transmission efficiency will adjust the partitions and beacon automatically for reducing retransmissions. The partition size is determined using the density of network transmission of each partition schedule is estimated using the Black Widow Optimization (BWOA). The emergency message gets low delay and redundancy of the message is reducing, ASPBT include the forwarding of novel with the selection of optimal partition. The performance analysis is done with the existing methods for the determination of efficiency, redundancy, collision, and delay. The efficiency of proposed technique as 98% comparing with existing broadcast schemes of VANET.\u003c/p\u003e","manuscriptTitle":"Black Widow Optimization Algorithm and Similarity Index Based Adaptive Scheduled Partitioning Technique for Reliable Emergency Message Broadcasting in VANET","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2021-04-05 14:41:26","doi":"10.21203/rs.3.rs-309575/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"2c507db7-b216-46a5-8c8d-cf3995bf3f48","owner":[],"postedDate":"April 5th, 2021","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":3415751,"name":"Systems and Networking"},{"id":3415752,"name":"Technical Communication"}],"tags":[],"updatedAt":"2022-11-10T21:26:25+00:00","versionOfRecord":{"articleIdentity":"rs-309575","link":"https://doi.org/10.1080/00051144.2022.2140392","journal":{"identity":"automatika","isVorOnly":true,"title":"Automatika"},"publishedOn":"2022-11-02 00:00:00","publishedOnDateReadable":"November 2nd, 2022"},"versionCreatedAt":"2021-04-05 14:41:26","video":"","vorDoi":"10.1080/00051144.2022.2140392","vorDoiUrl":"https://doi.org/10.1080/00051144.2022.2140392","workflowStages":[]},"version":"v1","identity":"rs-309575","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-309575","identity":"rs-309575","version":["v1"]},"buildId":"_2-kVJe1T_tPrBINL-cwx","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.