Efficient data aggregation and routing in wireless sensor networks

Abstract : Wireless Sensor Networks (WSNs) have gained much attention in a large range of technical fields such as industrial, military, environmental monitoring etc. Sensors are powered by batteries, which are not easy to replace in harsh environments. The energy stored by each sensor is the greatest impediment for increasing WSN lifetime. Since data transmission consumes more energy, our major concern is how to efficiently transmit the data from all sensors towards a sink. We suggest three tree-based data aggregation algorithms: Depth-First Search Aggregation (DFSA), Flooding Aggregation (FA) and Well-Connected Dominating Set Aggregation (WCDSA) to reduce the number of transmissions from each sensor towards the sink. Tree-based data aggregation suffers from increased data delivery time because the parents must wait for the data from their leaves. Some parents might have many leaves, making it very expensive for a parent to store all incoming data in its buffer. We need to determine the aggregation time each parent in the tree has to spend in aggregating and processing the data from its leaves. We propose an Efficient Tree-based Aggregation and Processing Time (ETAPT) algorithm using Appropriate Data Aggregation and Processing Time (ADAPT) metric. Given the maximum acceptable latency, ETAPT's algorithm takes into account the position of parents, their number of leaves and the depth of the tree, in order to compute an optimal ADAPT time. At any time, the amount of data aggregated by parents may become greater than the amount of data that can be forwarded. We propose the introduction into the network of many data aggregators called Mini-Sinks (MSs). MSs are mobile and move according to a random mobility model inside the sensor field to maintain the fully-connected network in order to aggregate the data based on the controlled Multipath Energy Conserving Routing Protocol (MECRP). Sensors may use many radio interfaces sharing a single wireless channel, which they may use to communicate with several neighbours. Two sensors operating on the same wireless channel may interfere with each other during the transmission of data. We need to know which channel to use in the presence of multiple channels for a given transmission. We propose a distributed Well-Connected Dominating Set Channel Assignment (WCDS-CA) approach, in which the number of channels that are needed over all sensor nodes in the network in such a way that adjacent sensor nodes are assigned to distinct channels.
Complete list of metadatas

Cited literature [159 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/tel-01314125
Contributor : Abes Star <>
Submitted on : Tuesday, May 10, 2016 - 6:53:54 PM
Last modification on : Friday, May 17, 2019 - 12:31:26 PM
Long-term archiving on : Wednesday, November 16, 2016 - 12:07:02 AM

File

TheseFotueV2.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01314125, version 1

Collections

Citation

David Bertrand Fotue Fotso. Efficient data aggregation and routing in wireless sensor networks. Networking and Internet Architecture [cs.NI]. Télécom ParisTech, 2013. English. ⟨NNT : 2013ENST0066⟩. ⟨tel-01314125⟩

Share

Metrics

Record views

373

Files downloads

1218