Packets distribution algorithms for sensor networks

Abstract

Abstract-In this paper, we study, via simple discrete mathematical models, the problems of data distribution and data collection in wireless sensor networks. The work that follows continues the work presented by the authors in [1] where the focus was on sensor networks equipped with unidirectional antenna elements. Here we shift our interest to networks equipped with omnidirectional antenna elements. In particular we show how the data distribution and collection tasks can be performed optimally (with respect to time) on tree networks and give the corresponding time performances of those strategies. We also present a strategy for general graph networks that performs within a factor of 3 of the optimal performance. Finally we compare the performance of a network equipped with omnidirectional antenna elements with one equipped with unidirectional antenna elements. We show the latter outperforms the former by 33% at most in tree networks. To that purpose we included relevant results on directional antenna sensor networks, partly obtained in [1].

Approximation Algorithms for Data Broadcast in Wireless Networks

“…Phase 1. Node s collects all messages by modifying a data dissemination algorithm by Florens and McEliece [19]. In the data dissemination problem, a source node sends a different message m(v) to each node v in the network, and they present a 3-approximation algorithm.…”

A Study on Data Aggregation and Reliability in Managing Wireless Sensor Networks

“…In [7] it is shown that data distribution and collection tasks can be performed optimally on tree networks. In [8] the performance of a greedy algorithm to build trees in networks of differing densities is evaluated.…”

Spatio-temporal sampling rates and energy efficiency in wireless sensor networks

“…The sensors can communicate their decisions to join a particular cluster to its clusterhead according to this schedule without wasting any energy in retransmissions. Once the clusterhead has knowledge of all the sensors in its cluster, it can find a more optimal transmission schedule using strategies proposed in [24,25].…”

“…Researchers have also proposed protocols that manage and attempt to minimize the energy spent in gathering data [10,11,16,[23][24][25] in a sensor network. In [23], the authors have proposed schemes that minimize an energy*delay metric in gathering data in sensor networks.…”

“…In [23], the authors have proposed schemes that minimize an energy*delay metric in gathering data in sensor networks. In [24], the authors have proposed algorithms to obtain transmission schedules that achieve minimum delay in gathering or distributing data in tree networks. These algorithms are centralized in nature and need complete information about the network topology.…”