scholarly journals THE PERFORMANCE OF DIRECTIONAL FLOODING ROUTING PROTOCOL FOR UNDERWATER SENSOR NETWORKS

2015 ◽  
Vol 74 (9) ◽  
Author(s):  
Nur Asfarina Idrus ◽  
Jiwa Abdullah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Underwater Communication ◽  
Routing Mechanism ◽  
Simulation Results ◽  
Networking Protocols

The specific characteristic of underwater environment introduces new challenges for the networking protocols. Underwater Wireless Sensor Networks (UWSN) and terrestrial Wireless Sensor Networks (WSN) share some common properties but their differences necessitate specialized new protocols for successful underwater communication. In this paper, a specialized protocol, known as Directional Flooding Routing Protocol is being chosen as the protocol to implement the routing mechanism for underwater sensor networks (UWSNs). The protocol is analyzed and evaluated. Simulation experiments have been carried out to find the suitability of various protocols for the sub aquatic transmission medium, whether in freshwater or seawater. The goal of this paper is to produce simulation results that would illustrate the performances of the protocol for a given metric such as end-to-end delay, packet delivery ratio and energy consumption. By analyzing the simulation results, DFR is considerably reliable for UWSN because this protocol is suitable for the sub aquatic transmission medium such as seawater.   

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

Sequential Beacon Scheduling Mechanism for Cluster-Tree WSNs

2012 ◽  
Vol 263-266 ◽  
pp. 932-938
Author(s):  
Hao Ru Su ◽  
Zhi Guo Shi ◽  
Zhi Liang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ieee 802.15.4 ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Cluster Tree ◽  
Collision Problem ◽  
Interference Range ◽  
Scheduling Mechanisms ◽  
Simulation Results

To solve the beacon collision problem in IEEE 802.15.4/ZigBee cluster-tree Wireless Sensor Networks, we proposed a Sequential Beacon Scheduling (SBS) mechanism. In this mechanism, the Cluster Headers (CHs) choose the beacon transmission time in a certain order. The CH which finishes the sequence chosen sends out control frame to inform other CHs in its interference range. The simulation results indicate that SBS general has better delivery ratio, latency, and throughput than three other beacon scheduling mechanisms.

scholarly journals A Secure Communication in IoT Enabled Underwater and Wireless Sensor Network for Smart Cities

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4309 ◽  
Author(s):  
Tariq Ali ◽  
Muhammad Irfan ◽  
Ahmad Shaf ◽  
Abdullah Saeed Alwadie ◽  
Ahthasham Sajid ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Secure Communication ◽  
Performance Metrics ◽  
Smart Cities ◽  
Wireless Sensor ◽  
Acoustic Medium ◽  
Delivery Ratio ◽  
Second Phase

Nowadays, there is a growing trend in smart cities. Therefore, the Internet of Things (IoT) enabled Underwater and Wireless Sensor Networks (I-UWSN) are mostly used for monitoring and exploring the environment with the help of smart technology, such as smart cities. The acoustic medium is used in underwater communication and radio frequency is mostly used for wireless sensor networks to make communication more reliable. Therefore, some challenging tasks still exist in I-UWSN, i.e., selection of multiple nodes’ reliable paths towards the sink nodes; and efficient topology of the network. In this research, the novel routing protocol, namely Time Based Reliable Link (TBRL), for dynamic topology is proposed to support smart city. TBRL works in three phases. In the first phase, it discovers the topology of each node in network area using a topology discovery algorithm. In the second phase, the reliability of each established link has been determined while using two nodes reliable model for a smart environment. This reliability model reduces the chances of horizontal and higher depth level communication between nodes and selects next reliable forwarders. In the third phase, all paths are examined and the most reliable path is selected to send data packets. TBRL is simulated with the help of a network simulator tool (NS-2 AquaSim). The TBRL is compared with other well known routing protocols, i.e., Depth Based Routing (DBR) and Reliable Energy-efficient Routing Protocol (R-ERP2R), to check the performance in terms of end to end delay, packet delivery ratio, and energy consumption of a network. Furthermore, the reliability of TBRL is compared with 2H-ACK and 3H-RM. The simulation results proved that TBRL performs approximately 15% better as compared to DBR and 10% better as compared to R-ERP2R in terms of aforementioned performance metrics.

