The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
RPL is the routing protocol for low-power and lossy networks and has recently been considered as the standard routing protocol for IPv6 based wireless sensor networks using the IEEE 802.15.4 protocol. RPL is oriented towards supporting multi-point to point communications in which multiple points typically communicate with one sink node that considered the root of the RPL tree. RPL aims to minimize...
Estimating accurately important nodes for routing in modern and future networks is a key process with numerous benefits. Towards this goal, in this paper we propose Hyperbolic Traffic Load Centrality (HTLC), as a novel alternative to the Traffic Load Centrality (TLC) metric, used for ranking nodes with respect to their importance in the routing operation. HTLC is based on network embedding in hyperbolic...
It is vital to find a path that satisfies multiple Quality-of-Service (QoS) constraints with the deployment of current emerged services. However, it is not very efficient and effective at finding such a path for existing algorithms. In this paper, an improved version of fully polynomial time approximation scheme (IFPTAS) for multiple constraints path optimal (MCOP) problem was proposed. We find that...
Efficient routing in mobile ad hoc networks (MANETs) is highly desired and connected dominating sets (CDS) have been gaining significant popularity in this regard. The CDS based approach reduces the search for a minimum cost path between a source and destination terminals to the set of terminals forming the backbone network. Researchers over the years have developed numerous distributed and localized...
The intermittent connectivity between nodes to transfer data is exploited using Disruption tolerant networks (DTNs). DTNs are susceptible to flood attacks which limit the network resources. Various methods were used to defend these attacks based on distributed schemes with certain difficulties to count the packets or duplicates sent by a node. This is due to lack of communication infrastructure. Two...
Opportunistic networking targets networks where end-to-end communication paths between nodes may not exist and it becomes important to seize opportunities to forward data to neighbouring nodes in the hope that it will eventually be propagated to the destination. Forwarding algorithms must address the trade-off between delivery performance (success ratio, end-to-end delay) and resource consumption...
1/2 network capacity is often believed to be the limit of worst-case throughput for mesh networks. However, this paper provides a new worst-case throughput bound, which is higher than 1/2 network capacity, for odd radix two-dimensional mesh networks. In addition, we propose a routing algorithm called U2TURN that can achieve this worst-case throughput bound for odd radix meshes. For even radix meshes,...
In this paper, we investigate the cost-constrained incremental network planning problem in multi-hop wireless networks. Given an existing wireless network, we study the problem of how to add new wireless links to improve the network performance under the deployment cost constraint. After formulating the problem as COst-constrained Incremental Network ($COIN$) problem, we introduce a performance metric,...
Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we study the problem of finding an anypath subject to multiple (K) constraints, which has been proved to be NP-hard. We present a polynomial distributed K-approximation routing algorithm. Our algorithm...
For a Carrier Ethernet or MPLS-TP service provider the determination of a multipoint-to-multipoint (mp2mp) virtual connection must be done in an efficient way in order to maximise network performance. This problem can be formulated as a Steiner tree problem which is a very complex combinatorial problem, being NP-complete. In general, any transport network ideal management system should seek to balance...
Finding a path that satisfies multiple Quality-of-Service (QoS) requirements is vital to the deployment of current emerged services. However, existing QoS routing algorithms are not very efficient and effective at finding such path. Moreover, few works focus on two or more QoS constraints. In this paper, we propose an effective fully polynomial approximation scheme (FPAS) for multiconstrainted path...
Search in peer-to-peer networks is a challenging problem due to the absence of any centralized control & the limited information available at each node. When information is available about the overall structure of the network, use of this information can significantly improve the efficiency of decentralized search algorithms. Many peer-to-peer networks have been shown to exhibit power-law degree...
The notion of vertex sparsification (in particular cut-sparsification) is introduced in, where it was shown that for any graph G = (V, E) and any subset of k terminals K ⊂ V, there is a polynomial time algorithm to construct a graph H = (K, EH) on just the terminal set so that simultaneously for all cuts (A,K-A), the value of the minimum cut in G separating A from K-A is approximately the same as...
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we focus on anypath routing subject to K constraints, and present a polynomial time K-approximation algorithm. When K = 1, our algorithm is the optimal polynomial time algorithm for the corresponding problem. When...
Multiprotocol Label Switching (MPLS) Point to Multipoint (P2MP) can be used as an underlying technology for transmitting video data. Reducing the transmission delay on a network is very important to maintain the quality of service for video transmission. Therefore, the hop count of the path between a source and a destination node should be reduced using MPLS P2MP routing technology. We considered...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.