Delay Efficient Data Gathering in Sensor Networks

Abstract

Abstract. Data gathering is a very important functionality in sensor networks. Most of current data gathering researches have been emphasized on issues such as energy efficiency and network lifetime maximization; and the technique of data aggregation is usually used to reduce the number of radio transmissions. However, there are many emerging sensor network applications with different requirements and constraints. Rather, they are time critical, i.e., delivering sensed information of each individual sensor node back to a central base station quickly becomes most important. In this paper, we consider collision-free delay efficient data gathering problem in sensor networks, assuming that no data aggregation happens in intermediate nodes. We formally formulate this problem and propose optimal and near-optimal algorithms for different topologies. Particularly, in general topology, we present two approximation algorithms with performance ratio of 2 and 1+1/(k+1), respectively.

Capacity of data collection in randomly-deployed wireless sensor networks

“…However, their results have a gap between the upper and lower bounds due to the random selection of the sources and designations. In addition, Zhu et al [24] studied how to schedule data collection in an arbitrary sensor network, where sensors are not randomly distributed, such that delay or latency is minimized. Notice that random network is a subset of arbitrary network.…”

“…Capacity of data collection in wireless sensor networks has been studied in [1][2][3][4][5][6]24]. In [1,2], Duarte-Melo et al first studied the many-to-one transport capacity in dense and random sensor networks.…”

Data gathering and personalized broadcasting in radio grids with interference

“…Following [11,12,15,16,18] we assume that no buffering is done at intermediate nodes and each node forwards a message as soon as it receives it. One of the rationales behind this assumption is that it frees intermediate nodes from the need to maintain costly state information and message storage.…”

Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas

“…Following [10,12,18], we assume that no buffering is done at intermediate nodes and each node forwards a packet as soon as it receives it. One of the rationales behind this assumption is that it might be too much energy consuming to hold data in the node memory; moreover, it also free intermediate nodes from the need to maintain costly state information.…”

“…An other important factor to take into account when performing data gathering is the Funded by ANR AGAPE, ANR GRATEL and APRF PACA FEDER RAISOM latency of the information accumulation process. Indeed, the data collected by a node of the network can frequently change, thus it is essential that they are received by the base station as soon as it is possible without being delayed by collisions [18]. The same problem was asked by France Telecom (see [6]) on how to bring internet to places where there is no high speed wired access.…”