scholarly journals Improved Unequal-Clustering and Routing Protocol

2021 ◽  
Author(s):  
Mohammad Alharbi ◽  
Mario Kolberg
Keyword(s):  
Routing Protocol ◽  
Transmission Range ◽  
Unequal Clustering ◽  
Hop Count ◽  
Network Nodes ◽  
Fixed Area ◽  
Alternate Routing ◽  
Network Backbone

We propose improved unequal-clustering and routing protocol (IUCR) protocol to solve both of these problems jointly. IUCR provide fixed area clustering derived from transmission range of network nodes. This clustering also develops strong network backbone that provides fail-over-proof routing. Efficient routing path is achieved by finding minimal hop-count with availability of alternate routing path.

scholarly journals Improved Unequal-Clustering and Routing Protocol

2021 ◽  
Author(s):  
Mohammad Alharbi ◽  
Mario Kolberg
Keyword(s):  
Routing Protocol ◽  
Transmission Range ◽  
Unequal Clustering ◽  
Hop Count ◽  
Network Nodes ◽  
Fixed Area ◽  
Alternate Routing ◽  
Network Backbone

We propose improved unequal-clustering and routing protocol (IUCR) protocol to solve both of these problems jointly. IUCR provide fixed area clustering derived from transmission range of network nodes. This clustering also develops strong network backbone that provides fail-over-proof routing. Efficient routing path is achieved by finding minimal hop-count with availability of alternate routing path.

scholarly journals Towards Improved Clustering and Routing Protocol for Wireless Sensor Networks

2020 ◽  
Author(s):  
Mohammad Alharbi ◽  
Mario Kolberg ◽  
Muhammad Zeeshan
Keyword(s):  
Large Scale ◽  
Network Connectivity ◽  
Network Capacity ◽  
Wireless Sensor ◽  
Transmission Range ◽  
Hop Count ◽  
Iot Applications ◽  
Battery Capacity ◽  
Alternate Routing ◽  
Network Backbone

Abstract Wireless sensor network (WSN)-based Internet of Things (IoT) applications suffer from issues including limited battery capacity, frequent disconnections due to multihop communication and a shorter transmission range. Researchers propose different but isolated clustering and routing solutions that are inefficient in terms of energy efficiency and network connectivity in IoT-based WSNs. In this work, we emphasize the importance of considering the context of IoT applications that have further requirements for dedicated data collection per node. We address two interlinked issues, clustering and routing, in a large-scale IoT-based WSN. We propose an improved clustering and routing (ICR) protocol to jointly solve both of these issues. Improved clustering and routing provide area-based clustering derived from the transmission range of network nodes. This clustering also develops a strong network backbone that provides fail-over-proof routing. An efficient routing path is achieved by finding the minimal hop count with the availability of alternate routing paths. The results are compared with state-of-the-art benchmark protocols, Joint Clustering and Routing (JCR), Low Energy Adaptive Hierarchical Clustering (LEACH) and other recent protocols. Theoretical and simulation results demonstrate reliable network topology, improved network lifetime, efficient node density management and improved overall network capacity.

scholarly journals Towards improved clustering and routing protocol for wireless sensor networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Mohammad Ali Alharbi ◽  
Mario Kolberg ◽  
Muhammad Zeeshan
Keyword(s):  
Network Lifetime ◽  
Routing Protocol ◽  
Large Scale ◽  
Network Capacity ◽  
Efficient Solutions ◽  
Wireless Sensor ◽  
Transmission Range ◽  
Hop Count ◽  
Battery Capacity ◽  
Alternate Routing

AbstractWireless sensor network (WSN)-based Internet of Things (IoT) applications suffer from issues including limited battery capacity, frequent disconnections due to multi-hop communication and a shorter transmission range. Clustering and routing are treated separately in different solutions and, therefore, efficient solutions in terms of energy consumption and network lifetime could not be provided. This work focuses data collection from IoT-nodes distributed in an area and connected through WSN. We address two interlinked issues, clustering and routing, for large-scale IoT-based WSN and propose an improved clustering and routing protocol to jointly solve both of these issues. Improved clustering and routing provide area-based clustering derived from the transmission range of network nodes. During process of clustering, cluster-heads are selected in such a way that provide fail-over-proof routing. An efficient routing path is achieved by finding the minimal hop-count with the availability of alternate routing paths. The results are compared with state-of-the-art benchmark protocols. Theoretical and simulation results demonstrate reliable network topology, improved network lifetime, efficient node density management and improved overall network capacity.

