Proposed Routing Mechanism Research Articles

Disentangled Partial Label Learning

Partial label learning (PLL) induces a multi-class classifier from training examples each associated with a set of candidate labels, among which only one is valid. The formation of real-world data typically arises from heterogeneous entanglement of series latent explanatory factors, which are considered intrinsic properties for discriminating between different patterns. Though learning disentangled representation is expected to facilitate label disambiguation for partial-label (PL) examples, few existing works were dedicated to addressing this issue. In this paper, we make the first attempt towards disentangled PLL and propose a novel approach named TERIAL, which makes predictions according to derived disentangled representation of instances and label embeddings. The TERIAL approach formulates the PL examples as an undirected bipartite graph where instances are only connected with their candidate labels, and employs a tailored neighborhood routing mechanism to yield disentangled representation of nodes in the graph. Specifically, the proposed routing mechanism progressively infers the explanatory factors that contribute to the edge between adjacent nodes and augments the representation of the central node with factor-aware embedding information propagated from specific neighbors simultaneously via iteratively analyzing the promising subspace clusters formed by the node and its neighbors. The estimated labeling confidence matrix is also introduced to accommodate unreliable links owing to the inherent ambiguity of PLL. Moreover, we theoretically prove that the neighborhood routing mechanism will converge to the point estimate that maximizes the marginal likelihood of observed PL training examples. Comprehensive experiments over various datasets demonstrate that our approach outperforms the state-of-the-art counterparts.

Dynamic User Routing, Paid and Free Users, Web applications, Content Delivery Network (CDN)

Abstract: This research paper introduces a novel approach for efficient routing between paid and free users in web applications by harnessing the capabilities of a Content Delivery Network (CDN). The primary objective of this study is to optimize user experience and resource allocation based on user type, aiming to deliver personalized content while maximizing resource utilization. The proposed routing mechanism dynamically directs users to the appropriate pages or content based on their subscription status, leveraging the integration of a CDN into the web application architecture. The paper thoroughly explores the implementation details, emphasizing the seamless interaction between the CDN and user authentication mechanisms, and investigates the routing algorithms employed to intelligently determine the most suitable content delivery path for each user type. Through comprehensive experimentation and evaluation, the research demonstrates the efficiency and scalability of the proposed approach. Various user scenarios are considered, and factors such as response time, resource utilization, and content availability are evaluated. The experimental results showcase the significant enhancement of the overall user experience achieved through the dynamic user routing mechanism, providing tailored content delivery while effectively managing resource allocation. The findings of this research contribute to the field of web application development, particularly in managing different user types and delivering personalized content. By effectively leveraging CDNs and implementing dynamic routing strategies, web applications can optimize user satisfaction, ensure efficient resource utilization, and accommodate varying user subscription models. This research offers valuable insights and practical implications for designing and implementing usercentric web applications that deliver customized experiences and efficiently allocate resources based on user types. The paper delves into the implementation details, highlighting the key components and functionalities of the proposed solution. It explores the integration of the CDN into the web application architecture, emphasizing the seamless interaction between the CDN and user authentication mechanisms. Additionally, it investigates the routing algorithms employed to intelligently determine the appropriate content delivery path for each user type.

Metaheuristic based routing incorporated with energy harvesting for enhanced network lifetime in WBAN

Wireless body area networks (WBAN) have improved healthcare industries to a large extent by providing contactless measurements and remote data analysis. However, the challenges encountered are mostly in the form of energy depletion scenarios, which results in the reduction of network lifetime to a large extent. This work presents an effective model to provide energy-efficient routing and enhanced energy harvesting mechanisms to improve network lifetime. The ant colony optimization (ACO) method has been extended to include a fitness function that takes into account several factors, and this is the basis for the routing model. These processes ensure effective routing, which conserves energy and, in turn, results in enhanced network lifetime. Performance of the proposed model has been compared with the existing state-of-the-art models in the domain. Comparison with the metaheuristic-based model, cooperative energy efficient and priority based reliable routing protocol with network coding (CEPRAN), indicates the efficiency of the energy harvesting mechanism used in the proposed work. When compared with models using energy harvesting mechanisms, results exhibit higher network lifetime, depicting the efficiency of the proposed routing mechanism.

An effective data routing for dynamic area coverage using multidrone network

