Improved Unequal-Clustering and Routing Protocol

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.

Improved Unequal-Clustering and Routing Protocol

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.

Towards improved clustering and routing protocol for wireless sensor networks

Wireless 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.

Towards Improved Clustering and Routing Protocol for Wireless Sensor Networks

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.

Software Defined Networking Based Solution in Load Balancing for Media Transfer in Overlay Network

Traditional methodologies for routing in media streaming is challenging because packets are not retransmitted when there is loss or corruption of packets. Thus throughput, packet loss rate or delay is not guaranteed. Providing multipath for every transmission helps in meeting efficient load balancing metrics. Software defined networking (SDN) approach is used to configure the network topology and increase the network performance and monitoring. Controller act as a centralized management device which monitors the overlay network. It reacts to network failures/changes by administering alternate routing instructions to the overlay nodes. The overlay network enhances different load balancing metrics. Dijkstra’s algorithm is used to solve the routing problem for find the shortest path. The proposed scheme is using an AOMDV multipath on-demand routing protocol which dynamically finds multipath. It experimentally evaluates performance metrics like end-to-end delay, throughput using AOMDV is compared with AODV.

Spectrum Allocation Policy in Elastic Optical Networks

The considered problem covers routing and spectrum allocation problem (RSA problem) in Elastic Optical Networks while maintaining the spectrum continuity constraints, non-overlapping spectra constraints for adjacent connections on individual links of the network and spectrum contiguity constraints of the connection. In this article the modified version of the First Fit spectrum slot allocation policy for Fixed Alternate Routing in flexible optical networks has been proposed. The Fixed Alternate Routing with proposed spectrum allocation policy rejects fewer requests, provides less bandwidth blocking probability and less spectrum fragmentation than Fixed Alternate Routing with well-known First Fit and Exact Fit spectrum allocation policies. However, the cost of improving these parameters is a higher computational complexity of the proposed allocation policy.

Hazmat Routing: Alternate Routing Risk Analysis

The railroad industry is challenged by the complexity and cost of performing the alternate route analysis as required by the Federal Railroad Administration’s (FRA) hazmat routing regulation. This is especially problematic to the regional and short line railroads for several reasons, including the unavailability of alternate routes and, as with the Class I railroads, it is a matter of cost and complexity of analysis. This research paper will look at developing a simplified risk model so as to reduce the cost and complexity of the analysis. This will be accomplished by, among other things, looking at the input parameters to the model for commonality so as to reduce the number (of input parameters) and look at three operating conditions for the analysis. They are: 1) the premise that there are available alternate routes, 2) that alternate routes may not be feasible operationally or economically and 3) that there are no alternate routes. This research and analysis will result in a model that is less complex and costly to run and address the concerns and challenges of the short line and regional railroads.