Journal articles: 'Distributed nodes'

1

Sundaram, Shreyas, and Bahman Gharesifard. "Distributed Optimization Under Adversarial Nodes." IEEE Transactions on Automatic Control 64, no. 3 (March 2019): 1063–76. http://dx.doi.org/10.1109/tac.2018.2836919.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Krechowicz, Adam. "Content-aware data distribution over cluster nodes." Intelligent Data Analysis 25, no. 4 (July 9, 2021): 907–27. http://dx.doi.org/10.3233/ida-205360.

Full text

Abstract:

Proper data items distribution may seriously improve the performance of data processing in distributed environment. However, typical datastorage systems as well as distributed computational frameworks do not pay special attention to that aspect. In this paper author introduces two custom data items addressing methods for distributed datastorage on the example of Scalable Distributed Two-Layer Datastore. The basic idea of those methods is to preserve that data items stored on the same cluster node are similar to each other following concepts of data clustering. Still, most of the data clustering mechanisms have serious problem with data scalability which is a severe limitation in Big Data applications. The proposed methods allow to efficiently distribute data set over a set of buckets. As it was shown by the experimental results, all proposed methods generate good results efficiently in comparison to traditional clustering techniques like k-means, agglomerative and birch clustering. Distributed environment experiments shown that proper data distribution can seriously improve the effectiveness of Big Data processing.

APA, Harvard, Vancouver, ISO, and other styles

3

Joy T, Thushara, and Sruthy Manmadhan. "Reallocation of Load in Nodes of Distributed File Systems." International Journal of Scientific Research 3, no. 5 (June 1, 2012): 274–75. http://dx.doi.org/10.15373/22778179/may2014/84.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ye, Chong Yang, and Yi Zhuang. "An Improved Dynamic Trust Model for Distributed System." Advanced Materials Research 1046 (October 2014): 500–503. http://dx.doi.org/10.4028/www.scientific.net/amr.1046.500.

Full text

Abstract:

The parallel, sharing and high speed distributed system has become the mainstream of current system architecture, the characteristics of uncentralized management makes more and more people take flexible operations. However, as the nodes in the system are not bound by a central server and resource sharing is a node’s voluntary behavior, the traditional centralized mechanism is not suitable for large-scale distributed system. Aiming at this problem, this paper proposes an improved dynamic trust model for distributed system (IDTrust) to quantify and evaluate the credible degree between nodes. The analysis and simulation results show that the effectiveness of contain malicious nodes and the security aspects of IDTrust are superior to those of current typical methods.

APA, Harvard, Vancouver, ISO, and other styles

5

de Bruin, Marcel G. "Interpolation on non-uniformly distributed nodes." Nonlinear Analysis: Theory, Methods & Applications 47, no. 3 (August 2001): 1931–40. http://dx.doi.org/10.1016/s0362-546x(01)00322-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gargaro, Anthony. "Virtual nodes/distributed systems working group." ACM SIGAda Ada Letters X, no. 4 (March 1990): 66–77. http://dx.doi.org/10.1145/91360.91372.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yang, Chun Xi, Chao Sun, Sha Fan, and Ning Wu. "Cluster-Gossip Based Distributed Kalman Consensus Filter Algorithm with Energy Efficiency." Applied Mechanics and Materials 667 (October 2014): 291–99. http://dx.doi.org/10.4028/www.scientific.net/amm.667.291.

Full text

Abstract:

According to these constrains that wireless sensor networks are composed of many wireless nodes with limited power, a new energy efficient cluster-based distributed consensus kalman filtering algorithm is proposed in this paper. In this algorithm, each cluster contains a cluster-head and some member nodes where the cluster-head is used to fuse data which come from member nodes and consensus process between neighbor cluster-head. This clustering method divide wireless sensor networks into two classes of networks: cluster units network and cluster-heads network. In this way, numbers of information transmission among nodes are reduced efficiently and communication distances among nodes are also shortened. As a result, node’s energy in wireless sensor network can be saved greatly. Moreover, Gossip algorithm is introduced to deal with the consensus problem between cluster-heads for improving power consumption and the convergence analysis for the algorithm which is given by applying to graph theory and matrix theory. Finally, a simulation example is given to show the effectively of our method.

APA, Harvard, Vancouver, ISO, and other styles

8

Xu, Bao, and Yong Feng Ju. "Distributed Coverage-Hole Repair Algorithm towards Nodes Failure in Wireless Sensor Networks." Applied Mechanics and Materials 135-136 (October 2011): 464–69. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.464.

Full text

Abstract:

In order to preserve the coverage and ensure the efficiency of Wireless Sensor Networks (WSNs), a distributed coverage-hole repair algorithm towards nodes failure is proposed in this paper. Every node has a energy threshold, if node’s energy is lower than its threshold, it sends a failure message to the nearest node and appoints it as the head node, the head node consideres all the neighbors of the failure node are preparatory boundary nodes at first, then judges every preparatory boundary nodes whether be a non-boundary node through the intersection angle with the failure node. In the last, the head node activates the redundant node within the sensing range of failure node which has the most boundary nodes as neighbor nodes. Analyzes and simulation on Matlab platform indicate that this algorithm has a low time complexity and the repair efficiency has a grate relation with node density and node sensing radius.

APA, Harvard, Vancouver, ISO, and other styles

9

Teykhrib, Anton Pavlovich. "Data transmission in Hybrid Distributed Environment." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 2989. http://dx.doi.org/10.11591/ijece.v6i6.12129.

Full text

Abstract:

This article discusses a hybrid distributed environment including two levels of nodes: the first level which has high quality channels between the nodes, and the second one in which the nodes are directly involved in communication and the communication is performed through the first-level nodes. For the indicated distribution scheme, the questions of selection of the best path between the first-level nodes are solved based on such communication channel characteristics as delay in packet transmission, jitter in transmission, packet loss in transmission, and choosing a method for data transmission through the selected best path: protocols of transport and network layers have been compared, and the use of network layer has been preferred.

