检索结果-内蒙古大学图书馆

4th World Congress on Nature and Biologically Inspired Computing (NaBIC)

作者： Liu, Keke Chen, Zhenxiang Abraham, Ajith Cao, Wenjie Jing, Shan Univ Jinan Shandong Prov Key Lab Network Based Intelligent C Jinan Peoples R China MRI Lab Auburn WA 98071 USA VSB Tech Univ Ostrava IT Innovat Ostrava Czech Republic

ISBN: (纸本)9781467347686

Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic. The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem. We measure the multicast capability of each node through the degree-constraint for each node and discuss the problem of multicast in the case of degree-constraint, which has an important significance in the communication network. Limiting the capacity of each node during the replication process of information transmission can improve the speed of the network, which has an important significance in real-time service. In this paper, we solve constrained multicast routing algorithm based on genetic algorithm. The idea is to simulate the Darwinian theory of biological evolution. At the same time, we improve the generating random tree and replace the variation by the combination of the two variations. On one hand, we improve the efficiency of generating random tree and on the other hand, we can control the mutation of different variations in a more flexible manner.

关键词： Multicast Replication-Associated Process Genetic Algorithm (GA) routing algorithms Line of nodes networks(communications) Steiner trees evolution schedule service data transmission Spanning tree

来源：评论

学校读者我要写书评

暂无评论

A Framework based on Small World Features to Design HSNs Topologies with QoS

A Framework based on Small World Features to Design HSNs Top...

引用

17th IEEE Symposium on Computers and Communications (lSCC)

作者： Guidoni, Daniel L. Boukerche, Azzedine Villas, Leandro A. Souza, Fernanda S. H. Mini, Raquel A. F. Loureiro, Antonio A. F. Federal University of S&#x00E3 o Jo&#x00E3 o dei-Rei - Brazil

ISBN: (纸本)9781467327138

In this work we propose a framework based on the small world features to design Heterogeneous Sensor Network (HSN) topologies with QoS. The framework creates three different topologies and each topology has its goals related to the latency and energy consumption during data communication. We also propose a routing algorithm that uses the created topologies in order to provide QoS in HSN. Simulation results showed that the three topologies can provide different levels of QoS that can be used in many sensor network applications. We also compare our framework to the literature topology to provide QoS in HSN and our framework presents better tradeoff between energy consumption and latency during data communication.

关键词： Quality of service Frameworks data communication Latency energy consumption topology routing algorithms Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Virtualizing Virtual Channels for Increased Network-on-Chip Robustness and Upgradeability

Virtualizing Virtual Channels for Increased Network-on-Chip ...

引用

IEEE-Computer-Society Annual Symposium on VLSI (ISVLSI)

作者： Evripidou, Marios Nicopoulos, Chrysostomos Soteriou, Vassos Kim, Jongman Univ Cyprus Dept ECE Nicosia Cyprus Cyprus Univ Technol Dept EECEI Nicosia Cyprus Georgia Inst Technol Sch ECE Atlanta GA 30332 USA

ISBN: (纸本)9780769547671

The Network-on-Chip (NoC) router buffers are instrumental in the overall operation of Chip Multi-Processors (CMP), because they facilitate the creation of Virtual Channels (VC). Both the NoC routing algorithm and the CMP's cache coherence protocol rely on the presence of VCs within the NoC for correct functionality. In this article, we introduce a novel concept that completely decouples the number of supported VCs from the number of VC buffers physically present in the design. Virtual Channel Renaming enables the virtualization of existing virtual channels, in order to support an arbitrarily large number of VCs. Hence, the CMP can (a) withstand the presence of faulty VCs, and (b) accommodate routing algorithms and/or coherence protocols with disparate VC requirements. The proposed VC Renamer architecture incurs minimal hardware overhead to existing NoC designs and is shown to exhibit excellent performance without affecting the router's critical path.

关键词： virtual channels Upgradability network-on-chip Virtualization stream order routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An ACOA-AFSA Fusion routing Algorithm for Underwater Wireless Sensor Network

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2012年第unknown期2012卷 1-9页

作者： Wu, Huafeng Chen, Xinqiang Shi, Chaojian Xiao, Yingjie Xu, Ming Shanghai Maritime Univ Merchant Marine Coll Shanghai 201306 Peoples R China Shanghai Maritime Univ Coll Informat Engn Shanghai 201306 Peoples R China

Due to intrinsic properties of aqueous environments, routing protocols for underwater wireless sensor network (UWSN) have to cope with many challenges such as long propagation delay, bad robustness, and high energy consumption. Basic ant colony optimization algorithm (ACOA) is an intelligent heuristic algorithm which has good robustness, distributed computing and combines with other algorithms easily. But its disadvantage is that it may converge at local solution, not global solution. Artificial fish swarm algorithm (AFSA) is one kind of intelligent algorithm that can converge at global solution set quickly but has lower precision in finding global solution. Therefore we can make use of AFSA and ACOA based on idea of complementary advantages. So ACOA-AFSA fusion routing algorithm is proposed which possesses advantages of AFSA and ACOA. As fusion algorithm has aforementioned virtues, it can reduce existing routing protocols' transmission delay, energy consumption and improve routing protocols' robustness theoretically. Finally we verify the feasibility and effectiveness of fusion algorithm through a series of simulations.

