Single-path Routing Research Articles

Investigation of an improved tensor routing model in the telecommunications network represented in the basis of interpolar paths and internal node pairs

An improved tensor model of a telecommunication network (TCN) was selected for the study. The model is presented in terms of inter-polar paths and internal node pairs. The advantage of this model is the use of quality of service conditions in terms of bandwidth, average end-to-end delay, and packet loss probability. Within the framework of the chosen model, the technological routing problem is formulated in an optimization form together with the conditions and constraints imposed on routing variables. A system of criteria for optimality of routing solutions, which can be used to calculate optimal values for routing variables, is proposed. These criteria depending on the specifics of the routing problem focus on the optimal use of the available network resource and/or on the differentiated improvement of Quality of Service (QoS) indicators of network performance, to the numerical values of which one or another packet flow is sensitive. The analysis of the influence to the optimality criterion form on the nature of solutions to QoS-routing problems using the proposed tensor model of a telecommunications network is carried out. On a set of numerical examples, the improved tensor model of TCN both at the level of the proposed QoS-conditions and the considered QoS-optimality criteria confirmed its adequacy in solving the problems of a single path and multipath routing. The improved tensor model of TCN provided an adaptive response to changes in network load and the type of optimality criterion for routing solutions in terms of ensuring the required values of QoS-indicators – bandwidth, average end-to-end delay, and packet loss probability.

SmartDR:A device-to-device communication for post-disaster recovery

Natural disasters, such as earthquakes, can cause severe destruction and create havoc in the society. Buildings and other structures may collapse during disaster incidents causing injuries and deaths to victims trapped under debris and rubble. Immediately after a natural disaster incident, it becomes extremely difficult for first responders and rescuers to find and save trapped victims. Often searches are carried out blindly in random locations, which delay the rescue of the victims. This paper introduces a Smartphone Assisted Disaster Recovery (SmartDR) method for post-disaster communication using Smartphones. SmartDR utilizes the device-to-device (D2D) communication technology in Fifth Generation (5G) networks, which enables direct communication between proximate devices without the need of relaying through a network infrastructure, such as mobile access points or mobile base stations. We examine a scenario of multi-hop D2D communication where smartphones carried by trapped victims and other people in disaster affected areas can self-detect the occurrence of a disaster incident by monitoring the radio environment and then can self-switch to a disaster mode to transmit emergency help messages with their location coordinates to other nearby smartphones. To locate other nearby smartphones also operating in the disaster mode and in the same channel, each smartphone runs a rendezvous process. The emergency messages are thus relayed to the functional base station or rescue centre. To facilitate routing of the emergency messages, we propose a path selection algorithm, which considers both delay and the leftover energy of a device (a smartphone in this case). Thus, the SmartDR method includes: (i) a multi-channel channel hopping rendezvous protocol to improve the victim localization or neighbour discovery, and (ii) an energy-aware multi-path routing (Energy-aware ad-hoc on-demand distance vector or E-AODV) protocol to overcome the higher energy depletion rate at devices associated with single shortest path routing. The SmartDR method can guide search and rescue operations and increase the possibility of saving lives immediately aftermath a disaster incident. A simulation-based performance study is conducted to evaluate the protocol performance in post-disaster scenario. Simulation results show that a significant performance gain is achievable when a device utilizes the channel information for the rendezvous process and the leftover energy for routing path selection. Our results show that peer discovery in multi-channel D2D environment can be significantly improved when channel quality information is considered in CH sequence design. Moreover, selecting a routing path based on LoE of a device and the standard deviation of residual energy of a path, can not only enhance the network lifetime, but also reduce the chance of network being partitioned.

ОПТИМІЗАЦІЙНА МОДЕЛЬ МАРШРУТИЗАЦІЇ ЧУТЛИВОГО ДО ЗАТРИМОК ТРАФІКА В ІНФОКОМУНІКАЦІЙНИХ МЕРЕЖАХ

