This paper presents the process of organizing a teaching scenario through an online Learning Management System (LMS). For our scenario, we chose material from the teaching of the course of Computer Networks. In partic...
详细信息
In this paper, a mobile cluster Ad Hoc network model is presented for scenarios with large nodes number and high mobility. Intelligent optimization algorithms perform better than traditional routing algorithms in such...
详细信息
There exist numerous strategies for Source Location Privacy (SLP) routing schemes. In this study, an experimental analysis of a few routing schemes is done to investigate the influence of the routing scheme algorithms...
详细信息
ISBN:
(纸本)9781728108933
There exist numerous strategies for Source Location Privacy (SLP) routing schemes. In this study, an experimental analysis of a few routing schemes is done to investigate the influence of the routing scheme algorithms on the privacy protection level and the network lifetime performance. The analysis involved four categories of SLP routing schemes. Analysis results revealed that the algorithms used in the representative schemes for tree-based and angle-based routing schemes incur the highest influence. The tree-based algorithm stimulates the highest energy consumption with the lowest network lifetime while the angle-based algorithm does the opposite. Moreover, for the tree-based algorithm, the influence is highly dependent on the region of the network domain.
Resource-conscious technologies for cutting sheet material include the ICP and ECP technologies that allow for aligning fragments of the contours of cutouts. In this work, we show the mathematical model for the proble...
详细信息
Resource-conscious technologies for cutting sheet material include the ICP and ECP technologies that allow for aligning fragments of the contours of cutouts. In this work, we show the mathematical model for the problem of cutting out parts with these technologies and algorithms for finding cutting tool routes that satisfy technological constraints. We give a solution for the problem of representing a cutting plan as a plane graph G = (V,F,E), which is a homeomorphic image of the cutting plan. This has let us formalize technological constraints on the trajectory of cutting the parts according to the cutting plan and propose a series of algorithms for constructing a route in the graph G = (V,F,E), which is an image of an admissible trajectory. Using known coordinates of the preimages of vertices of graph G = (V,F,E) and the locations of fragments of the cutting plan that are preimages of edges of graph G = (V,F,E), the resulting route in the graph G = (V,E) can be interpreted as the cutting tool's trajectory. The proposed algorithms for finding routes in a connected graph G have polynomial computational complexity. To find the optimal route in an unconnected graph G, we need to solve, for every dividing face f of graph G, a travelling salesman problem on the set of faces incident to f.
Dijkstra and Bellman- Ford routing algorithms were applied to the CUDI (Consorcio Universitario para el Desarrollo de Internet 2 - University's Consortium for the Development of Internet 2) advanced network backbo...
详细信息
Dijkstra and Bellman- Ford routing algorithms were applied to the CUDI (Consorcio Universitario para el Desarrollo de Internet 2 - University's Consortium for the Development of Internet 2) advanced network backbone infrastructure. Some calculations and considerations are discussed in a very didactic way to understand how to apply both algorithms to a real advanced network backbone infrastructure such as the CUDI network, but these algorithms could also be applied to other advanced networks. A step by step simulation and emulation were developed in order to get an approach to actual function for CUDI, where OSPF V2 protocol is used, which uses the Dijkstra algorithm for routing.
Ad-Hoc Cognitive Networks are composed of mobile cognitive nodes that are expected to fulfill end-to-end user application objectives. Each cognitive node can change its radio parameters (spectrum) in order to improve ...
详细信息
ISBN:
(纸本)9781509021529
Ad-Hoc Cognitive Networks are composed of mobile cognitive nodes that are expected to fulfill end-to-end user application objectives. Each cognitive node can change its radio parameters (spectrum) in order to improve its efficiency and to avoid interference with licensed or unlicensed users. This paper proposes schemes for increasing user experience of such networks, considering channels bandwidth and routing decisions, where the transmission of each cognitive node is limited to only one of its channels. The main contribution of our schemes is a simple algorithm that increases the performance of such networks in various conditions.
Technologies Intermittent Cutting Problem and Endpoint Cutting Problem for cutting the sheet material belong to so called resource-saving technologies. These technologies allow to overlap the contours of cut-off detai...
详细信息
According to the problem that there are redundant control overheads in community partitioning phase and the large transmission delay and the low success rate in transmission phase in the community-based opportunistic ...
详细信息
According to the problem that there are redundant control overheads in community partitioning phase and the large transmission delay and the low success rate in transmission phase in the community-based opportunistic network,we propose EDCRA(Efficient Distributed Community-based routing algorithms for opportunistic networks).By distinguishing the community of the encounter node is single-node community or multi-node community,EDCRA simplify the interaction flow of the encounter node merging into other community in the community partitioning *** through the efficient cross-layer listening mechanism,the node carrying message find eligible forwarding nodes in its neighbor nodes in the data transmission phase,so that the message can be forwarded to the destination community more *** results show that the performance of EDCRA algorithm is higher than that of CR and Bubble Rap in terms of control overhead,average end-to-end delay and transmission success rate.
Technologies Intermittent Cutting Problem and Endpoint Cutting Problem for cutting the sheet material belong to so called resource-saving technologies. These technologies allow to overlap the contours of cut-off detai...
详细信息
Technologies Intermittent Cutting Problem and Endpoint Cutting Problem for cutting the sheet material belong to so called resource-saving technologies. These technologies allow to overlap the contours of cut-off details. This paper is devoted to review of mathematical models for cut-off (lie details by these technologies and algorithms for defining the cutter route according to some technological restrictions. (C) 2016, IFAC (International Federation of Automatic. Control) Hosting by Elsevier Ltd. All rights reserved.
It is necessary to select the best routing techniques to send the data from a network to the other efficiently through the subnet. routing refers to the process of gaining and distributing the information in a network...
详细信息
ISBN:
(纸本)9781509023998
It is necessary to select the best routing techniques to send the data from a network to the other efficiently through the subnet. routing refers to the process of gaining and distributing the information in a network. So far none of the algorithms provided the best choice for all the cases. This paper presents a simulator which is a routing simulator tool that measures the performances of the given routing algorithms. We present the performance analysis of routing algorithms such as Distance Vector, routing Information Protocol, Link state, Hot potato, Flooding, Source routing. Descriptions of the mentioned algorithms, with the details of the experiments conducted and their results are presented in the paper.
暂无评论