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.
ZACA-EEC (Zigbee Ant Colony Algorithm Energy Efficient Cluster) routing protocol is proposed to replace AODV in Zigbee with the aim of increasing reliability for mine equipment monitoring in this paper, which can prolong the lifetime of network remarkably. Taking hydraulic support as an example, the distribution of monitoring nodes can be simplified as chain hierarchy topology, then Free-space model...
Wireless mesh networks are dynamically self-organized and self-configured, with the nodes in the network automatically establishing and maintaining mesh connectivity among them. Wireless mesh networks consist of three types of nodes: clients, routers and gateways. Wireless Mesh Network planning consists of determining the amount of routers needed to meet the demands for Internet access. It is a complicated...
Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks where communications between two nodes can be assisted by a single relay using two time slots. This paper continues our investigation of PHY techniques and cross-layer routing algorithms...
This paper presents a preliminary PhD research towards developing a framework to evaluate and optimize application mapping algorithms for Network-on-Chip architectures. Several such algorithms have been proposed for mapping the threads of a parallel application on a NoC architecture. However, the performance of those algorithms is evaluated only on some specific NoC designs. A unified approach for...
Center-based trees are one kind of group-shared trees. Packets are distributed over center-based trees from all sources to all multicast destinations. Because of its simplicity, the idea of center-based trees is used in multicast protocols such as CBT (Core-Based Tree) and PIM (Protocol Independent Multicast). There are two main problems in center-based trees. One is the core selection problem. The...
A network traffic system can be tuned by three factors: (i) the topology of underlying infrastructure; (ii) the distribution of traffic resources; (iii) the routing strategy. In this paper, we propose a model to study the optimization of network capacity based on complex network theory. We study the optimization method of network traffic in several situations corresponding to the real cases. The model...
Quality of service support for MANETs is a challenging task due to dynamic topology and limited resources. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. In this paper a novel QoS routing algorithm based on ant colony optimization is proposed. The proposed algorithm uses Ant-like agents to discover and maintain paths, that satisfy...
In LEO satellite constellation communication system, the routing strategy becomes a big challenge for the movement between satellites. According to researching on the 24/3/1 walker satellite constellation with inter-orbit ISLs and intra-orbit ISLs, two routing optimization scenarios based on ISL state and topology snapshot are suggested. At the same time, some valuable conclusions are provided according...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
Steiner routing is a fundamental yet NP-hard problem, in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing terminals as input ports and Hanan nodes as output ports. We show that the faster an output reaches its peak, the higher the possibility for the correspondent Hanan node to be a Steiner point. Iteratively adding one or multiple...
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.