У роботі запропоновано вдосконалену оптимізаційну модель маршрутизації чутливого до затримок трафіка в інфокомунікаційних мережах. Новизною моделі є використання критерію оптимальності, що пов'язаний з мінімізацію середньої міжкінцевої затримки пакетів. В основу зазначеного критерію оптимальності покладено математичний вираз, який дозволяє аналітично розрахувати середню міжкінцеву затримку з урахуванням характеристик мережного трафіка, типів дисциплін обслуговування пакетів на маршрутизаторах інфокомунікаційної мережі, пропускних здатностей каналів зв’язку. Також отримано умови забезпечення якості обслуговування за середньою міжкінцевою затримкою пакетів для будь-якого виду трафіка в умовах реалізації як одношляхової, так і багатошляхової маршрутизації. Отримати зазначені результати вдалося на підставі тензорного моделювання інфокомунікаційної мережі, коли тензори основних QoS-показників та метричні тензори розглядались у двох системах координат: гілок мережі та незалежних міжполюсних шляхів і внутрішніх вузлових пар. Дослідження та порівняльний аналіз з іншими маршрутними рішеннями підтвердили більш високу ефективність удосконаленої моделі за показником середньої міжкінцевої затримки пакетів, що є важливим для чутливого до затримок трафіка, особливо в умовах високих навантажень на інфокомунікаційну мережу

QoS optimization through PBMR algorithm in multipath wireless multimedia sensor networks

Recent research in communication moves towards cyber space with modern applications such as multimedia surveillance, smart autonomous traffic control, advanced health care monitoring, industrial automation, and continuous remote environmental and structural monitoring. Such applications are extensively generates multimedia information and converse through Wireless Multimedia Sensor Networks (WMSNs). Path selection plays vital role in transmitting the multimedia data over wireless networks. Single path selection incurs routing failure due to the energy hole because of power shortage and traffic congestion. Due to energy hole in any particular node the packet gets dropped in the route from source to destination. The multipath routing algorithm selects more than one path to increase the rate of the packet delivery than the single path routing. The prediction of energy deficiency in sensor nodes is becoming over head in WSMNs. In order to improve the packet delivery and performance of the network, in this paper a Priority Based Multipath Routing Algorithm (PBMRA) is proposed. It consists of three modules: The Neighbourhood Selection identifies the neighbours; Multipath Construction constructs multiple paths from the indentified neighbours; and Priority Selection selects the high energized routes based on the priority of node attributes such as liveliness, path delay and hop count. The proposed algorithm is experimentally compared with other existing algorithms such as AODV, DSR, DSDV and OLSR. The experimental results show that the PBMRA algorithm increases the overall throughput, packet received rate and provides the reliable route than existing algorithms.

SiMple: A Unified Single and Multi-Path Routing Algorithm for Wireless Sensor Networks With Source Location Privacy

Wireless Sensor Networks (WSNs) experience two different patterns of traffic with different requirements: 1) Event-driven traffic from sensor nodes to the base-station (BS) in the form of single-path uni-cast packets, and 2) Query-driven traffic from BS to sensors that better matches multi-casting and generates multi-path traffic. In this paper, we propose SiMple, a unified algorithm to jointly route single- and multi-path packets in WSNs. SiMple establishes a square destination area to control the degree of path multiplicity as well as the number of intermediate nodes between the source and destination nodes. When performing single-path routing, SiMple considers the direct line connecting source and destination nodes to select the closest sensor node to the line as the next carrier of the packet. Otherwise, SiMple directs packets towards the destination node(s) by exploiting multiple disjoint routes where the number of disjoint routes is controlled by the source node. In addition, SiMple introduces virtual source nodes to hide the location of the real source node, which is needed in asset monitoring applications. The conducted extensive NS-2 simulation experiments for mixed single- and multi-path packets confirm that SiMple results in a higher performance level and consumes lower energy when compared to the case of using two separate algorithms to individually route event and query packets.

