|
In traditional multi-hop wireless communications, at each hop the
transmitting node chooses the next-hop relay among a set of neighbors. This
method however has high overhead in highly populated and dynamic wireless ad
hoc and sensor networks. An alternative approach, which we call receiver-side relay-
election (RSRE), does not require that a transmitting node select the nexthop
relay node. Rather, an election is held among potential relay candidates, and
the best candidate is elected based on given criteria.
In this project, we first[1] show mathematically and through network simulation how
RSRE can be done in an optimal way. We introduce a mapping function to
associate relative priority to potential candidates, and show that a mapping
coefficient can be obtained that elects the best candidate with minimal election
delay and collision vulnerability.
We then[2] devise multi-criteria RSRE, which we
apply to a well-know problem associated with wireless greedy forwarding.
Greedy forwarding tends to select a neighbor at each hop with the least
remaining distance to the final destination. Unfortunately, the link to the most
forward node is also likely the most error prone, thus likely to cause more packet
loss and retransmissions. We solve this problem by taking a multi-criteria
decision making approach that includes both forward progress and link quality as
criteria. Via a generalized mapping function that maps multiple optimization
criteria into one, we show that an optimal tradeoff between greediness and link
quality can be obtained. Compared with previously reported approaches, our
results show significantly better energy and delay performance and up to 5times
improvement in end-to-end packet loss.
Publications in this project:
[1] K. Egoh and S. De, "Priority-Based Receiver-Side Relay Election in Wireless Ad
Hoc Sensor Networks," in Proc. ACM IWCMC'06, Vancouver, British Columbia, Canada, July 2006 ( Full paper)
[2] K. Egoh and S. De, "A multi-criteria receiver-side relay election approach in wireless ad hoc networks," in Proc. IEEE MILCOM'06, Wahington, DC , October 2006 (Abstract)
|
