Академический Документы
Профессиональный Документы
Культура Документы
z Reference
Introduction
1
Ideal routing scheme
Hyper
z microserver is equipped with two radios z Allow new nodes to join a network quickly
z CC1000 z support multiple independent routing trees
simultaneously for networks with concurrent fixed and
z standard 802.11 radio mobile users
z Challenging situations: z Opportunistically use 802.11 to connect application
z A technician tasked with deploying a new sensor scientists to the backend for retrieval of current and
historical data
node must verify that the new node has end-to-end
connectivity to a collection sink. z allow application scientists to go into the field, get
quick access to sensor data services, deploy new
z the scientist goes to the field to make observations. sensors and get results from them quickly, and even
z a scientist might bring new sensors to the field perform calibration experiments in real time
z burden the network as little as possible
2
Neighborhood Evaluation and Tree Construction
Fast link assessment protocol
z The mobile user sends out a total of N FastBPs and z tree update message
waits for S seconds between each FastBP in order to
receive responses. Neighbors each respond with N z the transmitter’s address (the parent in the routing
BPs. N and S are parameters that should be tuned; tree)
increasing N improves accuracy; increasing S z the address of the root
provides extra time to alleviate contention in dense z the path cost (sum of the individual link costs that
neighborhoods. BPs and FastBPs serve a dual role;
make up a path)
they may be used for estimating ingress quality and for
advertising it. z an epoch number to distinguish new updates from
z Once neighborhood connectivity is assessed, the link old ones)
layer alerts the routing software that the fast link z a TTL used to limit the depth of the tree
convergence stage has completed. z a time indicating when to expect the next update.
Neighborhood Evaluation and Tree Construction Neighborhood Evaluation and Tree Construction
z Receiver: waits to evaluate it for an amount of z In the event that no update packets are
time proportional to the cost of the link over
which the update came lost, and each node’s link estimates are
accurate then the tree that is built will be
z wait timer a minimum spanning tree, and each
z If before the wait timer expires another update
arrives, then the two are compared in terms of the node will only send out one update
path qualities they offer; the update message message.
containing the better path is retained.
z Once the wait timer expires, a node broadcasts its
own update message containing its best path cost
to the sink.
3
Efficient data collection Opportunistic Use of a Backchannel
4
Tiered routing mechanism Tiered routing mechanism
z Task z Observation
z Any and all communication from a master to z tasking is a relative infrequent event
a mote takes the form of a task z Task most if not all the motes
z Any and all communication from a mote is a
z Predicate tasklet
response to a task
z select a subset of motes
z motes cannot initiate tasks themselves
z Function of static attributes of a node
5
Design principle
CentRoute tree forming operation
Reference
z T. Stathopoulos, L. Girod, J. Heidemann, and D. Estrin,
Mote Herding for Tiered Wireless Sensor Networks, in
CENS Technical Report #58, Dec. 2005
z O. Gnawali, B. Greenstein, K.-Y. Jang, A. Joki, J. Paek,
M. Vieira, D. Estrin, R. Govindan, and E. Kohler, The
Tenet Architecture for Tiered Sensor Networks, ACM
SenSys, Nov. 1-3, 2006
z T. Schoellhammer, B. Greenstein, D. Estrin, Hyper: A
Routing Protocol to Support Mobile Users of Sensor
Networks, in CENS Technical Report #63, Jan. 2006