Concurrent Multipath Routing Optimization in Named Data Networks

To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as a mixed-integer maximum concurrent flow problem. Taking advantage of the smart forwarding framework in NDN, we obtain an approximate optimal routing and forwarding solution with our improved Fleischer and random rounding (FRR) algorithm. We analyze the complexity of the Fleischer algorithm more comprehensively and give the best scaling method to achieve the least iterations. In addition, we further reduce the complexity of the Fleischer algorithm so that it iterates only once, thus getting a heuristic algorithm which is called multicommodity multipath (MCMP). Using ndnSIM-based simulation, we compare our proposed routing algorithms with the existing routing algorithms, including flooding, k-shortest path, and best single path routing, and the simulation results prove that FRR and MCMP can outperform other algorithms both in throughput and latency, and it can also be concluded that the best number of paths for k-shortest path routing should be close to and less than the average node degree of the network. For studying routing optimization with caching, we conduct simulations with different in-network cache capacity and different caching policies. The simulation results show that although the LRU can achieve the best performance under the same cache capacity, the cache capacity plays a decisive role. All routing algorithms produce better performance with caching, but the FRR still achieves the best performance, and follows by MCMP.

A Restricted Multipath Routing Algorithm in Wireless Sensor Networks Using a Virtual Cylinder: Bypassing Black hole and Selective Forwarding Attacks

In this paper, a simple and novel routing algorithm is presented to improve the packet delivery in harsh conditions such as selective forwarding and blackhole attacks to the wireless sensor networks. The proposed algorithm is based on restricted multi-path broadcast based on a virtual cylinder from the source node to the sink node. In this algorithm, when a packet is broadcast by a source node, a virtual cylinder with radius w is created from the source node to a sink node. All the nodes located in this virtual cylinder are allowed to forwardthe packet to the sink. Thus, data is forwarded to sink via multiple paths, but in a restricted manner so that the nodes do not consume a high amount of energy. If there are some compromised nodes in this virtual cylinder, the packets may be forwarded to the sink via other nodes of the virtual cylinder. The proposed algorithm is simulated and evaluated in terms of packet delivery rate and energy consumption. The experiment results show that the proposed algorithm increases packet delivery rate 7 times compared to the single-path routing method and reduces energy consumption up to three times compared to flooding routing method.

Energy-Effective Cooperative and Reliable Delivery Routing Protocols for Underwater Wireless Sensor Networks

Underwater deployed sensors nodes are energy-constrained. Therefore, energy efficiency becomes crucial in underwater wireless sensor networks (U-WSNs). The adverse channel corrupts the packets and challenges their reliability. To handle these challenges, two routing schemes are introduced in this paper. They are effective energy and reliable delivery (EERD) and cooperative effective energy and reliable delivery (CoEERD). In EERD, the packets follow single-path routing and the best forwarder node is selected using a weight function such that packets are transferred via the reliable paths with low energy usage. Packet transfer via a single route in EERD has, however, compromised reliability as the undersea links bear harshness and unpredictability. Therefore, the CoEERD scheme adds cooperative routing to EERD, in which a relay node is introduced between a source–destination pair. The destination requests the relay when the packets it gets from the source are corrupted beyond a threshold value. Selection of weight function is unique and considers many factors to ensure low energy usage with reliability while considering nodes for data transfer. This also helps in selecting a single relay node rather than many relays in the conventional cooperative routing model. Based on simulation results, the EERD and CoEERD protocols have improved performance in energy usage, reliable packet transfer and delay.

Multipath aware scheduling for high reliability and fault tolerance in low power industrial networks

