Ghosh, A. and Durmaz Incel, O. and Anil Kumar, V.S. and Krishnamachari, B.
Algorithms for Fast Aggregated Convergecast in Sensor Networks.
Technical Report CENG-2008-8,
USC-Ceng, Los Angeles.
ISSN not assigned
Full text available as:
Fast and periodic collection of aggregated data
is of considerable interest for mission-critical and continuous
monitoring applications in sensor networks. In the many-to-one
communication paradigm, referred to as convergecast, we focus
on applications wherein data packets are aggregated at each hop
en-route to the sink along a tree-based routing topology, and
address the problem of minimizing the convergecast schedule
length by utilizing multiple frequency channels. The primary
hindrance in minimizing the schedule length is the presence of
interfering links. We prove that it is NP-complete to determine
whether all the interfering links in an arbitrary network can
be removed using at most a constant number of frequencies.
We give a sufficient condition on the number of frequencies for
which all the interfering links can be removed, and propose a
polynomial time algorithm that minimizes the schedule length
in this case. We also prove that minimizing the schedule length
for a given number of frequencies on an arbitrary network is
NP-complete, and describe a greedy scheme that gives a constant
factor approximation on unit disk graphs. When the routing tree
is not given as an input to the problem, we prove that a constant
factor approximation is still achievable for degree-bounded trees.
Finally, we evaluate our algorithms through simulations and
compare their performance under different network parameters.
|Item Type:||Internal Report (Technical Report)|
|Research Group:||EWI-PS: Pervasive Systems|
|Research Program:||CTIT-WiSe: Wireless and Sensor Systems|
|Research Project:||Smart Surroundings|
|Deposited On:||29 September 2008|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item