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.
The gradient-based routing algorithm considers the number of hops as the distance cost from a node to a sink is proposed by routing over lossy link (ROLL) [8]. In this paper, the height value at each node also implies the minimum hop
A. Distance Cost ModelA node defines a scalar field, called the node's height [13] by advertising packets. This is a common method to provide basic routing function and is used by several routing algorithms, e.g., the well-known shortest path first (SPF) algorithm [14]. A packet is forwarded on the link with the steepest gradient to the next nodes. Each node x maintains a distance cost with respect to all sinks (in a multi-sink scenario):industrial networks. Our proposal exploits two-hop information and enhances congestion detection ability owing to its monitoring of the buffer length at a node. The underlying concept of our algorithm is the construction of gradient field using three factors: number of hops, number of packets at one-hop neighbors and the minimum number of packets at two-hop neighbors corresponding to the previous node. The number of hops (distance cost) is built conventionally as in other gradient-based routing protocols that find the shortest paths for packets. The second and third factors address the queue length at neighboring nodes that may become the next forwarder. Once the queue length, changing with network traffic exceeds a threshold, it means that there is congestion at a node in the path toward a specific sink. The node asks its surrounding nodes to increase (or decrease) their gradient field so that packets can flow along other paths. Thus, this method leads to a trade-off between shortest paths and packet delays caused by congestion at overloaded nodes.The rest of this paper is organized as follows. In Section II, we build a system model with the total gradient field and outline how the local cost and global cost models are combined in our proposed scheme. In Section III, the implementation of our proposed algorithm is described in detail. The simulation model and performance evaluations are given in Section IV. Finally, Section V concludes this paper and infers some limitations and future work.(1) \71 (x) == hop_count.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.