AbstractDrones equipped with visual sensors are extensively utilized in various area coverage applications such as area mapping, monitoring of crops and road traffic, rescue operations, and so on. To enhance the coverage process, a suitable mobility model and an effective way of data communication are required. In literature, many works have been performed by focusing on the above‐mentioned aspects individually. However, unwanted information processing and a less packet delivery ratio with high message flooding are some shortcomings that have been seen in existing works on mobility model and routing protocol respectively. The above‐mentioned issues motivate us to propose a three‐level working process of ground area coverage, which includes the design of a mobility model as well as a routing mechanism incorporating the above‐mentioned mobility pattern. A set of waypoints for the movement of a drone is generated by an optimized aerial decomposition process in order to maximize and minimize the actual and exterior ground area coverage respectively. The decomposition is performed by incorporating the position and orientation of the camera footprint. While moving through the waypoints, a drone finds a stable and energy‐enable path to transmit the collected information to other drones. To avoid the frequent link loss due to the high mobility and limited energy of drones, threshold values for the velocity and energy with an estimated link stability time are considered as three parametric for the proposed routing mechanism. The result shows that the proposed work outperforms the existing result in many folds, and is suitable for the area coverage applications.

Improvement of Network Throughput by Providing CAODV-Based Routing Algorithm in Cognitive Radio Ad Hoc Networks

In this paper, a CAODV-based routing approach is proposed which uses multi-channel and multi-path forwarding techniques to deal with the time-varying activities of PUs. We also benefited from a suitable channel selection strategy with the goal of increasing throughput. Our method allocates interference-free channels and, if data is entered or activated, each node will select a path. The proposed routing mechanism, in turn, considers the relay loading, and the interference of the common channel in the primary and secondary nodes. We use the Lyapunov optimization queuing model in a multi-channel network. What is clear from the simulation results is that the proposed protocol improves end to end delay, PDR and throughput performance significantly in comparison to another protocols such as SEARCH and CAODV.

Beeware Routing Scheme for Detecting Network Layer Attacks in Wireless Sensor Networks

In wireless sensor networks identifying the optimal path is a complex task, it requires some effective routing schemes to handle the issues in networks. To provide such environment for carrying effective routing for data forwarding is nightmare for the traditional methods. In this paper, we propose a bio inspired based secure routing scheme with the help of bee algorithms. The proposed routing mechanism consists of two important metrics known as primary scout bee and secondary scout bee for carrying routing and security mechanism. It provides better data efficiency with security in many scenarios. Here we use three kinds of routing attacks, to evaluate the proposed scheme such as flood attack, spoof attack and Sybil attack. The final verdict of adopting this technique is to derive a secure routing path for carrying the message in WSN environment. The simulation result shows that, the proposed Beeware routing scheme provides a better result compared to other mechanism.

A hybrid secure routing and monitoring mechanism in IoT-based wireless sensor networks

Internet of Things (IoT) has advanced its pervasiveness across the globe for the development of smart networks. It is aimed to deploy network edge that enables smart services and computation for the IoT devices. In addition, this deployment would not only improve the user experience but also provide service resiliency in case of any catastrophes. In IoT applications, the edge computing exploits distributed architecture and closeness of end-users to provide faster response and better quality of service. However, the security concern is majorly addressed to resist the vulnerability of attacks (VoA). Existing methodologies deal only with static wireless sensor web to deduce the intrusions in which the sensor nodes are deployed in a uniform manner to retain the constancy. Since the sensor nodes are constantly being in question through different transmission regions with several levels of velocities, selection of sensor monitoring nodes or guard nodes has become a challenging job in recent research. In addition, the adversaries are also moving from one location to another to explore its specific chores around the network. Thus, to provide flexible security, we propose a secure routing and monitoring protocol with multi-variant tuples using Two-Fish (TF) symmetric key approach to discover and prevent the adversaries in the global sensor network. The proposed approach is designed on the basis of the Authentication and Encryption Model (ATE). Using Eligibility Weight Function (EWF), the sensor guard nodes are selected and it is hidden with the help of complex symmetric key approach. A secure hybrid routing protocol is chosen to be built by inheriting the properties of both Multipath Optimized Link State Routing (OLSR) and Ad hoc On-Demand Multipath Distance Vector (AOMDV) protocols. The result of the proposed approach is shown that it has a high percentage of monitoring nodes in comparison with the existing routing schemes. Moreover, the proposed routing mechanism is resilient to multiple mobile adversaries; and hence it ensures multipath delivery.

Trust-based security routing mechanism in mobile social networks

Malicious and selfish behaviors represent a serious security threat against routing in mobile social networks (MSN). Due to MSN’s unique network characteristics, such as sociability, mobility and diversity, it is a challenge to design a misbehavior detection scheme in MSN. To improve the security in MSN routing, a trust-based security routing mechanism is presented in this paper, i.e., a malicious behavior detection mechanism with identity verification scheme. The main idea is to introduce the behavior trust and the identity trust to guide the routing. Firstly, we judge a node’s behavior based on both comprehensive trust and social relationship strength. And then, we forward messages according to the different measurement within and outside the friend groups. We also propose a distributed key management scheme which can issue, verify or revoke certificates based on the evaluation of the social relationship strength. We further improve the efficiency of the proposed mechanism by verifying the identity trust of the node. The simulation results indicate that the proposed routing mechanism can lower the impact of malicious behavior of nodes effectively and it has greater security performance than some classical routing algorithms do.

