| Summary: | 碩士 === 國立交通大學 === 應用數學系所 === 101 === In wireless sensor networks, most protocols choose greedy forwarding strategies
to route the messages. Communication voids are the most intolerable events that
occur at the time of transmission and a communication void is where greedy for-
warding fails to forward a packet further towards its destination. To overcome the
problem of communication voids,void handling techniques have attracted a lot of
attention. Many greedy forwarding strategies and void handling techniques have
been proposed. The main contribution of this thesis is to present an overview of
three commonly used greedy forwarding strategies (Most Forward Routing, Com-
pass Routing, and Ellipsoid Routing) and four void handling techniques (Face-2,
Request-Response, Cost-based forwarding, and Distance Upgrading Algorithm) and
to provide a comparison between the 12 combinations of the above approaches.
|
|---|
