GRATA: gradient‐based traffic‐aware routing for wireless sensor networks. Issue 2 (1st June 2013)

• Record Type: Journal Article
• Authors: Tan, Do Duy; Quoc Dinh, Nguyen; Kim, Dong‐Seong
• Is Part Of: IET wireless sensor systems. Volume 3:Issue 2(2013)
• Page Start: 104
• Page End: 111
• Publication Date: 2013-06-01
• Subjects: gradient methods -- search problems -- telecommunication network routing -- telecommunication traffic -- wireless sensor networks; gradient‐based traffic‐aware routing -- wireless sensor networks -- GRATA -- distributed traffic‐aware routing scheme -- multisink networks -- gradient‐based search -- gradient field -- gradient index -- IETF working group -- implicit traffic delay -- current holding node -- end‐to‐end delay; gradient methods -- search problems -- telecommunication network routing -- telecommunication traffic -- wireless sensor networks; gradient‐based traffic‐aware routing -- wireless sensor networks -- GRATA -- distributed traffic‐aware routing scheme -- multisink networks -- gradient‐based search -- gradient field -- gradient index -- IETF working group -- implicit traffic delay -- current holding node -- end‐to‐end delay; Wireless sensor networks -- Periodicals; 681.2
• DOI: 10.1049/iet-wss.2012.0083
• Languages: English
• ISSNs: 2043-6386

Abstract

Abstract : In this study, a distributed traffic‐aware routing scheme is proposed for a wireless sensor network with multiple sinks. In multi‐sink networks, traffic moving towards one sink may congest that moving towards others. The algorithm proposed here considers the traffic of surrounding neighbours before jumping to any sink. This is accomplished by building for each single sink, a gradient field and using gradient‐based search for routing. The gradient index of one node contains two parts. (i) The first represents the distance‐cost to travel, based on routing over lossy link) proposed by an IETF working group. (ii) The second contains the implicit traffic delay carried by the current holding node. Gradient field is built in distributed way and proven to free from loops. In a simulation, the authors show that this method of building gradient field routes balances the shortest path and possible congestion made by sinks, especially in heavy traffic networks, thereby reducing the overall end‐to‐end delay.