SDN Based End-to-End Inter-Domain Routing Mechanism for Mobility Management and Its Evaluation.

Nowadays, due to the widespread usage of mobile devices and wireless network technologies, we can use various ICT services almost anytime, anywhere even if we are changing our location at that moment. Therefore, mobility management technology have been attracting attention. This technology is to keep communication alive even when a mobile node (MN), which is communicating with the server or some nodes, moves to another network domain. Software Defined Networking (SDN) is used for mobility management to realize effective intra-domain routing that optimizes routes when an MN moves inside an SDN domain. However, many of the approaches mainly focus on intra-domain routing and it is difficult to optimize inter-domain route. In this paper, we focus on this routing optimization problem and propose an SDN based end-to-end routing mechanism specified for mobility management. The proposed routing mechanism can optimize an end-to-end route based on various parameters such as bandwidth, number of domains, and flow operations for mobility after an MN has moved across SDN domains. We carried out some simulational experimentations to evaluate the effect of proposal. It is shown that the proposed routing mechanism can reduce communication delay and enhance network performance. Thus, the proposed routing mechanism can realize effective ICT services.

Research on Energy Sensing Based Fault-Tolerant Distributed Routing Mechanism for Wireless Sensor Network

For the serious impact of network fault caused by the uneven energy consumption of sensor nodes, hardware failure, and attacker intrusion on data transmission, an energy sensing-based fault-tolerant distributed routing (ESFDR) mechanism for a wireless sensor network is proposed in this paper. ESFDR is composed of three interrelated algorithms, namely the distributed energy sensing clustering algorithm for the cluster head selection in the wireless sensor network, the route selection routing algorithm (DRSA) which helps the cluster head to obtain $k$ -disjoint routes to the base station, and the novel routing maintenance strategy for route restoration. The efficient transmission of data can be achieved by the combination of these three algorithms. Performance analysis and simulation results show that the proposed routing mechanism can improve the QoS of the wireless sensor network and reduce the impact of network fault effectively.

Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable routing in ad hoc networks.

Braided Routing Technique to Balance Traffic Load in Wireless Sensor Networks

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

A two-hop based adaptive routing protocol for real-time wireless sensor networks.

One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

QoS-Aware Routing Mechanism in OpenFlow-Enabled Wireless Multimedia Sensor Networks

Applications supporting various multimedia data in wireless multimedia sensor networks (WMSNs) have specific QoS requirements on bandwidth, delay, and/or packet loss. Perception of applications' QoS requirements and detection of link states are indispensable for the design of QoS-aware routing mechanism. Software defined networking (SDN) is suitable for the purpose since it provides visibility of network resources and programmable interfaces. OpenFlow is the most recognized realization of SDN. We propose a QoS-aware routing mechanism for OpenFlow-enabled WMSNs. The mechanism consists of a framework and routing algorithms on SDN controller. The framework includes two functions: detection of link states among OpenFlow-enabled nodes and determination of flow's QoS requirements. The routing algorithms are achieved in two steps. First, the SDN controller seeks the feasible paths that satisfy QoS requirements of a flow. If there is no path which satisfies the required QoS, the path will be decided by the proposed algorithms depending on flow types: delay-sensitive, bandwidth-sensitive, and best-effort traffic. We conducted experiments on a SDN testbed to evaluate our mechanism and compared the results with conventional routing protocols. The results show that proposed routing mechanism increases the throughput by 43% for video data and reduces the delay by more than 30% for audio data.

An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks

In a multihop wireless network, such as a wireless sensor network (WSN), with nodes being aware of their locations, the geographic routing scheme is an effective way of delivering packets to their destinations because of its 1-hop beacon broadcasting based routing related information exchange operation. The routing information obtained via 1-hop beaconing is local in the sense that it is just 1-hop compared to the multihop end-to-end routing. Hence, at some point, packets may experience no more place to be forwarded to (i.e., dead-ends). In this paper, we propose a geographical routing mechanism adopting the concept of the azimuth to reduce the possibility of packets confronting dead-ends. In other words, the node with a packet to be forwarded to the final destination figures out the next-hop node by utilizing the azimuth of the destination as a routing metric. Besides, we propose additional routing metrics for stable next-hop node selection to provide reliable IP connectivity. In order to validate the performance of the proposed routing mechanism, we evaluate its performance through the NS-2 based simulations and show that our mechanism outperforms the other schemes in terms of the packet delivery success rate, the end-to-end delay, and the number of dead-end encounters.

