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.
It has been found that almost all routing protocols can induce network congestion due to control message complexity. To overcome this overhead various optimization processes are used. One such process is gossiping, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. In this paper, we show how gossiping can be used to improve the performance of...
Vehicular Ad Hoc Networks (VANET) have become one of the most important research areas for the successful and deployment of intelligent transportation system and the unmanned vehicle technologies. In VANET, Travel Prediction-based Data Forwarding (TPD) was proposed as one of novel data forwarding schemes based on road traffic statistics. However, the TPD could not guarantee good performance in the...
The recent popularity of three dimensional integrated circuits (3D ICs) technology stems from its higher integrated degree and enhanced performance. However, the design routability for 3D ICs becomes especially important. In this paper, we propose a novel estimation model and a congestion aware floorplan for 3D ICs. This model is based on probabilistic analysis considering through silicon vias (TSV)...
We present stochastic vehicle routing policies for detection of any number of anomalies in a set of regions of interest. The autonomous vehicle collects information from a set of regions and sends it to a fusion center. The vehicle follows a randomized region selection policy at each iteration. Using the collected information, the fusion center runs an ensemble of cumulative sum (CUSUM) algorithms...
In this paper, we propose a new intersection-based geographical routing protocol, called delay tolerant routing protocol (DTRP) that adapts to the changes in the local topology within city environments. DTRP is based on an effective selection of road intersections through which a packet must pass to reach the gateway to the Internet. The selection, in such delay tolerant VANETs, is made in a way that...
IEEE 802.15.4 multi-hop wireless networks are an important communication infrastructure for many applications, including industrial control, home automation, and smart grids. Existing analysis of the IEEE 802.15.4 medium access control (MAC) protocol are often based on assumptions of homogeneous traffic and ideal carrier sensing, which are far from the reality when predicting performance for multi-hop...
When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. An optimal load balancing is very important, because it increases the system capacity and improves the overall ring performance. An important optimisation problem in this context is the Weighted Ring Arc Loading Problem (WRALP). It consists of the design, in a communication...
The main design challenge in wireless sensor networks is to achieve satisfactory network lifetimes under scarce energy resources available at the nodes. In this paper we present an optimization framework for maximizing lifetime of a network in which opportunistic routing together with random linear network coding is used. We propose a scheme in which each node attempts to receive transmissions from...
This paper presents an ant colony optimization algorithm with the 2nd Newton Law. We couple a group of parameters with the basic ant colony approach to handle the balance between the convergent speed and the global solution searching ability. This approach narrates the pheromone increasing style with the 2nd Newton law, and some new parameters named agglomeration and acceleration are used to describe...
Due to limited energy supplies, reducing power consumption is an important goal in wireless sensor networks. Clustering techniques are used to reduce power consumption and prolong network lifetime in many existing research efforts, among which grid-based ones are often used due to their simplicity and scalability. However, most existing work uses average distance as a simplification in calculating...
Ultra-wideband (UWB) communications has emerged as a promising technology for high data rate wireless personal area networks (WPANs). In this paper, we address a key issue that impacts the performance of multi-hop, multi-rate UWB-based WPANs, namely joint routing and rate selection. Arbitrary selection of routes (including direct links) and transmission rates along these routes results in unnecessarily...
We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange state information. Since communication costs can be significant, we seek conditions under which communication of state information among nodes can be minimized while still ensuring that the optimization process converges. In prior...
Due to the limited energy supplies of nodes in many applications like wireless sensor networks, energy efficiency is crucial for extending the lifetime of these networks. This paper addresses the routing problem for outage-restricted multihop wireless ad hoc networks based on cooperative transmission. The source node wants to transmit messages to a single destination. Other nodes in the network may...
Recently, opportunistic routing has been proposed to take good advantage of broadcast nature and spatial diversity to achieve high throughput, despite highly unpredictable and lossy wireless links in multi-hop wireless networks. Most previous works provide heuristic solutions to select as many candidates, and don't take inter-candidate delivery probability into account, which might suffer acknowledgement...
Ant colony algorithm (ACA), inspired by the food-searching behavior of ants, is an evolutionary algorithm and performs well in discrete optimization. In this paper, through an analysis of the constructive procedure of the solution in the ACA, a hybrid ant colony system (PLSACA) with Pareto local search (PLS), is proposed. In PLSACA, only partial facilities are randomly chosen to compute the designed...
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective method to reduce the reaction time. Very commonly, a backup path is chosen to be a most disjoint path from the primary path, or in the network level, backup paths are computed for all links (e.g., IPRFF). The validity of...
We consider the problem of dimensioning and expansion of wavelength division multiplexing (WDM) networks, taking in to account the fact that traffic demand is growing with time. It is known that such networks are operating in non-steady states, and absorption probabilities should be used to dimension the network instead of traditional blocking probabilities. In this paper, we first propose a numerical...
In this paper, the VRPTWRV (VRPTW with Re-used Vehicle) was presented and a mathematical programming model with multiple objects was constructed correspondingly. The heuristic information and Pseudo-random probability selection rule are improved according to the principle of serving customers with earlier service beginning time, shorter service time and earlier ending time firstly based on Ant Colony...
The vehicle routing problem (VRP) is a very important combinatorial optimization and nonlinear programming problem in the fields of transportation, distribution and logistics. In this paper, a particle swarm optimization (PSO) algorithm with crossover for VRP is proposed. The PSO algorithm combined with the crossover operation of genetic algorithm (GA) can avoid being trapped in local optimum due...
Capacitated vehicle routing problem(CVRP) is an important combinatorial optimization problem which has received considerable attention in the last decades. The Ant Colony system (ACS) is a metaheuristic which is inspired by the trail following behavior of real ant colonies. This paper proposes a two-stage hybrid ACS algorithm for CVRP. The algorithm first minimizes the number of vehicles using ACS...
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.