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.
For more efficient use of wireless sensor networks, the article using the Bayesian formula to revise the subjective weights base on the fuzzy multiple attribute decision making (MADMR) of WSN routing algorithm which making the subjective weight more theoretical, at the same time using the entropy coefficient model to avoid too much deviation with the objective weights. The simulation results show...
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...
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...
For unpredictable manner of mobile ad hoc network (manet), due to mobility of nodes in network, the shortest path is not necessarily the better path. If we do not consider the stability of routing path, then wireless links may be easily broken. Hence it is important to find a route that endures a longer time. Recently, efforts in this field have dealt the parameters battery power or trust of a node...
A Mobile Ad hoc Network (MANET) is made up of mobile nodes that communicate through wireless connections, without any existing infrastructure or central administrator. Topology of the network is not fixed. Hence, routing in dynamic network is a new challenge. Nature-inspired algorithms (swarm intelligence) such as Ant Colony Optimization algorithms have shown to be a good method for expanding routing...
Data aggregation is an important issue in wireless sensor networks which gathers and routes information through a multi-hop network and processes data at intermediate nodes. This paper considers how to construct data aggregation tree in wireless sensor network where there are several source nodes and a single sink. Ant Colony Optimization algorithm is an effective distributed approach. It has been...
In order to reduce the congestion of Ad Hoc network and increase the speed of routing searching, the link-disjoint paths algorithm based on ant colony optimization is proposed in this paper. The new algorithm introduces the intelligence and positive feedback of ant algorithm to link-disjoint paths algorithm to improve the probability of path optimization, sets the age domain of ant to reduce immersion,...
Mobile ad hoc networks do not have any fixed topology. Routing in such network is very challenging and difficult due to the mobility of the nodes. Ant colony optimization is an efficient optimization technique used to find the optimum shortest route in the adhoc network. This paper describes a new routing algorithm for MANETs using Ant Colony Optimization technique. Special attention has been given...
This paper presents a new adaptive and dynamic routing algorithm called AAODV for mobile ad hoc networks inspired by Ant Colony Optimization algorithms. This algorithm is proposed by maintaining the nature of the Ad hoc On-demand Distance Vector (AODV) routing through the use of Ant Colony Optimization. AAODV maintains the on-demand nature of AODV but works in an adaptive manner. It does not send...
In order to establish a trusted and secure wireless mesh network, routing protocols should not only ensure the integrity, confidentiality and authentication, but also take into consideration the fact that the application of routing strategies should not impact the performance of routing protocols to a severe extent. This paper adopts Node's Trust as a routing parameter, and some improvements are made...
Has the same problems as the traditional wireless LAN, wireless mesh networks (WMN) is anticipated to resolve the limitations and to significantly improve the performance of ad hoc network. In fact, differs from that of planning other wireless networks, such as cellular systems WLAN, design such a WMN to cover in a given region can be a non-trivial task. To solve the optimization problem of routing...
The most popular routing algorithm in p2p network is that every node keeps a route table which records a certain number of other nodes. Such algorithm selects neighbor nodes at random, and this reduces routing efficiency. In this paper a new algorithm of optimizing p2p overlay network topology is proposed, which is based on minimum maximum k-means principle. According to the communication history,...
Due to long calculation time and slow convergence speed, ant colony system (ACS) cannot be used directly in wireless sensor networks (WSN). In this paper, we present an improved ACS algorithm based on Altitude Information (AI) and Ant Withdrawal (AW), named ACSA (an improved ACS algorithm with AI). The concept of AI is defined, and the design philosophy, algorithm realization and performance simulation...
This paper presents a novel Markovian jump model for developing routing algorithms in mobile networks that encounter variable number of nodes as well as changing number of destinations. The changes in the number of active destination nodes are represented by singular switching systems where a unified Hinfin decentralized routing control is proposed and implemented. The resulting optimization problem...
The mass transit network is fairly similar to computer network. If we apply IP addressed theory and routing algorithm in computer network to mass transit network, we realize line query in mass transit. If only we can establish substitute-speak-site of frontier set and its contiguous relationship, then line change information table is noticed each other between contiguous substitute-speak-site of frontier...
This paper presents a new detailed router for the hierarchical field programmable gate arrays (H-FPGAs). The optimal objectives of proposed routing algorithm are improving the time consumption of routing procedure (minimizing the running time of algorithm), and at the same time make great effort to decrease the wire length and critical path delay. Initially, nets are routed sequentially according...
Routing algorithm is a key component of wireless sensor networks. The researchers applied a lot of routing algorithm to satisfy the needs of various wireless sensor networks. In this paper we analyzed the topologies of multi-sink node wireless sensor networks and achieved a multi-direction routing algorithm based on meet ant colony optimization for multi-sink node wireless sensor networks. The simulation...
In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetime, in which wireless link bandwidth has been optimistically assumed to be sufficient. This article shows that ignoring the bandwidth constraint can lead to infeasible routing solutions. As energy constraint affects how data...
A new energy-efficient wireless sensor network routing algorithm is proposed. The algorithm obtains optimization routing paths using global information of wireless sensor network. And the optimizing process can be reproduced in distribution by constructing a neural network for each node. Simulation results show the algorithm can accomplish routing process correctly and rapidly, and increase network...
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.