Keywords: wireless sensor networks, event reporting, transport layer, fairness, congestion control
Received April 21, 2008; revised July 15, 2008; accepted September 18, 2008.
Communicated by Tei-Wei Kuo.
| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] | [ 22] | [ 23] | [ 24] | [ 25] |
¡@
FAISAL-BASHIR HUSSAIN AND YALCIN CEBI
Department of Computer Engineering
Dokuz Eylul University
Buca-Izmir, 35160 Turkey
Fairness in wireless sensor networks demands event nodes to have an equal share in
the overall throughput of the system. Fairness is difficult to achieve in sensor networks
due to multiple hop packet forwarding to a single destination that results in congestion.
Moreover, greater the density of event region greater is the level of interference and
greater is the number of packet drops. In this paper, we present a mechanism for fair
event reporting that is implemented at the transport layer. The solution encompasses
congestion control and fair rate adjustment schemes based on hop-by-hop packet delivery
and buffer size. Moreover, a schedule based packet forwarding policy is used at the
transport layer for ordered delivery of packets to the underlying layer; instead of commonly
used jittered forwarding. The simulation results of our scheme shows high per
node fair throughput from multiple event nodes to a single sink. Also, the use of our
schedule-based packet forwarding policy helps to avoid packet collisions and increases
the packet delivery ratio even from densely populated event regions.
Received April 21, 2008; revised July 15, 2008; accepted September 18, 2008.
Communicated by Tei-Wei Kuo.