APA, Harvard, Vancouver, ISO, and other styles

10

Teykhrib, Anton Pavlovich. "Data transmission in Hybrid Distributed Environment." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 2989. http://dx.doi.org/10.11591/ijece.v6i6.pp2989-2993.

Full text

Abstract:

This article discusses a hybrid distributed environment including two levels of nodes: the first level which has high quality channels between the nodes, and the second one in which the nodes are directly involved in communication and the communication is performed through the first-level nodes. For the indicated distribution scheme, the questions of selection of the best path between the first-level nodes are solved based on such communication channel characteristics as delay in packet transmission, jitter in transmission, packet loss in transmission, and choosing a method for data transmission through the selected best path: protocols of transport and network layers have been compared, and the use of network layer has been preferred.

APA, Harvard, Vancouver, ISO, and other styles

11

Wang, Xue Yu, Bing Qiang Shan, and Li Shan Sun. "Distributed Construction for Power Aware Connected Dominating Set." Advanced Materials Research 709 (June 2013): 667–70. http://dx.doi.org/10.4028/www.scientific.net/amr.709.667.

Full text

Abstract:

This paper proposes a distributed algorithm for constructing power aware connected dominating set. It starts from any node, using depth first search, to form a connected dominating set after completing search in one orientation and then backtrack search in other orientations. For any dominating node’s neighbor nodes, when any neighbor node’s energy is lower than the threshold energy, backtrack search in other orientations. Simulation results show that the proposed algorithms perform better than some known ones.

APA, Harvard, Vancouver, ISO, and other styles

12

Hu, Cheng, Shui Bao Zhang, Shou Zhi Xu, and Bo Xu. "Distributed Landsilde Mornitoring by Wireless Sensor Nodes." Advanced Materials Research 594-597 (November 2012): 1069–73. http://dx.doi.org/10.4028/www.scientific.net/amr.594-597.1069.

Full text

Abstract:

Wireless Sensor network (WSN) is an emerging technology widely applied in environmental disasters monitoring. With the constraint of computation resource, it face big challenge of stability and reliability of monitoring network. A statistical model of strain data and distributed monitoring algorithm for landslide based on WSN is studied in this paper. The strain data is modeled using variable mean of Gaussian process. Miss alarm rate and false alarm rate are introduced as critical performance parameters of landslide prediction. Comparing with centralized monitoring method, simulation result shows that distributed monitoring algorithm performs better than centralized monitoring.

APA, Harvard, Vancouver, ISO, and other styles

13

Liu, Chao, Qinghua Luo, Xiaozhen Yan, Yang Shao, Kexin Yang, and Chunyu Ju. "A distributed localization method for mobile nodes." IOP Conference Series: Materials Science and Engineering 1207, no. 1 (November 1, 2021): 012001. http://dx.doi.org/10.1088/1757-899x/1207/1/012001.

Full text

Abstract:

Abstract In Wireless Sensor Networks(WSNs), the location services are the basis of many application scenarios. However, for the range-based localization method, the localization accuracy and the system robustness of the distributed localization system are difficult to guarantee, due to the uncertainty of the distance estimation and position calculation are affected by the node state and communication uncertainty. In this paper, we propose the distributed localization method based on anchor node selection and Particle Filter optimization. In this method, we analyze the uncertainty of error propagation in the Least-squares method and find that there is a proportional relation between localization error and uncertainty propagation. According to this relationship, we propose the corresponding optimization criterion methods of anchor nodes. To optimize the initial localization results, we present the distributed localization method based on anchor node optimal selection and Particle Filter. Simulation results show that the methods we proposed could effectively improve the localization accuracy of the mobile nodes and the robustness of the system.

APA, Harvard, Vancouver, ISO, and other styles

14

Ibrahim, Abdelrahman M., Ahmed A. Zewail, and Aylin Yener. "Green Distributed Storage Using Energy Harvesting Nodes." IEEE Journal on Selected Areas in Communications 34, no. 5 (May 2016): 1590–603. http://dx.doi.org/10.1109/jsac.2016.2545538.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Brasileiro, F. V., P. D. Ezhilchelvan, S. K. Shrivastava, N. A. Speirs, and S. Tao. "Implementing fail-silent nodes for distributed systems." IEEE Transactions on Computers 45, no. 11 (1996): 1226–38. http://dx.doi.org/10.1109/12.544479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Herakovič, Niko, Hugo Zupan, Miha Pipan, Jernej Protner, and Marko Šimic. "Distributed Manufacturing Systems with Digital Agent." Strojniški vestnik – Journal of Mechanical Engineering 65, no. 11-12 (November 18, 2019): 650–57. http://dx.doi.org/10.5545/sv-jme.2019.6331.

Full text

Abstract:

This paper presents a novel approach to implement manufacturing nodes using the combined strength of digital twins, holons, and digital agents. Manufacturing nodes are based on holon theory and present a universal manufacturing platform that consists of cyber-physical systems (CPS) with an integrated digital twin, digital agent, databases and various communication protocols. The manufacturing node network is controlled globally using the global digital twin of logistics process and locally using the local nodes and local digital agents, digital twins and information shared by the node network. The main objective of this research was to develop and test a new concept of distributed system modelling and distributed system control for easy implementation of distributed manufacturing nodes in a smart factory concept.

APA, Harvard, Vancouver, ISO, and other styles

17

Zhang, Zhao Hui, Ming Ming Hu, Dong Li, and Xiao Gang Qi. "Distributed Malicious Nodes Detection in Wireless Sensor Networks." Applied Mechanics and Materials 519-520 (February 2014): 1243–46. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.1243.

Full text

Abstract:

Data theft and node attack in wireless sensor networks causes great damage to the networks and the attacker destroys network and obtains the data of the network by malicious nodes distributed in the network. Therefore, it is necessary to detect these malicious nodes and to eliminate their influence. We propose a distributed malicious nodes detection protocol which called BMND based on Bayesian voting, every node determine its suspected malicious nodes by its request message and abnormal behavior. Also, we determine the malicious nodes by Bayesian voting, so that the network can protect itself from such malicious nodes influence. The simulation results show that our algorithm has good performance in both the detection rate and false positive rate.

