Min Kyung An
Aggregation Scheduling Algorithms in Wireless Sensor Networks
562 - 570
2017
11
5
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/10007096
https://publications.waset.org/vol/125
World Academy of Science, Engineering and Technology
In Wireless Sensor Networks which consist of tiny
wireless sensor nodes with limited battery power, one of the most
fundamental applications is data aggregation which collects nearby
environmental conditions and aggregates the data to a designated
destination, called a sink node. Important issues concerning the
data aggregation are time efficiency and energy consumption due
to its limited energy, and therefore, the related problem, named
Minimum Latency Aggregation Scheduling (MLAS), has been the
focus of many researchers. Its objective is to compute the minimum
latency schedule, that is, to compute a schedule with the minimum
number of timeslots, such that the sink node can receive the
aggregated data from all the other nodes without any collision or
interference. For the problem, the two interference models, the graph
model and the more realistic physical interference model known as
SignaltoInterferenceNoiseRatio (SINR), have been adopted with
different power models, uniformpower and nonuniform power (with
power control or without power control), and different antenna
models, omnidirectional antenna and directional antenna models.
In this survey article, as the problem has proven to be NPhard,
we present and compare several stateoftheart approximation
algorithms in various models on the basis of latency as its
performance measure.
Open Science Index 125, 2017