Placeholder text

Go to cart

Routing on the Geometry of Wireless Ad Hoc Networks (Series in Distributed Computing)

By Roland Flury

Routing on the Geometry of Wireless Ad Hoc Networks (Series in Distributed Computing)

By Roland Flury

0 - Default Title
Description
In the first part of this work we focus on the protocol design and analyze the properties of our routing algorithms under simplifying network models. In particular, we describe a location service that supports geographic routing even if the destination node is constantly moving. Such a location service is important as the geographic routing technique bases each routing step on the position of the destination node by repeatedly forwarding a message to the neighbor which is geographically closest to its destination. If there is no such neighbor, the message has reached a local minimum. This is a node at the boundary of a network hole around which the message needs to be led before it can continue its greedy path. We extend the classic notion of network holes to 3-dimensional unit ball graphs and propose several randomized recovery techniques to escape from local minima in such networks. In addition, we show that it is possible to forward messages greedily without ever falling in a local minimum. We do so by embedding the network into an higher-dimensional space such that there is a greedy path between any two nodes. Similarly, we describe a renaming technique in combination with small routing tables that ensures good routing paths not only for unicast, but also for anycast and multicast. In the second part of this thesis, we examine the design of applications and come up with a programming technique to efficiently translate protocols to the limited hardware of sensor networks. We describe the slotted programming paradigm that fosters modular programming and decouples unrelated software components temporally. We demonstrate the advantages of our approach with two case studies: (1) an efficient clock synchronization module, and (2) an alarming module through which all nodes of a network can be awaken efficiently and reliably.
Product details
Binding:
Paperback
Edition:
1
Number of Pages:
146
Release Date:
2009-10-06
Publication Date:
2009-10-06
Publisher:
Hartung-Gorre
Languages:
Published: English, Original: English
ISBN10:
386628280X
Buy on Amazon
Currently sold out