. NDN naturally supports multicast better than the traditional Internet, and multicast plays an important role in NDN. Most researchs on multicast routing algorithms are focused on cost optimization without taking nod...
详细信息
PEX, PEX-ROR, GRP and other special bit permutation instructions support fewer types of permutation, but they need complicated control information configuration and large hardware. In order to solve the problems, a ne...
详细信息
The Vehicular ad-hoc network (VANET) is suitable for transmitting information in an intelligent transportation system in the smart city scenarios, but it requires real-time and accurate communications. To achieve effe...
详细信息
This paper investigates the potential output power of photovoltaic (PV) installations on top of battery-powered electric vehicles (BEVs) and hybrid electric vehicles (HEVs). By choosing different routes within urban a...
详细信息
ISBN:
(数字)9781728144603
ISBN:
(纸本)9781728144610
This paper investigates the potential output power of photovoltaic (PV) installations on top of battery-powered electric vehicles (BEVs) and hybrid electric vehicles (HEVs). By choosing different routes within urban areas, we expect different output power levels from the vehicle's PV installation. Hence, we calculate energy profiles to estimate the PV energy which can be gained during driving conditions to choose the most energy-efficient route for BEVs and HEVs. While driving duration, driving distance and traffic conditions are some of the criteria within the decision-making process of routing algorithms, in this paper, we focus on energy-efficiency of routing algorithms. We present experimental data to highlight the importance of energy profiles for improving and maximising of the electrical driving distance of BEVs and HEVs.
In recent years, with the vigorous development of the video business market, the competition among service providers has become increasingly fierce. The key to winning the competition depends on the Quality of Experie...
详细信息
Although the traditional ring network can provide more secure and stable services, it is not satisfactory in terms of network delay and transmission efficiency. The augmented ring network structure and the complex mul...
详细信息
The task of constructing the cutting path of the tool when the part cut off from the sheet does not require additional cuts and the trajectories of cuts intersections are forbidden (the touches is allowed) may arise i...
详细信息
Topology structure has been studied as an important aspect which influences the performance of Data Center (DC). Recently, we proposed a novel topology structure named MSTS structure. MSTS structure is a multi-layer t...
详细信息
During the technological preparation of the cutting process, it is necessary to determine the path of the cutter when there are no self-intersections of the cutting path and the part cut off from the sheet does not re...
详细信息
During the technological preparation of the cutting process, it is necessary to determine the path of the cutter when there are no self-intersections of the cutting path and the part cut off from the sheet does not require any cuts, then arise the problems: first, representation of the cutting plan as a planar graph which is the homeomorphic image of the cutting plan; second, algorithms to find the cutter routes in this graph. The paper is devoted to a polynomial-time algorithm for constructing a non-intersecting ordered enclosing chain ( NOE -chain) for a plane Eulerian graph. The proposed approach consists in splitting of all original graph vertices with degree higher than 4 by introducing fictive vertices and edges and, thus, reducing the considered earlier problem to the problem of finding an A-chain with ordered enclosing in a plane connected 4-regular graph. A test example of constructing NOE -chain with ordered enclosing is considered.
One major concern shared by many researchers about underwater wireless sensor networks (UWSNs), with respect to the limitations and particularities of underwater environment, is the problem of routing. These limitatio...
详细信息
One major concern shared by many researchers about underwater wireless sensor networks (UWSNs), with respect to the limitations and particularities of underwater environment, is the problem of routing. These limitations include three-dimensional topology, limited bandwidth, node movement, long delay, limited energy, and construction costs. The new routing protocols for underwater networks have been developed on the basis of voracious routing systems. The main problem with UWSNs is finding an efficient route between the source and the target to send more packets to the target with lower levels of energy consumption. In this research, by improving VBF algorithm, which is dependent on the radius of the routing pipe, an algorithm is introduced which considers pipe radius as a function of the environment's dimensions and of the range and the number of nodes. Consequently, by changing one of these parameters, the radius of the routing pipe changes. However, to control the energy consumed by the nodes, there exists a function that, if the recipient node's energy to receive the packet is much lower than that of the sender node, the proposed method reduces the size of the routing pipe's radius to lessen its chance of being selected as the guiding node so that other nodes are able to have the chance of getting the packet's guiding node. The proposed algorithm has been compared with VBVA, HHVBF, and VBF protocols;the simulation results obtained from NS-2 simulator indicate that the proposed protocol could cut back on energy consumption, especially in networks with high number of nodes, by relying on changing the width of the routing pipe in proportion to network density. It was also successful in delivering more packets in non-dense networks.
暂无评论