APA, Harvard, Vancouver, ISO, and other styles

18

Liu, Jia, Run Chang Zhang, Wei Lian Qu, and Li Jiang. "Study on Distributed Properties of Welding Residual Stress in Bridge Nodes." Applied Mechanics and Materials 501-504 (January 2014): 1166–69. http://dx.doi.org/10.4028/www.scientific.net/amm.501-504.1166.

Full text

Abstract:

The distributed properties of residual stress in bridge nodes have been investigated in the paper. Based on some bridge node, the three dimensional thermodynamics finite element model has been established, meanwhile, the double ellipsoidal distributed heat source model are used to simulate the whole welding procedure of bridge nodes according to the welding parameters. Thus, the distributed regularities of residual stress of bridge node have been obtained. Simulating results show that the residual stresses distribute uniformly in the welding direction, and the max value reaches the yield strength of steel Q345qD. Besides, the residual stress in the lateral direction reaches the max value in the place of welding district, and decreases rapidly when far away from the welds.

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Xue Yu. "On Constructing 2-Connected2-Dominating Set Using Distributed Algorithm." Advanced Materials Research 850-851 (December 2013): 588–91. http://dx.doi.org/10.4028/www.scientific.net/amr.850-851.588.

Full text

Abstract:

This paper proposes a distributed algorithm to construct a 2-connected 2-dominating set. The main ingredient of this algorithm is that the nodes in the loop are 2-vertex connected. It starts from any node, and forms a localized loop made by dominating nodes. The nodes in the loop are 2-vertex connected. Basing on this loop, the algorithm continue to construct other loops formed by dominating nodes until the nodes out loops are 2-dominated.

APA, Harvard, Vancouver, ISO, and other styles

20

Zhang, Qiaoling, Zhe Chen, and Fuliang Yin. "Global Coherence Field and Distributed Particle Filter-Based Speaker Tracking in Distributed Microphone Networks." Journal of Computational Acoustics 23, no. 03 (June 25, 2015): 1550010. http://dx.doi.org/10.1142/s0218396x15500101.

Full text

Abstract:

Based on the combination of global coherence field (GCF) and distributed particle filter (DPF) a speaker tracking method is proposed for distributed microphone networks in this paper. In the distributed microphone network, each node comprises a microphone pair, and its generalized cross-correlation (GCC) function is estimated. Based on the average over all local GCC observations, a global coherence field-based pseudo-likelihood (GCF-PL) function is developed as the likelihood for a DPF. In the proposed method, all nodes share an identical particle set, and each node performs local particle filtering simultaneously. In the local particle filter, the likelihood GCF-PL for each particle weight is computed with an average consensus algorithm. With an identical particle set and the consistent estimate of GCF-PL for each particle weight, all individual nodes possess a common particle presentation for the global posterior of the speaker state, which is utilized by each node for an estimated global speaker position. Employing the GCF-PL as the likelihood for DPF, no assumption is required about the independence of nodes observations as well as observation noise statistics. Additionally, only local information exchange occurs among neighboring nodes; and finally each node has a global estimate of the speaker position. Simulation results demonstrate the validity of the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

21

Lakshmi Siva Rama Krishna, T., J. Priyanka, N. Nikhil Teja, Sd Mahiya Sultana, and B. Jabber. "An Efficient Data Replication Scheme for Hadoop Distributed File System." International Journal of Engineering & Technology 7, no. 2.32 (May 31, 2018): 167. http://dx.doi.org/10.14419/ijet.v7i2.32.15396.

Full text

Abstract:

A Distributed file system (DFS) is a storage component of a distributed system (DS). DS consists of multiple autonomous nodes connected via a communication network to solve large problems and to achieve more computing power. One of the design requirement of any DS is to provide replicas. In this paper, we propose a new replication algorithm which is more reliable than the existing replication algorithm used in DFS. The advantages of our proposed replication algorithm by incrementing nodes sequentially (RAINS) is that it distributes the storage load equally among all the nodes sequentially and it guarantees a replica copy in case two racks in a DS are down. This feature is not available in the existing DFS. We have compared existing replication algorithm used by Hadoop distributed file system (HDFS) with our proposed RAINS algorithm. The experimental results indicate that our proposed RAINS algorithm performs better when more number of racks failed in the DS.

APA, Harvard, Vancouver, ISO, and other styles

22

Liu, Li Yan, Rong Fu, Yi He, and Ying Qian Zhang. "Deployment Strategy in Distributed Underwater Sensor Networks." Applied Mechanics and Materials 602-605 (August 2014): 3643–47. http://dx.doi.org/10.4028/www.scientific.net/amm.602-605.3643.

Full text

Abstract:

Distributed underwater sensor network coverage is divided into two main categories: deterministic coverage and stochastic coverage. A strategy is put forward to deploy determinate area by using a triangular-grid method. When a coverage ratio is known, the distance between nodes can be adjusted to meet the coverage ratio in the monitored area, and the least number of sensor nodes can be calculated. Also a heuristic method is proposed for stochastic area deployment strategy. It is under the premise that the initial node location randomly deployed is given, using Voronoi diagram, the not easiest monitored path is searched, and the network coverage performance is improved by configuring the new nodes in the path. Finally it is proved that network performance is more improved by the simulation experiments, when one to four nodes are configured in the easiest breach path.

APA, Harvard, Vancouver, ISO, and other styles

23

Javed, Muhammad Umar, Mubariz Rehman, Nadeem Javaid, Abdulaziz Aldegheishem, Nabil Alrajeh, and Muhammad Tahir. "Blockchain-Based Secure Data Storage for Distributed Vehicular Networks." Applied Sciences 10, no. 6 (March 16, 2020): 2011. http://dx.doi.org/10.3390/app10062011.

