Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - Reliable Many-to-Many Routing in Wireless Sensor Networks Using Ant Colony Optimisation
AU - Grosso, Jasmine
AU - Jhumka, Arshad
AU - Bradbury, Matthew
PY - 2019/9/1
Y1 - 2019/9/1
N2 - 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.
AB - 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.
KW - ant colony optimisation
KW - routing protocols
KW - telecommunication network reliability
KW - wireless sensor networks
KW - WSN
KW - growing application area
KW - fire detection
KW - natural areas
KW - urban areas
KW - air conditioning
KW - protocol aggregates data
KW - network lifetime
KW - Cooja Network simulator show
KW - multiple data sources
KW - scalable many-to-many routing protocol
KW - Wireless sensor networks
KW - Routing protocols
KW - Routing
KW - Optimization
KW - Network topology
KW - Topology
KW - many-to-many routing
U2 - 10.1109/EDCC.2019.00030
DO - 10.1109/EDCC.2019.00030
M3 - Conference contribution/Paper
SN - 9781728139296
SP - 111
EP - 118
BT - 15th European Dependable Computing Conference (EDCC)
T2 - 15th European Dependable Computing Conference (EDCC)
Y2 - 17 September 2019 through 20 September 2019
ER -