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 order to make good use of the limited energy, ant colony optimization (ACO) was applied to inter-cluster routing mechanism. An uneven clustering routing algorithm for Wireless Sensor Networks (WSNs) based on ant colony optimization (ACO) was proposed. The algorithm utilized the dynamic adaptability and optimization capabilities of the ant colony to get the optimum route between the cluster head...
We present our initial work on the design and implementation of an efficient channel assignment and routing architecture for multi-radio and multichannel wireless mesh networks (WMNs). Our proposed scheme is derived from the principle of Ant Colony Optimization (ACO) in which smart ants (agents) perform the routing and channel assignment to stochastically solve a dynamic network optimization problem...
Cellular networks provide a range of communication services and are the principal wireless technology for domestic and business users. However, in cellular networks, an accident or a storm or a malicious action may cause a base station to fail and so be unable to provide radio coverage to sections of users. Such base station failures also might result in user congestion to nearby operational base...
This paper identifies the key aspects of perishable food distribution problem in metropolis. A multi-objective model of vehicle routing problem with time window is constructed including fixed vehicle cost, operation cost, shelf life loss and default cost. In order to reduce the increase distribution cost via meeting the time window, two-generation Ant Colony Optimization with ABC customer classification...
The proposed work presented a modified MAX-MIN Ant System (MMAS) algorithm to solve the routing problem, in which known demand are supplied from a store house with parallel routes for new local search. Routing Problem is an optimization problem and solved to nearly optimum by heuristics. The objective of routing issues is to use a fleet of vehicles with specified capacity to serve a number of users...
In DTNs, due to the unique characteristic of frequent partitioning, multicasting is a considerably different and challenging problem. Moreover, the single data multicast is different from multiple data multicast. In this paper, The mathematics model of multiple data multicast for DTNs is established, and the ant colony optimization algorithm introduce to solve the multiple data multicast problem....
Rumor routing is a routing protocol based on query for wireless sensor networks, which selects next hop randomly during establishing path and the path may not be optimal and may be loop. So this paper puts forward a novel rumor routing (NRR), which bases on ant colony optimization and can resolve the loop route that established by rumor routing, and has good convergence, comparing to rumor routing,...
In this paper, we present a modified on-demand routing algorithm for mobile ad-hoc networks (MANETs). The proposed algorithm is based on both the standard Ad-hoc On-demand Distance Vector (AODV) protocol and ant colony based optimization. The modified routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the routing overhead, response...
Traditional multicast technology faces a serious state scalability problem when there are large numbers of concurrent groups in the network. As a new approach to solve this scalability problem, aggregated multicast forces multiple multicast groups to share a common distribution tree. This can be defined as a minimum grouping problem and is proved to be an NPC problem. An ant colony optimization algorithm...
In this paper, it is presented a methodology for solving the Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW). The proposed methodology can be divided in two phases, i.e, the construction phase and the refinement phase. In the construction phase, the generation of an initial solution is made through Ant Colony Optimization (ACO) meta-heuristic with the elitism concept. Only...
Power consumption is one of the most important problems for wireless sensor networks because of the battery limitation in each sensor. This paper presents an ant colony optimization- (ACO-) based routing algorithm to reduce power consumption. First, a grade table is built and referred to generate several possible routing paths. Then, the ACO explores these paths to reduce the power consumption of...
Ant Colony Optimization (ACO) has proven to be a very powerful optimization heuristic for combinatorial optimization problems. This paper introduces a new type of ACO algorithm that will be used for routing along multiple routes in a network as opposed to optimizing a single route. Contrary to traditional routing algorithms, the Ant Dispersion Routing (ADR) algorithm has the objective of determining...
Delay Tolerant Mobile Networks (DTMNs) focus on scenarios where most of the time contemporaneous end-to-end paths between source and destination do not exist, and mobility should be explored for message delivery. Ant colony optimization is based on reinforcement learning and is adaptive. In this paper, we propose ACRP: an Ant-Colony-based Routing Protocol for DTMNs. In the protocol, the forward ants...
How to select a proper access gateway from the several gateways of a wireless mesh networks(WMN) to connect to the Internet is one of the critical technologies which can improve the performances of WMN. A multi-path multi-gateway WMN anycast routing protocol based on an ant colony optimization (MMAMBA) was presented. In this protocol, gateway selection was taken as an anycast service, the distributed...
Motivated by an industry project with a small package shipping company in France, we study a vehicle routing problem with stochastic travel and service times that considers the influence of driver familiarity with routes and customers on routing efficiency. Our approach forgoes any fixing of delivery areas thus maintaining routing flexibility. Driver specific travel and service times give drivers...
Evacuation routing problem with mixed traffic flow is complex due to the interaction among different types of evacuees. The positive feedback mechanism of single ant colony system may lead to congestion on some optimum routes. Like different ant colony systems in nature, different components of traffic flow compete and interact with each other during evacuation process. In this paper, an approach...
The paper presents a Predication mode based Routing Algorithm based on ACO (PRACO) to achieve the energy-aware data-gathering routing structure in wireless sensor networks (WSN). We adopt series model ARMA to analyze dynamic tendency in data traffic and deduce the construction of load factor, which can help to reveal the future energy status of sensor in WSN. By checking the load factor in heuristic...
Data gathering is one of the most important operations in wireless sensor networks. Since the nodes operate on limited power, it is a critical task to design an energy-efficient data gathering algorithm. In this paper, we propose an energy-efficient data gathering algorithm (EDGA) in which the network is grouped into clusters (each with a clusterhead) and the nodes form chains in each cluster. Firstly,...
Anycast communication has been defined as a standard communication model of IPv6. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can't get satisfying results when using the precise method in polynomial time. In this paper, a QoS anycast routing algorithm based on ant colony optimization is proposed. This algorithm regulates the pheromone on the...
The demand for Internet connectivity has grown exponentially in the past few years. Moreover, the advent of new services such as Voice over IP (VoIP), Video on Demand (VOD) and Videoconferencing applications have caused a sever increase in traffic, which makes it extremely hard to ensure an acceptable level of quality. This is mainly attributed to current routing strategies, such as Link State (LS)...
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.