The Industrial Internet of Things is expected to enable the Industry 4.0 through the large deployment of low-power devices. However, industrial applications require most of the time high reliability close to 100%, and low end-to-end delays. Thus, most industrial wireless networks rely on a strict schedule of the transmissions to avoid collisions, and implement frequency hopping to combat external interference. In multihop topologies, the network has to decide both when the transmissions have to be scheduled, and which router can forward the packets. To be fault-tolerant, multipath routing consists in exploiting several paths in parallel. We exploit here a braided path routing structure, where each router has several possible next hops. Thus, we can cope with any fault along the path, while still providing a remaining operational path. We propose also a scheduling algorithm, where multiple transmitters are attached to a single cell, to the same receiver. The schedule is constructed such that only one transmitter is active at a time, and is consequently collision-free. Mutualizing the same cell for several transmitters reduces the energy consumption and increases the network capacity. Our approach is still fully compliant with the standard while minimizing idle listening. Our simulation results show the relevance of such solution to provide high-reliability and fault-tolerance. While the single and disjoint paths solutions achieve a very low reliability (20%) when two nodes crash, we keep on providing a packet delivery ratio above 80%, whatever the conditions. Besides, our scheduling algorithm is particularly energy efficient since it presents the same energy consumption as the classical single path routing scheme.

Multipath routing identification for network measurement built on end-to-end packet order

Multipath routing, which provides multiple paths for ubiquitous communications, has been considered as promising routing mechanism to optimize network performance for Internet. However, it will incur adverse effects on the existing and emerging network measurement schemes, for example incomplete and inaccurate measurement results, to understand network characteristics, since many of them commonly do the work under single-path routing rather than multipath-routing. In order to eliminate this emerging issue on single-path-based network measurement in Internet, it requires to identify whether there is multipath routing between two reachable hosts in the network. Notice that no out-of-order delivery among a strip of packets along multiple paths seldom occurs, in this paper, an efficient multipath routing identification approach has been proposed to achieve this goal, by introducing a composite probe built on out-of-order delivery. We have elaborated our theoretical observation on the current probe composed of a strip of packets, and then presented our composite probe design in detail. Our proposed approach not only can efficiently identify the existing multipath routing, but also accurately recognize its type, referring to flow-based or packet-based routing. Corroborated by experiments and simulations, conducted on Planetlab and NS2, respectively, our approach outperforms other schemes in terms of effectiveness and accuracy.

Cooperative and Delay Minimization Routing Schemes for Dense Underwater Wireless Sensor Networks

Symmetry in nodes operation in underwater wireless sensor networks (WSNs) is crucial so that nodes consume their energy in a balanced fashion. This prevents rapid death of nodes close to water surface and enhances network life span. Symmetry can be achieved by minimizing delay and ensuring reliable packets delivery to sea surface. It is because delay minimization and reliability are very important in underwater WSNs. Particularly, in dense underworks, packets reliability is of serious concern when a large number of nodes advance packets. The packets collide and are lost. This inefficiently consumes energy and introduces extra delay as the lost packets are usually retransmitted. This is further worsened by adaptation of long routes by packets as the network size grows, as this increases the collision probability of packets. To cope with these issues, two routing schemes are designed for dense underwater WSNs in this paper: delay minimization routing (DMR) and cooperative delay minimization routing (CoDMR). In the DMR scheme, the entire network is divided into four equal regions. The minor sink nodes are placed at center of each region, one in each of the four regions. Unlike the conventional approach, the placement of minor sink nodes in the network involves timer based operation and is independent of the geographical knowledge of the position of every minor sink. All nodes having physical distance from sink lower than the communication range are able to broadcast packets directly to the minor sink nodes, otherwise multi-hopping is used. Placement of the minor sinks in the four regions of the network avoids packets delivery to water surface through long distance multi-hopping, which minimizes delay and balances energy utilization. However, DMR is vulnerable to information reliability due to single path routing. For reliability, CoDMR scheme is designed that adds reliability to DMR using cooperative routing. In CoDMR, a node having physical distance from the sink greater than its communication range, sends the information packets by utilizing cooperation with a single relay node. The destination and the relay nodes are chosen by considering the lowest physical distance with respect to the desired minor sink node. The received packets at the destination node are merged by fixed ratio combining as a diversity technique. The physical distance computation is independent of the geographical knowledge of nodes, unlike the geographical routing protocols. This makes the proposed schemes computationally efficient. Simulation shows that DMR and CoDMR algorithms outperform the counterpart algorithms in terms of total energy cost, energy balancing, packet delivery ratio (PDR), latency, energy left in the battery and nodes depleted of battery power.

