<?xml version='1.0' encoding='utf-8'?>
<?xml-stylesheet type="text/xsl" href="/v2/static/oai2.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-14T01:48:13Z</responseDate>
  <request identifier="oai:figshare.com:article/33802963" metadataPrefix="oai_dc" verb="GetRecord">https://api.figshare.com/v2/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:figshare.com:article/33802963</identifier>
        <datestamp>2026-09-15T15:29:13Z</datestamp>
        <setSpec>portal_1197</setSpec>
        <setSpec>item_type_3</setSpec>
        <setSpec>month_year_09_2026</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Data for Reliable many-to-many routing in wireless sensor networks using ant colony optimisation</dc:title>
          <dc:creator>Jasmine Grosso (24932929)</dc:creator>
          <dc:creator>Arshad Jhumka (21512825)</dc:creator>
          <dc:creator>Matthew S. Bradbury (24811657)</dc:creator>
          <dc:subject>Wireless sensor networks</dc:subject>
          <dc:subject>Wireless sensor networks -- Computer programs</dc:subject>
          <dc:subject>Routing (Computer network management)</dc:subject>
          <dc:subject>Mathematical optimization</dc:subject>
          <dc:subject>Migrated from ePrints</dc:subject>
          <dc:description>Wireless sensor networks (WSNs) have been widely studied in the context of many-to-one communication, in which multiple data sources send messages to a dedicated sink. However, there has been little research in the area of many-to-many communication. Many-to-many communication in WSNs is a growing application area, with examples including fire detection in both natural and urban areas, and the monitoring of heating and air conditioning within buildings. In this paper, we propose a scalable many-to-many routing protocol that makes use of Ant Colony Optimisation (ACO) that is applicable for an arbitrary number of sources and sinks. The protocol aggregates data sent from multiple sources into a single, shared backbone of nodes to reduce the total number of packets sent and so increase network lifetime. Results from simulations using the Cooja Network simulator show that the protocol is able to achieve packet delivery ratios above 95%, with the algorithm becoming more efficient with larger networks, sending fewer packets relative to the size of the networks, as well as involving fewer nodes in routing.&lt;br&gt;&lt;br&gt;Data record consists of 5 data files in .csv format, the results files for testing of ACO protocol for many to many routing in wireless sensor networks.</dc:description>
          <dc:date>2019-03-26T00:00:00Z</dc:date>
          <dc:type>Dataset</dc:type>
          <dc:type>Dataset</dc:type>
          <dc:identifier>10.82444/warw.33802963.v1</dc:identifier>
          <dc:relation>https://figshare.com/articles/dataset/Data_for_Reliable_many-to-many_routing_in_wireless_sensor_networks_using_ant_colony_optimisation/33802963</dc:relation>
          <dc:rights>CC BY 4.0</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