Full text

Abstract:

In this paper, a blockchain-based secure data sharing mechanism is proposed for Vehicular Networks (VNs). Edge service providers are introduced along with ordinary nodes to efficiently manage service provisioning. The edge service providers are placed in the neighborhood of the ordinary nodes to ensure smooth communication between them. The huge amount of data generated by smart vehicles is stored in a distributed file storage system, known as Interplanetary File System (IPFS). It is used to tackle the issues related to data storage in centralized architectures, such as data tampering, lack of privacy, vulnerability to hackers, etc. Monetary incentives are given to edge vehicle nodes to motivate them for accurate and timely service provisioning to ordinary nodes. In response, ordinary nodes give reviews to the edge nodes against the services provided by them, which are further stored in a blockchain to ensure integrity, security and transparency. Smart contracts are used to automate the system processes without the inclusion of an intermediate party and to check the reviews given to the edge nodes. To optimize gas consumption and to enhance the system performance, a Proof of Authority (PoA) consensus mechanism is used to validate the transactions. Moreover, a caching system is introduced at the edge nodes to store frequently used services. Furthermore, both security and privacy are enhanced in the proposed system by incorporating a symmetric key cryptographic mechanism. A trust management mechanism is also proposed in this work to calculate the nodes’ reputation values based upon their trust values. These values determine the authenticity of the nodes involved in the network. Eventually, it is concluded from the simulation results that the proposed system is efficient for VNs.

APA, Harvard, Vancouver, ISO, and other styles

24

Ho, Jun-Won. "Distributed Software-Attestation Defense against Sensor Worm Propagation." Journal of Sensors 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/874782.

Full text

Abstract:

Wireless sensor networks are vulnerable to sensor worm attacks in which the attacker compromises a few nodes and makes these compromised nodes initiate worm spread over the network, targeting the worm infection of the whole nodes in the network. Several defense mechanisms have been proposed to prevent worm propagation in wireless sensor networks. Although these proposed schemes use software diversity technique for worm propagation prevention under the belief that different software versions do not have common vulnerability, they have fundamental drawback in which it is difficult to realize the aforementioned belief in sensor motes. To resolve this problem, we propose on-demand software-attestation based scheme to defend against worm propagation in sensor network. The main idea of our proposed scheme is to perform software attestations against sensor nodes in on-demand manner and detect the infected nodes by worm, resulting in worm propagation block in the network. Through analysis, we show that our proposed scheme defends against worm propagation in efficient and robust manner. Through simulation, we demonstrate that our proposed scheme stops worm propagation at the reasonable overhead while preventing a majority of sensor nodes from being infected by worm.

APA, Harvard, Vancouver, ISO, and other styles

25

Sisinni, Silvia, Davide Margaria, Ignazio Pedone, Antonio Lioy, and Andrea Vesco. "Integrity Verification of Distributed Nodes in Critical Infrastructures." Sensors 22, no. 18 (September 14, 2022): 6950. http://dx.doi.org/10.3390/s22186950.

Full text

Abstract:

The accuracy and reliability of time synchronization and distribution are essential requirements for many critical infrastructures, including telecommunication networks, where 5G technologies place increasingly stringent conditions in terms of maintaining highly accurate time. A lack of synchronization between the clocks causes a malfunction of the 5G network, preventing it from providing a high quality of service; this makes the time distribution network a very viable target for attacks. Various solutions have been analyzed to mitigate attacks on the Global Navigation Satellite System (GNSS) radio-frequency spectrum and the Precision Time Protocol (PTP) used for time distribution over the network. This paper highlights the significance of monitoring the integrity of the software and configurations of the infrastructural nodes of a time distribution network. Moreover, this work proposes an attestation scheme, based on the Trusted Computing principles, capable of detecting both software violations on the nodes and hardware attacks aimed at tampering with the configuration of the GNSS receivers. The proposed solution has been implemented and validated on a testbed representing a typical synchronization distribution network. The results, simulating various types of adversaries, emphasize the effectiveness of the proposed approach in a wide range of typical attacks and the certain limitations that need to be addressed to enhance the security of the current GNSS receivers.

APA, Harvard, Vancouver, ISO, and other styles

26

Pathak, A. K., and Poornima Tiwari. "‘Incomplete’ Pál Type Interpolation on Nonuniformly Distributed Nodes." Journal of scientific research 64, no. 02 (2020): 212–15. http://dx.doi.org/10.37398/jsr.2020.640230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Lakshman, T. V., and V. K. Wei. "Distributed computing on regular networks with anonymous nodes." IEEE Transactions on Computers 43, no. 2 (1994): 211–18. http://dx.doi.org/10.1109/12.262125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Fusco, Emanuele G., and Andrzej Pelc. "Distributed tree comparison with nodes of limited memory." Networks 60, no. 4 (March 27, 2012): 235–44. http://dx.doi.org/10.1002/net.21463.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Won, Hee-Sun, Sang-Pil Kim, Sanghun Lee, Mi-Jung Choi, and Yang-Sae Moon. "Secure principal component analysis in multiple distributed nodes." Security and Communication Networks 9, no. 14 (June 24, 2016): 2348–58. http://dx.doi.org/10.1002/sec.1501.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Panda, Sanjaya Kumar, and Saswati Naik. "An Efficient Data Replication Algorithm for Distributed Systems." International Journal of Cloud Applications and Computing 8, no. 3 (July 2018): 60–77. http://dx.doi.org/10.4018/ijcac.2018070105.

Full text

Abstract:

This article describes how data replication plays an important role in distributed systems. It primarily focuses on the redundancy of data at two or more nodes, to achieve both fault tolerance and improved performance. Therefore, many researchers have proposed various data replication algorithms to manage the redundancy of data. However, they have not considered the faults that are associated with the nodes, such as permanent, transient and intermittent. Moreover, they have not incorporated any recovery approach to rejoin the failed nodes. Therefore, the authors propose a data replication algorithm, called dynamic vote-based data replication (DVDR). The main contribution of DVDR is to consider all types of faults and rejoin the failed nodes. DVDR is based on dynamic vote assignment among the connected nodes, and referred as passive and non-hierarchical one. The authors perform rigorous analysis of DVDR and compare with an existing dynamic vote assignment algorithm. The result shows the efficacy of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

