scholarly journals Application-Aware SDN-Based Iterative Reconfigurable Routing Protocol for Internet of Things (IoT)

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3521
Author(s):  
Ayesha Shafique ◽  
Guo Cao ◽  
Muhammad Aslam ◽  
Muhammad Asad ◽  
Dengpan Ye

The central intelligence offered by Software Defined Networking (SDN) promise the smart and reliable reconfiguration which enables the scalability of dynamic enterprise networks. The decoupled forwarding plane and control plane of SDN infrastructure is a key feature that supports the SDN controller to extract the physical network topology information at runtime to formulate network reconfigurations. This SDN-based network reconfiguration enables application-aware routing capability for Internet of Thing (IoT). However, these IoT enabled SDN-based routing protocols face some performance limitations in iterative reconfiguration process due to complete centralized path selection mechanism To this end, in this paper, we propose SDN-Based Application-aware Distributed adaptive Flow Iterative Reconfiguring (SADFIR) routing protocol. The proposed routing protocol enables the distributed SDN iterative solver controller to maintain the load-balancing between flow reconfiguration and flow allocation cost. In particular, the proposed routing protocol of SADFIR implements multiple SDN controllers that collaborate with network devices at forwarding plane to develop appropriate clustering strategy for routing the sensed information. This distributed SDN controllers are assisted to clustering topology that successfully map the residual network resources and also enable unique multi-hop application-aware data transmission. In addition, the proposed SADFIR monitor the iterative reconfiguration settings according to the network traffic of heterogeneity-aware network devices. The simulation experiments are conducted in comparison with the state-of-the-art routing protocols which demonstrates that SADFIR is heterogeneity-aware which is able to adopt the different scales of network with maximum network lifetime.

2013 ◽  
Vol 336-338 ◽  
pp. 2464-2467
Author(s):  
Quan Fen Yang ◽  
Heng Hua Shi ◽  
Shan Zhu

EIGRP is an enhanced version of IGRP, and is a private routing protocol of Cisco Systems, Inc. We analyze the packet format of EIGRP and the advantages including PDM, RTP, DUAL, rapid convergence times, low usage of network resources, and route summarization. In Packet Tracer simulation software, the simulation experiments configure EIGRP in a simple network topology. The simulation results show the different structure of EIGRP packet, and EIGRP supports well route summarization and provides extremely quick convergence times with minimal network traffic for low usage of network resources.


Author(s):  
Zhongdong Hu ◽  
Zhendong Wang ◽  
Junling Wang ◽  
Ting Zeng

<p>The existing routing protocols such as LEACH and its improvements are all balance the overall energy consumption of the network by electing cluster heads looping and randomly. However, it also causes defects such as different cluster sizes and uneven cluster head distribution, resulting in uneven energy loss. In response to these shortcomings, this paper proposes a new routing protocol called AOCRP based on automatic optimization of clustering. The AOCRP has an optimized and fixed number of clusters, and the cluster head distribution is relatively uniform. It can adjust the number of nodes in each cluster automatically during the operation and keep the number of nodes the same in each cluster during each round. The AOCRP balances node energy loss and extends the life cycle of wireless sensor networks. Simulation experiments show that the performance of this protocol is better than EH-LEACH and DEEC in extending the network lifecycle and data transmission.</p>


2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
David Chunhu Li ◽  
Li-Der Chou ◽  
Li-Ming Tseng ◽  
Yi-Ming Chen ◽  
Kai-Wei Kuo

To support an increasing amount of various new applications in vehicular ad hoc networks (VANETs), routing protocol design has become an important research challenge. In this paper, we propose a Bipolar Traffic Density Awareness Routing (BTDAR) protocol for vehicular ad hoc networks. The BTDAR aims at providing reliable and efficient packets delivery for dense and sparse vehicle traffic network environments. Two distinct routing protocols are designed to find an optimal packet delivery path in varied vehicular networks. In dense networks, a link-stability based routing protocol is designed to take vehicles connectivity into consideration in its path selection policy and maximize the stability of intervehicle communications. In sparse networks, a min-delay based routing protocol is proposed to select an optimal route by analyzing intermittent vehicle connectivity and minimize packets delivery latency. Intervehicles connectivity model is analyzed. The performance of BTDAR is examined by comparisons with three distinct VANET routing protocols. Simulation results show that the BTDAR outperforms compared counterpart routing protocols in terms of packet delivery delay and packet delivery ratio.


Author(s):  
Franciszek Grabowski ◽  
Marek Bolanowski ◽  
Andrzej Paszkiewicz