关键词： routing algorithms WIRELESS sensor networks NETWORK time delays ROBUST control ENERGY consumption ANT algorithms MULTISENSOR data fusion

来源：评论

学校读者我要写书评

暂无评论

In-Network Iterative Distributed Estimation for Power-constrained Wireless Sensor Networks

In-Network Iterative Distributed Estimation for Power-constr...

引用

8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Shah, Santosh Beferull-Lozano, Baltasar Univ Valencia Grp Informat & Commun Syst Inst Robot & Tecnol Informac & Comunicac Paterna 46980 Valencia Spain

ISBN: (纸本)9780769547077

In this paper, we consider the problem of power-efficient distributed estimation of a localized event in the large-scale Wireless Sensor Networks (WSNs). In order to increase the power efficiency in these networks, we develop a joint optimization problem that involves both selecting a subset of active sensors and the routing structure so that the quality of estimation at a given querying node is the best possible subject to a total imposed communication cost. We first formulate our problem as an optimization problem and show that it is NP-Hard. Then, we design two algorithms: a fixed-tree relaxation-based and a novel and very efficient iterative distributed to optimize jointly the sensor selection and the routing structure. We also provide a lower bound for our optimization problem and show that our iterative distributed algorithm provides a performance that is close to this bound. Although there is no guarantee that the gap between this lower bound and the optimal solution of the main problem is always small, our numerical experiments support that this gap is actually very small in many cases. An important result from our work is the fact that because of the interplay between communication cost and gain in estimation when fusing measurements from different sensors, the traditional Shortest Path Tree (SPT) routing structure, widely used in practice, is no longer optimal, that is, our routing structures provide a better trade-off between the overall communication cost and estimation accuracy. Comparing to more conventional sensor selection and fixed routing algorithms, our proposed joint sensor selection and routing algorithms yield a significant amount of energy saving.

关键词： energy capacity routing algorithms Network routing Sensors Iterative dynamic efficiency Distribute

来源：评论

学校读者我要写书评

暂无评论

On Improved MANET Network Utilization

On Improved MANET Network Utilization

引用

4th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Chang, Zhijiang Gaydadjiev, Georgi Delft Univ Technol Comp Engn Lab NL-2628 CD Delft Netherlands

ISBN: (纸本)9781467358293;9781467358309

Mobile ad hoc network (MANET) is a new opportunity for mobile networking using intelligent mobile terminals. However, the widely used shortest path first based routing algorithm leads to various network utilization problems. Mobile terminals have limited power, hence, power saving should be considered when terminals serve as intermediate nodes in MANET. Furthermore, ad hoc routing table calculation is distributed among all network terminals. Therefore, we also need to construct stable paths with longer lifetime in order to reduce the communication overhead introduced by route reconstruction. A less evenly distributed traffic exhausts power on the nodes in the center of the network and leads to shorter path lifetime. Such a network deployment is not fair for the internal nodes. The above problems exist for all routing protocols especially proactive routing protocols based on shortest path first algorithm OLSR. In this paper we study the MANET network utilization in term of load distribution and path lifetime. Our careful simulation results demonstrate that the standard shortest path first algorithm leads to worse load balancing and reduced path lifetime compared to our proposal. When the most unstable network topology is considered, our proposal achieves better network utilization by reducing the peak transmission per node by 15% and the standard deviation of transmission per node by 50%. The average lifetime for established paths is doubled under the most unstable topology.

关键词： Mobile ad hoc networks shortest path intermediate node Line of nodes Shortest path algorithms routing algorithms mobile terminal Load distribution Network Network topology Load balancing Ganglia

来源：评论

学校读者我要写书评

暂无评论

a 3D-NoC Router Implementation exploiting Vertically-Partially-Connected Topologies

a 3D-NoC Router Implementation exploiting Vertically-Partial...

引用

IEEE-Computer-Society Annual Symposium on VLSI (ISVLSI)

作者： Bahmani, Maryam Sheibanyrad, Abbas Petrot, Frederic Dubois, Florentine Durante, Paolo TIMA Lab SLS Team Grenoble France

ISBN: (纸本)9780769547671