31

Zalatnay, Zsolt, Csaba Simon, Markosz Maliosz, and Balázs Terza. "Managing Streaming Services in a Distributed Testbed." MACRo 2015 1, no. 1 (March 1, 2015): 223–34. http://dx.doi.org/10.1515/macro-2015-0022.

Full text

Abstract:

AbstractControlling the nodes in a distributed networking environment is not a trivial task, because there is no central entity that is aware of all the details. In this paper we present a solution that solves this issue in a testbed dedicated to research the streaming video distribution among mobile nodes. We designed a peer-to-peer overlay to support the control functions. We implement network coding function in the nodes, making possible to apply it to the video stream, increasing the robustness of the streaming service. We present the prototype of our solution and the performance evaluation of the service.

APA, Harvard, Vancouver, ISO, and other styles

32

Zheng, Zhi, and Zhihong Peng. "Distributed Cooperation Based Priority Coverage Control Strategy for Mobile Sensors." Journal of Advanced Computational Intelligence and Intelligent Informatics 19, no. 2 (March 20, 2015): 191–96. http://dx.doi.org/10.20965/jaciii.2015.p0191.

Full text

Abstract:

Random deployment and inadequate numbers of sensor nodes may cause low coverage, so we propose a new priority coverage control strategy based on the distributed cooperation of mobile sensors. Sensor nodes are distributed randomly around the region of interest (ROI) and searched for independently. When nodes are found, an unbreakable group is formed under repulsion, attraction and speed consistency control, then searching is begun cooperatively. When some node finds a ROI, it guides the other nodes in the group following it to the ROI. While in the ROI, nodes choose the most important position within the sensing range, then move toward it independently while avoiding collision, eventually, reaching the most important area of the ROI. Under the premise of satisfying key area coverage, sensor nodes are adjusted based on the degree of coverage, maximizing coverage. Simulation results show that the proposed method quickly improves the coverage rate and achieves priority coverage of key areas strongly robustly without being adversely affected by sudden damage to nodes. Applications include coverage with limited amounts of nodes in unknown environments.

APA, Harvard, Vancouver, ISO, and other styles

33

Chen, Xing, Wei Jiang Li, Tie Jun Zhao, and Xing Hai Piao. "Design of the Distributed Web Crawler." Advanced Materials Research 204-210 (February 2011): 1454–58. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1454.

Full text

Abstract:

On the current scale of the Internet, the single web crawler is unable to visit the entire web in an effective time-frame. So, we develop a distributed web crawler system to deal with it. In our distribution design, we mainly consider two facets of parallel. One is the multi-thread in the internal nodes; the other is distributed parallel among the nodes. We focus on the distribution and parallel between nodes. We address two issues of the distributed web crawler which include the crawl strategy and dynamic configuration. The results of experiment show that the hash function based on the web site achieves the goal of the distributed web crawler. At the same time, we pursue the load balance of the system, we also should reduce the communication and management spending as much as possible.

APA, Harvard, Vancouver, ISO, and other styles

34

Fujishima, Daisuke, and Tomio Kamada. "Collective Relocation for Associative Distributed Collections of Objects." International Journal of Software Innovation 5, no. 2 (April 2017): 55–69. http://dx.doi.org/10.4018/ijsi.2017040104.

Full text

Abstract:

The field of parallel computing has experienced an increase in the number of computing nodes, allowing broader applications, including computations that have irregular features. Some parallel programming languages handle object data structures and offer marshaling/unmarshaling mechanisms to transpose them. To manage data elements across computing nodes, some research on distributed collections has been conducted. This study proposes a distributed collection library that can handle multiple collections of object elements and change their distributions while maintaining associativity between their elements. This library is implemented on an object-oriented parallel programming language, X10. The authors assume pairs of associative collections such as vehicles and streets in a traffic simulation. When many vehicles are concentrated on streets assigned to certain computing nodes, some of these streets should be moved to other nodes. The authors' library assists the programmer in easily distributing the associative collections over the computing nodes and collectively relocating elements while maintaining the data sharing relationship among associative elements. The programmer can describe the associativity between objects by using both declarative and procedural methods. They show a preliminary performance evaluation of their library on a Linux cluster and the K computer.

APA, Harvard, Vancouver, ISO, and other styles

35

Zhong, Jin Hua, and Wan Fang. "Image-Based 3D Reconstruction on Distributed Hash Network." International Journal of Mobile Computing and Multimedia Communications 9, no. 4 (October 2018): 58–75. http://dx.doi.org/10.4018/ijmcmc.2018100104.

Full text

Abstract:

In order to optimize the workflow of iterative 3D reconstruction and support the goal of massive image data processing, high performance and high scalability, this article proposes an image distributed computing framework FIODH. It is a distributed computing framework based on distributed hash algorithm, which accomplishes the task of storing, calculating and merging the image data in multiple nodes. A SIFT algorithm is used to extract feature points from the original images which are distributed on the hash nodes. During the process of image clustering computation, the agent nodes are responsible for task management and intermediate result calculation. The clustering results in hierarchical trees which can be converted into computational tasks and assigned to the appropriate nodes. The experimental analysis shows that the algorithm has achieved satisfactory results in efficiency and error adjustment. In a large amount of experiment data, the advantage of the algorithm is more obvious.

APA, Harvard, Vancouver, ISO, and other styles

36

Țâmbulea, Leon, and Manuela Horvat-Petrescu. "Redistributing Fragments into a Distributed Database." International Journal of Computers Communications & Control 3, no. 4 (December 1, 2008): 384. http://dx.doi.org/10.15837/ijccc.2013.4.2406.

