Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
The flooding time synchronization protocol
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
The scheduling and energy complexity of strong connectivity in ultra-wideband networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Effective carrier sensing in CSMA networks under cumulative interference
INFOCOM'10 Proceedings of the 29th conference on Information communications
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Nearly optimal bounds for distributed wireless scheduling in the SINR model
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Maximizing capacity with power control under physical interference model in simplex mode
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Wireless capacity with oblivious power in general metrics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Minimizing latency is of primary importance for data aggregation which is an essential application in wireless sensor networks. Many fast data aggregation algorithms under the protocol interference model have been proposed, but the model falls short of being an accurate abstraction of wireless interferences in reality. In contrast, the physical interference model has been shown to be more realistic and has the potential to increase the network capacity when adopted in a design. It is a challenge to derive a distributed solution to latency-minimizing data aggregation under the physical interference model because of the simple fact that global-scale information to compute the cumulative interference is needed at any node. In this paper, we propose a distributed algorithm that aims to minimize aggregation latency under the physical interference model in wireless sensor networks of arbitrary topologies. The algorithm uses O(K) time slots to complete the aggregation task, where K is the logarithm of the ratio between the lengths of the longest and shortest links in the network. The key idea of our distributed algorithm is to partition the network into cells according to the value K, thus obviating the need for global information. We also give a centralized algorithm which can serve as a benchmark for comparison purposes. It constructs the aggregation tree following the nearest-neighbor criterion. The centralized algorithm takes O( logn) and O(log^3n) time slots when coupled with two existing link scheduling strategies, respectively (where n is the total number of nodes), which represents the current best algorithm for the problem in the literature. We prove the correctness and efficiency of our algorithms, and conduct empirical studies under realistic settings to validate our analytical results.