Minimizing Flow Time in the Wireless Gathering Problem

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this problem can have approximation ratio less than $\Omega(m^{1/3)$ when $m$ packets have to be transmitted, unless $P = NP$. We then use resource augmentation to assess the performance of a FIFO-like strategy. We prove that this strategy is 5-speed optimal, i.e., its cost remains within the optimal cost if we allow the algorithm to transmit data at a speed 5 times higher than that of the optimal solution we compare to.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Minimizing Flow Time in the Wireless Gathering Problem 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 Minimizing Flow Time in the Wireless Gathering Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing Flow Time in the Wireless Gathering Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-647790

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.