Remaining bandwidth based multipath routing in 5G millimeter wave self-backhauling network

The millimeter wave self-backhaul network (mW-SBN) is one of the key solutions in 5G small cell backhaul. However, a lot of new challenges will be faced when the routing protocol of mW-SBN is designed, due to the dynamic traffic requirement and the directional transmission. To solve the problem well, the remaining bandwidth is described in the paper firstly, which plays a key role in the process of the path discovery. Secondly, a remaining bandwidth based multi-path routing (RBMR) protocol is proposed for the mW-SBN, which is mainly composed of the interaction of the remaining bandwidth information between adjacent nodes, the source route discovery that meets the data backhaul bandwidth requirements and the effective maintenance of the routing table. Thirdly, the upper limit of the number of multi-path is analyzed indirectly. Finally, the proposed protocol is simulated and compared. The simulation results show that RBMR protocol has greater gain than the three variations, i.e. remaining bandwidth based single-path routing (RBSR), non-remaining bandwidth based multi-path routing (NBMR) and non-remaining bandwidth based single-path routing (NBSR), in terms of network average throughput, routing overhead and packet loss rate.

Cross-layer multipath routing scheme for wireless multimedia sensor network

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.

Limitation of Erlang B Traffic Model in Elastic Optical Network for Blocking Probability Estimation

Abstract In this paper, an algorithm for multipath connection provisioning in elastic optical network (EON) has been proposed. Initially, the algorithm prefers the single-path routing for service provisioning. But when single-path routing is not adequate to serve a dynamic connection, the algorithm switches to the connection request fragmentation. Its computation is based on the parameters such as capacity_constant and capacity_allowed to fragment the connection request on disjoint paths. Simulation results clearly state that the proposed algorithm performs well in service provisioning as compared to the traditional single-path routing algorithms and improves the average network throughput. Thereafter, we have investigated the limitation of Erlang B traffic model in EON for calculation of link blocking probability using routing and spectrum assignment (RSA) algorithm. It is verified by the following two ways: (i) effect on the blocking probability in case of constant load and (ii) effect of slot width on the blocking probability. Our simulation results indicate that in EON due to dynamic RSA, blocking probability is not constant in case of proportionate varying of call arrival and service rate giving constant load and blocking probability depends on the number of slots per link, but in Erlang B traffic model blocking probability is always constant in case of constant load and it considers wavelength per link instead of slots per link. This is attributed to the fact that Erlang B traffic model fails to calculate blocking probability accurately in EON. We have computed the carried traffic on 14 nodes, 21-link National Science Foundation Network (NSFNET) topology.

Identify Congested Links with Network Tomography Under Multipath Routing

Identifying congested links accurately to ensure the Service Level Agreements is an important but challenging task, since it is costly or even practically unfeasible to monitor massive interior links directly for large networks. Network tomography has been proposed to overcome this problem by using end-to-end (path) measurements. However, most of existing tomographic methods only focus on the loss performance degradation, while paying much less attention the fact that network congestion will also greatly worsen the delay performance. Nevertheless, most of them normally work under single-path routing, which may also get violated in today’s Internet as multipath routing is increasingly common. In this paper, we consider the problem of using end-to-end measurements to identify congested links when multipath routing is employed in a non-tree network. Firstly, we use both link delay variances and link loss rates to model the system constraints between end- to-end paths and the interior links, and transfer the issue of congested link identification as an optimization problem. By theoretically demonstrating that the link delay variances are identifiable from the end-to-end delay measurements with certain topology conditions, we further prove that the above optimization problem is a Non-deterministic Polynomial-time hard (NP-hard) problem. Then in order to solve such an NP-hard problem, two greedy algorithms based on bool and additive congestion statuses are proposed. Lastly, simulation studies show that with extra delay constraints, our proposed algorithms are able to achieve better identification performances than existing methods under multipath routing.

