Fast Scalable Peer-to-peer Lookup Services for Multi-hop Wireless Networks
A tightly-structured scheme RIGS (Ring Interval Graph Search) realizes a Distributed Hash Table (DHT) in multi-hop wireless networks. Experimental study shows the limitations of existing DHTs in mult-hop wireless networks due to its independence of underlying topology. Unlike DHT, R IGS constructs a search structure Ring Interval Graph such that queries are forwarded only to local neighbors. Rigs guarantees successful object lookup with near-optimal performance.0 4 7 8 9 10 1 6 5 2 3 11 LM v 1 v 2 v 0 9 v 0 9 v 0 6 11 v 1 (a) A Valley-Walk (b) Step 0 (c) Step 1 9 v 0 6 11 v 1 0 7 5 3 v 2 9 v ... figure, Xi is the minimum key- distance among dia1 neighbors of node v ia1 and Xj is that of dja1 neighbors of node vj=1 . ... We convert the original Valley-Walk to a modified version incremental- Valley-Walk, which has the same distribution of the search length with the original.
| Title | : | Fast Scalable Peer-to-peer Lookup Services for Multi-hop Wireless Networks |
| Author | : | |
| Publisher | : | ProQuest - 2008 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works:- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like (Personal use)
- 3. Cancel the membership at any time if not satisfied.
