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.
In mesh networks, the proposed distributed algorithm sets up (in advance or dynamically) maximal-length (virtual-) circuits to bypass IP routers, reducing their size and power requirements, increasing efficiency, and improving network performance. By finding and setting up the optimal configuration of bypass circuits in an IP network, the algorithm: (i) minimizes the total number of expensive, high-speed...
A minimum connected dominating set (MCDS) offers an optimized way of sending messages in wireless networks. However, constructing a MCDS is a NP-complete problem. Many heuristics based approximation algorithms for MCDS problems have been previously reported. In this paper, we propose a new degree-based multiple leaders initiated greedy approximation algorithm (PSCASTS) based on the selection of a...
We consider the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The Lagrangian Duality...
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the `path space' can help many important routing primitives, in particular, multipath routing and resilient routing (when nodes or links can fail unexpectedly) as considered in this paper. Both problems are challenging for a general graph setting, especially if each node cannot...
In this paper, we focus on minimum cost routing in the Wireless Sensor Networks (WSNs). In-network data is often routed in such a way that it can minimize overall energy consumption or it can maximize the network lifetime. However, these metrics do not take into account other costs such as queueing delay and congestion. We solve the problem by introducing a comprehensive cost function and formulating...
One of the main challenges in optical networking is the problem of Routing and Wavelength Assignment (RWA). Generally speaking, the algorithms proposed for RWA are divided into two categories: Centralized and Distributed. According to the scale, size and other preferences of a network, one of the above strategies can be selected for establishing lightpaths in the network. In small size networks where...
Because wireless networks use shared communication channels, contention and interference can significantly degrade throughput and fairness. Optimal rate control algorithms can be designed for wireless networks by modeling the contention between routers using capacity constraints and solving a convex optimization problem. In this work we develop a more accurate network model that directly incorporates...
Multi-hop wireless networks have been an active research area for decades, however, the solutions proposed to solve routing misbehaviors are still not robust. In this paper, we use the evolutionary game theory (EGT) framework to address one issue of routing misbehavior, the problem of selfishness. We propose the use of distributed algorithms that are able to force selfish nodes to cooperate and forward...
We present a new scheme to reduce the end-to-end routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. While greedy routing in the synchronized MAC model has been studied extensively, efficient routing in an asynchronous MAC model is considerably different because the wake-up time and availability of a node along the pre-decided path...
Geographic routing is a promising approach for point-to-point routing in wireless sensor networks, but it requires the availability of geographic coordinates. Location devices like GPS do not work indoors and they are often not cost-effective for ubiquitous deployment on a large scale. While it is possible to manually configure coordinates for small sensor networks, it is infeasible to do the same...
Connected dominating set (CDS) algorithm based on a virtual backbone technology has an important role for wireless ad hoc network, route optimization, energy conservation and allocation of resources. In this paper, on the base of several classic distributed CDS approximation algorithm and connected dominating set, a new distributed CDS algorithm based on weight is presented, the correctness and efficiency...
This work proposes a distributed algorithm for the energy optimal routing in wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without...
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theory provides some general use of centrality measures that have been applied to a large variety of knowledge fields. This work aims to use centrality information in the design of routing algorithms for Wireless Sensor Networks...
We consider the problem of backbone formation in ad hoc wireless networks composed of heterogeneous nodes. A virtual backbone in an ad hoc wireless network provides a hierarchical infrastructure that can be used to address important challenges such as efficient routing, multicasting/broadcasting, activity-scheduling, and energy efficiency. We model a wireless network in which nodes have different...
The increasing growth of the global Internet making the shortcomings of its unstructured topology and distributed routing algorithm are exposed more rapidly. To design a controllable, scalable and manageable backbone network with a simple, efficient architecture is very imperative. Among many topologies, Tree topology which has a natural hierarchical structure and explicit end-to-end transmission...
In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is different every time when the relative location of relay node to the destination changes. The configuration in the entire network when all the succeeding paths from a relay node are blocked by local minima is irregular and its...
NUM (Network Utility Maximization) problems have worked as an important approach to solve network deployment problem especially for network resource management. In existing literature, NUM model has been used to provision optimal network resource allocation. However, in practice, routing and transmission delay would not be ignored. Without routing, we would not achieve the “real” maximum utility....
In order to improve transmission throughput of a multi-hop wireless network, many efforts have been made in recent years to reduce traffic and hence transmission collisions by constructing backbone networks with minimum size. However, many other important issues need to be considered. Instead of simply minimizing the number of backbone nodes or supporting some isolated network features, in this work,...
We study the problem of gateway placement for cost minimization (GPCM) in two-dimensional wireless mesh networks. We are given a set of mesh routers, assume they have identical transmission range r, represented by unit transmission disks around them. A router may be selected as a gateway at certain placing cost. A router is served by a gateway if and only if the gateway is within its transmission...
Throughput optimization and traffic engineering in Wavelength-Division Multiplexing (WDM) networks are usually treated as mono-objective optimization problems. In this paper, we provide a multi-objective Integer Linear Program (ILP) for the joint throughput optimization and traffic engineering problem. By simultaneously i) maximizing the throughput, ii) minimizing the resource consumption, and iii)...
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.