Minimum cost load balanced multipath routing protocol for low power and lossy networks

Conventional shortest path routing mechanisms in low power and lossy networks (LLNs) impose excessive traffic load on some nodes and cause their early battery depletion. Load balancing via multipath routing is a promising solution to increase lifetime. This idea is practised by some algorithms, mostly through limited number of disjoint paths, to reduce inter-path interference. In this paper a proactive multipath routing algorithm called MRPL is proposed, based on the recent standard routing protocol for LLNs. The algorithm tries to distribute the traffic load through a set of braided paths, with the objective of maximizing the network lifetime and minimizing total transmission cost. The traffic distribution mechanism is formulated by a linear program and a heuristic method is proposed to implement it in a distributed manner. Simulation results provide enough evidence for energy and cost efficiency of the proposed routing mechanism.

Efficient Routing in Heterogeneous SoC Designs with Small Implementation Overhead

In application-specific SoCs, the irregularity of the topology ends up in a complex and customized implementation of the routing algorithm, usually relying on routing tables implemented with memory structures at source end nodes. As system size increases, the routing tables also increase in size with nonnegligible impact on power, area, and latency overheads. In this paper, we present a routing implementation for application-specific SoCs able to implement in an efficient manner (with no routing tables and using a small logic block in every switch) a deadlock-free routing algorithm in these irregular networks. The mechanism relies on a tool that maps the initial irregular topology of the SoC system into a logical regular structure where the mechanism can be applied. We provide details for both the mapping tool and the proposed routing mechanism. Evaluation results show the effectiveness of the mapping tool as well as the low area and timing requirements of the mechanism. With the mapping tool and the routing mechanism, complex irregular SoC topologies can now be supported without the need for routing tables.

An Energy-aware Routing Mechanism for Latency-sensitive Traffics

With the rapid development of Internet technology and enhanced QoS requirements, network energy consumption has attracted more and more attentions due to the overprovision of network resources. Generally, energy saving can be achieved by sacrificed some performance. However, many popular applications require real-time or soft real-time QoS performance for attracting potential users, and existing technologies can hardly obtain satisfying tradeoffs between energy consumption and performance. In this paper, a novel energy-aware routing mechanism is presented with aiming at reducing the network energy consumption and maintaining satisfying QoS performance for these latency-sensitive applications. The proposed routing mechanism applies stochastic service model to calculate the latency-guarantee for any given network links. Based on such a quantitative latencyguarantee, we further propose a technique to decide whether a link should be powered down and how long it should be kept in power saving mode. Extensive experiments are conducted to evaluate the effectiveness of the proposed mechanism, and the results indicate that it can provide better QoS performance for those latency-sensitive traffics with improved energyefficiency.

Adaptive forwarding using network coding in vector-based wireless sensor networks

Network Coding NC has been applied in Wireless Sensor Networks WSNs where major improvements have been achieved. In this paper, we propose a network coding routing mechanism in WSNs that is based on Vector-Based Forwarding VBF. The goal of the proposed routing mechanism is to decrease the total number of transmissions needed to deliver data to the destination. Decreasing the total number of transmissions is achieved by varying the number of transmissions performed by each sensor node in a particular way that does not sacrifice the reliability of data delivery. Decreasing the number of transmissions decreases the traffic forwarded in the process of delivering data and enhances power savings which prolong the lifetime of the WSN. Simulation results show major improvements achieved by the proposed routing mechanism.

A highly reliable multi-path routing scheme for ad hoc wireless networks

This paper presents a new routing scheme for ad hoc wireless networks that provides fresh routing information along active routes with affordable cost. The proposed routing mechanism, called proactive route maintenance (PRM), is used to replace the naive route mechanism in existing reactive (on-demand) routing protocols to enhance route reliability and reduce the frequency of expensive route discoveries. The assumption behind PRM is the communication locality in ad hoc wireless networks. That is, most data packets are transported along a few active routes. Data packets are forwarded via multiple optimal paths to meet certain QoS requirements, such as fault tolerance and load balance. Routing information is disseminated along active routes and advertised only by active nodes that forward data packets. Alternative paths are dynamically discovered and maintained by active nodes and their 1-hop neighbors (called passive nodes). The routing overhead in passive nodes is light. PRM maintains reliable end-to-end connections even in dynamic networks with relatively low overhead, and has desirable properties including high delivery ratio, low latency, fair load distribution, self-healing and self-optimization.