Constructing sensor barriers to detect intruders crossing restricted regions, such as country borders, is one of the major application categories for wireless sensor networks. In this paper, we present a distributed a...
详细信息
ISBN:
(纸本)9781424456383
Constructing sensor barriers to detect intruders crossing restricted regions, such as country borders, is one of the major application categories for wireless sensor networks. In this paper, we present a distributed algorithm to find the maximum number of disjoint sensor barriers in wireless sensor networks. Our solution works for any sensor deployment, for any size and shape of a covered region, and even for heterogeneous sensor nodes. In particular, our algorithm is distributed and works perfectly in an asynchronous communication environment. It utilizes the property of wireless channel and has lower complexity compared with other algorithms. For a deployment of n sensors, our algorithm spends O(n(2)) messages and O(n(2)) time.
In the context of e-commerce, the concept of security involves two areas: hard security and soft security. Hard security includes cryptography, information hiding and other standards, while soft security is associated...
详细信息
ISBN:
(纸本)9781509021727
In the context of e-commerce, the concept of security involves two areas: hard security and soft security. Hard security includes cryptography, information hiding and other standards, while soft security is associated with the methods which are based on trust. finding malevolent entities or malevolent agents are one of the most important concepts in e-commerce. Thus, sufficient attention should be paid to their security. Since the centralized security management architecture in e-commerce environment and cannot have enough effectiveness nor be implemented, with the aim of overcoming the limitations of centralized architectures, a distributed and dynamic algorithm is proposed to finding malevolent entities and improving security. This algorithm uses a distributed network. The results of this study indicate that the proposed algorithm is capable of finds malevolent entities and improves security in a fast and efficient manner.
Phylogenetic tree reconstruction plays a key role in the field of bioinformatics for the understanding of evolutionary history of species and species traits. However, computation of such trees, especially for enormous...
详细信息
ISBN:
(纸本)9789811086366;9789811086359
Phylogenetic tree reconstruction plays a key role in the field of bioinformatics for the understanding of evolutionary history of species and species traits. However, computation of such trees, especially for enormous data sets, is a challenging task. Maximum Parsimony method generates accurate results, although it is highly resource intensive. In this paper, we present a novel algorithm that improves over the original Maximum Parsimony method. Following a bottom-up approach of the divide-and-conquer methodology, the algorithm divides the input data set into sub-data sets. Sub-trees corresponding to the sub-data sets are generated and analysed in parallel via multiple threads of execution running over multiple cores of multiple processors. Finally, they are merged to generate the optimal evolution tree. Cluster cell formation is encouraged with a novel idea of utilizing bitcoins to reward participating users. We show that our method has reduces time complexity and analyse the impact of bitcoins on user participation willingness. The proposed algorithm is programming language independent.
Multicast routing is a very important research issue in self-organizing networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to it is NP...
详细信息
ISBN:
(纸本)9781479951512
Multicast routing is a very important research issue in self-organizing networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to it is NP-completeness, many heuristic methods have been employed to solve the problem. This paper proposes distributed algorithm for optimized self-organizing network of multicast routing (DOSMR). Because self-organizing networks have a dynamic nature, the algorithm of solving this problem is required to meet the dynamic characteristics. The proposed algorithm node information is stored in the routing table to calculate the hops of multicast tree routing. The simulation results show the proposed algorithm superiority to the methods based on DCMPH.
This paper proposes a distributed algorithm to solve the economic dispatch problem (EDP) over fixed directed communication networks, which is based on ratio consensus and running sum method. Under the assumption that ...
详细信息
ISBN:
(纸本)9781728101057
This paper proposes a distributed algorithm to solve the economic dispatch problem (EDP) over fixed directed communication networks, which is based on ratio consensus and running sum method. Under the assumption that the network is strongly connected, the distributed algorithm can handle both packet drops and bounded time delays. The analyses of packet drops and time delays are based on the augmented digraph idea, which models the packet drops and time delays as virtual butlers" and "virtual" nodes respectively. Finally, some numerical examples are used to verify the proposed algorithm.
We investigate the problem of power balancing in a general renewable-integrated power grid with storage and flexible loads. We consider a power grid that is supplied by one conventional generator (CG) and multiple ren...
详细信息
ISBN:
(纸本)9781479975914
We investigate the problem of power balancing in a general renewable-integrated power grid with storage and flexible loads. We consider a power grid that is supplied by one conventional generator (CG) and multiple renewable generators (RGs) each co-located with storage, and is additionally connected with external markets. An aggregator operates the power grid and aims at minimizing the long-term system cost. We propose a distributed real-time power balancing solution, taking into account the uncertainty of the renewable generation, loads, and energy prices. We demonstrate that our proposed algorithm is asymptotically optimal as the storage capacity increases and the CG ramping constraint loosens. The distributed implementation enjoys a fast convergence rate and enables each RG and the aggregator to make their own decisions.
Demand response has recently become a topic of active research. Most of work however considers only the balance between aggregate load and supply, and abstracts away the underlying power network. In this paper, we stu...
详细信息
ISBN:
(纸本)9781467350518
Demand response has recently become a topic of active research. Most of work however considers only the balance between aggregate load and supply, and abstracts away the underlying power network. In this paper, we study demand response in a radial distribution network, by formulating it as an optimal power flow problem that maximizes the aggregate user utilities and minimizes the supply cost and the power line losses, subject to the power flow constraints and operating constraints. We propose a fully distributed algorithm for the users to coordinate their demand response decisions through local communication with their neighbors so as to achieve the optimum. Numerical examples with the real-world distribution circuits are provided to complement our theoretical analysis.
This paper deals with iterative formation control problems for multi-agent systems with switching topologies. Our approach combines consensus protocol algorithms conducted with an iterative learning control update. Th...
详细信息
ISBN:
(纸本)9781479986842
This paper deals with iterative formation control problems for multi-agent systems with switching topologies. Our approach combines consensus protocol algorithms conducted with an iterative learning control update. This leads to networks dynamically changing with evolution along two directions: a finite time axis and an infinite iteration axis. A distributed algorithm is constructed based on nearest neighbor information, and its convergence is established via a Roesser system-based two-dimensional approach. It is shown that a desired relative formation between agents can be achieved along a finite time trajectory if and only if the union of the interaction graphs between the agents over iteration intervals of finite length has a spanning tree for every time step. Simulations are included to illustrate the effectiveness of the derived results.
This paper presents a cooperative algorithm for multiple robots that move in 3-D unknown environment performing coverage and search tasks. We assume some significant constraints, i.e., each agent carried an onboard vi...
详细信息
ISBN:
(纸本)9781509066841
This paper presents a cooperative algorithm for multiple robots that move in 3-D unknown environment performing coverage and search tasks. We assume some significant constraints, i.e., each agent carried an onboard vision-based sensor facing downward to task area and has a limited communication radius. Based on the coverage control and probability map updated model, we proposed a combination method considering the tradeoff between probability information and Euclidean distance to obtain an optimal robots deployment. This algorithm is illustrated by the simulation and effectively make a group of robots searches multiple static targets under the coordination mechanism.
In a paper, Roscoe has proposed two algorithms that can preserve a form of consistency in the distributed databases arranged a ring, and validated them using a group-like algebra, invented by the same author. In this ...
详细信息
ISBN:
(纸本)9780769539423
In a paper, Roscoe has proposed two algorithms that can preserve a form of consistency in the distributed databases arranged a ring, and validated them using a group-like algebra, invented by the same author. In this paper, we have simplified one of the algorithms and tried to validate it by applying a simple set theory. We suppose that each process located at a node of the ring emits one only one update in its history and all processes insert their updates in the ring at the same time. The behavior of the system is synchronized by a global system clock, and at each tick of the system clock, all updates move to their right neighbors.
暂无评论