Distributed traffic aware routing with multiple sinks in wireless sensor networks

Dinh, Nguyen Quoc; Hoa, Tran Dang; Kim, Dongsung

doi:10.1109/indin.2011.6034911

Cited by 6 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each node generates data packets, and the packet generation rate is randomly distributed in the range [1,3] packets/second, and the size of data frame is 127 bytes. Nodes generate packets using an on/off schedule, i.e., the nodes generate the packets for a duration randomly distributed in the range [2,5] seconds, afterwards the nodes wait for a random duration of time distributed in the range [10,15] seconds before generating packets again. No node generates packets after 100 simulation seconds.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…The routing protocols presented in [3], [5], [15], [16], [17] construct and maintain a best data forwarding path towards all sinks. This is done assuming an application selects the sink, hence a routing protocol does not select the sink node for a data packet (in general, this is the only difference compared to gradientbased best sink selection category).…”

Section: E Frequency Of Dio Messagesmentioning

confidence: 99%

See 1 more Smart Citation

RPL-based routing protocols for multi-sink wireless sensor networks

Farooq

Sreenan

Brown

et al. 2015

2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

View full text Add to dashboard Cite

Section: Simulation Resultsmentioning

confidence: 99%

Section: E Frequency Of Dio Messagesmentioning

confidence: 99%

RPL-based routing protocols for multi-sink wireless sensor networks

Farooq

Sreenan

Brown

et al. 2015

2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

View full text Add to dashboard Cite

“…Moreover, it can also know about the congestion before the neighbor's buffer begins to overflow. This technique solves problems related to local information [4].…”

Section: B Queue Length Fieldmentioning

confidence: 99%

“…In several previous studies, the authors used one-hop information into in the cost model to find the next forwarder [4], [11]. However, with this limited local information, packets cannot avoid the heavily congested regions.…”

Section: Traffic-balancing Routing Cost Modelmentioning

confidence: 99%

“…Additionally, in large-scale wireless sensor networks (WSNs), the traditional centralized approach in which data traffic from sensor nodes gather toward a unique sink [1] is not efficient in terms of energy consumption or packet delays, and may even be impossible due to limited network capacity. Therefore, the use of multiple sinks is proposed as a more feasible scheme for such networks [2], [3], [4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Traffic-balancing routing scheme for industrial wireless sensor networks

Tan

Prasetiadi

Kim

2012

2012 International Conference on ICT Convergence (ICTC)

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks

Tan

Kim

2013

Wireless Netw

View full text Add to dashboard Cite

Distributed traffic aware routing with multiple sinks in wireless sensor networks

Cited by 6 publications

References 14 publications

RPL-based routing protocols for multi-sink wireless sensor networks

RPL-based routing protocols for multi-sink wireless sensor networks

Traffic-balancing routing scheme for industrial wireless sensor networks

Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks

Contact Info

Product

Resources

About