Showing papers on "Multipath routing published in 2019"
TL;DR: This paper model the problem as a multiconstrained optimal path problem and proposes a distributed learning automaton (DLA) based algorithm to preserve it, which has a better performance than current state-of-the-art competitive algorithms in terms of end-to-end delay and energy-efficiency.
Abstract: Quality of service (QoS) routing is one of the critical challenges in wireless sensor networks (WSNs), especially for surveillance systems. Multihop data transmission of WSNs, due to the high packet loss and energy-efficiency, requires reliable links for end-to-end data delivery. Current multipath routing works can provision QoS requirements like end-to-end reliability and delay, but suffer from a significant energy cost. To improve the efficiency of the network with multiconstraints QoS parameters, in this paper we model the problem as a multiconstrained optimal path problem and propose a distributed learning automaton (DLA) based algorithm to preserve it. The proposed approach leverages the advantage of DLA to find the smallest number of nodes to preserve the desired QoS requirements. It takes several QoS routing constraints like end-to-end reliability and delay into account in path selection. We simulate the proposed algorithm, and the obtained results verify the effectiveness of our solution. The results demonstrate that our algorithm has a better performance than current state-of-the-art competitive algorithms in terms of end-to-end delay and energy-efficiency.
129 citations
TL;DR: This paper proposes source-based and destination-based multipath cooperative routing algorithms, which deliver different parts of a data flow along multiple link-disjoint paths dynamically and cooperatively, and designs an efficient No-Stop-Wait ACK mechanism for the NCMCR protocol to accelerate the data transmission.
Abstract: Multipath routing can significantly improve the network throughput and end-to-end (e2e) delay. Network coding based multipath routing removes the complicated coordination among multiple paths so that it further enhances data transmission efficiency. Traditional network coding based multipath routing protocols, however, are inefficient for Low Earth Orbit (LEO) satellite networks with the long link delay and regular network topology . Considering these characteristics, in this paper, we first formulate the multipath cooperative routing problem, then propose a Network Coding based Multipath Cooperative Routing (NCMCR) protocol for LEO satellite networks to improve the throughput. We propose source-based and destination-based multipath cooperative routing algorithms, which deliver different parts of a data flow along multiple link-disjoint paths dynamically and cooperatively. Furthermore, we design an efficient No-Stop-Wait ACK mechanism for our NCMCR protocol to accelerate the data transmission, where a source node continuously sends subsequent batches before it receives ACK messages for the batches sent previously. Under the proposed acknowledgement mechanism, we theoretically analyze the number of coded packets that should be sent and the transmission times of each batch for successfully decoding a batch. NS2-based simulation results demonstrate that our NCMCR outperforms the most related protocols.
91 citations
TL;DR: A distributed joint source, routing, and channel selection scheme that can effectively improve the network aggregate throughput, as well as reduce delay and packet loss probability.
Abstract: A node can provide a file to other nodes after downloading the file or data from the Internet. When more than one node have obtained the same file, this is considered a multisource transmission, in which all these nodes can act as candidate providers (sources) and transmit the file to a new request node (destination) together. In cases where there is negligible or no interference, multisource transmission can improve the download throughput because of parallel transmissions through multiple paths. However, this improvement is not guaranteed due to wireless interference among different paths. Wireless interference can be alleviated by the multiradio and multichannel technique. Because the source and multipath routing selections interact with channel assignment, the multisource transmission problem with multiradio and multichannel presents a significant challenge. In this paper, we propose a distributed joint source, routing, and channel selection scheme. The source selection issue can be concurrently solved via multipath finding. There are three sub-algorithms in our scheme, namely, interference-aware routing algorithm, channel assignment algorithm, and local routing adjustment algorithm. The interference-aware routing algorithm is used to find paths sequentially and is jointly executed with the channel assignment algorithm. After finding a new path, the local routing adjustment algorithm may be executed to locally adjust the selected paths so as to further reduce wireless interference. Extensive simulations have been conducted to demonstrate that our algorithms can effectively improve the network aggregate throughput, as well as reduce delay and packet loss probability.
51 citations
TL;DR: This paper reviews recent research efforts on energy-efficient and QoS-aware communication protocols, including MAC protocols, with a focus on their prioritization and service differentiation mechanisms and disjoint multipath routing protocols.
Abstract: In recent years, wireless multimedia sensor networks (WMSNs) have emerged as a prominent technique for delivering multimedia information such as still images and videos. Being under the great spotlight of research communities, however, multimedia delivery over resource- constraint WMSNs poses great challenges, especially in terms of energy efficiency and quality-of-service (QoS) guarantees. In this paper, recent developments in techniques for designing highly energy-efficient and QoS-capable WMSNs are surveyed. We first study the unique characteristics and the relevantly imposed requirements of WMSNs. For each requirement we also summarize their existing solutions. Then we review recent research efforts on energy-efficient and QoS-aware communication protocols, including MAC protocols, with a focus on their prioritization and service differentiation mechanisms and disjoint multipath routing protocols.
49 citations
TL;DR: A new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs and increases the throughput, energy efficiency, link quality and scalability, and reduces the delay and energy consumption.
Abstract: In wireless sensor networks (WSN), the nodes are used to collect and gather the data from different environments. Hence, the network consumes more energy which is the main and challenging issue in WSNs. Since the sensor is operating under battery, recharging is impossible and hence the lifetime of each sensor is an important issue. Therefore, it is necessary to introduce new and efficient techniques to extend the network lifetime. In this paper, a new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs. This approach introduces a delay constraint based reliable routing approach which reduces the energy consumption by constructing efficient clusters without increasing the end-to-end delay. Moreover, the proposed technique called the rule based clustering for routing model provides better performance in terms of network lifetime than the other existing techniques since they consume more energy during the formation of clusters and finding the shortest path. Moreover, additional overhead on the cluster head selection is tackled also using rules in this proposed model in an efficient manner by building balanced clusters. The main advantage of the proposed approach is that it extends the lifetime of the network and increases the throughput, energy efficiency, link quality and scalability. The experimental verification of this technique has been carried out using MATLAB simulations and proved that this model increases the packet delivery rate, network performance and reduces the delay and energy consumption.
44 citations
TL;DR: The evidence from experiments suggest that the proposed energy efficient cluster-based routing protocol method (called MLSEEP) gives better results than the existing protocols by the supplement of those techniques.
Abstract: In this paper, we propose a new power-aware routing protocol for Wireless Sensor Network (WSN) based on the threshold rate and fuzzy logic for improving energy efficiency. The cluster heads are elected based on the probability values of every node in WSN, which are calculated from the remaining energy of every node. Cumulative remaining node energy is used to calculate mean energy of the whole network of the current phase. The nodes with high probability will have more chances to be selected as the cluster head, which gathers packets from the cluster member via single hop communication. The cluster head forwards the gathered data to sink by using fuzzy control with multi-hop communication. Fuzzy control takes three parameters namely queue length of a node, the distance of a node from the base station, and the remaining energy of node. The evidence from experiments suggest that the proposed energy efficient cluster-based routing protocol method (called MLSEEP) gives better results than the existing protocols by the supplement of those techniques.
44 citations
TL;DR: A novel routing algorithm for wireless sensor network, which achieves uniform energy depletion across all the nodes and thus leading to prolonged network lifetime and compared with various sensor network routing protocols, it is found that the proposed algorithm outperformed them in network lifetime, energy consumption and coverage ratio.
Abstract: In this article, we propose a novel routing algorithm for wireless sensor network, which achieves uniform energy depletion across all the nodes and thus leading to prolonged network lifetime. The proposed algorithm, divides the Region of Interest into virtual zones, each having some designated cluster head nodes. In the entire process, a node can either be a part of a cluster or it may remain as an independent entity. A non-cluster member transmits its data to next hop node using IRP-Intelligent Routing Process (based on the trade-off between the residual energy of itself as well as its neighbor, and the required energy to transmit packets to its neighbor). If on the transmission path, some cluster member is elected as a next hop, it rejects IRP and transmits the packets to cluster head, which later forwards them to sink (adopting multihop communication among cluster heads). Routing is not solely performed using clusters, rather they aid the overall routing process, hence this protocol is named as Cluster Aided Multipath Routing (CAMP). CAMP has been compared with various sensor network routing protocols, viz., LEACH, PEGASIS, DIRECT TRANSMISSION, CEED, and CBMR. It is found that the proposed algorithm outperformed them in network lifetime, energy consumption and coverage ratio.
43 citations
TL;DR: This work proposes a routing algorithm that combines dynamic cluster formation, cluster head selection, and multipath routing formation for data communication to reduce energy consumption as well as routing overheads and shows that the proposed algorithm outperformed the three other routing protocols.
Abstract: Wireless multimedia sensor networks (WMSNs) are capable of collecting multimedia events, such as traffic accidents and wildlife tracking, as well as scalar data. As a result, WMSNs are receiving a great deal of attention both from industry and academic communities. However, multimedia applications tend to generate high volume network traffic, which results in very high energy consumption. As energy is a prime resource in WMSN, an efficient routing algorithm that effectively deals with the dynamic topology of WMSN but also prolongs the lifetime of WMSN is required. To this end, we propose a routing algorithm that combines dynamic cluster formation, cluster head selection, and multipath routing formation for data communication to reduce energy consumption as well as routing overheads. The proposed algorithm uses a genetic algorithm (GA)-based meta-heuristic optimization to dynamically select the best path based on the cost function with the minimum distance and the least energy dissipation. We carried out an extensive performance analysis of the proposed algorithm and compared it with three other routing protocols. The results of the performance analysis showed that the proposed algorithm outperformed the three other routing protocols.
39 citations
TL;DR: Overall, the acquired results indicate that the proposed MRLAM routing scheme significantly improves the overall performance of the network.
Abstract: To facilitate connectivity to the internet, the easiest way to establish communication infrastructure in areas affected by natural disaster and in remote locations with intermittent cellular services and/or lack of Wi-Fi coverage is to deploy an end-to-end connection over Mobile Ad-hoc Networks (MANETs). However, the potentials of MANETs are yet to be fully realized as existing MANETs routing protocols still suffer some major technical drawback in the areas of mobility, link quality, and battery constraint of mobile nodes between the overlay connections. To address these problems, a routing scheme named Mobility, Residual energy and Link quality Aware Multipath (MRLAM) is proposed for routing in MANETs. The proposed scheme makes routing decisions by determining the optimal route with energy efficient nodes to maintain the stability, reliability, and lifetime of the network over a sustained period of time. The MRLAM scheme uses a Q-Learning algorithm for the selection of optimal intermediate nodes based on the available status of energy level, mobility, and link quality parameters, and then provides positive and negative reward values accordingly. The proposed routing scheme reduces energy cost by 33% and 23%, end to end delay by 15% and 10%, packet loss ratio by 30.76% and 24.59%, and convergence time by 16.49% and 11.34% approximately, compared with other well-known routing schemes such as Multipath Optimized Link State Routing protocol (MP-OLSR) and MP-OLSRv2, respectively. Overall, the acquired results indicate that the proposed MRLAM routing scheme significantly improves the overall performance of the network.
37 citations
TL;DR: An attempt was made to propose a more stable and more reliable in multi-path quality of service multicast routing protocol (SR-MQMR) for mobile ad-hoc networks and the production of stable routes led to a significant enhancement of reliability.
Abstract: Recently, the use of real-time multimedia applications has attracted the attention of mobile ad hoc network users. These applications support service quality. The characteristics of mobile ad hoc networks such as lack of central coordinator, mobility of hosts, dynamic changes in network topology and the limitation of access to resources have caused remarkable challenges in providing high quality services for mobile ad hoc networks. Bandwidth limitation of wireless nodes and the lack of adequate multicast trees are regarded as the main challenges for quality of service-based multicast routing. In this paper, an attempt was made to propose a more stable and more reliable in multi-path quality of service multicast routing protocol (SR-MQMR) for mobile ad-hoc networks. In the proposed method, considering the requested bandwidth, the researchers first used the signal strength of nodes to select the most stable nodes. Then, using the two parameters of route expiration time and the number of hops, we selected a route which had low delay and high stability. The results of simulations conducted in the present study indicated that the SR-MQMR protocol used less time slots than the MQMR protocol in the routing process which resulted in an increase in success ratio. Furthermore, the production of stable routes led to a significant enhancement of reliability. Since the reduction of route request packet exchange decreased overhead in the proposed method, the degree of consumed bandwidth decreased which led to an increase in network lifetime.
36 citations
TL;DR: The particle swarm optimization based on available bandwidth and link quality based on mobility prediction algorithm is used to provide the multipath routing in MANET and is able to attain a significant progress in the packet delivery ratio, path optimality, and end-to-end delay.
Abstract: In mobile ad hoc network (MANET), optimal path identification is the main problem for implementing the Multipath routing technique MANET desires an efficient algorithm for improving the performance of the network by improving the connectivity of network organization MANET routing protocol will consider so many parameters like extended power, the superiority of wireless associations, path failures, desertion, obstruction, and topological adjusts are generated for the discovery of optimal path for increasing the original routing algorithms Further advancement in multipath routing algorithm proposal will be based on local rerouting called particle swarm optimization-based bandwidth and link availability prediction algorithm for multipath routing and to ensure forwarding continuity with compound link failures In the route discovery phase, each node establishes a link between their neighboring nodes If there is any route failure resulting in data loss and overhead will occur Hence routing in MANET is developed by the movement of a node (mobility) In this paper, the particle swarm optimization based on available bandwidth and link quality based on mobility prediction algorithm is used to provide the multipath routing in MANET In this prediction phase, the available bandwidth, link quality, and mobility parameters are used to select the node based on their fuzzy logic The selected node will broadcast information among all the nodes and details are verified before transmission In the case of link failure, the nodes are stored into a blacklisted link Furthermore, the routes are diverted and backward to find a good link as a forwarder or intermediate node The proposed scheme is able to attain a significant progress in the packet delivery ratio, path optimality, and end-to-end delay
TL;DR: This paper aims to provide the possible way for fastest communication without any delay by prioritizing the medical application data from normal data in the network using SDN, and proposes a multipath routing that gives QoS ensures to be implemented in the SDN-enabled OpenStack environment using the OpenContrail controller.
TL;DR: This work considers a mechanism design problem for the joint flow control and multipath routing in informationally decentralized networks with strategic agents and proposes an incentive mechanism that strongly implements the social-welfare maximizing outcome in Nash equilibria.
Abstract: We consider a mechanism design problem for the joint flow control and multipath routing in informationally decentralized networks with strategic agents. Based on a surrogate optimization approach, we propose an incentive mechanism that strongly implements the social-welfare maximizing outcome in Nash equilibria. This mechanism possesses several other desirable properties, including individual rationality and budget balance at equilibrium. More importantly, in contrast to the existing literature on the network resource allocation mechanisms, the proposed mechanism is dynamically stable, meaning that the Nash equilibrium (NE) of the game induced by the mechanism can be learned by the agents in a decentralized manner. To establish dynamic stability, we propose a decentralized iterative process that always converges to a NE of the game induced by the mechanism, provided that all strategic agents follow the process. To the best of our knowledge, this is the first incentive mechanism that simultaneously possesses all the above-mentioned properties.
TL;DR: A bio-inspired particle multi-swarm optimization (PMSO) routing algorithm to construct, recover and select k -disjoint paths that tolerates the failure while satisfying quality of service (QoS) parameters is proposed.
TL;DR: This paper presents a survey of the literature on security problems relating to D2D communications in mobile 5G networks, and describes results of a simulation that tests three path selection techniques inspired by the literature.
Abstract: Through direct communication, device-to-device (D2D) technology can increase the overall throughput, enhance the coverage, and reduce the power consumption of cellular communications. Security will be of paramount importance in 5G, because 5G devices will directly affect our safety, such as by steering self-driving vehicles and controlling health care applications. 5G will be supporting millions of existing devices without adequate built-in security, as well as new devices whose extreme computing power will make them attractive targets for hackers.This paper presents a survey of the literature on security problems relating to D2D communications in mobile 5G networks. Issues include eavesdropping, jamming, primary user emulation attack, and injecting attack. Because multipath routing emerges as a strategy that can help combat many security problems, particularly eavesdropping, the paper contains an extensive discussion of the security implications of multipath routing. Finally, the paper describes results of a simulation that tests three path selection techniques inspired by the literature. The simulation reveals that routing information through interference disjoint paths most effectively inhibits eavesdropping.
TL;DR: Six new algorithms are introduced to resolve the fragmentation problem and improve blocking probability in EON by reducing Blocking Probability by controlling fragmentation in each path since they try different ways in order to assign spectrum for a given connection request.
TL;DR: A novel DIFFERENtiated sChEduling (DIFFERENCE) approach that dynamically sets up paths for elephant and mice flows separately, based on current link workload, which outperforms related proposals in terms of various system performance.
Abstract: In Software defined networking (SDN) based datacenters, flow-level management seriously limits system scalability due to large amount of control messages between data and control planes; and mice flows often are blocked by elephant flows because of the indiscriminate flow scheduling. To improve management efficiency and system performance, it is prerequisite to schedule elephant and mice flows respectively. Unfortunately, existing flow scheduling approaches in SDN consider only elephant flows. In this paper, we firstly propose an efficient flow detection mechanism. Then, we propose a novel DIFFERENtiated sChEduling (DIFFERENCE) approach that dynamically sets up paths for elephant and mice flows separately, based on current link workload. Our DIFFERENCE schedules mice flows with proactively installed weighted multipath routing algorithm and adjusts path weight according to link utilization. Instead, we propose a blocking island based path setup algorithm for elephant flows, which find the least congested path with shorter searching space. To balance traffic in a SDN networks, we design an algorithm to dynamically reschedule data flows in terms of current link utilization ratio. Experiment results on real public datacenter traces demonstrate that our approach outperforms related proposals in terms of various system performance.
TL;DR: A new deadlock-free adaptive fault-tolerant routing algorithm based on a new two-layer safety information model, is proposed by mapping routers in a group, and groups of the dragonfly network into two separate hypercubes that tolerates static and dynamic faults.
Abstract: Dragonfly networks have been widely used in the current high-performance computers or high-end servers. Fault-tolerant routing in dragonfly networks is essential. The rich interconnects provide good fault-tolerance ability for the network. A new deadlock-free adaptive fault-tolerant routing algorithm based on a new two-layer safety information model, is proposed by mapping routers in a group, and groups of the dragonfly network into two separate hypercubes. The new fault-tolerant routing algorithm tolerates static and dynamic faults. Our method can determine whether a packet can reach the destination at the source by using the new safety information model, which avoids dead-ends and aimless misrouting. Sufficient simulation results show that the proposed fault-tolerant routing algorithm even outperforms the previous minimal routing algorithm in fault-free networks in many cases.
TL;DR: The assessment of efficiency for the approach to construction of online decision-making systems demonstrates its benefits in comparison with the known probabilistic methods of decision- making in telecommunication networks.
Abstract: The paper considers a new approach to online decision-making in telecommunication systems based on applying hierarchical fuzzy situational networks. This approach allows one to make efficient decisions in the conditions of dynamically changing external factors. Mathematical foundations for creation and application of hierarchical fuzzy situational networks to implement the fuzzy logical inference in telecommunication networks are presented. As a case study for implementation of the offered methods the problem of alternative multipath routing is analyzed. The architecture of the online decision-making system, based on hierarchical fuzzy situational networks and oriented on its multi-agent implementation, is considered. The generalized online decision-making system functioning algorithm is developed. The architecture of an intelligent agent of the online decision-making system is shown. The assessment of efficiency for the approach to construction of online decision-making systems demonstrates its benefits in comparison with the known probabilistic methods of decision-making in telecommunication networks. It also proves a possibility of functioning of the offered online decision-making system in a real or near real mode.
TL;DR: A joined space-temporal routing algorithmic framework for disruption-tolerant-networking-based earth-observing satellite networks, where the time-varying topology is modeled as a space–time graph leveraging the predictability of satellites’ relative motions is proposed.
Abstract: In this paper, we consider the problem of routing in disruption-tolerant-networking-based earth-observing satellite networks, which are characterized by a frequently changing topology and potentially sparse and intermittent connectivity. To handle the routing challenges posed by these properties, we propose a joined space-temporal routing algorithmic framework for those networks, where the time-varying topology is modeled as a space–time graph leveraging the predictability of satellites’ relative motions. Based on this graph model, we devise a multipath routing algorithm [minimum-cost constrained multipath (MCMP)] to find a feasible set of available routing paths, through which a certain amount of mission data can be transferred back to ground stations within a tolerable delay with a minimum cost. To comparatively evaluate the performance of MCMP, moreover, we design an earliest arrival multipath routing policy (EAMP) algorithm based on the typical contact graph routing algorithm. The performance comparisons among MCMP, EAMP, and direct transfer strategy are simulated and analyzed.
TL;DR: A new link-disjoint multipath routing method is proposed to solve the optimization problem in the real-time network environment of MANETs and results proved that the proposed method performs well in the dynamic network environment.
Abstract: Mobile Ad-hoc Networks (MANETs) is the network of wireless mobile nodes with self-organizing, dynamic network connectivity without any pre-defined infrastructure for wireless communication. Error-less data broadcasting is the major role in MANET transmission. With the salient feature of dynamic topology and the distributed infrastructure, multipath routing is of great interests in MANETs. Multipath routing methods are dependable on adjacent nodes for finding the shortest path that several data packets are fallen to network traffic. Attention on the adjacent nodes can have the end-to-end delay while broadcasting the data packets into other nodes that finish up being fallen to congestion. It will also reduce network throughput and cause the network optimality problem. In this paper, we propose a new link-disjoint multipath routing method to solve the optimization problem in the real-time network environment. Hence, the proposed method is used to choose the shortest path from multiple paths in MANETs. Simulation results proved that the proposed method performs well in the dynamic network environment.
TL;DR: A novel network coding-based braided multipath routing called NC-BMR protocol, which integrates a data compression-based network coding method with the construction of hierarchical multiparent nodes (HMPNs) topology for the routing with coordinated data forwarding manner and a multipackets-based time scheduler strategy (MTSS).
Abstract: In wireless sensor networks (WSNs), energy efficiency can simultaneously guarantee robustness to link loss and node failure and is a key design goal of routing protocols because WSNs are strongly constrained in terms of transmission reliability, transmission delay, and energy consumption. Braided multipath routing has become a powerful tool for tolerating node failures and link losses, with high reliability and efficient data transmission rates. In this paper, we propose a novel network coding-based braided multipath routing called NC-BMR protocol. It integrates a data compression-based network coding method with the construction of hierarchical multiparent nodes (HMPNs) topology for the routing with coordinated data forwarding manner and a multipackets-based time scheduler strategy (MTSS). Its perfect transmission efficiency is achieved by only attaching a little control information with data packets. We validated NC-BMR based on the TOSSIM platform and compared it to several previous methods. Theoretical analysis and simulation results demonstrate its performance improvement in terms of the transmission reliability, delay, and overhead.
01 Apr 2019
TL;DR: This paper presents a multipath routing strategy that takes full advantage of a hybrid SDN/OpenFlow and P4 architecture, and analyzes different strategies for choosing the routes that provide the best results based on RTT values received from the switches.
Abstract: Control plane programmability, primarily enabled by SDN/OpenFlow, has brought new impetus to already consolidated management and planning practices in the area of computer networks. However, applications that require high responsiveness and demand more dynamic mechanisms executing beyond the control plane can only be effectively exploited through interactions with the data plane, where decisions and reactive responses can be made at line rate. P4 achieves this goal by providing directives that allow a certain level of control over the hardware that performs packet forwarding tasks, bringing programmability to the data plane. In this paper, we present a multipath routing strategy that takes full advantage of a hybrid SDN/OpenFlow and P4 architecture. In the data plane, P4 and the Flowlet abstraction are used to actively perform load balancing and routing over multiple asymmetric paths, in addition to monitor active links. In the logically centralized control plane, the overall view of the network is leveraged to perform more elaborate passive tasks, which include mapping paths, configuring devices and updating routes asynchronously. Experimental evaluations are conducted in which we analyze different strategies for choosing the routes that provide the best results based on RTT values received from the switches.
TL;DR: A braided path routing structure, where each router has several possible next hops, which can cope with any fault along the path, while still providing a remaining operational path, and a scheduling algorithm, where multiple transmitters are attached to a single cell, to the same receiver.
03 Jun 2019
TL;DR: The possibilities of increasing the efficiency of redundant service requests by a sequence of nodes of a multilevel info-communication system are investigated and multi-path service of requests is shown.
Abstract: The possibilities of increasing the efficiency of redundant service requests by a sequence of nodes of a multilevel info-communication system are investigated. The efficiency of multi-path service of requests is shown, in which, with a sequential receipt of a request for each level, a given number of copies are formed with their distribution for servicing between redundant nodes of the corresponding level. A copy of the request made first is sent for back-up service to the next level of the system, the remaining copies are destroyed. The effectiveness of the proposed service organization is determined in comparison with the option in which the formation of copies takes place only until the request for the first level is received, and for each of them, the path is written as a sequence of nodes at different levels involved in the service.
01 Dec 2019
TL;DR: This paper proposes an algorithm for routing, spectrum and core allocation based on single/multipath routing for providing path protection that can decrease the blocking ratio by three orders of magnitude when compared with other existing algorithms.
Abstract: The adoption ofSpace division multiplexing (SDM) in elastic optical networks brings new challenges for spectrum allocation. This paper proposes an algorithm for routing, spectrum and core allocation based on single/multipath routing for providing path protection. The proposed solution has the advantage of using small contiguous bands divided into several paths to provide the request protected bandwidth, allowing the increase in the number of requests accepted. Results show that the proposed algorithm can decrease the blocking ratio by three orders of magnitude when compared with other existing algorithms.
TL;DR: This paper proposes Buffer Enabled Ad hoc On-demand Multipath Distance Vector algorithm, that generates the routing protocol with Bernoulli model and finds that the packet information minimizes the average end-to-end delay.
Abstract: The buffering in Mobile Ad hoc Networks (MANETs) will depend on end-to-end delay of every user’s information from the arrival time of the resource node which is waiting for the receiving time-span of the destination node Normally each base station will act as relay node or repeater for different mobile nodes as well as for different base stations Deployment of base station in the MANET is also a critical research Each base station contain large number of nodes which is connected based on peer-to- peer communications Dynamic queuing method is used to share the traffic load to various paths which are selected according to the least buffer size; that increases the packet delivery of the network Dynamic queuing method is used to reduce the overall waiting time of the packets in the network In this paper, we propose Buffer Enabled Ad hoc On-demand Multipath Distance Vector (BE-AOMDV) algorithm, that generates the routing protocol with Bernoulli model and find that the packet information minimizes the average end-to-end delay By using periodic updates on the buffer information of the nodes in the paths, the nodes can take dynamic decisions regarding the help of better routes in the data transmission which can lead to even better use of resources of the network Buffer Enable Multipath Routing is compared with other multipath routing techniques Furthermore, using perceptive simplifications, we find that the effect of buffers in networks increases the throughput although incongruously considering average end-to-end delay During widespread simulations, our simulation results proved that the network with the appearance of data stream circumstance improves using Bernoulli function and the proposed method has the increased throughput compared to other related methods
01 Sep 2019
TL;DR: This study proposes a novel routing scheme referred to as the energy-efficient multipath routing (E2MR) for UWSN, which is basically designed for long-term monitoring with higher energy efficiency and delivery ratio.
Abstract: Exploration of underwater resources, oceanographic data collection, tactical surveillance and natural disaster prevention are some of the areas of Underwater Wireless Sensor Network(UWSN) applications UWSN is different from traditional wireless sensor network The later uses radio waves for communication between sensors while the former uses acoustic waves for data transmission Communication through UWSN is more challenging because of the many challenges associated with acoustic channels such as low bandwidth, high transmission delay, usual path loss and intermittent connectivity In UWSN, some algorithms were introduced to enhance the lifetime of networks, by using a smaller battery and other for critical data transmission However, data packets flooding, path loss and low network lifetime are few challenges with immediate attention This study proposes a novel routing scheme referred to as the energy-efficient multipath routing (E2MR) for UWSN, which is basically designed for long-term monitoring with higher energy efficiency and delivery ratio The E2MR establishes a priority table, and the forward nodes are selected based on that priority table Different experiments are carried out by simulating E2MR and compared with Depth-Based Routing (DBR), EEDBR and H2-DAB with respect to the number of live nodes, end-to-end delay, packet delivery ratio and total energy consumption
TL;DR: The design of cross-layer multipath routing (CLMR) scheme is proposed in order to ensure QoS and minimize energy consumption and the simulation results show that the CLMR has a significant improvement in performance as compared to other similar existing protocols.
Abstract: Multimedia transmission in wireless multimedia sensor network requires restricted quality of services (QoS) conditions Where the resource-constrained nature of wireless multimedia sensor network (WMSNs) adds more challenges Such a situation demands a routing strategy that can ensure QoS transmission and exploit the resources efficiently At present, the single-path routing techniques cannot guarantee the end to end QoS requirements of video transmission causing the video quality degradation Besides, the traditional network layers stack is not suitable for dynamic wireless sensor network environment, where important information is required from nonadjacent layers to enhance the routing decision This paper proposes the design of cross-layer multipath routing (CLMR) scheme in order to ensure QoS and minimize energy consumption CLMR is designed to determine the suitable multipath and to send the multimedia packets according to their importance The cross-layer design between application, network and physical layers is adapted to obtain optimal routing decision The simulation results show that the CLMR has a significant improvement in performance as compared to other similar existing protocols, where the obtained average delay with high delivery is less than 150 ms, while the energy consumption is reduced, and the PSNR values for the tested clips are more than 30 db