In this paper, we detail the design and implementation of a router for vertically-partially-connected 3D-NoCs based on stacked 2D-meshes. This router implements the necessary hardware to support a recently introduced routing algorithm called "Elevator-First", which targets topologies with irregularly placed vertical connections in a deadlock free manner, using only two virtual channels in the plane. The micro-architectural design shows that the proposed router requires few additional hardware. Our studies about the practicality of the algorithm and its router implementation demonstrate that it has low overhead compared to a router for fully connected 3D-NoCs. Using STMicroelectronics 65nm CMOS technology Elevator-First router with 7 ports has a total area of 0.07mm(2), an Operating frequency of over 3GHz and a power consumption of around 3mW.

关键词： virtual channels Power consumption Routers Computer hardware operating frequency routing algorithms Microelectronics CMOS technology

来源：评论

学校读者我要写书评

暂无评论

General shuffle-exchange networks and their tag-based routing algorithms

General shuffle-exchange networks and their tag-based routin...

引用

Wireless Applications and Computing 2008 and Telecommunications, Networks and Systems 2008, MCCSIS'08 - IADIS Multi Conference on Computer Science and Information Systems

作者： Lan, James K. Chou, Well Y. Chen, Chiuyuan Department of Applied Mathematics National Chiao Tung University 1001 University Road Hsinchu 300 Taiwan

ISBN: (纸本)9789728924621

This paper considers the problem of designing efficient routing algorithms for the backward network of a bidirectional general shuffle-exchange network (BGSEN). A BGSEN consists of the forward and the backward network. The control tag used in the forward (backward) network is called the forward (backward) control tag. It has been shown that Padmanabhan's formula (Padmanabham, 1991) can be used in the forward network. As for the backward network, Chen et al. (Chen et al., 2003) proposed a tag-based routing algorithm, which is based on the idea of using the forward control tag generated by Padmanabhan's formula inversely. Recently, Chen and Lou (Chen and Lou, 2006) also proposed a tag-based routing algorithm for the backward network. It should be noted, however, that Padmanabhan's formula is actually an explicit formula for computing the forward control tag. Neither (Chen et al., 2003) nor (Chen and Lou, 2006) provides an explicit formula for computing the backward control tag. This paper attempts to propose such formula that builds specifically for the backward control tag and greatly simplifies the computation process of Chen and Lou's algorithm. © 2008 IADIS.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid position-based routing algorithms for 3D mobile ad hoc networks

Hybrid position-based routing algorithms for 3D mobile ad ho...

引用

4th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2008

作者： Liu, Song Fevens, Thomas Abdallah, Alaa Eddien Department of Computer Science and Software Engineering Concordia University Montréal QC H3G 1M8 Canada

ISBN: (纸本)9780769534572

Numerous routing algorithms have been proposed for routing efficiently in mobile ad hoc networks (MANETs) embedded in two dimensional (2D) spaces. But, in practice, such networks are frequently arranged in three dimensional (3D) spaces where the assumptions made in two dimensions, such as the ability to extract a planar subgraph, break down. Recently, a new category of 3D position-based routing algorithms based on projecting the 3D MANET to a projection plane has been proposed. In particular, the Adaptive Least-Squares Projective (ALSP) Face routing algorithm (Kao et al., 2007) achieves nearly guaranteed delivery but usually discovers excessively long routes to the destination. Referencing the idea of hybrid Greedy-Face-Greedy (GFG) routing in 2D MANETs, we propose a local hybrid algorithm combining Greedy routing with ALSP Face routing on projection planes. We show experimentally that this hybrid ALSP GFG routing algorithm on static 3D ad hoc networks can achieve nearly guaranteed delivery while discovering routes significantly closer in length to shortest paths. The mobility of nodes is handled by introducing the concepts of active sole nodes and a limited form of flooding called residual path finding to the ALSP GFG routing algorithm. Under mobility simulations, we demonstrate that the mobility-adapted hybrid routing algorithm can maintain high delivery rates with decreases in the average lengths of the paths discovered compared to shortest paths, without generating a large amount of flooding traffic. © 2008 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research of an event process designed for event & voluminous graphs to compute customized itinerary

Research of an event process designed for event & voluminous...

引用

2nd International Conference on Innovative Computing Technology (INTECH)

作者： Omar, Kassara Loubna, Cherrat Mostapha, Ezziyyani Mohammad, Essaaidi Abdelmalek Essaadi Univ LaSIT Fac Sci Tetouan Morocco Abdelmalek Essaadi Univ LaSIT FSTT Tetouan Morocco

ISBN: (纸本)9781467326797

Processes of itinerary calculation in graphs have been, and still are, an interesting research topic. Despite the great interest that this topic has drawn in the research community, the proposed algorithms in the literature reveal certain limits to compute the itinerary in the graphs which parameters (vertices, edges) could be varying and could have a big graph order. The purpose main of this paper is to present the solution that resolve the issue in question and final results will be operated for the benefit of humans (included people with visual, auditory and mobile disabilities) to guide them in the presence of the unexpected of navigation that cause the variability of graph parameters. The presented solution can also be operated in a wide range of applications fields.

关键词： routing algorithms dynamic parameters navigation graphs

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：