Real-Time Routing Protocols for Wireless Sensor Networks: A Survey

Chennakesavula, Pradeep; Ebenezer, Jemimah; Murty, S.A.V. Satya

doi:10.5121/csit.2012.2413

Cited by 13 publications

(7 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, these protocols are unsuitable for delay-sensitive applications in which delay bound constraints must be satisfied. A real-time routing protocol can achieve real-time communications, thus being able to deliver data packets to their destination within their predefined deadline [28]. Due to IWSNs lossy links, sensor nodes resource constraints, and the delay constraint, real-time routing is a very challenging task.…”

Section: Related Workmentioning

confidence: 99%

Real-Time Energy-Efficient Reliable Traffic Aware Routing for Industrial Wireless Sensor Networks

Elfouly

Ramadan

2020

IEEE Access

View full text Add to dashboard Cite

Many industrial wireless sensor network (IWSN) applications require real-time communications in which bounded delay requirements need to be satisfied. IWSN lossy links and limited resources of sensor nodes pose significant challenges for supporting real-time applications. Many IWSN routing algorithms focus on being energy efficient to extend the network lifetime, but the delay wasn't the main concern. However, these algorithms are unable to deal with real-time applications in which data packets need to be delivered to the sink node within a predefined real-time information. On the other hand, the most existing real-time routing schemes are often based on the desired deadline time (required delivery time) and end-to-end distance in the selection of forwarding node while the reliability of on-time data delivery, the effects of a collision, energy balance, and a number of a hop count to the sink node have largely been ignored. These issues can dramatically impact real-time performance. Therefore, the paper proposes a routing algorithm that achieves a balance between energy efficiency and reliability while being suitable for real-time applications as well. In addition, it reduces the effects of congestion by sufficiently utilizing the underloaded nodes to improve network throughput. Finally, the hop count to the sink is considered. This paper formulates the real-time routing problem into 0/1 Integer Linear Programming (ILP) problem and then proposes a Realtime Energy-Efficient Traffic-Aware approach (RTERTA) to solve the optimization problem for a large-scale IWSN. From the obtained simulation results, the proposed solution has proved to be able to enhance the network performance in terms of packets miss ratio, average end-to-end delay, packets delivery rate, as well as network lifetime.

show abstract

Section: Related Workmentioning

confidence: 99%

Real-Time Energy-Efficient Reliable Traffic Aware Routing for Industrial Wireless Sensor Networks

Elfouly

Ramadan

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…27 The distinct characteristics of WSN such as small proportions, low power intake, self-governing, freedom of movement, dense volume, self-healing, and self-organizing pose some constraints in terms of power intake, storage, processing capabilities, and bandwidth requirement. 28 Using tens to thousands of sensor devices in self-organizing networks has created a new technology referred to as wireless sensor network. 29 Routing of sensor data has been one of the challenging zones in wireless sensor network research.…”

Section: Literature Surveymentioning

confidence: 99%

“…Cognitive networks are likely to employ cross‐layer optimizations, and they act simultaneously on parameters belonging to multiple layers in the protocol stack 27 . The distinct characteristics of WSN such as small proportions, low power intake, self‐governing, freedom of movement, dense volume, self‐healing, and self‐organizing pose some constraints in terms of power intake, storage, processing capabilities, and bandwidth requirement 28 . Using tens to thousands of sensor devices in self‐organizing networks has created a new technology referred to as wireless sensor network 29 .…”

Section: Literature Surveymentioning

confidence: 99%

DACASN: Dynamic ant routing‐based channel accessing cognitive sensor network in Internet of Things

Arulanantham¹,

Palanisamy

2020

Int J Communication

View full text Add to dashboard Cite

SummaryThe Internet of Things (IoT) is a structure with sensors, base station, gateway, and network servers. Users can access the information contained in it and use it as they need. These sensors are embedded in several data collection locations in a uniform or random manner to collect data. The users in many parts of the world obtain such data that fit their requirements. For example, sensors are used in remote areas to monitor various areas such as forests, wildlife sanctuaries, fields, industrial needs, human condition, and changes in the ocean. The changes like these that take place in the open spaces require the selection of the best routing method and seamless delay reduction in data collection helps to immediately reach those involved in it. In the proposed protocol, dynamic ant routing‐based channel accessing cognitive sensor network (DACASN) in the IoT, cognitive sensors are used. It is made with the knowledge of choosing a channel for communication as well as selecting the parameters for path selection and setting the most accurate path with the channel knowledge and communicating with the internet server. The sensors set the paths for this route selection using the centrifugal method and the anticolonial method. As a result, it can be seen in the results and discussion section that the quality of the routing information is high because it is delivered to the destination in the shortest possible time.

show abstract

“…In these scenarios, real-time communication is one of the areas highly focused on to support diverse and novel emerging sensor applications such as urgent data reporting and multimedia traffic management. However, supporting real-time communication is also a challenging issue in WSNs since the distinguishing features of WSNs as compared to traditional wired networks [ 3 , 4 ] lead to the building of harsh network environments that are composed of a large number of resource-constrained sensor nodes where their links are lossy and unstable. Therefore, WSNs naturally have dynamic environments such that states of nodes and links are easily changed.…”

Section: Introductionmentioning

confidence: 99%

A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks

Park

Kim

et al. 2017

Sensors

View full text Add to dashboard Cite

Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new (m, k)-firm-based Real-time Broadcast Protocol (FRBP) by constructing a broadcast tree to satisfy the (m, k)-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured (m, k)-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption.

show abstract

Real-Time Routing Protocols for Wireless Sensor Networks: A Survey

Abstract: Wireless sensor networks can be termed as a new generation of distributed embedded

Cited by 13 publications

References 29 publications

Real-Time Energy-Efficient Reliable Traffic Aware Routing for Industrial Wireless Sensor Networks

Real-Time Energy-Efficient Reliable Traffic Aware Routing for Industrial Wireless Sensor Networks

DACASN: Dynamic ant routing‐based channel accessing cognitive sensor network in Internet of Things

A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks

Contact Info

Product

Resources

About