Distributed Object Searching in Multi-hop Wireless Network

The Hong Kong University of Science and Technology
Department of Computer Science and Engineering


FYT Presentation & Demonstration

Title: "Distributed Object Searching in Multi-hop Wireless Network"

By

Mr. YUE Xiaonan, John

Abstract

Efficient object location is at the heart of many Internet applications.
In object location, a node searching for an object needs to obtain a path
to the object's owner. We study in this paper how to efficiently locate
objects in multi-hop wireless network (such as wireless mesh and multi-hop
wireless LAN), where peers associated with an AP may share and query
objects any time. Traditional approaches as used in wired network based on
distributed hash table (DHT) and flooding are not appropriate due to high
bandwidth overhead, processing and memory requirement, and long search
time. We propose and study DOLWiM (Distributed Object Location in Wireless
Multihop networks), a scalable, network-adaptive and distributed object
location protocol for multi-hop wireless network. In the protocol, a peer
maintains some bloom filters which effectively filter out the paths not
leading to the destination (i.e., the object owner). By employing this
approach, the control overhead incurred by route discoveries is greatly
reduced. Using ns-2 simulation, we show that our protocol is of low
control overhead, lightweight in terms of processing and memory
requirement, and bandwidth efficient. Since search path is close to
shortest path routing, our search time is low.


Date:			Saturday, 28 April 2007

Time:			2:30pm - 3:00pm

Venue:			Room 2578
 			Lifts 29 - 30

Advisor:		Dr. Gary Chan

2nd Reader:		Dr. Zhang Qian


**** ALL are Welcome ****