Most of the existing routing protocols from those in the terrestrial networks can not be directly applied in Deep Space Information Networks (DSINs), because of its inherent outstanding characteristics, such as bandwi...
详细信息
Most of the existing routing protocols from those in the terrestrial networks can not be directly applied in Deep Space Information Networks (DSINs), because of its inherent outstanding characteristics, such as bandwidth constraints, high latency, asymmetric data rates, and heterogeneous network architectures. Therefore, designing an optimal routing algorithm that is suitable for DSINs becomes a challenging and interesting problem. In this paper, a bandwidth allocation scheme based on non-cooperative differential game is proposed. Our scheme takes the selfness of nodes into consideration. It is shown that our proposed scheme can effectively allocate bandwidth with bandwidth constraints, and is more feasible and adaptive to DSINs with bandwidth constraints.
Divisor-Skip Wavelength Division Multiplexing (DS-WDM) ring is an optical interconnection network for workstation clusters or parallel machines which can connect various number of nodes easily using wavelength divisio...
详细信息
Divisor-Skip Wavelength Division Multiplexing (DS-WDM) ring is an optical interconnection network for workstation clusters or parallel machines which can connect various number of nodes easily using wavelength division multiplexing techniques. However, the wavelength-ordered routine algorithm proposed for the DS-WDM ring requires complicated processes in each router. Here, a new routing algorithm called the comparing dimensional number routing algorithm for the DS-WDM ring is proposed and evaluated. Although the diameter and average distance are almost same as traditional wavelength-ordered routing, the cost and latency are much reduced.
A search method based on Particle Swarm Optimisation to search simutaneously the energy function coefficients and the parameters of the Hopfield Neural Network (HNN) algorithm is proposed. Experiments using three diff...
详细信息
A search method based on Particle Swarm Optimisation to search simutaneously the energy function coefficients and the parameters of the Hopfield Neural Network (HNN) algorithm is proposed. Experiments using three differents communication networks are presented. The results show that the proposed approach achieves better results than existing algorithms that employ the HNN for routing. Some results show that the algorithm tends to be quicker than Dijkstra for larger communication networks.
To solve the overlap problem in node selection process in order to fill the existing routing algorithms deficiencies, This paper designs a traditional Gossiping routing algorithm based on SPSO. At the same time, the p...
详细信息
ISBN:
(纸本)9781467389792
To solve the overlap problem in node selection process in order to fill the existing routing algorithms deficiencies, This paper designs a traditional Gossiping routing algorithm based on SPSO. At the same time, the paper gives the content and design steps of this algorithm. The simulation results show that the algorithm can effectively solve the problem of node selection.
作者：
Liu, MinXu, ShijunSun, SiyiTongji Univ
Key Lab Embedded Syst & Serv Comp Sch Elect & Informat Engn Shanghai 201804 Peoples R China Tongji Univ
CIMS Res Ctr Sch Elect & Informat Engn Shanghai 201804 Peoples R China
Existing routing algorithms are not effective in supporting the dynamic characteristics of wireless sensor networks (WSNs) and cannot ensure sufficient quality of service in WSN applications. This paper proposes a nov...
详细信息
Existing routing algorithms are not effective in supporting the dynamic characteristics of wireless sensor networks (WSNs) and cannot ensure sufficient quality of service in WSN applications. This paper proposes a novel agent-assisted QoS-based routing algorithm for wireless sensor networks. In the proposed algorithm, the synthetic QoS of WSNs is chosen as the adaptive value of a Particle Swarm Optimization algorithm to improve the overall performance of network. Intelligent software agents are used to monitor changes in network topology, network communication flow, and each node's routing state. These agents can then participate in network routing and network maintenance. Experiment results show that the proposed algorithm can ensure better quality of service in wireless sensor networks compared with traditional algorithms. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.
Nowadays, the needs of healthcare for the elderly are growing rapidly. To provide continuous all-day medical monitoring and diagnoses at low cost, wireless body area networks (WBANs) have become a forward-looking tech...
详细信息
Nowadays, the needs of healthcare for the elderly are growing rapidly. To provide continuous all-day medical monitoring and diagnoses at low cost, wireless body area networks (WBANs) have become a forward-looking technology since it is regarded as a potential solution for the remote collecting of physical and symptoms information. Because of its application characteristics, reliability and delay are the most important, as the energy consumption also needs to be considered. However, due to the limitation of the large propagation loss and the complicated channel conditions, the existing routing algorithms cannot completely address the above problems. To balance the node energy consumption and reduce the transmission delay, a simplified energy-balanced alternative-aware routing algorithm (SEAR) for WBANs is proposed in this paper. The residual energy and the current load of a candidate of the next hop destination are considered during the routing request forwarding procedures. The required information is exchanged during the improved routing request and routing request response procedures, and the routing cost is modified accordingly. To improve the compatibility and robustness, the added path is introduced as an alternative path in our algorithm. The simulation results show that SEAR achieves significantly higher network residual energy and network throughput, and end-to-end delay is also reduced. Therefore, the lifetime of the network is extended effectively.
In order to reduce the protection-switching time when the fault occurs and realize the fast recovery of service, we propose a new routing algorithm-FSRA algorithm, based on KSP algorithm.
ISBN:
(纸本)9781943580705
In order to reduce the protection-switching time when the fault occurs and realize the fast recovery of service, we propose a new routing algorithm-FSRA algorithm, based on KSP algorithm.
Based on the study on communication situation of mobile ad hoc network (MANET) accessing Internet and taking the gateway important function of accessing network into account, a MANET accessing Internet routing algorit...
详细信息
Based on the study on communication situation of mobile ad hoc network (MANET) accessing Internet and taking the gateway important function of accessing network into account, a MANET accessing Internet routing algorithm based on dynamic gateway adaptive selection (MRBDAS) is presented. It considers candidate gateways’ connecting degree, load degree, residual energy, and movement rate synthetically and uses the idea of group decision-making method for reference. The algorithm employs the methods of multipaths and query localization technique based on old path information to maintain routing adaptively. Compared with the existing accessing routing algorithm based on dynamic gateway, the algorithm demonstrates in its simulations that by bringing dynamic gateways colony function, the MRBDAS can improve network throughput, reduce average transmission delay of data packets and routing overhead, and prolong accessing network life. The validity of MRBDAS has been proven.
Keywords routing algorithm - gateway selection - dynamic gateway - mobile ad hoc network (MANET) accessing
Multi-FPGA boards suffer from large timing delays in inter-FPGA physical tracks compared to intra-FPGA track delays, as well as a limited bandwidth between FPGAs due to the limited number of I/Os per FPGA. In order to...
详细信息
ISBN:
(纸本)9781479924097
Multi-FPGA boards suffer from large timing delays in inter-FPGA physical tracks compared to intra-FPGA track delays, as well as a limited bandwidth between FPGAs due to the limited number of I/Os per FPGA. In order to tackle this problem, an algorithm which routes multi-terminal nets in multi-point tracks is proposed in this paper to spare FPGA I/Os. Experiments are conducted using Gaisler Research Benchmarks. Firstly, each testbench will be implemented in an off-the-shelf board. The results show that the system frequency can be increased in the off-the-shelf board by the proposed routing algorithm. Secondly, an automatic design flow which generates a custom multi-FPGA board is enhanced by generating multi-point tracks in the board, and each testbench will be implemented with the proposed routing algorithm in custom boards. The results show that the system frequency is improved in the custom board with both 2- and multi-point tracks.
In Delay Tolerant Networks （DTNs）, some routing algorithms ignore that most nodes are selfish, i.e., nodes are willing to use their own resources to forward messages to nodes with whom they have a relationship. In v...
详细信息
In Delay Tolerant Networks （DTNs）, some routing algorithms ignore that most nodes are selfish, i.e., nodes are willing to use their own resources to forward messages to nodes with whom they have a relationship. In view of this phenomenon, we propose a routing algorithm based on Geographic Information and Node Selfishness （GINS）. To choose a forwarding node, GINS combines nodes＇ willingness to forward and their geographic information to maximize the possibility of contacting the destination. GINS formulates the message forwarding process as a 0-1 Knapsack Problem with Assignment Restrictions to satisfy node demands for selfishness. Extensive simulations were conducted, and results show that GINS can achieve a high delivery ratio and a lower hop count compared with GRONE and LPHU. Furthermore, its overhead ratio is 25% and 30% less than that of GRONE and LPHU, respectively.
暂无评论