scholarly journals Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Packet Delivery

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

Improved Unequal-Clustering and Routing Protocol

2021 ◽  
pp. 1-1
Author(s):  
Mohammad Ali Alharbi ◽  
Mario Kolberg
Keyword(s):  
Routing Protocol ◽  
Unequal Clustering

scholarly journals A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Heuristic Function ◽  
Hop Count ◽  
Dynamic Topology ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

scholarly journals Performance of Static Iot Networks using RPL Objective Functions

2019 ◽  
Vol 8 (4) ◽  
pp. 8972-8977 ◽  
Keyword(s):  
Objective Function ◽  
Routing Protocol ◽  
Routing Algorithms ◽  
Transmission Protocol ◽  
Objective Functions ◽  
Lossy Networks ◽  
Hop Count ◽  
Efficient Data ◽  
Selection Of ◽  
Better Than

Internet of Things, abbreviated as IoT is a network used mainly for the communication where different devices are connected for the retrieval, examination and execution of the necessary task. One of IoT’s biggest challenge is that, they are resource-constrained. Hence, it is essential to use an efficient data transmission protocol for routing. An effective routing protocol for static IoT network is the Routing protocol for Low Power and Lossy Networks (RPL). It is essential to assess the effectiveness of the RPL with the selection of best objective function for different static model. In this paper, the performance of different routing algorithms is compared in connection with different static topologies. Hence, the objective function’s performance is compared for different topologies i.e., Butterfly, Ring and Umbrella topologies. We consider two objective functions: namely Minimum Rank with Hysteresis Objective Function (MRHOF) and Objective Function Zero (OF0). MRHOF considers Expected Transmission Count (ETX) as its metric and the metric considered under OF0 is hop count. It is observed that the objective function OF0 performs better than MRHOF for the metric of energy and successful receiving of data.

scholarly journals Energy Efficient Composite Metric Based Routing Protocol for Internet of Things

2020 ◽  
Vol 26 (11) ◽  
pp. 1366-1381
Author(s):  
Sathishkumar Natesan ◽  
Rajakumar Krishnan
Keyword(s):  
Internet Of Things ◽  
Low Power ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Link Quality ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Lossy Networks ◽  
Hop Count ◽  
Battery Discharge

The Routing Protocol for Low Power and Lossy Networks (RPL) is operated by gadgets comprised of many devices of embedded type with limited energy, memory as well as resources that do their process. The improvements in the life of the network and energy conservation are the key challenging features in Low Power and Lossy Networks (LLN). Obviously, the LLN has a key strategic part in routing. The Internet of Things (IoT) device is expected to make the apt choice. In LLN, the poor routing choice leads to traffic congestion, reduction in power as well as packet loss ratio. The task in the proposal analyzes Delay (D), Load (L) and Battery Discharge Index (BDI) pivoted Energy Efficient Composite Metric Routing (EECMR) protocol for LLN. The performance of the work in the proposal is evaluated by the COOJA simulator. It outperforms with respect to Network Lifetime (NL), Delay as well as Packet Delivery Ratio (PDR) contrasted to the routing metrics like Traffic Load (TL), Link Quality (LQ), Residual Energy (RE), RE-Battery Discharge Index (RE-BDI) and Hop Count (HC).

Research and Improvement of Dynamic Source Routing Protocol Based on Ad Hoc

2014 ◽  
Vol 644-650 ◽  
pp. 2838-2841
Author(s):  
Ping Zong ◽  
Jun Qin
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Hop Count ◽  
Qos Guarantee ◽  
Source Routing ◽  
Dynamic Source Routing ◽  
Dynamic Source ◽  
Mobile Ad Hoc

With the growth of multimedia business demand in commercial applications, providing QoS support in Ad Hoc network is more and more important. With the appearance of the business which has strict requirements on the QoS, to provide QoS guarantee in mobile Ad Hoc network will have more important significance. By researching the QoS guarantee mechanism research status of wireless Ad Hoc network, as well as the existing research results and the analysis of the problems remaining to be solved, this paper puts forward a new QoS routing protocol named ProDSR, which adds QoS guarantee mechanism extension to the dynamic source routing protocol (DSR). This protocol makes bandwidth, stability and hop count to be selection criteria for providing QoS guarantee, effectively improves the service quality of mobile Ad Hoc network.

Sign in / Sign up

Export Citation Format

Share Document