It is a great challenge to share,manage and apply abundant data that is occupying the hardware resources in the information ***-to-peer(P2P) technology has gained more and more attention as a research area because it ...
详细信息
It is a great challenge to share,manage and apply abundant data that is occupying the hardware resources in the information ***-to-peer(P2P) technology has gained more and more attention as a research area because it can provide fast and accurate inquires of service which is an important medium to solve the large information resources. However because of its openness and autonomy,there is a lot of unreliable service and fraud behavior in the P2P ***,the design of a reliable and efficient trust management mechanism is an important research subject. The paper brought the priority control into a gossip algorithm,using the trust value feedbacks by neighbors to make destination searching no longer blind and more reasonable,as well as more accurate and faster to *** study combines the search efficiency,cost and service that is required,and improves the gossip search algorithm of unstructured P2P network based on recommendation trust.
In this paper, we consider the problem of direction of arrival (DOA) estimation achieved by a distributed way in wireless sensors networks. The goal for each node is to detect targets based on its local information an...
详细信息
ISBN:
(纸本)9781467365567
In this paper, we consider the problem of direction of arrival (DOA) estimation achieved by a distributed way in wireless sensors networks. The goal for each node is to detect targets based on its local information and that of its neighbors through some iteration. Classic estimation methods, such as maximum likelihood (ML) algorithm, are not suitable here because there is often a requirement of a central unit to obtain the optimal solution. We propose a new distributed DOA estimation algorithms based on the randomized gossip method, the goal of which is to realize the conventional Capon method by a distributed way. The proposed algorithm does not require any constraint on the network geometries, thereby making it suitable for distributed signal processing in large wireless sensor networks. The given simulation results illustrate the main characteristics of the proposed algorithm, including DOA resolution and mean square error (MSE) performance.
Mobile Ad-hoc Network (MANET) are expected to be a means of communication for disaster victim support systems and information distribution systems at event sites where it is challenging to use existing infrastructure ...
详细信息
Mobile Ad-hoc Network (MANET) are expected to be a means of communication for disaster victim support systems and information distribution systems at event sites where it is challenging to use existing infrastructure owing to their feature of being able to build a network immediately among nodes that are present on the spot. An operating scenario of such a post-disaster application requires an all-to-all exchange of information that quickly and reliably exchanges a lot of information among a large number of nodes present at the scene to collect more decision-making materials. All-to-all communication places a lot of load on all nodes in the network as they exchange information about all nodes with each other. The MANET routing protocol is also heavily loaded due to route discovery by flooding, which, together with the all-to-all information exchange, is a double challenge to MANET. In this article, we propose an information exchange method that is robust to high-density nodes and high-traffic environments, assuming a situation where communication becomes difficult as a result of requests to send and receive large amounts of information between overcrowded nodes in crowded environments, such as evacuation centers, during a disaster and event sites. The proposed method overcomes the problems of conventional methods and achieves smooth information exchange by applying a delay tolerant network(DTN), a clustering method, and a gossip protocol method. Simulation experiments have shown that the proposed method is highly tolerant of network congestion and increase in the number of nodes due to all-to-all information exchange.
The convexity arguments used in the consensus literature to prove synchronization in vector spaces can be applied to the circle only when all agents are initially located on a semicircle. Existing strategies for (almo...
详细信息
The convexity arguments used in the consensus literature to prove synchronization in vector spaces can be applied to the circle only when all agents are initially located on a semicircle. Existing strategies for (almost-)global synchronization on the circle are either restricted to specific interconnection topologies or use auxiliary variables. The present paper first illustrates this problem by showing that weighted, directed interconnection topologies can be designed to make any reasonably chosen configuration of the agents on the circle a stable equilibrium of a basic continuous-time consensus algorithm. Then it proposes a so-called “gossip algorithm”, which achieves global asymptotic synchronization on the circle with probability 1 for a large class of interconnections, without using auxiliary variables, thanks to the introduction of randomness in the system.
This work proposes a decentralized and adaptive subspace estimation method, called the Power-Oja (P-Oja) method. Existing decentralized subspace tracking algorithms have slow convergence rate or are unable to adapt to...
详细信息
ISBN:
(纸本)9781509041183
This work proposes a decentralized and adaptive subspace estimation method, called the Power-Oja (P-Oja) method. Existing decentralized subspace tracking algorithms have slow convergence rate or are unable to adapt to time varying statistics. To resolve these issues, the P-Oja method is developed by combining the power method with Oja's learning rule. Our key innovation lies on the design of a modified objective function with enhanced spectral gap property. This allows the P-Oja method to track the principal subspace more quickly with a finite number of samples. Interestingly, the resulting method coincides with the conventional Oja's learning rule in some special cases. To enable decentralized signal processing, we further demonstrate that the proposed method can be implemented by using a gossip algorithm. Our simulation results show that the proposed P-Oja outperforms the conventional Oja's method in terms of estimation accuracy, and the power method in terms of tracking performance. The effect of the communication graph on the tracking performance is also studied.
Efficient search algorithm is one of the important issues in unstructured P2P systems. However, current search mechanisms are not efficient or scalable enough with the expansion of system. gossip-based P2P techniques ...
详细信息
ISBN:
(纸本)9781424442843
Efficient search algorithm is one of the important issues in unstructured P2P systems. However, current search mechanisms are not efficient or scalable enough with the expansion of system. gossip-based P2P techniques are reliable and scalable protocols for information dissemination. To this end, one search algorithm based on gossip algorithm with referral trust is proposed in our paper, in which peers can disseminate the query with low traffic and better efficiency.
With the development of smart grid technology, the future power system will become a complex cyber-physical system. The control and management of this system will impose new challenges to the current Supervisory Contr...
详细信息
ISBN:
(纸本)9781479940318
With the development of smart grid technology, the future power system will become a complex cyber-physical system. The control and management of this system will impose new challenges to the current Supervisory Control and Data Acquisition system such as scalability in its computational and communications effort, and robustness to single point of failure. Decentralized cooperative control is promising to control and manage such a system in a more efficient and robust way. Consensus based algorithms have been proposed by researchers to deal with various power system applications in a distributed manner. Because of the sensitivity to communications imperfections, the performance of the consensus based algorithms degrade when the communication packet loss happens in practical applications. In this paper, a Hybrid Incremental Cost Consensus (Hybrid ICC) algorithm is proposed. Different from other consensus based algorithms, the Hybrid ICC algorithm is robust against communications imperfections by integrating gossip algorithm and consensus algorithm together. Several case studies are presented to illustrate the performance of the proposed Hybrid ICC algorithm and demonstrate the scalability and robustness under packet loss scenarios.
暂无评论