Journal articles on the topic 'Node generation'
To see the other types of publications on this topic, follow the link: Node generation.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Node generation.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Li, Na, Yong Gang Li, and Qing Jie Zhou. "Power Flow Calculation Based on Power Losses Sensitivity for Distribution System with Distributed Generation." Applied Mechanics and Materials 391 (September 2013): 295–300. http://dx.doi.org/10.4028/www.scientific.net/amm.391.295.
Full textAbstract:
The introduction of distributed generation (DG) into distribution network will greatly impact on its operation and security inevitably, load flow calculation with distributed generations is the basic premise for the optimization planning and operation of distribution network, so the power flow in distribution network containing DG should be calculated .This paper analyzes several common DG in the former back flow calculation and mathematical model, with the first generation method fail to deal with PV node problem, improves back/forward substitution method based on node-layer, the branch search method is presented to form node impedance matrix to modify the PV node reactive injection. so that it can effectively deal with PV nodes, and the program written by matlab7.1, several schemes are designed for the different modes of DGS and are tested in IEEE33 node system and verifies the feasibility of the method, the reliability of the program.
2
Hübschle-Schneider, Lorenz, and Peter Sanders. "Linear work generation of R-MAT graphs." Network Science 8, no. 4 (May 29, 2020): 543–50. http://dx.doi.org/10.1017/nws.2020.21.
Full textAbstract:
AbstractR-MAT (for Recursive MATrix) is a simple, widely used model for generating graphs with a power law degree distribution, a small diameter, and communitys structure. It is particularly attractive for generating very large graphs because edges can be generated independently by an arbitrary number of processors. However, current R-MAT generators need time logarithmic in the number of nodes for generating an edge— constant time for generating one bit at a time for node IDs of the connected nodes. We achieve constant time per edge by precomputing pieces of node IDs of logarithmic length. Using an alias table data structure, these pieces can then be sampled in constant time. This simple technique leads to practical improvements by an order of magnitude. This further pushes the limits of attainable graph size and makes generation overhead negligible in most situations.
3
Cynthia, Antony, and V. Saravanan. "Tango Binary Search Tree Based Asymmetric Cryptographic Sensor Node Authentication for Secured Communication in Wireless Sensor Networks." Sensor Letters 18, no. 1 (January 1, 2020): 55–63. http://dx.doi.org/10.1166/sl.2020.4189.
Full textAbstract:
Wireless sensor network (WSN) comprises the group of sensor nodes distributed to sense and monitor the environments and collects the data. Due to the distributed nature of the sensor nodes, security is a major role to access the confidential data and protect the unauthorized access. In order to improve the secure communication, authentication is essential process in WSN. A Tango Binary Search Tree based Schmidt Cryptographic Sensor Node Authentication (TBST-SCSNA) technique is introduced for secured data communication in WSN with higher authentication accuracy. Initially, the trust values for each sensor nodes are calculated for increasing the security in data communication. The sensor nodes in WSN are arranged in tango binary search tree based on the trust value. The nodes in tree are inserted or removed based on their deployment. After that, the Schmidt-Samoa cryptographic technique is applied for node authentication and secure data communication. The cryptographic technique comprises three processes key generation, encryption and decryption. In key generation phase, the public key (i. e., node_ID) are generated and distributed for the sensor nodes and private key is kept secret using Schmidt-Samoa algorithm. The root node is embedded with a key during the deployment and it is controlled the entire the sensor nodes in the path. A Parent node generates the keys for child node based on the ID of parent node. After the key generation, the sender node encrypts the data packet and transmits to receiver node in the tree with the receiver node ID. After that, the receiver node enters their private key and verifies it with already stored key at the time of key generation. If both keys are same, then the node is said to be authentic node. Otherwise, the sensor node is said to be a malicious node. The authentic node only receives the original data packets. This process gets repeated till all the nodes in the path verify their identities and performs the secure communication. Simulation is carried out with different parameters such as authentication accuracy, authentication time and security level with respect to a number of sensor nodes and a number of data packets. The results observed that the TBST-SCSNA technique efficiently improves the node authentication accuracy, security level with minimum time than the state-of-the-art-methods.
4
FUJISAWA, TOSHIMITSU, and GENKI YAGAWA. "A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE." International Journal of Computational Methods 01, no. 02 (September 2004): 241–65. http://dx.doi.org/10.1142/s0219876204000149.
Full textAbstract:
In this paper, a FEM-based meshfree method with a probabilistic node generation technique is presented. In the proposed method, all computational procedures, from the mesh generation to the solution of a system of equations, can be performed seamlessly in parallel in terms of nodes. Local finite element mesh is generated robustly around each node, even for acute boundary shapes such as cracks. The algorithm and the data structure of finite element calculation are based on nodes, and parallel computing is realized by dividing a system of equations by the row of the global coefficient matrix. In addition, the node-based finite element method is accompanied by a probabilistic node generation technique, which generates good-natured points for nodes of finite element mesh. Furthermore, the probabilistic node generation technique can be performed in parallel environments. As a numerical example of the proposed method, we perform a compressible flow simulation containing strong shocks. Numerical simulations with frequent mesh refinement, which are required for such kind of analysis, can be effectively performed on parallel processors by using the proposed method.
5
Ribeiro, Leonardo F. R., Yue Zhang, Claire Gardent, and Iryna Gurevych. "Modeling Global and Local Node Contexts for Text Generation from Knowledge Graphs." Transactions of the Association for Computational Linguistics 8 (September 2020): 589–604. http://dx.doi.org/10.1162/tacl_a_00332.
Full textAbstract:
Recent graph-to-text models generate text from graph-based data using either global or local aggregation to learn node representations. Global node encoding allows explicit communication between two distant nodes, thereby neglecting graph topology as all nodes are directly connected. In contrast, local node encoding considers the relations between neighbor nodes capturing the graph structure, but it can fail to capture long-range relations. In this work, we gather both encoding strategies, proposing novel neural models that encode an input graph combining both global and local node contexts, in order to learn better contextualized node embeddings. In our experiments, we demonstrate that our approaches lead to significant improvements on two graph-to-text datasets achieving BLEU scores of 18.01 on the AGENDA dataset, and 63.69 on the WebNLG dataset for seen categories, outperforming state-of-the-art models by 3.7 and 3.1 points, respectively. 1
6
Shen, Xue, and Ran Li. "The Research for the Voltage of Distribution Network Including Distributed Generation." Applied Mechanics and Materials 521 (February 2014): 183–86. http://dx.doi.org/10.4028/www.scientific.net/amm.521.183.
Full textAbstract:
There is a challenge to the voltage stability of distribution network when DG is added to the distribution network. By means of theoretical derivation, three conclusions had been got. The amplitudes of node voltage would rise including DG. The more capacity of DG, the higher node voltages. The same capacity of DG met different nodes would have different effects on the node voltages. The farther away from the equilibrium node, the higher voltages. Through a case, the correctness of theoretical analysis had been proved.
7
Abidin, Zainal, and Agus Zainal Arifin. "Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi." CAUCHY 1, no. 2 (May 15, 2010): 97. http://dx.doi.org/10.18860/ca.v1i2.1706.
Full textAbstract:
Edges generation by random graph erdos-royi methods was needed high computation, it’s caused low performance. In fact, edge generation was used frequently with many nodes. this paper is described a node restriction by k-nearest neighbour on edge generation of random graph erdos royi method. Result of node<br />restriction by k-nearest neighbour can be reduced computation time.
8
Zamolo, Riccardo, and Enrico Nobile. "Node generation in complex 3D domains for heat conduction problems solved by RBF-FD meshless method." Journal of Physics: Conference Series 2116, no. 1 (November 1, 2021): 012020. http://dx.doi.org/10.1088/1742-6596/2116/1/012020.
Full textAbstract:
Abstract A novel algorithm is presented and employed for the fast generation of meshless node distributions over arbitrary 3D domains defined by using the stereolithography (STL) file format. The algorithm is based on the node-repel approach where nodes move according to the mutual repulsion of the neighboring nodes. The iterative node-repel approach is coupled with an octree-based technique for the efficient projection of the nodes on the external surface in order to constrain the node distribution inside the domain. Several tests are carried out on three different mechanical components of practical engineering interest and characterized by complexity of their geometry. The generated node distributions are then employed to solve a steady-state heat conduction test problem by using the Radial Basis Function-generated Finite Differences (RBF-FD) meshless method. Excellent results are obtained in terms of both quality of the generated node distributions and accuracy of the numerical solutions.
9
Felner, Ariel, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Robert Holte, and Jonathan Schaeffer. "Partial-Expansion A* with Selective Node Generation." Proceedings of the International Symposium on Combinatorial Search 3, no. 1 (August 20, 2021): 180–81. http://dx.doi.org/10.1609/socs.v3i1.18227.
Full textAbstract:
A* is often described as being 'optimal,' in that it expands the minimum number of unique nodes. But, A* may generate many extra nodes which are never expanded. This is a performance loss, especially when the branching factor is large. Partial Expansion A* (PEA*) addresses this problem when expanding a node, n, by generating all the children of n but only storing children with the same f-cost as n. We introduce an enhanced version of PEA* (EPEA*). Given a priori domain knowledge, EPEA* only generates the children with the same f-cost as the parent. State-of-the-art results were obtained for a number of domains. Drawbacks of EPEA* are also discussed. A full version of this paper appears in the proceedings of AAAI-2012
10
BATTEY, BRET. "Musical pattern generation with variable-coupled iterated map networks." Organised Sound 9, no. 2 (August 2004): 137–50. http://dx.doi.org/10.1017/s1355771804000226.
Full textAbstract:
This paper introduces the concept of variable-coupled iterated map networks and explores its application to generation of musical textures. Such networks consist of one or more interlinked nodes. Each node consists of an iterated map function with a time-delay factor that schedules successive iterations. The value broadcast by a node can drive the variables and time-delay factor of any other nodes in the network, including itself. Lehmer's Linear Congruence Formula, an iterated map normally used for production of pseudo-random numbers, is explored for its own potential as a pattern generator and is used as the iterated map in the nodes in the examples presented. The capacity of these networks to produce richly gestural behaviours and mid-term modulation of behaviour is demonstrated.
11
Felner, Ariel, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Jonathan Schaeffer, and Robert Holte. "Partial-Expansion A* with Selective Node Generation." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 471–77. http://dx.doi.org/10.1609/aaai.v26i1.8137.
Full textAbstract:
A* is often described as being `optimal', in that it expands the minimum number of unique nodes. But, A* may generate many extra nodes which are never expanded. This is a performance loss, especially when the branching factor is large. Partial Expansion A* addresses this problem when expanding a node, n, by generating all the children of n but only storing children with the same f-cost as n. n is re-inserted into the OPEN list, but with the f-cost of the next best child. This paper introduces an enhanced version of PEA* (EPEA*). Given a priori domain knowledge, EPEA* generates only the children with the same f-cost as the parent. EPEA* is generalized to its iterative-deepening variant, EPE-IDA*. For some domains, these algorithms yield substantial performance improvements. State-of-the-art results were obtained for the pancake puzzle and for some multi-agent pathfinding instances. Drawbacks of EPEA* are also discussed.
12
Bi, Jia Na, and E. Xu. "An Energy-Efficient Security Node-Based Key Management Protocol for WSN." Applied Mechanics and Materials 347-350 (August 2013): 2117–21. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2117.
Full textAbstract:
A security node-based key management protocol is proposed for cluster-based sensor networks. Member nodes and cluster heads are responsible for data collection and transmission. Security nodes are responsible for key management. Security nodes restrain key management function of cluster heads, and reduce damage of captured cluster heads. Generation of security nodes and different kinds of keys is described. Performance analysis and simulation show that the proposed key management protocol consumes less energy, and its delay time of key generation is short. At the same time, the protocol can provide more collaborative authentication security for keys. It has strong resilience against node capture, and can support large scale network.
13
Jiao, Peng, Shengjun Huang, Bo Jiang, and Tao Zhang. "Optimal Topology Design for Distributed Generation Networks Considering Different Nodal Invulnerability Requirements." Symmetry 14, no. 5 (May 16, 2022): 1014. http://dx.doi.org/10.3390/sym14051014.
Full textAbstract:
Distributed generators and microgrids are of great importance for the stable operation of power systems when failures occur. The major work of this paper is proposing an optimal topological design model of preset connection lines, aiming at a distributed power generation network based on different nodal invulnerability requirements. Moreover, the important innovation of this paper lies in that the perspective is shifted from the system to an individual node of a different type. When a node malfunction occurs, the faulty node can be connected to its neighbor nodes by closing a switch to achieve energy exchange. The distributed generation network consists of a series of nodes that can realize self-sufficiency and can be classified into three types with different levels of importance according to their tasks. The nodes of different types must meet different requirements of destructibility. In this paper, a mixed-integer linear programming model is formulated to solve the optimal topology design problem. In addition, this paper also analyzes the influence of changing nodal power generation capacity and nodal type, and the simulation results show the practicability of the proposal.
14
Jiang, Feng Li, Zai Lin Piao, and Li Di Wang. "A New Backward/Forward Algorithm for Weakly Meshed Distribution Systems with Distributed Generation." Applied Mechanics and Materials 541-542 (March 2014): 1027–31. http://dx.doi.org/10.4028/www.scientific.net/amm.541-542.1027.
Full textAbstract:
According to the analysis of the network topological structure, an improved backward/forward sweep algorithm was proposed. The algorithm can be applied for weakly meshed distribution systems with distributed generation (DG). The method developed an incidence matrixbranch current-bus current injection matrix. A meshed network was converted to a radial network by breaking the loops at the ending nodes of link branches. The mathematical models of DG were established as PV and PQ node. For PV nodes, this paper used a dummy node and dummy branch which inject reactive power to the specified node to maintain the specified voltage value. IEEE 33-bus test feeder was used to verify the correctness and convergence of the proposed algorithm. Moreover, the impact of both weakly meshed and DG on voltage profile and convergence was also investigated.
15
Song, Xu Dong, Nan Hua Yu, Zhong Chen, and Peng Peng Zong. "The Research of Control Strategy Based on Hierarchical Consistency Algorithm in Active Distribution Network." Advanced Materials Research 1008-1009 (August 2014): 756–61. http://dx.doi.org/10.4028/www.scientific.net/amr.1008-1009.756.
Full textAbstract:
With the increase of renewable energy in distribution network, development of active distribution network adapt to the control and management of distributed generation. In order to adapt to the increase of distributed generation which makes the distribution network expansion planning more complex, This paper presents an active control method of hierarchical consistency to control distributed generation when the load changes. Each control objectives need to interact with the neighboring targets, and it can achieve the goal of global optimal control without global information. The method classifies the distributed generation node, and achieves the ultimate goal of consistency based on the information communication of local distributed generation by monitoring the power of main distributed generation node and other distributed generation nodes in each layer. The efficiency and feasibility of the strategy are demonstrated by IEEE26 system.
16
Lee, Eun, Dong Seo, and Yun Chung. "An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks." Applied Sciences 8, no. 11 (November 10, 2018): 2215. http://dx.doi.org/10.3390/app8112215.
Full textAbstract:
In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.
17
Deng, Xiaohong, Zhiqiong Luo, Yijie Zou, Kangting Li, and Huiwen Liu. "A Novel Semifragile Consensus Algorithm Based on Credit Space for Consortium Blockchain." Security and Communication Networks 2022 (April 18, 2022): 1–13. http://dx.doi.org/10.1155/2022/1955141.
Full textAbstract:
Nowadays, blockchain is known as a new generation of secure information technologies for realizing business and industrial sustainability, and consensus algorithm is the key technology of blockchain. In order to solve the problem of “oligarchy” nodes and excessive punishment for nodes in existing credit consensus algorithms, a novel semifragile consensus algorithm based on the credit space for consortium blockchain is proposed in this paper. Firstly, the accounting node selection mechanism based on credit space is proposed. The credit value of the node is calculated according to a novel credit evaluation model, and then the credit space of the node is allocated according to the size of the credit value. Afterward, a random algorithm is used to select the accounting node in the credit space. This mechanism effectively inhibits the generation of “oligarchy” nodes and maintains the enthusiasm of nodes. Secondly, this paper proposes a semifragile hierarchical punishment mechanism, which punishes the malicious nodes with severe measures and gives the nonmalicious nodes the opportunity to continue participating in the consensus. So, this semifragile punishment mechanism solves the problem of excessive punishment of nodes. Experimental simulation results demonstrate that the proposed consensus algorithm has randomness while maintaining the credit incentive among nodes. In addition, the node’s punishment mechanism is more reasonable. This algorithm has better security and can be well applied to consortium blockchain scenarios.
18
Zhang, Yajun, Gang Qiu, Meng Liu, and Hongjun Wang. "High-density data transmission and scheduling method in wireless sensor networks based on Wi-Fi." International Journal of Distributed Sensor Networks 16, no. 7 (July 2020): 155014772094341. http://dx.doi.org/10.1177/1550147720943414.
Full textAbstract:
In wireless sensor network, the storage amount of information is high, and the transmission and scheduling of control information is reasonable. The node communication model, network structure model, and energy consumption model are constructed. On this basis, the high-density data in wireless sensor network are scheduled to optimize the time for nodes to perform tasks. The nodes in the network are fully scheduled to control the generation time of packets in the network and the generation time of packets in the network. Experimental results show that in different iterations, the proposed method has lower node delay and node energy consumption, with values less than 0.2 and 2, respectively, and the maximum data fusion quality can reach 98, with high fusion benefits, so as to improve the transmission and scheduling efficiency and quality of high-density data in wireless sensor network.
19
Et. al., G. Asha Jyothi. "A Privacy Preserving and Efficient Randomness Routing in Adhoc Wireless Network." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 10, 2021): 5583–88. http://dx.doi.org/10.17762/turcomat.v12i3.2224.
Full textAbstract:
Now a day’s automatic key establishment of any two devices in the network is placed an important role and generation of key is used for public key based algorithm. By using public key based algorithm we can automatically generated secret key any two devices in the network. So that by performing this process we can randomly generate secret key. In the ad hoc networks another concepts is routing from source node to destination node. The generation of routing process can be done by randomly and performing this process we can improve the efficiency in the routing. In this paper we are implementing random routing of secure data transmission protocol for generating routing and provide privacy of transferred message. By implementing this protocol we can provide random routing process for transferring message. Before transferring message the server will randomly generate routing for source node to destination node. After that the source node will send data to destination node. Before transferring message or data the source node will encrypt and send the cipher format data to destination node. The destination node will retrieve cipher format data and perform the decryption process. After completion of decryption process the destination node will get original message. By implementing those concepts we can improve the efficiency for generating routing and also provide security of transferring message.
20
Pan, Jian Min, and Qing Hua Shi. "Density-Based Energy-Efficient Unequal Clustering." Applied Mechanics and Materials 568-570 (June 2014): 608–13. http://dx.doi.org/10.4028/www.scientific.net/amm.568-570.608.
Full textAbstract:
In this paper, we propose a Density-based Energy-Efficient Unequal Clustering (DEEUC) algorithm to solve the energy consumption imbalance problem of the nodes deployed randomly. The algorithm balances the energy consumption of the cluster by making nodes as cluster head in turn and taking the remaining energy into consideration, which makes the generation of the cluster head more reasonable. It balances the energy consumption of the cluster by generating unequal cluster with different radius based on nodes density and the distance to the sink. In the routing strategy, the cluster head node with high density is chosen as the next hop, which makes the selected node undertake more data forwarding tasks, and balances the regional energy consumption. The simulation experiments show that this algorithm can effectively balance the network energy consumption and prolong the network lifetime.
21
KUPERSHTEIN, LEONID, and MYKHAILO KRENTSIN. "ANALYSIS OF PEER-TO-PEER NETWORKS TRENDS." HERALD OF KHMELNYTSKYI NATIONAL UNIVERSITY 299, no. 4 (October 2021): 26–29. http://dx.doi.org/10.31891/2307-5732-2021-299-4-26-29.
Full textAbstract:
The concept and nature of peer-to-peer networks are analyzed, a short history of their development is researched and presented. The first network of this type (Usenet), its features and prerequisites are described. Three types of peer-to-peer network architectures are considered – pure, federal and hybrid; advantages and disadvantages of each. The hybrid architecture is the most widely used today, as using a central server to connect nodes is a promising approach. Three generations of peer-to-peer networks are considered and their architectural features are presented. The first generation involved only file sharing, its feature was the use of a central server, which had information about which node contains which file. The second generation was characterized by the absence of a central server, but there was no indexing of nodes and data, which caused long delays in finding a node to connect. The third generation is more advanced, because it provides storage in each node of hash tables with information about other network members. The main advantages and disadvantages of peer-to-peer network architectures are investigated. A comparative analysis of peer-to-peer and multi-peer networks is performed. It is determined that it is more expedient to use decentralized networks in comparison with centralized ones, especially in cases where anonymity, confidentiality, fault tolerance and scalability are a priority. The most known directions of practical use of peer-to-peer networks are investigated. Today they are used in chat systems, banks, cryptocurrency systems, video communication systems. Decentralized systems are also used when working with digital wallets, because it makes online payments more effective.
22
Sun, Lu, and Guo Qun Zhao. "Surface Matching Technique in Hexahedral Element Mesh Generation with Inside-Out Grid-Based Method." Key Engineering Materials 474-476 (April 2011): 908–14. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.908.
Full textAbstract:
Surface matching technique is a key technique in automatic generation of 3D finite element mesh. In this paper, a surface matching technique including surface-gap filling, boundary match and C-node match, is introduced. Eight types of free facet configurations and their corresponding matching rules are established. Then a combined method of priority nodes and relative position relationships for boundary match is presented, and an effective method for C-node match is given, too. The methods can achieve precise match between mesh boundaries and model boundaries, and establish reasonable geometry and topology connections of matched nodes. Several examples are provided to demonstrate the accuracy and efficiency of the algorithms presented in this paper.
23
Kim, Seon-Ho, Kyung-Oh Lee, Yoon-Jae Chae, Ho-Won Lee, and Yoon-Yong Park. "A Topology Map Generation Algorithm for Optimal Path Finding for Image-Based Maps." Applied Sciences 12, no. 23 (December 5, 2022): 12436. http://dx.doi.org/10.3390/app122312436.
Full textAbstract:
Algorithms that automatically search for routes have various applications, such as games, navigation, and robots, and are used to create optimal paths in the space of real and virtual worlds. This paper introduces an indoor navigation algorithm allowing rescuers to create a topology map of floor plans, given that the amount of data provided by conventional mapping constructs is limited. Traditional pathfinding algorithms include the A* algorithm, which has demonstrated excellent performance; however, its applicability is limited in the case of high-resolution images, as the number of nodes increases significantly. Here, we use the corner node algorithm (CNA) to improve pathfinding performance by preprocessing the data to create a topology map for the pathfinding algorithm. The algorithm can reduce the number of nodes required for the pathfinding process by generating topology maps in advance through two preprocessing processes: node creation and node connection. This effectively reduces the number of nodes to be processed, as well as the error rate when creating more accurate routes. Furthermore, a generated topology map can be reused by the algorithm unless its structure changes, which enhances efficiency. For the user, this means that the sought-after mapping information of the floor plan is quickly made available for navigation. With this algorithm, we created an augmented reality navigation solution to display virtual objects for rescuers, to demonstrate the enhanced performance of our approach.
24
van der Sande, Kiera, and Bengt Fornberg. "Fast Variable Density 3-D Node Generation." SIAM Journal on Scientific Computing 43, no. 1 (January 2021): A242—A257. http://dx.doi.org/10.1137/20m1337016.
Full text
25
Smirnov, A. V., and H. Zhang. "Physically Based Node Distributions For Mesh Generation." International Journal of Modelling and Simulation 28, no. 2 (January 2008): 182–87. http://dx.doi.org/10.1080/02286203.2008.11442466.
Full text
26
Rauniyar, Ashish, Paal Engelstad, and Olav Østerbø. "RF Energy Harvesting and Information Transmission Based on NOMA for Wireless Powered IoT Relay Systems." Sensors 18, no. 10 (September 27, 2018): 3254. http://dx.doi.org/10.3390/s18103254.
Full textAbstract:
Amidst the rapid development of the fifth generation (5G) networks, Internet of Things (IoT) is considered as one of the most important part of 5G next generation networks as it can support massive object communications. These massive object communications in the context of IoT is expected to consume a huge power. Furthermore, IoT sensors or devices are rather power constrained and are mostly battery operated. Therefore, energy efficiency of such network of IoT devices is a major concern. On the other hand, energy harvesting (EH) is an emerging paradigm that allows the wireless nodes to recharge themselves through radio frequency (RF) signals directed to them from the source node and then relaying or transmitting the information. Although a myriad of works have been carried out in the literature for EH, the vast majority of those works only consider RF EH at the relay node and successfully transmitting the source node data. Those approaches do not consider the data transmission of the relay node that may be an energy deprived IoT node which needs to transmit its own data along with the source node data to their respective destination nodes. Therefore, in this paper, we envisioned a RF EH and information transmission system based on time switching (TS) relaying, power splitting (PS) relaying and non-orthogonal multiple access (NOMA) which is suitable for wireless powered IoT relay systems. A source node information data is relayed through power constrained IoT relay node I o T R that first harvests the energy from source node RF signal using either TS and PS relaying protocol and then transmits the source node information along with its information using NOMA protocol to the respective destination nodes. Considering NOMA as a transmission protocol, we have mathematically derived analytical expressions for TS and PS relaying protocol for our proposed system. We have also formulated an algorithm to find out optimal TS and PS factor that maximizes the sum-throughput for our proposed system. Our proposed system analytical results for TS and PS protocol are validated by the simulation results.
27
Kanwal, Samira, Zeshan Iqbal, Aun Irtaza, Muhammad Sajid, Sohaib Manzoor, and Nouman Ali. "Head Node Selection Algorithm in Cloud Computing Data Center." Mathematical Problems in Engineering 2021 (July 24, 2021): 1–12. http://dx.doi.org/10.1155/2021/3418483.
Full textAbstract:
Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes’ selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they select the head nodes without taking the resources of the nodes. Still, there is a need for the candidate node which can be selected as a head node in case of head node failure. Therefore, in this paper, we proposed a technique, i.e., Head Node Selection Algorithm (HNSA), for optimal head node selection from the data center, which is based on the genetic algorithm (GA). In our proposed method, there are three modules, i.e., initial population generation, head node selection, and candidate node selection. In the first module, we generate the initial population by randomly mapping the task on different servers using a scheduling algorithm. After that, we compute the overall cost and the cost of each node based on resources. In the second module, the best optimal nodes are selected as a head node by applying the genetic operations such as crossover, mutation, and fitness function by considering the available resources. In the selected optimal nodes, one node is chosen as a head node and the other is considered as a candidate node. In the third module, the candidate node becomes the head node in the case of head node failure. The proposed method HNSA is compared against the state-of-the-art algorithms such as Bees Life Algorithm (BLA) and Heterogeneous Earliest Finished Time (HEFT). The simulation analysis shows that the proposed HNSA technique performs better in terms of execution time, memory utilization, service level sgreement (SLA) violation, and energy consumption.
28
Duan, Peiran, Bingluo Gu, Zhenchun Li, Zhiming Ren, and Qingyang Li. "An adaptive node-distribution method for radial-basis-function finite-difference modeling with optimal shape parameter." GEOPHYSICS 86, no. 1 (January 1, 2021): T1—T18. http://dx.doi.org/10.1190/geo2019-0670.1.
Full textAbstract:
The radial-basis-function finite-difference (RBF-FD) method has been proven successful in modeling seismic-wave propagation. Node distribution is typically the first and most critical step in RBF-FD. Regarding the difficulties in seismic modeling, such as node distribution of complex geologic structures, we have designed an adaptive node-distribution method that can generate nodes automatically and flexibly as the computation proceeds with the adaptive grain-radius satisfied dispersion relation and stability condition of seismic-wave propagation. Our method consists of two novel points. The first one is that we adopt an adaptive grain-radius generation method, which can automatically provide a wider scope of grain radius in seismic modeling while satisfying the dispersion relation and stability condition; the second one is that the node-generation algorithm is built by a smoothed model, which significantly improves the modeling stability at a reduced computational cost. Excessive or undesirable shape parameters will create a very ill-conditioned problem. A set of optimal shape parameters for different numbers of neighbor nodes is found quantitatively by minimizing root-mean-square error functions. This optimization method enables us to achieve an improved meshfree modeling process with higher accuracy and practicability and fewer spurious diffractions caused by the transition of different sampling areas. Several numerical results verify the feasibility of our adaptive node-distribution method and the optimal shape parameters.
29
BARKER, KEVIN J., KEI DAVIS, ADOLFY HOISIE, DARREN J. KERBYSON, MIKE LANG, SCOTT PAKIN, and JOSE CARLOS SANCHO. "A PERFORMANCE EVALUATION OF THE NEHALEM QUAD-CORE PROCESSOR FOR SCIENTIFIC COMPUTING." Parallel Processing Letters 18, no. 04 (December 2008): 453–69. http://dx.doi.org/10.1142/s012962640800351x.
Full textAbstract:
In this work we present an initial performance evaluation of Intel's latest, second-generation quad-core processor, Nehalem, and provide a comparison to first-generation AMD and Intel quad-core processors Barcelona and Tigerton. Nehalem is the first Intel processor to implement a NUMA architecture incorporating QuickPath Interconnect for interconnecting processors within a node, and the first to incorporate an integrated memory controller. We evaluate the suitability of these processors in quad-socket compute nodes as building blocks for large-scale scientific computing clusters. Our analysis of intra-processor and intra-node scalability of microbenchmarks, and a range of large-scale scientific applications, indicates that quad-core processors can deliver an improvement in performance of up to 4x over a single core depending on the workload being processed. However, scalability can be less when considering a full node. We show that Nehalem outperforms Barcelona on memory-intensive codes by a factor of two for a Nehalem node with 8 cores and a Barcelona node containing 16 cores. Further optimizations are possible with Nehalem, including the use of Simultaneous Multithreading, which improves the performance of some applications by up to 50%.
30
Zivzivadze, Omar, and David Japaridze. "Optimal Rescheduling of the Additional Reactive Power Source Selected in a Backbone Network to a Distribution Network." Works of Georgian Technical University, no. 3(521) (September 29, 2021): 123–29. http://dx.doi.org/10.36073/1512-0996-2021-3-123-129.
Full textAbstract:
An additional (generation) source of reactive power may be required in a backbone network node (𝑈 ≥ 220 𝑘𝑣) which has a heavy reactive load. When solving this problem, in a technical-economic sense, it is advisable to place this additional source of reactive power not in the mentioned node of a backbone network, but in the nodes of a distribution network (𝑈 ≤ 110 𝑘𝑣) connected to this node. This problem specifically involves: optimal rescheduling of total power of the additional reactive power source selected according to a voltage criterion in a backbone network node between the distribution network nodes connected to this node. The relevant optimization equations created in the article and the obtained mathematical model allow us to solve this problem effectively and successfully. The condition for optimality here implies the best economic returns, while the objective function is to minimize active power losses caused by nodal reactive powers. That was why we used the economic criterion as the main criterion in solving this problem.
31
Karthikeyan, A., P. G. Kuppusamy, and Iraj S. Amiri. "Secured Identity Based Cryptosystem Approach for Intelligent Routing Protocol in VANET." Scalable Computing: Practice and Experience 21, no. 1 (March 19, 2020): 41–46. http://dx.doi.org/10.12694/scpe.v21i1.1608.
Full textAbstract:
Vehicular specially appointed systems named as Vehicular Ad-hoc NETwork (VANET) have been raising dependent on the condition of-art advancements in remote and system communication. The message confirmations among vehicles and infrastructure are fundamental for the VANET security. The genuine personality of vehicles ought not to be uncovered, yet which is just detectable by approved nodes. Existing arrangements either depend vigorously on a carefully designed hardware or cannot fulfill the security necessity. Secured Identity Based Cryptosystem Approach (SIDBC) for intelligent routing protocol is proposed for better results since implementing a secured network for traffic forecasting and efficient routing in dynamically changing environment. Polynomial key generation is utilized for generating identity based pseudonym keys for each and every node that comes under the system. This keying process protects the node from malignant node from passing false information. The assessment output demonstrates that the planned method is more effective than past schemes since it is free pairing and it fulfills security and protection prerequisites.
32
Jiang, Peng, Xihao Dou, Jun Dong, Hexiang Huang, and Yuanyuan Wang. "Terminal Node of Active Distribution Network Correlation Compactness Model and Application Based on Complex Network Topology Graph." Sustainability 15, no. 1 (December 29, 2022): 595. http://dx.doi.org/10.3390/su15010595.
Full textAbstract:
Multiple nodes (such as distributed generation (DG), electric vehicles (EV), energy storage (ES), flexible loads (FL), etc.) are connected to the active distribution network (ADN), which changes its original operational mode. According to the bidirectional current and low-voltage transmission mode, this study proposed a multi voltage and multi electricity flat loop network, AC/DC (Alternating Current/ Direct Current) hybrid network, unified interface and flexible self-organizing network based on Complex network theory. First, the ADN complex network topology of various nodes is established based on the actual grid connected terminal nodes and power flow sensitivity algorithm. Second, using the TOPSIS model, the influence factor matrix of weighted directed network is established. The matrix can be used to guide the formulation of the distribution network operation mode, and the robustness and reliability of this paper are verified by using the standard multi voltage level main distribution hybrid model provided by the Panda Power website as the verification method. Finally, using the influence maximization calculation model of the New Creedy algorithm, the node correlation matrix is expanded to form a super family region set of active distribution network. The results show that the seven nodes in this paper have high correlation, while the other nodes have low correlation. In addition, the change of reactive power has little impact on other nodes, for a node with a change rate of 0, it is obviously not in the same power supply family as node 1, and theoretically it may not have a topological relationship, be a power generation node, or be completely independent. Analyzing the relationship between nodes has a guiding significance for power supply recovery and interaction in distribution network reconfiguration.
33
Wang, Bin. "Application of Random Data in RFID Secure Communication." Applied Mechanics and Materials 602-605 (August 2014): 3680–82. http://dx.doi.org/10.4028/www.scientific.net/amm.602-605.3680.
Full textAbstract:
With the development of the supply chain industry, the application environment has become increasingly complex, and the security demands in RFID communication are also increasing. This paper analyzes the problems and security requirements of node authentication, message accuracy and privacy protection, etc., proposes an RFID secure communication algorithm based on random numbers describing the algorithm for nodes query generation and node processing forwards. Experimental results show that the proposed algorithm has higher accuracy.
34
Cao, Yuyan, Yongxi Lyu, and Xinmin Wang. "Fault Diagnosis Reasoning Algorithm for Electromechanical Actuator Based on an Improved Hybrid TFPG Model." Electronics 9, no. 12 (December 16, 2020): 2153. http://dx.doi.org/10.3390/electronics9122153.
Full textAbstract:
As a new generation of power-by-wire actuators, electromechanical actuators are finding increasingly more applications in the aviation field. Aiming at the application problem of the fault diagnosis of the electromechanical actuator, an improved diagnosis reasoning algorithm based on a hybrid timed failure propagation graph (TFPG) model is proposed. On the basis of this hybrid TFPG model, the activation conditions of OR and causality among nodes are given. The relationship discrepancy node is transformed into a relationship node and discrepancy node, which unifies the model storage process. The backward and forward extension operations of hypothesis generation and updating are improved. In the backward expansion operation, the specific process of backward update from non-alarm nodes is given, and the judging logic of the branch of relationship nodes is added, which guarantees the unity of the algorithm framework and the accuracy of the time update. In the forward expansion operation, the update order is adjusted to ensure the accuracy of the node update for the case of multiple parents. A hybrid TFPG model of the electromechanical actuator is established in the general modeling environment (GME), and a systematic verification scheme with two simulation types is tested with the application of the P2020 reference design board (RDB) and VxWorks 653 system. The results show that the proposed algorithm can realize the fault diagnosis of the electromechanical actuator as well as fault propagation prediction.
35
Reihani, Ehsan, Pierluigi Siano, and Michael Genova. "A New Method for Peer-to-Peer Energy Exchange in Distribution Grids." Energies 13, no. 4 (February 12, 2020): 799. http://dx.doi.org/10.3390/en13040799.
Full textAbstract:
In this paper, distribution-level peer-to-peer energy exchange is proposed that allows increased matching between load and generation nodes. Contributions of the proposed improved matching system between the local load and generation nodes aim at making efficient use of unused power generation, reducing the cost of electrical energy for consumers, and assisting utility companies by reducing transmission line congestion. The proposed system for matching the load and generation nodes consists of a financial layer and technical layer. In the financial layer, nodes with an excess of energy provide a price to sell energy, while the nodes needing energy bid on a price to purchase energy. A market-clearing mechanism using pool clearing is applied to determine a final price for peer-to-peer exchange. The technical layer determines the connection of energy transfer between the generation and load nodes while considering the distance, power flow constraints, and specified time windows. The proposed approach is verified in a five-node system and the results are discussed.
36
Pongchairerks, Pisut. "A Probabilistic Hill-Climbing Algorithm for the Single-Source Transportation Problem." Sustainability 15, no. 5 (February 28, 2023): 4289. http://dx.doi.org/10.3390/su15054289.
Full textAbstract:
This paper proposes a probabilistic hill-climbing algorithm, called PH, for the single-source transportation problem (STP). PH is a tree search algorithm in which each node contains an assignment problem (AP) transformed from the STP being solved. The transformation converts each source’s product units into product lots; a product lot equals multiple product units. The AP aims to find the optimal assignment of product lots to destinations to minimize the total assignment cost. PH uses the Hungarian method to find the optimal solution of the AP in every node, which is a solution of the STP. For the AP of the root node (as the initial current node), the number of each source’s product lots is set to be small enough to guarantee the generation of a feasible solution for the STP. To generate every subsequent level, the current node is branched into multiple child nodes, in which the number of child nodes equals the number of sources in the STP. The AP of each child node is modified from the AP of the current node by adding one more product lot into a specific different source. Consequently, each child node provides a solution that is better than or the same as the current node’s solution; however, some child nodes’ solutions may be infeasible for the STP due to the insufficiency of a source’s capacity. If all of the child nodes cannot find a better feasible solution than the current node’s solution, PH stops its procedure. To diversify the search, PH selects one of the child nodes as the new current node in a probabilistic way, instead of always selecting the best child node. The experiment’s results in this paper reveal the performance of the three variants of PH.
37
Hui-Jun, Sun, and Wu Jian-Jun. "Evolution of network from node division and generation." Chinese Physics 16, no. 6 (June 2007): 1581–85. http://dx.doi.org/10.1088/1009-1963/16/6/015.
Full text
38
FUJISAWA, Toshimitsu, and Genki YAGAWA. "A Probabilistic Node Generation Technique for Meshfree Methods." Proceedings of The Computational Mechanics Conference 2003.16 (2003): 923–24. http://dx.doi.org/10.1299/jsmecmd.2003.16.923.
Full text
39
Vlasiuk, O., T. Michaels, N. Flyer, and B. Fornberg. "Fast high-dimensional node generation with variable density." Computers & Mathematics with Applications 76, no. 7 (October 2018): 1739–57. http://dx.doi.org/10.1016/j.camwa.2018.07.026.
Full text
40
Cabana, Katherine, John Candelo, Rafael Castillo, and Emiro De la Hoz Franco. "Voltage sensitivity analysis to determine the optimal integration of distributed generation in distribution systems." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 1 (February 1, 2019): 55. http://dx.doi.org/10.11591/ijece.v9i1.pp55-65.
Full textAbstract:
<span>This paper presents a</span><span lang="EN-US"> voltage </span><span>sensitivity analysis </span><span lang="EN-US">with respect to the real power injected </span><span>with</span><span lang="EN-US"> renewable energies</span><span> to determine the optimal integration of distributed generation (DG) in distribution systems (DS).</span><span> <span lang="EN-US">The best nodes where the power injections improve voltages magnitudes complying with the constraints are determined.</span></span><span> As it is a combinatorial problem, p</span><span lang="EN-US">article swarm optimization (PSO) and simulated annealing (SA) were used to change injections from 10% to 60% of the total power load using solar and wind generators and find the candidate nodes for installing </span><span>power </span><span lang="EN-US">sources. The method was tested using the 33-node, 69-node and 118-node radial distribution networks. The results showed that the best nodes for injecting real power with renewable energies were selected for the distribution network</span><span> by using the voltage sensitivity analysis</span><span lang="EN-US">. Algorithms found the best nodes for the three radial distribution </span><span>networks</span><span lang="EN-US"> with similar</span><span> values in the maximum injection of real</span><span lang="EN-US"> power</span><span>, suggesting that this value maintains for all the power system cases</span><span lang="EN-US">. The injections applied to the different nodes showed that voltage magnitudes increase significantly, especially when exceeding the maximum penetration of DG. The test showed that some nodes support injections up to the limits, but the voltages increase considerably on all nodes.</span>
41
Hossain, Ashraf. "Boundary Effect in Node Deployment: Coverage Fraction and Information Generation in Wireless Sensor Network." International Journal of Engineering and Technology 4, no. 6 (2012): 794–97. http://dx.doi.org/10.7763/ijet.2012.v4.486.
Full text
42
Xin, Jing, and Jia Pin Xu. "Based on Edge Node Network Service Recognition Research." Applied Mechanics and Materials 55-57 (May 2011): 1473–78. http://dx.doi.org/10.4028/www.scientific.net/amm.55-57.1473.
Full textAbstract:
At present, the recognition ability of the service recognition technique is limited to single installation. It leads to recognition error easily and it's dangerous for the Next Generation Networks which depend on service recognition and control. This paper is based on TCP/IP architecture. With the studying of the present service recognition techniques, a model of networking service recognition system based on edge node is designed. And using the modeling recognition method, the information exchange among recognition nodes, and the second recognition, dynamic recognition of networking service flow is implemented. The testing result of the networking service recognition system model is that, at different protocol types and different ports, the recognition rate is from 99.39% to 99.89%, which indicates that the networking service recognition system based on edge nodes can meet the service recognition requirements of the Next Generation Networks.
43
Ma, Ding, M. Onderwater, F. Wetzels, G. J. Hoekstra, R. D. van der Mei, S. Bhulai, and Lei Zhuang. "Cost-Efficient Allocation of Additional Resources for the Service Placement Problem in Next-Generation Internet." Mathematical Problems in Engineering 2015 (2015): 1–15. http://dx.doi.org/10.1155/2015/517409.
Full textAbstract:
One of the major challenges in next-generation Internet is to allocate services to nodes in the network. This problem, known as theservice placement problem, can be solved by layered graph approach. However, due to the existence of resource bottleneck, the requests are rejected from the beginning in the resource constrained network. In this paper we propose two iterative algorithms for efficient allocation of additional resources in order to improve the ratio of accepted service placement requests. To this end, we (1) introduce a new concept of sensitivity for each service node to locate the bottleneck node, (2) state the problem of allocating additional resources, and (3) use sensitivity to propose a simple iterative algorithm and an utilization-based iterative algorithm for efficient resource allocation. The performance of these two algorithms is evaluated by simulation experiments in a variety of parameter settings. The results show that the proposed algorithms increase request acceptance ratio significantly by allocating additional resources into the bottleneck node and links. The utilization-based iterative algorithm also decreases the long-term cost by making efficient use of additional resources.
44
Yoshizaki, K., T. Matsuda, N. Nishimoto, T. Kuritani, L. Taeho, K. Aozasa, T. Nakahata, H. Kawai, H. Tagoh, and T. Komori. "Pathogenic significance of interleukin-6 (IL-6/BSF-2) in Castleman's disease." Blood 74, no. 4 (September 1, 1989): 1360–67. http://dx.doi.org/10.1182/blood.v74.4.1360.1360.
Full textAbstract:
Abstract Castleman's disease is a syndrome consisting of giant lymph node hyperplasia with plasma cell infiltration, fever, anemia, hypergammaglobulinemia, and an increase in the plasma level of acute phase proteins. It has been reported that clinical abnormalities disappear after the resection of the affected lymph nodes, suggesting that products of lymph nodes may cause such clinical abnormalities. Interleukin-6 (IL-6) is a cytokine inducing B-cell differentiation to immunoglobulin-producing cells and regulating biosynthesis of acute phase proteins. This report demonstrates that the germinal centers of hyperplastic lymph nodes of patients with Castleman's disease produce large quantities of IL-6 without any significant production of other cytokines. In a patient with a solitary hyperplastic lymph node, clinical improvement and decrease in serum IL-6 were observed following surgical removal of the involved lymph node. There was a correlation between serum IL-6 level, lymph node hyperplasia, hypergammaglobulinemia, increased level of acute phase proteins, and clinical abnormalities. The findings in this report indicate that the generation of IL-6 by B cells in germinal centers of hyperplastic lymph nodes of Castleman's disease may be the key element responsible for the variety of clinical symptoms in this disease.
45
Yoshizaki, K., T. Matsuda, N. Nishimoto, T. Kuritani, L. Taeho, K. Aozasa, T. Nakahata, H. Kawai, H. Tagoh, and T. Komori. "Pathogenic significance of interleukin-6 (IL-6/BSF-2) in Castleman's disease." Blood 74, no. 4 (September 1, 1989): 1360–67. http://dx.doi.org/10.1182/blood.v74.4.1360.bloodjournal7441360.
Full textAbstract:
Castleman's disease is a syndrome consisting of giant lymph node hyperplasia with plasma cell infiltration, fever, anemia, hypergammaglobulinemia, and an increase in the plasma level of acute phase proteins. It has been reported that clinical abnormalities disappear after the resection of the affected lymph nodes, suggesting that products of lymph nodes may cause such clinical abnormalities. Interleukin-6 (IL-6) is a cytokine inducing B-cell differentiation to immunoglobulin-producing cells and regulating biosynthesis of acute phase proteins. This report demonstrates that the germinal centers of hyperplastic lymph nodes of patients with Castleman's disease produce large quantities of IL-6 without any significant production of other cytokines. In a patient with a solitary hyperplastic lymph node, clinical improvement and decrease in serum IL-6 were observed following surgical removal of the involved lymph node. There was a correlation between serum IL-6 level, lymph node hyperplasia, hypergammaglobulinemia, increased level of acute phase proteins, and clinical abnormalities. The findings in this report indicate that the generation of IL-6 by B cells in germinal centers of hyperplastic lymph nodes of Castleman's disease may be the key element responsible for the variety of clinical symptoms in this disease.
46
Elagin, Vasiliy S., Vladimir I. Fedorovskikh, and Anastasia V. Spirkina. "DEVELOPMENT AND ANALYSIS OF A BLOCKCHAIN SYSTEM BASED ON JAVASCRIPT." T-Comm 15, no. 2 (2021): 40–45. http://dx.doi.org/10.36724/2072-8735-2021-15-2-40-45.
Full textAbstract:
The paper describes the main features of blockchain technology, provides the main areas of use of this technology. Today, blockchain has evolved into a reliable and secure way to store and record transactions across a wide range of application domains. However, the impact of existing solutions on the current network infrastructure needs to be considered. The authors propose to create a system for generating and storing blockchain traffic based on the JavaScript programming language. This solution cannot be applied to cryptocurrencies, but it allows you to evaluate the work of a distributed database based on blockchain technology. The aim of the work is to analyze the delays in the generation and distribution of traffic between various numbers of nodes and the dependence of the speed of distribution and block generation on the performance of computers. The paper also considered the algorithm for joining a new node to the cluster and sending a new block to the blockchain, as well as the scheme of a node in a blockchain cluster, and presented the results of an experiment with a quantitative assessment of network performance characteristics.
47
Bakhsh, Sheikh Tahir, Muhammad Aman Sheikh, and Rayed AlGhamdi. "Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks." International Journal of Distributed Sensor Networks 2015 (2015): 1–17. http://dx.doi.org/10.1155/2015/746216.
Full textAbstract:
The distributive nature of wireless sensor networks (WSNs) poses great challenges for the design of distributive scheduling to maximize network life and spatial reuse of time slot with minimum frame length. Most of the existing scheduling techniques are either centralized or contentional. The existing techniques cannot efficiently adapt to the dynamic wireless environment. In this paper, self-scheduled and distributed MAC (SSD-MAC) and self-distributive MAC (SD-MAC) medium access control algorithms are proposed to reduce the complexity and variety of scheduling problems. The proposed algorithms do not require any synchronization and can effectively adapt to dynamic topology changes without incurring global communication overhead. According to the proposed algorithms, each node maps a conflict-free time slot for itself up to 2-hop neighboring nodes. Consequently, each node successfully schedules a unique time slot for itself in a heuristic manner based on its local information. Moreover, the proposed algorithms also guarantee conflict-free edge coloring because all the incident edges to a single node are assigned to colors in such a way that none of the edges should have the same color. It has been demonstrated that, with regard to communication overhead, energy consumption and execution time through simulation proposed that algorithms outperform existing distributed randomized scheduling algorithm (DRAND).
48
Kozdrowski, Stanisław, Mateusz Żotkiewicz, and Sławomir Sujecki. "Optimization of Optical Networks Based on CDC-ROADM Technology." Applied Sciences 9, no. 3 (January 24, 2019): 399. http://dx.doi.org/10.3390/app9030399.
Full textAbstract:
New generation of optical nodes in dense wavelength division multiplexed networks enables operators to improve service flexibility and make significant savings, both in operational and capital expenditures. Thus the main objective of the study is to minimize optical node resources, such as transponders, multiplexers and wavelength selective switches, needed to provide and maintain high quality dense wavelength division multiplexed network services using new generation of optical nodes. A model based on integer programming is proposed, which includes a detailed description of an optical network node. The impact on the network performance of conventional reconfigurable optical add drop multiplexer technology is compared with colorless, directionless and contentionless approaches. The main focus of the presented study is the analysis of the network congestion problem arising in the context of both reconfigurable optical add drop multiplexer technologies. The analysis is supported by results of numerical experiments carried out for realistic networks of different dimensions and traffic demand sets.
49
Tahir, Muhammad Atif, Asif Jamshed, Habib-ur Rehman, and Yassine Daadaa. "Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees." Journal of Intelligent Systems 24, no. 4 (December 1, 2015): 479–89. http://dx.doi.org/10.1515/jisys-2014-0043.
Full textAbstract:
AbstractIn a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.
50
Celebi, M. S., and R. F. Beck. "Geometric Modeling for Fully Nonlinear Ship-Wave Interactions." Journal of Ship Research 41, no. 01 (March 1, 1997): 17–25. http://dx.doi.org/10.5957/jsr.1997.41.1.17.
Full textAbstract:
Using the desingularized boundary integral method to solve transient nonlinear water-wave problems requires the solution of a mixed boundary value problem at each time step. The problem is solved at nodes (or collocation points) distributed on an ever-changing body surface. In this paper, a dynamic node allocation technique is developed to distribute efficiently nodes on the body surface. A B-spline surface representation is employed to generate an arbitrary ship hull form in parametric space. A variational adaptive curve grid generation method is then applied on the hull station curves to generate effective node placement. The numerical algorithm uses a conservative form of the parametric variational Euler-Lagrange equations to perform adaptive gridding on each station. Numerical examples of node placement on typical hull cross sections and for fully nonlinear wave resistance computations are presented.