Full text

Abstract:

A distributed system database performance is strongly related to the fragment allocation in the nodes of the network. An heuristic algorithm for redistributing the fragments is proposed. The algorithm uses the statistical information relative to the requests send to a distributed database. This algorithm minimizes the size of the data transferred for solving a request. Assuming that a distribution of the fragments in the nodes of a network is known, the algorithm generates a plan to transfer data fragments, plan that will be used to evaluate a request.

APA, Harvard, Vancouver, ISO, and other styles

37

Stepanova, Maria V., and Oleg I. Eremin. "THE ASSIGNMENT OF TASKS TO THE NODES OF THE IOT DISTRIBUTED SYSTEM BASED ON REINFORCEMENT MACHINE LEARNING." АВТОМАТИЗАЦИЯ ПРОЦЕССОВ УПРАВЛЕНИЯ 63, no. 1 (2021): 27–33. http://dx.doi.org/10.35752/1991-2927-2021-1-63-27-33.

Full text

Abstract:

The article describes issues of applying an adaptive approach based on reinforcement learning for assignment of the computing tasks to nodes of distributed Internet of Things (IoT) platform. The IoT platform consists of heterogeneous elements that are computing nodes. Classical approaches, methods, and algorithms for distributed and parallel systems are not suitable for task assignment in IoT systems due to its characteristics. The reinforcement learning method allows you to solve the problem of building a distributed system due to the adaptive formation of a sequence of computational nodes and the corresponding computational tasks. Thus, the article represents a method that makes IoT nodes capable of execution computing tasks, especially, which were previously designed for classical distributed and parallel systems.

APA, Harvard, Vancouver, ISO, and other styles

38

Janapati, Ravichander, Ch Balaswamy, and K. Soundararajan. "Localization of Cooperative WSN using Distributed PSO with Optimum References." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 3094. http://dx.doi.org/10.11591/ijece.v6i6.11427.

Full text

Abstract:

In indoor environment WSN nodes are deployed randomly and do not know the accurate position. Find the node position with the help of anchor nodes is known as localization. CRB algorithm selects the best anchor nodes which gives high accuracy. In this paper distributed PSO algorithm with optimum selection of reference nodes using CRB is proposed to find accurate node position. The proposed method performs better in comparison with other algorithms like PSO, RLS, LMS and GPS in terms of position accuracy, latency and complexity.

APA, Harvard, Vancouver, ISO, and other styles

39

Janapati, Ravichander, Ch Balaswamy, and K. Soundararajan. "Localization of Cooperative WSN using Distributed PSO with Optimum References." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 3094. http://dx.doi.org/10.11591/ijece.v6i6.pp3094-3102.

Full text

Abstract:

In indoor environment WSN nodes are deployed randomly and do not know the accurate position. Find the node position with the help of anchor nodes is known as localization. CRB algorithm selects the best anchor nodes which gives high accuracy. In this paper distributed PSO algorithm with optimum selection of reference nodes using CRB is proposed to find accurate node position. The proposed method performs better in comparison with other algorithms like PSO, RLS, LMS and GPS in terms of position accuracy, latency and complexity.

APA, Harvard, Vancouver, ISO, and other styles

40

Devanaboyina, Tejaswini, Balakrishna Pillalamarri, and Rama Murthy Garimella. "Distributed Computation in Wireless Sensor Networks." International Journal of Wireless Networks and Broadband Technologies 4, no. 3 (July 2015): 14–32. http://dx.doi.org/10.4018/ijwnbt.2015070102.

Full text

Abstract:

Wireless Sensor Networks are used to perform distributed sensing in various fields like health, military, home etc where the sensor nodes communicate among themselves and do distributed computation over the sensed values to identify the occurrence of an event. The architecture for distributed computation of primitive recursive functions and median is presented in this paper. This paper assumes the no memory computational model of sensor nodes; in the architecture for primary recursive functions i.e. the sensor nodes only have two registers. This assumption is not made for the computation of median. This paper also explores the applications of wireless sensor networks in building a smart, hassle free transportation system. In purview of emerging technologies like Internet of things and Vehicular Ad Hoc networks, the transport system can be made user friendly by including itinerary planning, dynamic speed boards etc. Already research is moving in the direction of making transport system efficient and user-friendly. This paper serves as a one more step in the process of achieving it.

APA, Harvard, Vancouver, ISO, and other styles

41

Musavi Shirazi, Seyed Mohammad Bagher, Maryam Sabet, and Mohammad Reza Pajoohan. "A DISTRIBUTED ENERGY EFFICIENT CLUSTERING ALGORITHM FOR DATA AGGREGATION IN WIRELESS SENSOR NETWORKS." IIUM Engineering Journal 19, no. 1 (June 1, 2018): 72–90. http://dx.doi.org/10.31436/iiumej.v19i1.825.

Full text

Abstract:

