Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection

Details Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection

2009-02-24

arxiv.org/abs/0902.4157v1

Computer Science

Networking and Internet Architecture

Scientific paper

We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible greedy routing scheme that can be adapted to any variant of geographical routing and works for any connectivity graph, not necessarily Unit Disk Graphs. The idea is to reactively detect voids, backtrack packets, and propagate information on blocked sectors to reduce packet loss. We also propose an extrapolating algorithm to reduce the latency of void discovery and to limit route stretch. Performance evaluation via simulation shows that our modified greedy routing avoids most of packet losses.

Affiliated with

Also associated with

No associations

Rating

Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection 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 Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172467