Title: A1256655642wqkRY
1Geographic Routing with Context-awareness for
Sensor Networks
Jiaxi You, Dominik Lieckfeldt, and Dirk Timmermann
- Construction of Detour Paths
- Start construction of a detour path from a local
minimum (node A), and mark the detour path until
the data sink. - On the arrival of a new detour path, assign
detour nodes with distance labels to the sink.
Resort the detour path by discovery of
neighboring detour nodes with smaller distance
label. - Construct more detour paths by repeating step 1,
2.
- Start
- A Wireless Sensor Network (WSN) is typically
composed of a number of sensor nodes, which are
capable of sensing, signal processing and
wireless communication. - Geographic Routing (with Greedy Forwarding)
Effective routing protocol that forwards a packet
(on node A) to the direct neighbor (node B) which
will further minimize the remaining distance to
the data sink. Routing Holes Caused by voids
in deployment or node failure in the
network.Local Minimum (node A) Node
with no neighbor that is nearer to the data sink,
which often lead traditional geographic routing
algorithms to fail.
The Routing Process
- Start
- A WSN with Routing Holes.
Example Construction of a detour path
(A-B-C-D--Data Sink)
Construction of Detour Paths Build multiple
detour paths along boundaries of holes.
- Routing with Detour Paths
- A packet at node J will
- Select node C as the next-hop, for a shorter
route to the data sink. - Select node K as the next-hop, when node C is
energy-critical.
Example Resort of detour path
Routing with Detour Paths Choose a detour path
with context awareness.
Example Construction of multiple detour paths
(A-B-C-D--Data Sink, E-F-G-H--Data Sink,
I-J-K-L-M--Data Sink,)
Example Route selection from multiple detour
paths
Institute of Applied Microelectronics and
Computer Engineering Department of Computer
Science and Electrical Engineering University of
Rostock