Efficient Security Authentication Protocol in Wireless Sensor Networks

2014 ◽  
Vol 573 ◽  
pp. 418-423
Author(s):  
S. Asha Latha ◽  
A. Sivabalan
Keyword(s):  
Wireless Sensor Networks ◽  
Black Hole ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Authentication Protocol ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Secure Authentication ◽  
Aodv Routing Protocol

Wireless sensor networks consist of a network of autonomous sensors that can reconfigure themselves so as to sense the environment in the most significant manner. However, a significant challenge in the practical application of these networks exists in credible authentication and network security. This paper proposes a secure authentication protocol which is considered as a pro-active method, where a user is strongly verified before accessing the data, it is the modified Adhoc On-Demand Distance vector (AODV) Routing protocol that provides many security principles to the user such as checking sequence number, IP address and threshold values. The performance of proposed algorithm is compared with the existing alogorithm based on the following parameters such as Throughput, End to End delay and packet delivery ratio. The results shows that the proposed protocol possesses many advantages against the popular black hole attack. This work has been carried out using NS2 software and the result obtained testifies the effectiveness of the proposed protocol. Keyword: Authentication protocol, AES security, AODV routing protocol, Black hole attack, Wireless sensor network (WSN).

scholarly journals Solution for intra/inter-cluster event-reporting problem in cluster-based protocols for wireless sensor networks

2022 ◽  
Vol 12 (1) ◽  
pp. 868
Author(s):  
Raed Taleb Al-Zubi ◽  
Abdulraheem Ahmed Kreishan ◽  
Mohammad Qasem Alawad ◽  
Khalid Ahmad Darabkh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Reducing Power ◽  
Wireless Sensor ◽  
Effective Solution ◽  
Event Reporting ◽  
Energy Limitation ◽  
Simulation Results

<span>In recent years, wireless sensor networks (WSNs) have been considered one of the important topics for researchers due to their wide applications in our life. Several researches have been conducted to improve WSNs performance and solve their issues. One of these issues is the energy limitation in WSNs since the source of energy in most WSNs is the battery. Accordingly, various protocols and techniques have been proposed with the intention of reducing power consumption of WSNs and lengthen their lifetime. Cluster-oriented routing protocols are one of the most effective categories of these protocols. In this article, we consider a major issue affecting the performance of this category of protocols, which we call the intra/inter-cluster event-reporting problem (IICERP). We demonstrate that IICERP severely reduces the performance of a cluster-oriented routing protocol, so we suggest an effective Solution for IICERP (SIICERP). To assess SIICERP’s performance, comprehensive simulations were performed to demonstrate the performance of several cluster-oriented protocols without and with SIICERP. Simulation results revealed that SIICERP substantially increases the performance of cluster-oriented routing protocols.</span>

scholarly journals Hn-PERP: Hop by Hop - Power-Efficient Routing Protocol over Underwater Wireless Sensor Networks

2018 ◽  
Author(s):  
Tareq Krishan ◽  
Rami S. Alkhawaldeh ◽  
Saed Khawaldeh ◽  
Bilal Al-Ahmad ◽  
Adnan Al Smadi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Level ◽  
Routing Protocol ◽  
Data Transmission ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Underwater Wireless Sensor Networks ◽  
Power Efficient ◽  
Power Monitoring

Underwater wireless sensor networks (UWSN) have recently been proposed as a way to monitor and explore the water depths' environments. Efficiently delivering the data is still a challenging problem in these networks because of the weaknesses in the acoustic transmission. To tackle such a problem, we propose a novel algorithm provides controlling mechanisms for critical long-term data forwarding underwater sensor networks, called Hop by Hop Power-Efficient Routing Protocol (Hn-PERP). The proposed Hn-PERP is a centralized full-control model that enhances the network's throughput and energy efficiency by a set of solutions depend on power monitoring in UWSN nodes. In particular, the model provides a guaranteed mechanism for scheduling and processing data transmission based on number of nodes, hops between the nodes, energy level and congestion within each node to minimize energy levels or power consumption by avoiding disconnected probability for any node, which in turn maximizing the network lifetime. Simulation results show that our proposed model is consistent with energy level and congestion, and is more accurate for enabling routing and data transmission. Therefore, the data packet delivery ratio and overall throughput also achieves robust scenarios of very sparse or/and weak networks, to keep on Performance stability in UWSN via adjusting hop-by-hop delay and energy consumption during packages delivery.

