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.
In this paper, we firstly propose the concept of aerostat cluster in the space and ground integration network. Then we discuss the structure of the near space aerostat network based on the business requirements of communication. After that, we design the routing algorithm (named ISPR) in near space network and make an in-depth analysis. Lastly, we propose an access method (named G_AAT) to achieve...
In this paper the performance analysis of a routing algorithm for MANETs called Service Zone Gateway Prediction (SZGP) is presented. This is a non-cooperative and hybrid type of routing with a hierarchical multilayered structure, incorporating pre-computed multipath hop-by-hop distributed connectivity. The goal is balance of the load among the nodes and reliable and energy efficient communication...
It will cause the loss of information in the distributed satellite networks, if the network node is failure. For this problem, a method for distributed satellite networks based on standby nodes is presented in this paper. Firstly, it can establish a main path and confirm main nodes according to max-throughput principle in this method. Secondly, it can establish standby nodes set for the main path...
With the increasing device scaling in the semiconductor technology, the necessity for designing robust and efficient Networks-on-Chip (NoCs) is more pronounced. The rerouting approach which is employed in most of the fault-tolerant methods causes the network performance to degrade considerably due to taking longer paths and creating hotspots around the faults. In this paper, a dynamically reconfigurable...
Ternary Content Addressable Memory (TCAM) is becoming very popular for designing high-throughput forwarding engines on most of today's high-end routers. Despite its capability for line-speed queries, it is very power hungry and capacity inefficient. Many recent research efforts, such as CoolCAMs and SmartPC, were proposed to reduce power consumption by constructing a pre-classifier to activate TCAM...
Reconfigurable devices are widely attractive for several application fields thanks to their size, rapid prototyping characteristics, flexibility and upgradability. Thanks to partial Reconfiguration features, FPGA becomes the golden core of the adaptive computation paradigm since they may dynamically change their functionalities based on the elaboration request. Today, adaptive computation is mainly...
We design a metric to measure the occupied holding time difference of frequency slots. With the metric, a routing and spectrum allocation algorithm in dynamic scenario is proposed to improve the network spectral utilization. Evaluation results show the proposed algorithm outperforms obviously in blocking probability.
The balance of searching time and storage space is a problem in routing lookup. The algorithm has solved it to some extent. It is based on IPv6 prefix distribution and adopts different approaches to divide and compress different prefixes. The prefixes that can be divided exactly are concentrated compression. Other prefixes that can't be divided exactly are handled with multi-branch tree method. According...
A radial increment WSN routing algorithm(RIRA) is proposed to reduce energy consumption and improve transmission efficiency caused by complex environment and narrow tunnel of deep mine, in which the wired network layout is limited. Multi-hop routing methods between clusters can reduce energy consumption. A weighting formula is constructed to select cluster heads, the greater the weight, the more likely...
With the aim to solve the frequent network reconfiguration problem caused by link failure in the broadband powerline communication (BPLC) system, this paper inroduces the two-way power frequency automatic communication system (TWACS) into current BPLC system. And in this BPLC and TWACS integrated communication system, a TWACS signaling based routing searching algorithm is proposed, to meet the requirements...
CGRA (Coarse-Grained Reconfigurable Array) is competitive hardware architecture for streaming applications due to its excellent tradeoff between programmability and efficiency. However, the efficiency of CGRA highly depends on how applications are mapped onto it with optimized operation placement and data routing. In the routing procedure, data are transferred through different processing elements...
This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication...
The link of wireless sensor networks used in home automation may be instable due to the effects of shadow fading. Designing a suitable routing algorithm to improve the packet delivery ratio and reduce the delay in shadow fading environment is strongly required, and therefore the Link-State-Aware Routing for Wireless Sensor Network in Home Automation (LSAR-WSNHA) algorithm is proposed. However, when...
Wireless Mesh Networks (WMNs) employ hybrid distributed mobile networks with instant deployment and capabilities Such as: self_healing, self_organization and self_configuration. These abilities make WMNs a likely technology for incident communication. An Incident Area Network (IAN) requires a reliable and efficient routing path in an environment, where infrastructure-based communications have been...
In this paper a new RMLSA (Routing, Modulation Level, and Spectrum Assignment) algorithm is presented. The proposal leverages on the potential usage of intermediate modulation format conversion to increase the optical reach or being able to use route segments with lower available capacity.
Aiming at the problem that the node energy is limited, the network cycle is short and the throughput is low in the wireless sensor network, Dynamic Routing Protocol Based on Clustering was proposed known as KACO (K-means and Ant Colony Optimal). At the beginning it employs ant colony optimal and k-means algorithm to form cluster, and the novel method which consider the energy ratio, node location...
Ultra-scale devices based on technologies below 20nm are nowadays widely adopted due to their elevated computing features and low power consumption. These characteristics made them attractive even for fields where the high reliability is the major concern like automotive or aerospace ones. In order to guarantee a high reliability level, one of the major challenge in these application fields is the...
In order to shorten the required time for the analysis of medical substances, Digital Microfluidic Biochips (DMFBs) have been suggested. They allow for handling small amounts of samples and reagents on a circuit board and, thus, automatically execute medical experiments that are usually conducted manually in laboratories. However, there are various challenges in the design of DMFBs. Issues such as...
Unwanted manipulation of layouts during the fabricating has been a major concern in current chip manufacturing process. Hardware Trojan insertion requires some resources such as white spaces and routing channels to place the Hardware Trojan components and maintain its connections. Conventional layout generation algorithms do not consider the security metrics during design cycle. In this paper, we...
Multi-level clustering offers the scalability that is essential to large-scale ad hoc and sensor networks in addition to supporting energy-efficient strategies for gathering data. The optimality of a multi-level network largely depends on two design variables: 1) the number of levels and 2) the number of nodes operating at each level. We characterize these variables within a multi-hop multi-level...
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.