Wireless sensor networks (WSNs) are a new generation of networks typically consisting of a large number of inexpensive nodes with wireless communications. The main purpose of these networks is to collect information from the environment for further processing. Nodes in the network have been equipped with limited battery lifetime, so energy saving is one of the major issues in WSNs. If we balance the load among cluster heads and prevent having an extra load on just a few nodes in the network, we can reach longer network lifetime. One solution to control energy consumption and balance the load among nodes is to use clustering techniques. In this paper, we propose a new distributed energy-efficient clustering algorithm for data aggregation in wireless sensor networks, called Distributed Clustering for Data Aggregation (DCDA). In our new approach, an optimal transmission tree is constructed among sensor nodes with a new greedy method. Base station (BS) is the root, cluster heads (CHs) and relay nodes are intermediate nodes, and other nodes (cluster member nodes) are the leaves of this transmission tree. DCDA balances load among CHs in intra-cluster and inter-cluster data communications using different cluster sizes. For efficient inter-cluster communications, some relay nodes will transfer data between CHs. Energy consumption, distance to the base station, and cluster headsâ€™ centric metric are three main adjustment parameters for the cluster heads election. Simulation results show that the proposed protocol leads to the reduction of individual sensor nodesâ€™ energy consumption and prolongs network lifetime, in comparison with other known methods. ABSTRAK: Rangkaian sensor wayarles (WSN) adalah rangkaian generasi baru yang terdiri daripada nod-nod murah komunikasi wayarles. Tujuan rangkaian-rangkaian ini adalah bagi mengumpul maklumat sekeliling untuk proses seterusnya. Nod dalam rangkaian ini dilengkapi bateri kurang jangka hayat, jadi simpanan tenaga adalah satu isu besar dalam WSN. Jika beban diimbang antara induk kelompok dan lebihan beban dihalang pada setiap rangkaian iaitu hanya sebilangan kecil nod pada tiap-tiap kelompok,Â jangka hayat dapat dipanjangkan pada sesebuah rangkaian. Satu penyelesaian adalah dengan mengawal penggunaan tenaga dan mengimbangi beban antara nod menggunakan teknik berkelompok. Kajian ini mencadangkan kaedah baru pembahagian tenaga berkesan secara algoritma berkelompok bagi pembahagian data dalam WSN, dikenali sebagai Pembahagian Kelompok Kumpulan Data (DCDA). Melalui pendekatan baru ini, pokok transmisi optimum dibina antara nod sensor melalui kaedah baru. Stesen utama (BS) ialah akar, induk kelompok-kelompok (CHs) dan nod penyiar ialah nod perantara, dan nod-nod lain (nod-nod ahli kelompok) ialah daun bagi pokok trasmisi. DCDA mengimbangi beban CHs antara-kelompok dan dalam-kelompok komunikasi data daripada kelompok berbeza saiz. Bagi komunikasi berkesan dalam-kelompok, sebahagian nod penyampai akan memindahkan data antara CHs. Penggunaan tenaga, jarak ke stesen utama dan induk kelompok metrik sentrik adalah tiga parameter pelaras bagi pemilihan induk kelompok. Keputusan simulasi protokol yang dicadang menunjukkan pengurangan penggunaan tenaga pada nod-nod sensor individu dan memanjangkan jangka hayat rangkaian, berbanding kaedah-kaedah lain yang diketahui.

APA, Harvard, Vancouver, ISO, and other styles

42

BUI, ALAIN, ABDURUSUL KUDIRETI, and DEVAN SOHIER. "AN ADAPTIVE RANDOM WALK BASED DISTRIBUTED CLUSTERING ALGORITHM." International Journal of Foundations of Computer Science 23, no. 04 (June 2012): 803–30. http://dx.doi.org/10.1142/s0129054112400370.

Full text

Abstract:

In this paper, we present a fully distributed random walk based clustering algorithm intended to work on dynamic networks of arbitrary topologies. A bounded-size core is built through a random walks based procedure. Its neighboring nodes that do not belong to any cluster are recruited by the core as ordinary nodes. Using cores allow us to formulate constraints on the clustering and fulfill them on any topology. The correctness and termination of our algorithm are proven. We also prove that when two clusters are adjacent, at least one of them has a complete core (i.e. a core with the maximum size allowed by the parameter). One of the important advantages of our mobility-adaptive algorithm is that the re-clustering is local: the management of the connections or disconnections of links and reorganization of nodes affect only the clusters in which they are, possibly adjacent clusters, and at worst, the ordinary nodes of the clusters adjacent to the neighboring clusters. This allows us to bound the diameter of the portion of the network that is affected by a topological change.

APA, Harvard, Vancouver, ISO, and other styles

43

Zhang, Lu, Shuang Xia Han, Wei Fan, and Ming Xia Yang. "A Distributed MDS-MAP Algorithm for Wireless Sensor Networks." Applied Mechanics and Materials 52-54 (March 2011): 1626–31. http://dx.doi.org/10.4028/www.scientific.net/amm.52-54.1626.

Full text

Abstract:

Aiming at the deficiencies of positioning accuracy and matrix operating complexity in the classical MDS-MAP locating algorithm in WSN, a distributed multi-dimensional scaling-MAP algorithm (MDS-MAP (D)) was proposed in this paper. In this algorithm, the distance of the nodes was quantified to obtain the close-neighbor vector (CNV), the distance matrix D and the initial value of nodes location was calculated. Theoretical analysis and simulation experimental results show that, the advance algorithm can realize the positioning of sensor nodes with good accuracy.

APA, Harvard, Vancouver, ISO, and other styles

44

Antoñanzas, Christian, Miguel Ferrer, Maria de Diego, and Alberto Gonzalez. "Control Effort Strategies for Acoustically Coupled Distributed Acoustic Nodes." Wireless Communications and Mobile Computing 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/3601802.

Full text

Abstract:

This paper considers the effect of effort constraints on the behavior of an active noise control (ANC) system over a distributed network composed of acoustic nodes. A distributed implementation can be desirable in order to provide more flexible, versatile, and scalable ANC systems. In this regard, the distributed version of the multiple error filtered-x least mean square (DMEFxLMS) algorithm that allows collaboration between nodes has shown excellent properties. However, practical constraints need to be considered since, in real scenarios, the acoustic nodes are equipped with power constrained actuators. If these constraints are not considered within the adaptive algorithm, the control signals may increase and saturate the hardware devices, causing system instability. To avoid this drawback, a control effort weighting can be considered in the cost function of the distributed algorithm at each node. Therefore, a control effort strategy over the output signals at each node is used to keep them under a given threshold and ensuring the distributed ANC system stability. Experimental results show that, assuming ideal network communications, the proposed distributed algorithm achieves the same performance as the leaky centralized ANC system. A performance evaluation of several versions of the leaky DMEFxLMS algorithm in realistic scenarios is also included.

APA, Harvard, Vancouver, ISO, and other styles

45

