Abstract:
Wireless sensor network is a collection of large number of sensors, some tiny batterypowered
sensing devices equipped with short range radio, deployed in a geographic area
to perform some distributed sensing task over the target region. For the collaboration of
the sensing activity sensors are networked among themselves through a multihop communication
paradigm. Due to some well-established constraints, addressing of nodes and
data routing techniques in sensor networks differ significantly from other networks. In this
thesis, we present an architecture for efficient addressing and routing in sensor networks.
We propose a dynamic and globally unique address allocation scheme for sensors in such
a way that these addresses can later be used for data routing. We build a tree like organization
of sensor nodes rooted by the sink node based on their transmission adjacency and
then set label on each sensor with a number according to the preorder traversal of the tree
from the root. In this addressing process, each sensor keeps necessary information so that
they can route data packets later on depending on these addresses, rather than keeping
large routing table or previous routing states. We conduct simulations to measure the
soundness of our approach and make a comparison with another similar technique.
