Achieving synchronization which occurs continuously with the change of situations in a distributed system is an important control functionality for a wide range of applications. In this paper, recognition of locally o...
详细信息
A novel, lattice self-reconfigurable modular robot called M-Cubes, which is three dimensional and homogeneous, was proposed. A distributed self-repair algorithm based on the location of the failed lattice self-reconfi...
详细信息
A novel, lattice self-reconfigurable modular robot called M-Cubes, which is three dimensional and homogeneous, was proposed. A distributed self-repair algorithm based on the location of the failed lattice self-reconfigurable module was presented. The algorithm can be used to solve the self-repair problem of most three dimensional lattice self-reconfigurable modular robots. The robot can use this method to repair itself wherever the failed module is. The method can effectively solve the computationally difficult problem when the failed module is inside the system by optimizing the motion path during the self-repair process. A computer simulation verified the feasibility and effectiveness of this self-repair algorithm.
Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption and radio interference, The goal of this technique is to control the topology of t...
详细信息
Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption and radio interference, The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this paper we present a new distributed learning based method to choose nodes transmitting range, in this method we run a range adjustment mechanism periodically to choose a near optimal transmitting range, we don't need any information about location of nodes or distance between nodes or received signal strength, the communication overhead of this method is very low, performance evaluation results show that this method decrease the energy consumption and overcome other existing methods in some scenarios.
Serial data aggregation ensures minimal energy consumption since only one sensor initiates the algorithm and each sensor communicates only once with its successor. But it is difficult in a real scenario (essentially d...
详细信息
Serial data aggregation ensures minimal energy consumption since only one sensor initiates the algorithm and each sensor communicates only once with its successor. But it is difficult in a real scenario (essentially distributed) to synchronize all sensors to collaborate. In this paper we propose a linear distributed algorithm to aggregate data and we simulate it for different scenarios using the ns2 network simulator. We conclude that the proposed algorithm consume energy in a uniform way.
This paper proposes an enhancement of the two levels dictionary based compression. The enhancement is based on optimizing the mapping tables overhead of the second level compression, usually variable length code, that...
详细信息
ISBN:
(纸本)9789532330731
This paper proposes an enhancement of the two levels dictionary based compression. The enhancement is based on optimizing the mapping tables overhead of the second level compression, usually variable length code, that used over the first level compression (the dictionary based one). The case study will be applied on ‘A-M' compression and will introduce the ‘A-M' dictionary version 2. This work guarantees the reduction of overhead from the second level compression up to 45% of the original mapping table. Besides, the use of ‘A-M' dictionary reduces the processing effort of recreation of dynamic dictionary. The idea is based on reducing the dictionary field of the mapping table by sorting, grouping, and then eliminating common parts (6 Most Significant Bits - MSB) of the dictionary words during compression, which is reconstructed back during decompression. The process is completely transparent with respect to the two levels of compression (dictionary and variable length) and can be applied not only for the ‘A-M' compression, but also for any other dictionary based compression technique.
Advanced Air Mobility (AAM) operations are expected to transform air transportation while challenging current air traffic management practices. By introducing a novel market-based mechanism, we address the problem of ...
详细信息
Advanced Air Mobility (AAM) operations are expected to transform air transportation while challenging current air traffic management practices. By introducing a novel market-based mechanism, we address the problem of on-demand allocation of capacity-constrained airspace to AAM vehicles with heterogeneous and private valuations. We model airspace and air infrastructure as a collection of contiguous regions (or sectors) with constraints on the number of vehicles that simultaneously enter, stay, or exit each region. Vehicles request access to airspace with trajectories spanning multiple regions at different times. We use the graph structure of our airspace model to formulate the allocation problem as a path allocation problem on a time-extended graph. To ensure that the cost information of AAM vehicles remains private, we introduce a novel mechanism that allocates each vehicle a budget of “air-credits” (an artificial currency) and anonymously charges prices for traversing the edges of the time-extended graph. We seek to compute a competitive equilibrium that ensures that: (i) capacity constraints are satisfied, (ii) a strictly positive resource price implies that the sector capacity is fully utilized, and (iii) the allocation is integral and optimal for each AAM vehicle given current prices, without requiring access to individual vehicle utilities. However, a competitive equilibrium with integral allocations may not always exist. We provide sufficient conditions for the existence and computation of a fractional-competitive equilibrium, where allocations can be fractional. Building on these theoretical insights, we propose a distributed, iterative, two-step algorithm that: 1) computes a fractional competitive equilibrium, and 2) derives an integral allocation from this equilibrium. We validate the effectiveness of our approach in allocating trajectories for the emerging urban air mobility service of drone delivery.
暂无评论