| | |
Summary: Self-Stabilizing Routing in Wireless Embedded
Systems
Mikhail Nesterenko
Kent State University
Anish Arora
Ohio State University
Abstract
We address the problem of routing tree maintenance in a network of
embedded sensors. We compare two routing protocols. One protocol
periodically discards and reconstructs the routing tree. The other uses
incremental routing tree construction. We analyze their advantages and
disadvantages and describe experiments to which we subjected the proto-
cols to compare their performance. We propose a protocol that combines
the best features of both original protocols.
1 Introduction
The advances of technology have led to the emergence of an assortment of small
devices capable of performing a variety of speci c functions. One such emerging
device is a wireless networked sensor [5]. Even though the functionality of
a single networking sensor is limited, a collection of them working together
can accomplish a variety of tasks ranging from treaty monitoring to inventory
|
