Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Data for Reliable many-to-many routing in wireless sensor networks using ant colony optimisation

Tools
- Tools
+ Tools

Grosso, Jasmine, Jhumka, Arshad and Bradbury, Matthew S. (2019) Data for Reliable many-to-many routing in wireless sensor networks using ant colony optimisation. [Dataset]

Research output not available from this repository, contact author.
Official URL: https://doi.org/10.5281/zenodo.2609159

Request Changes to record.

Abstract

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.

Item Type: Dataset
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Science > Computer Science
Type of Data: Experimental data
Library of Congress Subject Headings (LCSH): Wireless sensor networks, Wireless sensor networks -- Computer programs, Routing (Computer network management), Mathematical optimization
Publisher: Zenodo
Official Date: 26 March 2019
Dates:
DateEvent
26 March 2019Published
Status: Not Peer Reviewed
Publication Status: Published
Media of Output: .csv
Access rights to Published version: Open Access
Copyright Holders: University of Warwick
Description:

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.

RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
EP/L016400/1[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
Related URLs:
  • Related item in WRAP
  • Other
Contributors:
ContributionNameContributor ID
Contact PersonBradbury, Matthew S.66387

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us