Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks

Details Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks

2006-04-07

arxiv.org/abs/cs/0604029v2

Computer Science

Information Theory

Scientific paper

The predominate traffic patterns in a wireless sensor network are many-to-one and one-to-many communication. Hence, the performance of wireless sensor networks is characterized by the rate at which data can be disseminated from or aggregated to a data sink. In this paper, we consider the data aggregation problem. We demonstrate that a data aggregation rate of O(log(n)/n) is optimal and that this rate can be achieved in wireless sensor networks using a generalization of cooperative beamforming called cooperative time-reversal communication.

Affiliated with

Also associated with

No associations

Rating

Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723310