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

Tan, Do Duy; Kim, Dong-Seong

doi:10.1007/s11276-013-0672-z

Cited by 33 publications

(11 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the presented architecture of the network is not complicated enough to support routing graphs. Multiple sinks are generally used in the distributed scenario to balance the traffic load, which is responsible for packet collection as a substation [30,31,32,33]. In this paper, we realize a multi-sink gateway to achieve a highly schedulable WSAN in a practical industrial application.…”

Section: Related Workmentioning

confidence: 99%

Efficient Resource Scheduling for Multipath Retransmission over Industrial WSAN Systems

Wang

Yang

et al. 2019

Sensors

View full text Add to dashboard Cite

With recent adoption of Wireless Sensor-Actuator Networks (WSANs) in industrial automation, wireless control systems have emerged as a frontier of industrial networks. Hence, it has been shown that existing standards and researches concentrate on the reliability and real-time performance of WSANs. The multipath retransmission scheme with multiple channels is a key approach to guarantee the deterministic wireless communication. However, the efficiency of resource scheduling is seldom considered in applications with diverse data sampling rates. In this paper, we propose an efficient resources scheduling algorithm for multipath retransmission in WSANs. The objective of our algorithm is to improve efficiency and schedulability for the use of slot and channel resources. In detail, the proposed algorithm uses the approaches of CCA (clear channel assessment)-Embedded slot and Multiple sinks with Rate Monotonic scheme (CEM-RM) to decrease the number of collisions. We have simulated and implemented our algorithm in hardware and verified its performance in a real industrial environment. The achieved results show that the proposed algorithm significantly improves the schedulability without trading off reliability and real-time performance.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Resource Scheduling for Multipath Retransmission over Industrial WSAN Systems

Wang

Yang

et al. 2019

Sensors

View full text Add to dashboard Cite

show abstract

“…If its drawbacks, such as the blindness during scattering packets and the restrictions on coordinate systems, can be properly overcome, a more effective and practicable congestion control mechanism would be achieved for WSNs. Based on this understanding, many studies have been conducted with the aim of using gradient search to solve the routing problem in WSNs [17][18][19][20][21].…”

Section: Related Workmentioning

confidence: 99%

“…In several previous studies in the cost model, only the queue length of nodes has been used to find the next forwarder [19,20]. However, with this limited local information, packets cannot avoid the heavily congested regions.…”

Section: Traffic-balancing Routing Cost Modelmentioning

confidence: 99%

Hop-by-hop traffic-aware routing to congestion control in wireless sensor networks

Gholipour

Haghighat

Meybodi

2015

J Wireless Com Network

View full text Add to dashboard Cite

One of the major challenges in wireless sensor networks (WSNs) research is to prevent traffic congestion without compromising with the energy of the sensor nodes. Network congestion leads to packet loss, throughput impairment, and energy waste. To address this issue in this paper, a distributed traffic-aware routing scheme with a capacity of adjusting the data transmission rate of nodes is proposed for multi-sink wireless sensor networks that effectively distribute traffic from the source to sink nodes. Our algorithm is designed through constructing a hybrid virtual gradient field using depth and normalized traffic loading to routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The simulation results indicate that the proposed solution can improve the utilization of network resources, reduce unnecessary packet retransmission, and significantly improve the performance of WSNs.

show abstract

“…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%