AbstractIn the article the authors propose a method for load-balancing of network resources for the case which uses a routing protocols. In the first part of the article the authors present currently used algorithms for load balancing and possibilities of their modification. Through the introduction of additional hardware components for each node: the agent and the probe; it is possible to monitor and control the current system performance. The whole analyzed network is treated as a complex system. This allows to eliminate overloading of route nodes (through ongoing analysis of the optimal operating point for a given node). Load balancing can be achieved using a modified mechanism of ECMP. The proposed approach allows for dynamic adjustment of load to network resources and thus effectively to balance network traffic.


2019 ◽  
Vol 8 (2) ◽  
pp. 1548-1554

MANETs have specific features that can satisfy the mobility and heterogeneous requirement of the smart environment. Smart applications need high Mobility, Bandwidth, Reliability and less Packet Loss and Delays; therefore, it is important to provide good Quality of Service (QoS) in such applications. So there is a dire need of identifying and exploring the relevant protocols that may be adapted for IoT enabled the smart environment. The routing protocols in smart environments are accountable for connectivity among nodes, fairness, quality of service, etc. Protocol & path selection is the main strategies to design any mobile network. The chosen protocol must have the best in term of data integrity and data delivery. Hence the analysis of the protocols become an essential step. This paper presents various securities and safety-related issues of MANET-IoT system, and also advocate the requirement of enhancing routing protocols in a smart environment. In this research, a new enhanced cache update technique is introduced in MANET protocol to make it enable for the upcoming smart environment. The enhanced algorithm helps to detect the malicious node and remove the stale route present in the network, no matter which traffic mode is used and in which direction nodes are moving. Cache is upgraded in such manner that all nodes in the way are notified about the misbehaving node and its adjacent neighbors’ nodes will not use misbehaving node while searching for the route. Here the analysis has been done taking a various number of nodes. Packet Delivery and Packet Lost are two key parameters taken for analysis purpose.


Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 510 ◽  
Author(s):  
Suhail Butt ◽  
Kamalrulnizam Bakar ◽  
Nadeem Javaid ◽  
Niayesh Gharaei ◽  
Farruh Ishmanov ◽  
...  

The key concerns to enhance the lifetime of IoT-enabled Underwater Wireless Sensor Networks (IoT-UWSNs) are energy-efficiency and reliable data delivery under constrained resource. Traditional transmission approaches increase the communication overhead, which results in congestion and affect the reliable data delivery. Currently, many routing protocols have been proposed for UWSNs to ensure reliable data delivery and to conserve the node’s battery with minimum communication overhead (by avoiding void holes in the network). In this paper, adaptive energy-efficient routing protocols are proposed to tackle the aforementioned problems using the Shortest Path First (SPF) with least number of active nodes strategy. These novel protocols have been developed by integrating the prominent features of Forward Layered Multi-path Power Control One (FLMPC-One) routing protocol, which uses 2-hop neighbor information, Forward Layered Multi-path Power Control Two (FLMPC-Two) routing protocol, which uses 3-hop neighbor information and ’Dijkstra’ algorithm (for shortest path selection). Different Packet Sizes (PSs) with different Data Rates (DRs) are also taken into consideration to check the dynamicity of the proposed protocols. The achieved outcomes clearly validate the proposed protocols, namely: Shortest Path First using 3-hop neighbors information (SPF-Three) and Breadth First Search with Shortest Path First using 3-hop neighbors information (BFS-SPF-Three). Simulation results show the effectiveness of the proposed protocols in terms of minimum Energy Consumption (EC) and Required Packet Error Rate (RPER) with a minimum number of active nodes at the cost of affordable delay.


Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


2012 ◽  
Vol 3 (2) ◽  
pp. 419-423
Author(s):  
JARUPULA RAJESHWAR ◽  
Dr G NARSIMHA

A freely moving nodes forming as group to communicate among themselves are called as Mobile AdHoc Networks (MANET). Many applications are choosing this MANET for effective commutation due to its flexible nature in forming a network. But due to its openness characteristics it is posing many security challenges. As it has highly dynamic network topology security for routing is playing a major role. We have very good routing protocols for route discovery as well as for transporting data packers but most of them lack the feature of security like AODV. In this paper we are studying the basic protocol AODV and identify how it can be made secure. We are studying a protocol S-AODV which is a security extension of AODV which is called Secure AODV (S-AODV) and we are studying enhanced version of S-AODV routing protocol a Adaptive Secure AODV (A-SAODV). Finally we have described about the parameter to be taken for performance evaluation of different secure routing protocols


Sign in / Sign up

Export Citation Format

Share Document