Li, Fang Zhen, and Xue Fen Zhang. "Distributed Estimation in Clustered Wireless Sensor Networks." Advanced Materials Research 187 (February 2011): 185–89. http://dx.doi.org/10.4028/www.scientific.net/amr.187.185.

Full text

Abstract:

We consider the problem of distributed estimation of a deterministic vector parameters using in clustered wireless sensor networks (WSNs). The paper using the method of multipliers in conjunction with a block coordinate descent approach, we demonstrate how the resultant algorithm can be decomposed into a set of simpler tasks suitable for distributed implementation based on maximum likelihood estimators (MLE) in nonlinear and non-Gaussian data models. the iterative algorithms based on the communication between nodes and the head node that generate a local estimation, and the head nodes can be seen as the neighbor node of all the other nodes in the cluster, it can broadcast its estimation in the cluster, and the local iterates converge to the global MLE, We prove that these algorithms have guaranteed convergence to the desired estimator when the sensor links are assumed ideal. Furthermore, corroborating simulations demonstrate the merits of the novel distributed estimation algorithms.

APA, Harvard, Vancouver, ISO, and other styles

46

Al-Mejibli, Intisar. "Developing Energy Aware Distributed Aggregation Tree Technique for Wireless Sensor Networks." Iraqi Journal for Computers and Informatics 43, no. 2 (December 31, 2017): 1–8. http://dx.doi.org/10.25195/ijci.v43i2.57.

Full text

Abstract:

Wireless sensor network WSN consists of small sensor nodes with limited resources, which are sensing, gathering and transmitting data to base station. Sensors of various types are deployed ubiquitously and widely in varied environments for instance, wildlife reserves, battlefields, mobile networks and office building. Sensor nodes are having restricted and non replenishable power resources and this is regarded as one of the main of their critical limits. All applied techniques and protocols on sensor nodes must take into consideration their power limitation. Data aggregation techniques are used by sensor nodes in order to minimize the power consumption by organizing the communication among sensor nodes and eliminating the redundant of sensed data. This paper proposed lightweight modification on data aggregation technique named Energy Aware Distributed Aggregation Tree EADAT. The main principle of this development is using the available information in sensor nodes to pass the role of parent node among sensor nodes in each cluster. The process of passing parent node role is based on nominating the sensor nodes which have higher power on regular bases. A model based on tree network architecture is designed for validation purpose and is used with NS2 simulator to test the proposed development. EADAT and EADAT with proposed development are applied on the designed model and the results were promising

APA, Harvard, Vancouver, ISO, and other styles

47

Jiang, Ke, Feng Wu, Linjun Shi, and Keman Lin. "Distributed Hierarchical Consensus-Based Economic Dispatch for Isolated AC/DC Hybrid Microgrid." Energies 13, no. 12 (June 20, 2020): 3209. http://dx.doi.org/10.3390/en13123209.

Full text

Abstract:

In this paper, a distributed hierarchical consensus algorithm is proposed to solve the economic dispatch (ED) problem for the isolated AC/DC hybrid microgrid. At first, the whole nodes of the AC/DC hybrid microgrid are divided into two parts, that is, the leadership layer nodes and the tracking layer nodes. The leadership layer nodes update the data through their own feedback elements, while the tracking layer nodes receive the information from the leadership layer nodes and update the data. After several iterations, the two different layer nodes obtain the same state, which realizes the dynamic active power balance of the whole AC/DC microgrid. Besides, the AC sub-grid and DC sub-grid can also realize the power balance by the proposed algorithm, and the energy storage units will absorb or release active power to meet the power demand in the respective section. In addition, the constraints of the nodes are also taken into account to guarantee that the power nodes in the AC/DC hybrid microgrid should operate within their own limitations, which is necessary to realize the ED for the considered hybrid microgrid. Finally, case study and simulation results are provided to illustrate the effectiveness of the proposed hierarchal method.

APA, Harvard, Vancouver, ISO, and other styles

48

Onyeka Ekengwu, Bonaventure, Paulinus Chinaenye Eze, Christopher Nnaemeka Asiegbu, Samuel Chukwuemeka Olisa, and Chimezie Felix Udechukwu. "Satellite dish antenna control for distributed mobile telemedicine nodes." International Journal of Informatics and Communication Technology (IJ-ICT) 11, no. 3 (December 1, 2022): 206. http://dx.doi.org/10.11591/ijict.v11i3.pp206-217.

Full text

Abstract:

The positioning control of a dish antenna mounted on distributed mobile telemedicine nodes (DMTNs) within Nigeria communicating via NigComSat-1R has been presented. It was desired to improve the transient and steady performance of satellite dish antenna and reduce the effect of delay during satellite communication. In order to overcome this, the equations describing the dynamics of the antenna positioning system were obtained and transformed into state space variable equations. A full state feedback controller was developed with forward path gain and an observer. The proposed controller was introduced into the closed loop of the dish antenna positioning control system. The system was subjected to unit step forcing function in MATLAB/Simulink simulation environment considering three different cases so as to obtain time domain parameters that characterized the transient and steady state response performances. The simulation results obtained revealed that the introduction of the full state feedback controller provided improved position tracking to unit step input with a rise time of 0.42 s, settling time of 1.22 s and overshoot of 4.91%. With the addition of observer, the rise time achieved was 0.39 s, settling time of 1.31 s, and overshoot of 10.7%. The time domain performance comparison of the proposed system with existing systems revealed its superiority over them.

APA, Harvard, Vancouver, ISO, and other styles

49

Meian, LI, Wang Buyu, Chao Lumeng, and Liu Jiangping. "Symmetric Distributed Quorum Generation Algorithm Based on Backup Nodes." Information Technology Journal 12, no. 16 (August 1, 2013): 3781–84. http://dx.doi.org/10.3923/itj.2013.3781.3784.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Stolpe, Audun, and Jonas Halvorsen. "Distributed query processing in the presence of blank nodes." Semantic Web 8, no. 6 (August 7, 2017): 1001–21. http://dx.doi.org/10.3233/sw-160250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Distributed nodes'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles