A two-hop based real-time routing protocol for wireless sensor networks (original) (raw)
Related papers
A novel real-time routing protocol in wireless sensor networks
2009 International Conference on the Current Trends in Information Technology (CTIT), 2009
One of the most important and challenging issues in real-time applications of resource-constrained wireless sensor networks (WSNs) is providing end-to-end delay requirement. To address such an issue a few QoS routing protocols have been proposed. THVR (Two-Hop Velocity based routing protocol) is newly proposed real-time protocol while it is based on the concept of using two-hop neighbor information for routing decision. In this paper we propose a novel real-time Power-Aware Two-Hop (PATH) based routing protocol. PATH improves real-time performance by means of reducing the packet dropping in routing decisions. PATH is based on the concept of using two-hop neighbor information and power-control mechanism. The former is used for routing decisions and the latter is deployed to improve link quality as well as reducing the delay. PATH dynamically adjusts transmitting power in order to reduce the probability of packet dropping. Also PATH addresses practical issue like network holes, scalability and loss links in WSN's .We simulate PATH and compare it with THVR. Our simulation results show that PATH can perform better than THVR in term of energy consumption and delay.
Enhancing Real-Time Delivery in Wireless Sensor Networks With Two-Hop Information
IEEE Transactions on Industrial Informatics, 2000
A two-hop neighborhood information-based routing protocol is proposed for real-time wireless sensor networks. The approach of mapping packet deadline to a velocity is adopted as that in SPEED; however, our routing decision is made based on the novel two-hop velocity integrated with energy balancing mechanism. Initiative drop control is embedded to enhance energy utilization efficiency, while reducing packet deadline miss ratio. Simulation and comparison show that the new protocol has led to lower packet deadline miss ratio and higher energy efficiency than two existing popular schemes. The result has also indicated a promising direction in supporting real-time quality-of-service for wireless sensor networks.
Energy-Efficient and Reliable Routing for Real-time Communication in Wireless Sensor Networks
Engineering, Technology and Applied science research/Engineering, Technology and Applied Science Research, 2024
Wireless Sensor Networks (WSN) can be part of a tremendous number of applications. Many WSN applications require real-time communication where the sensed data have to be delivered to the sink node within a predetermined deadline decided by the application. In WSNs, the sensor nodes' constrained resources (e.g. memory and power) and the lossy wireless links, give rise to significant difficulties in supporting real-time applications. In addition, many WSN routing algorithms strongly emphasize energy efficiency, while delay is not the primary concern. Thus, WSNs desperately need new routing protocols that are reliable, energy-efficient, and appropriate for real-time applications. The proposed algorithm is a real-time routing algorithm appropriate for delay-sensitive applications in WSNs. It has the ability to deliver data on time while also enabling communications that are reliable and energy-efficient. It achieves this by deciding which candidate neighbors are eligible to participate in the routing process and can deliver the packet before its deadline. In order to lessen the delay of the chosen paths, it also computes the relaying speed for each eligible candidate. Moreover, it takes into account link quality, hop count, and available
Real-time Power-Aware Routing in Sensor Networks
200614th IEEE International Workshop on Quality of Service, 2006
Many wireless sensor network applications must resolve the inherent conflict between energy efficient communication and the need to achieve desired quality of service such as end-to-end communication delay. To address this challenge, we propose the Real-time Power-Aware Routing (RPAR) protocol, which achieves application-specified communication delays at low energy cost by dynamically adapting transmission power and routing decisions. RPAR features a power-aware forwarding policy and an efficient neighborhood manager that are optimized for resource-constrained wireless sensors. Moreover, RPAR addresses important practical issues in wireless sensor networks, including lossy links, scalability, and severe memory and bandwidth constraints. Simulations based on a realistic radio model of MICA2 motes show that RPAR significantly reduces the number of deadlines missed and energy consumption compared to existing real-time and energy-efficient routing protocols.
Energy-Efficient Packet Routing Model for Wireless Sensor Network
Lecture Notes in Electrical Engineering, 2017
The formation of clusters and cluster heads in wireless sensor network(WSN)leads to overhead. Such overhead is reduced by using proper medium access control design. Reliability and sleep scheduling of nodes is achieved by such protocols. There are two types of Medium Access control protocol, they are contention and contention free based protocol. The contention based protocols are CSMA/ CA. There is heavy contention of nodes for channel access [1]. When node density and network traffic are moderate or high, they suffer high collision rates because of concurrent channel access, which in turn increases the packet drop rate. As a result, for large networks contentionbased protocols are not suitable. This drawback is overcome by using contention free protocol such as TDMA [2] [3]. In such schemes, a specific time slot to is assigned by the cluster head to each node in the cluster, and the node uses that time slot to transmit. The sleep time of nodes increases by using TDMA. The reliability and the energy efficiency of the network are also improved. In many of the clustering techniques that utilized TDMA hop selection and probability of packet failure was not considered. Packet loss introduces an overhead for both intra and intercluster communication. This makes network unreliable as energy consumption increases. This aspect is studied by determining packet failure probability. Here an energy optimization technique and a packet failure likelihood estimation technique are presented.The proposed energy efficient model performs better than the existing in term of lifetime of network. When the number of nodes are increased, results show that proposed model performs better than (Low Energy Adaptive Clustering Hierarchy)
A Power-Aware Real-Time Routing Mechanism for Wireless Sensor Networks
2013
To optimally manage the limited energy of nodes without degrading efficiency of routing protocols in delivering real-time packets in wireless sensor networks, we propose in this paper an efficient power-aware real-time routing (PRR) mechanism. Firstly, it increases the network fluidity and saves more energy of nodes by removing early in network all useless data packets according to their residual deadline and expected end-to-end delay. Secondly, it reinforces the real-time behavior of the used routing protocol and preserves the network resources by selecting from the current-node queue the most urgent packet to be forwarded first. Finally, it saves energy of nodes without degrading the protocol efficiency in delivering real-time flows by combining adjusted transmission power of current node with relay speed of the forwarding candidate neighbors when selecting a next forwarder for the current packet. PRR is simple to implement and can be easily integrated in any geographic routing protocol. Associated with the well-know real-time routing protocol SPEED by using TinyOS, and evaluated in its embedded simulator TOSSIM, PRR achieved good performance in terms of network energy consumption, packet loss ratio, and node energy balancing.
Energy aware multi-path and multi-SPEED routing protocol in wireless sensor networks
2009 14th International CSI Computer Conference, 2009
Wireless sensor networks are limited in energy. Any routing protocol used in wireless sensor networks should take into consideration the time sensitive nature of the traffic in such networks, along with the amount of energy left for each sensor. In this paper we present an energy aware packet delivery mechanism for probabilistic Quality of Service (QoS) guarantee in wireless sensor networks. Each node takes routing decisions based on geographic progress towards the destination sink, required end-to-end total reaching probability, delay at the candidate forwarding node and residual energy. The simulation results demonstrate that the proposed protocol effectively improves the energy usage efficiency of the sensor nodes, maximizing the lifetime of the entire sensor network, while keeping guaranteed QoS.
Wireless sensor network (WSNs) are self-organized systems that depend on highly distributed and scattered low cost tiny devices. These devices have some limitations such as processing capability, memory size, communication distance coverage and energy capabilities. In order to maximize the autonomy of individual nodes and indirectly the lifetime of the network, most of the research work is done on power saving techniques. Hence, we propose energy-aware load distribution technique that can provide an excellent data transfer of packets from source to destination via hop by hop basis. Therefore, by making use of the cross-layer interactions between the physical layer and the network layer thus leads to an improvement in energy efficiency of the entire network when compared with other protocols and it also improves the response time in case of network change.
Energy-Efficient Routing Protocol for Wireless Sensor Networks [J]
2008
Sensors are regarded as significant components of electronic devices. In most applications of wireless sensor networks (WSNs), important and critical information must be delivered to the sink in a multi-hop and energy-efficient manner. Inasmuch as the energy of sensor nodes is limited, prolonging network lifetime in WSNs is considered to be a critical issue. In order to extend the network lifetime, researchers should consider energy consumption in routing protocols of WSNs. In this paper, a new energy-efficient routing protocol (EERP) has been proposed for WSNs using A-star algorithm. The proposed routing scheme improves the network lifetime by forwarding data packets via the optimal shortest path. The optimal path can be discovered with regard to the maximum residual energy of the next hop sensor node, high link quality, buffer occupancy and minimum hop counts. Simulation results indicate that the proposed scheme improves network lifetime in comparison with A-star and fuzzy logic(A&F) protocol.