Abstract
Wireless Sensor Networks (WSN) consist of a suite of sensor nodes capable of autonomous data collection and wireless communication deployed over an area of interest. They constitute a popular means of automated data collection with the sensors working together to form a wireless communication network and funnel collected data to nodes capable of transmitting data to a single or multiple collection points for interpretation. The routing instance from a single source to multiple destinations is formalized as a Multicast Routing Problem (MRP). Recent applications WSNs have focused on exploiting sink mobility technology (with multiple destinations) to extend network lifetime. As the nodes are often reliant on limited power sources, algorithms for efficient routing of data in these networks have been a source of increased research interest. However, few current algorithms consider the remaining energy levels of an individual network node during a single routing instance, creating a situation where the network may become disconnected faster than necessary. In this paper, we present an algorithm for multicast routing in wireless sensor networks implementing energy-reweighting techniques to simultaneously optimize the energy-cost of a routing and the network lifetime.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of International Conference on Operations Research and Enterprise Systems (ICORES-2015) |
| Publisher | SciTePress |
| Pages | 346-352 |
| Number of pages | 7 |
| ISBN (Electronic) | 978-989-758-075-8 |
| DOIs | |
| Publication status | Published - 2015 |
Keywords
- Wireless Sensor Networks
- Multicast Routing
- Steiner Tree
- Sink Mobility