Braided Routing Technique to Balance Traffic Load in Wireless Sensor Networks

2020 ◽  
pp. 837-855
Author(s):  
Apostolos Demertzis ◽  
Konstantinos Oikonomou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Local Variation ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Energy Hole ◽  
Local Variance ◽  
Routing Mechanism ◽  
Simulation Results

Many-to-one wireless sensor networks suffer from an extreme variation of traffic load between nodes. Sensor nodes near the sink consume much more energy than distant ones, resulting in the energy hole problem (global variation of load). In addition, even nodes located at the same distance from the sink experience very different traffic load with each other (local variation). This uneven distribution of traffic load, both globally and locally, results in a severe shortening of the time until first node runs out of battery. This work focuses on balancing the load of equally-distant nodes from the sink by sharing each one's load among its next-hop neighbors. Eventually, packets are travelling from node to sink by following interlaced paths. The proposed routing mechanism, called braided routing, is a simple one and can be applied over any cost-based routing, incurring a negligible overhead. Simulation results show that the local variance of load is reduced nearly 20-60% on average while the time until first death can be prolonged more than twice in many cases and the lifetime about 15%.

scholarly journals Adaptive hop-by-hop cone vector-based forwarding protocol for underwater wireless sensor networks

2020 ◽  
Vol 16 (9) ◽  
pp. 155014772095830
Author(s):  
Imran Ullah Khan ◽  
Mazhar Islam ◽  
Muhammad Ismail ◽  
Abdul Baseer Qazi ◽  
Sadeeq Jan ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Structure ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Underwater Wireless Sensor Networks ◽  
Base Angle ◽  
End To End Delay ◽  
End To End

In the recent past, a significant increase has been observed in the use of underwater wireless sensor networks for aquatic applications. However, underwater wireless sensor networks face several challenges including large propagation delays, high mobility, limited bandwidth, three-dimensional deployments, expensive manufacturing, and energy constraints. It is crucial for underwater wireless sensor networks to mitigate all these limitations primarily caused by the harsh underwater environment. To address some of the pertinent challenges, adaptive hop-by-hop cone vector-based forwarding routing protocol is proposed in this article which is based on the adaptive hop-by-hop vector-based forwarding. The novelty of adaptive hop-by-hop cone vector-based forwarding includes increasing the transmission reliability in sparse sensor regions by changing the base angle of the cone according to the network structure. The number of duplicate packets and end-to-end delay is also reduced because of the reduced base angle and a smart selection criterion for the potential forwarder node. The proposed routing protocol adaptively tunes the height and opening of the cone based on the network structure to effectively improve the performance of the network. Conclusively, this approach significantly reduces energy tax, end-to-end delay, and packet delivery ratio.

scholarly journals An Improved Opportunistic Routing Protocol for Intermittently Connected Delay Tolerant Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Dong Yeong Seo ◽  
Yun Won Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Intermittently Connected

In intermittently connected delay tolerant wireless sensor networks, sensor data generated at sensor nodes should be delivered to a sink node using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path from a source node to a sink node in intermittently connected network, an opportunistic routing protocol to deliver sensor data efficiently is needed. In this paper, an improved opportunistic routing protocol is proposed, where both current delivery predictability and maximum delivery predictability are used together to decide whether sensor data should be forwarded or not to a contact node. The proposed protocol can reduce buffer overflow and thus increase the delivery ratio, which is one of the most important performance measures in delay tolerant wireless sensor networks. The performance of the proposed routing protocol is compared with that of PRoPHET protocol and FREAK protocol, by varying buffer sizes and the number of nodes, in terms of delivery ratio, overhead ratio, and delivery latency. Performance analysis results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than the PRoPHET protocol and FREAK protocol have, in most considered parameter values, with appropriate selection of message dissemination thresholds.

Sign in / Sign up

Export Citation Format

Share Document