Limiting the Excess Broadcast in Multipath Routing Using Ant Colony Optimization

Single path routing in mobile adhoc network (MANET) suffers from frequent disconnections due to movement of nodes. So, multipath routing evolves as a solution to the single path routing. Many researchers are working on devising multipath routing protocols with new features and strategies. Ant colony optimization is also used by many investigators for developing new solutions for multipath routing in MANET. In this paper we have worked on controlling the broadcast being done by the intermediate nodes. We improved on our work done in Amanpreet Kaur et al. titled “ACO Agent Based Routing in AOMDV Environment” by making use of channel contention and backoff technique. We compared the newly designed algorithm with three broad categories unipath, multipath and ant based algorithm. The new algorithm performs better as compared with other algorithms on the basis of various QoS metrics like throughput, jitter, end to end delay, and number of packets send, lost in packets and delivery ratio.

Performances of Ad Hoc Networks Under Deterministic and Probabilistic Channel Conditions : Cases for Single Path and Multipath Routing Protocols

Performances of Ad Hoc Networks Under Deterministic and Probabilistic Channel Conditions : Cases for Single Path and Multipath Routing Protocols

Performances of Ad Hoc Networks Under Deterministic and Probabilistic Channel Conditions : Cases for Single Path and Multipath Routing Protocols

Performances of Ad Hoc Networks Under Deterministic and Probabilistic Channel Conditions : Cases for Single Path and Multipath Routing Protocols

Defense Against Co-Operative Black-hole Attack and Gray-hole Attack in MANET

Mobile Ad-hoc networks (MANETs) can be termed as an autonomous system created by the collaboration of a set of motile nodes communicating with one another through available wireless media and each node behaves as an end system, as well as a router for packet forwarding. Each node is allowed to move freely, change locations and configure them to form a network. Finding an optimal and efficient path between the sender and receiver node is the main aim of routing protocols. Multipath routing protocols show a better result in comparison to single path routing protocols, for data transmission from source to destination extending lifetime of the network. Along with that security in routing for a protected communication between nodes has become a prime concern as any attack during routing may interrupt data transmission, paralyzing the whole network. During packet transmission through multiple paths a number of attacks make come into action by the unauthenticated and compromised nodes present within the network and black-hole attack is one of them. So our objective is to design a multipath routing protocol that detects and avoids the path containing black-hole. Our paper proposes a way to defense the black-hole and gray-hole attacks with the help of intelligence in MANET.

Robust gateway placement in wireless mesh networks

Wireless mesh networks (WMNs) are communication networks that provide wireless Internet access over areas with limited infrastructure. Each node in a WMN serves several clients in its coverage area and transfers their traffic over wireless media to a few gateway nodes that have wired connections to the Internet. In this paper, we consider the Internet gateway placement (IGP) problem along with operational problems such as routing and wireless transmission capacity allocation. To eliminate wireless interference, we adopt the spatial reuse time division multiple access (TDMA) method, in which wireless transmissions are scheduled to occur at different time slots. We also employ destination-based single path routing for its ease of implementation. We present two mixed integer linear programming (MILP) formulations, both of which jointly determine the minimum number of gateway nodes needed to support forecasted demand, the locations of these gateway nodes, the routing trees, and the time slot allocations to wireless links. These formulations differ in the flow constraints. We also present a set of valid inequalities for the formulation with the multi-commodity flow constraints. In most cases, the solution to the IGP problem is not unique. Therefore, we also introduce a local search algorithm to select the most robust solution against any demand forecast errors. On example networks, we compare the proposed formulations with and without the valid inequalities in terms of the exact solution performances and the linear programming (LP) relaxations. We also demonstrate our local search algorithm to improve robustness against forecast errors on these example networks.