In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is su...
详细信息
In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is superior to the previously proposed hypercube interconnection networks and the hypercube transformation interconnection networks in terms of network cost(diameter x degree). In addition, several network properties (connectivity, routing algorithm, diameter, broadcasting) of MRH(n) are analyzed.
Hopfield neural network, as a recurrent neural network, shows very good results in solving a lot of different complex computational problems. Starting from its previous modification, and making the new ones, this netw...
详细信息
ISBN:
(纸本)9781479914180
Hopfield neural network, as a recurrent neural network, shows very good results in solving a lot of different complex computational problems. Starting from its previous modification, and making the new ones, this network was implemented in different types of communication networks in order to solve some real problems. In this paper, the possibility of intelligent decision making of Hopfield neural network, through the three independent implementations, will be presented. Starting from the problem of dynamic routing, one possible solution for multicast routing in telecommunication networks as well as routing in all optical networks will be presented. Beside this, the modifications of Hopfield neural network could be used for planning and projection of the new network infrastructures. One solution for route selection problem in real physical environment will be shown.
Nodes of wireless sensor networks need simple and effective cluster heads selection algorithms to balance the energy dissipation because of the limited processing capacity and energy. This article proposed a cluster h...
详细信息
Nodes of wireless sensor networks need simple and effective cluster heads selection algorithms to balance the energy dissipation because of the limited processing capacity and energy. This article proposed a cluster heads selection algorithm based on cluster notes number----CNN-LEACH, which is improved on classic algorithm LEACH. In order to balance the energy dissipation, if a node has been a cluster head already, it temporarily can not be a cluster head again several rounds afterward. The rounds are decided by cluster nodes number. The algorithm is straightforward, even without considering the residual energy and position information. But it significantly reduces the network energy consumption by using the threshold between 0 and 1 to control the effect of energy dissipation on the final round that one node should not be a cluster head. At the same time, it avoids the significant fluctuation in the number of cluster heads. Simulations and analysis results show that the algorithm can extend the lifetime of the network.
Fat-tree topologies are widely used in interconnect network designs for parallel supercomputers. In the classic fat-tree, compute nodes are connected to leaf stage switches by links. Given a large number of compute no...
详细信息
Fat-tree topologies are widely used in interconnect network designs for parallel supercomputers. In the classic fat-tree, compute nodes are connected to leaf stage switches by links. Given a large number of compute nodes, many switches and links are required, resulting in high hardware costs. To solve this problem, this paper proposes two hybrid topologies, k-Cube k-Ary n-Tree (CAT) and Mirrored k-Cube k-Ary n-Tree (MiCAT), based on fat-tree and hypercube. Instead of connecting k compute nodes directly to a leaf switch, we connect a k-cube to the switch, and each switch in the k-cube part connects k compute nodes. That is, this k-cube consists of 2(k) - 1 switches and k(2(k)-1) compute nodes. We give the shortest path routing algorithms and evaluate the path diversity, cost, performance, and average packet latency of CAT and MiCAT. The results show that CAT and MiCAT can save up to 87% switches and 80% links in a large-scale parallel system, k=n=8 for example, compared to fat-trees, and meanwhile, both CAT and MiCAT have higher path diversities than fat-trees.
In order to better apply the AODV routing protocol to the mine wireless ad-hoc network,this thesis proposes an improved routing *** on the AODV routing protocol choosing the minimum hops path as the routing path,the a...
详细信息
In order to better apply the AODV routing protocol to the mine wireless ad-hoc network,this thesis proposes an improved routing *** on the AODV routing protocol choosing the minimum hops path as the routing path,the algorithm adds the consideration of node congestion and residual energy,and designs a new hops count *** method divides different degrees of node congestion and energy consumption into different levels and determines hops according to different *** simulation results show that N-AODV protocol has excellent performance close to AODV protocol and can meet the requirements of mine wireless adhoc network.
作者：
Jun-Zhao SunMediaTeam
Machine Vision and Media Processing UnitInfotech Oulu P.O.Box 4500FIN-90014 University of OuluFinland
＜正＞In the near future,a pervasive computing environment can be expected based on the recent progresses and advances in computing and communication *** generation of mobile communications will include both prestigio...
详细信息
＜正＞In the near future,a pervasive computing environment can be expected based on the recent progresses and advances in computing and communication *** generation of mobile communications will include both prestigious infrastructured wireless networks and novel infrastructureless mobile ad hoc networks（MANETs）.A MANET is a collection of wireless nodes that can dynamically form a network to exchange information without using any pre-existing fixed network *** special features of MANET bring this technology great opportunities together with severe *** paper describes the fundamental problems of ad hoc networking by giving its related research background including the concept,features,status,and applications of *** of the technical challenges MANET poses are also presented,based on which the paper points out some of the key research issues for ad hoc networking technology that are expected to promote the development and accelerate the commercial applications of the MANET *** attention is paid on network layer routing strategy of MANET and key research issues include new X-cast routing algorithms,security ＆ reliability schemes,QoS model,and mechanisms for interworking with outside IP networks.
Since Network-on-Chip(NoC) is proposed to act as the communication infrastructure for many-core architecture, it has become one of the most investigated research topics. The term "saturation" is always used ...
详细信息
Since Network-on-Chip(NoC) is proposed to act as the communication infrastructure for many-core architecture, it has become one of the most investigated research topics. The term "saturation" is always used while discussing about performance and power figures exhibited by a NoC. Router buffer utilization is one of the key factors to understand network saturation status. In this paper, we carry out detail study on the router buffer utilization under various traffic load. According to our study, the network packets are classified into three types: destination packets, passing packets, and deterring packets. These packets will make different contribution to the router buffer occupation.
In view of the relevant requirements of different services in wireless multimedia sensor networks, after considering the parameters such as energy, time delay, hops and so on, we propose a Qos routing algorithm based ...
详细信息
In view of the relevant requirements of different services in wireless multimedia sensor networks, after considering the parameters such as energy, time delay, hops and so on, we propose a Qos routing algorithm based on Ant Colony *** algorithm uses a different parameter weighting method for different service processes, which makes it the most suitable route for the service process. Through setting the access conditions, we prevent the occurrence of premature deaths, high delay, and the emergence of ant colony and so on. Simulation results show that the proposed algorithm is suitable for mu lti service wireless multimedia sensor networks, and the network energy consumption is balanced on the basis of guaranteeing QoS. Moreover the lifetime of the whole network is extended.
Network-on-Chip has become a hot spot in the field of complex System-on-Chip for its effectiveness. The performance of No C, to a large extent, depends on the router's structure. In this paper, we present a method...
详细信息
Network-on-Chip has become a hot spot in the field of complex System-on-Chip for its effectiveness. The performance of No C, to a large extent, depends on the router's structure. In this paper, we present a method based on fault-tolerant hardware structure to solve the problem of instability inhere in routers. We suggest adding bypass into routers and using a dynamic reconfigurable XY-YX routing algorithm;this solution shall ensure effective communications in No C. Verilog language is used to describe all of the modules in QuartusⅡenvironment. We conduct the simulation experiment and area integrated, as well as accomplishes the overall modules' design using Altera's FPGA. The experiment results show that our design can meet the needs of communication in NoC.
Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizi...
详细信息
Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizing the transmission cost of each multicast session. In practice, it is not necessary that the source of each multicast session has to be in a specific location, as long as certain constraints are satisfied. Accordingly, applications usually meet a novel multicast with uncertain sources, ie, uncertain multicast. That is, multiple nodes have the responsibility to act as the root node of a multicast session. Prior proposals have addressed an uncertain multicast by constructing the minimum cost forest. However, it is still unknown how to efficiently share the network resources, when a set of uncertain multicast occupies the network simultaneously. To tackle such a challenging issue, we present the packing problem of uncertain multicasts (MPU) to minimize the total transmission cost, under the constraint of link capacity. We prove that the MPU problem is NP-hard. An intrinsic solution is constructing the minimum cost forest for each uncertain multicast individually. This method, however, is inefficient and may be infeasible because of the constraint of link capacity. Thus, we design 2 dedicated greedy methods, named priority-based and adjusting congested link, to approximate the optimal solution. The comprehensive results indicate that both of our 2 methods can find a feasible solution for the MPU problem. Moreover, given a set of uncertain multicasts, the adjusting congested link method can generate a desired transmission structure for each uncertain multicast and achieve the least total cost when packing them.
暂无评论