Hierarchical Routing over Dynamic Wireless Networks

Details Hierarchical Routing over Dynamic Wireless Networks Hierarchical Routing over Dynamic Wireless Networks

2009-09-14

arxiv.org/abs/0909.2504v2

Computer Science

Networking and Internet Architecture

29 pages, 19 figures, a shorter version was published in the proceedings of the 2008 ACM Sigmetrics conference

Scientific paper

Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are costly in terms of consuming throughput available for data transmission, which is precious in wireless networks. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks.

Affiliated with

Also associated with

No associations

Rating

Hierarchical Routing over Dynamic Wireless 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 Hierarchical Routing over Dynamic Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical Routing over Dynamic Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-564660