SATC: A Simulated Annealing Based Tree Construction and Scheduling Algorithm for Minimizing Aggregation Time in Wireless Sensor Networks

Data collection is one of the most important task in wireless sensor networks where a set of sensor nodes measure properties of a phenomenon of interest and send their data over a routing tree to the sink. In this paper, we propose a new simulated annealing based tree construction algorithm (SATC) t...

Full description

Saved in:
Bibliographic Details
Published in:Wireless personal communications 2019-09, Vol.108 (2), p.921-938
Main Authors: Osamy, Walid, El-sawy, Ahmed A., Khedr, Ahmed M.
Format: Article
Language:English
Subjects:
Algorithms
Collision avoidance
Communications Engineering
Computer Communication Networks
Computer simulation
Data acquisition
Engineering
Fitness
Networks
Remote sensors
Schedules
Scheduling
Sensors
Signal,Image and Speech Processing
Simulated annealing
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Data collection is one of the most important task in wireless sensor networks where a set of sensor nodes measure properties of a phenomenon of interest and send their data over a routing tree to the sink. In this paper, we propose a new simulated annealing based tree construction algorithm (SATC) to aggregate data with a collision-free schedule for node transmissions. SATC minimizes the time duration of delivering aggregated data to the sink. In the proposed algorithm, the average time latency is considered as the fitness function for the SA algorithm and it is evaluated based on Routing aware MAC scheduling methods. The efficiency of the proposed algorithm is studied through simulation and compared with existing state-of-the-art approaches in terms of average latency and average normalized latency.
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-019-06440-9