Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks
- Authors
- Tan, Do Duy; Kim, Dong-Seong
- Issue Date
- Aug-2014
- Publisher
- SPRINGER
- Keywords
- Multiple sinks; Traffic-aware; Wireless sensor networks; Gradient; End-to-end delay; Packet delivery ratio; Energy consumption
- Citation
- WIRELESS NETWORKS, v.20, no.6, pp.1239 - 1250
- Journal Title
- WIRELESS NETWORKS
- Volume
- 20
- Number
- 6
- Start Page
- 1239
- End Page
- 1250
- URI
- https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/19001
- DOI
- 10.1007/s11276-013-0672-z
- ISSN
- 1022-0038
- Abstract
- In this paper, a distributed traffic-balancing routing algorithm is proposed for multi-sink wireless sensor networks that effectively distributes traffic from sources to sinks. Each node has a gradient field that is used to decide on a neighbor node to reach a sink. The node's gradient index contains (1) the distance cost from a source to a respective sink, and (2) traffic information from neighboring nodes. The proposed algorithm considers the traffic being faced by surrounding neighbors before forwarding packets to any sink using gradient search for routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The key objective of this work is to achieve traffic-balancing by detecting congested areas along the route and distributing packets along paths that have idle and underloaded nodes. Extensive simulations conducted to evaluate the performance of the proposed scheme indicate that it effectively reduces the overall packet delay, energy consumption and improves the packet delivery ratio under heavy traffic.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Electronic Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.