Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks

Computer Science – Performance

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages

Scientific paper

In this paper, we analyze asymptotic delay-throughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spatial heterogeneity has the ability to drastically improve upon existing scaling laws established under the assumption that nodes are identical and uniformly visit the entire network area. In particular, we consider the situation in which each node moves around its own home-point according to a restricted mobility process which results into a spatial stationary distribution that decays as a power law of exponent delta with the distance from the home-point. For such restricted mobility model, we propose a novel class of scheduling and routing schemes, which significantly outperforms all delay-throughput results previously obtained in the case of identical nodes. In particular, for delta = 2 it is possible to achieve almost constant delay and almost constant per-node throughput (except for a poly-logarithmic factor) as the number of nodes increases, even without resorting to sophisticated coding or signal processing techniques.

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

Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc 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 Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-268723

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