The proliferation of connected objects has revolutionized the traditional Internet, giving rise to the emerging Internet of Things (IoT). The IoT ecosystem is very large, and it includes smart interconnections among s...
详细信息
The proliferation of connected objects has revolutionized the traditional Internet, giving rise to the emerging Internet of Things (IoT). The IoT ecosystem is very large, and it includes smart interconnections among sensors and devices with applications in both the industrial world and customers' daily lives. As a unified standard for IoT is still under development, many challenges related to IoT must be discussed and addressed, especially those related to energy efficiency. This article tackles the challenge of energy efficiency in IoT from a novel perspective. It shows that instead of maximizing the QoS, which is generally energy costly, better energy efficiency can be achieved by targeting satisfactory QoS levels only. The approach aims to enhance energy efficiency while ensuring a desired QoS threshold. This is supported by a game theoretical solution concept referred to as the satisfaction equilibrium. Moreover, as IoT objects require self-configuring techniques to maintain the network scalability and flexibility, this article introduces fully distributed schemes in order to reach efficient satisfaction equilibria in both slow-and fast-fading channel contexts. The proposed schemes can also be adapted to achieve the maximum performance of IoT applications that desire the highest QoS levels. The performance of these algorithms is illustrated through a smart home use case scenario.
Due to the expanding scale of vehicles and the new demands of multimedia services, current vehicular networks face challenges to increase capacity, support mobility, and improve QoE. An innovative design of next gener...
详细信息
Due to the expanding scale of vehicles and the new demands of multimedia services, current vehicular networks face challenges to increase capacity, support mobility, and improve QoE. An innovative design of next generation vehicular networks based on the content-centric architecture has been advocated recently. However, the details of the framework and related algorithms have not been sufficiently studied. In this article, we present a novel framework of a content-centric vehicular network (CCVN). By introducing a content-centric unit, contents exchanged between vehicles can be managed based on their naming information. Vehicles can send interests to obtain wanted contents instead of sending conventional information requests. Then we present an integrated algorithm to deliver contents to vehicles with the help of content-centric units. Contents can be stored according to their priorities determined by vehicle density and content popularity. Pending interests are updated based on the analysis of transmission ratio and network topology. The location of a content-centric unit to provide content during the moving of vehicles is determined by the forwarding information. Finally, simulation experiments are carried out to show the efficiency of the proposed framework. Results indicate that the proposed framework outperforms the existing method and is able to deliver contents more efficiently.
We consider the problem of distributed learning, where a network of agents collectively aim to agree on a hypothesis that best explains a set of distributed observations of conditionally independent random processes. ...
详细信息
We consider the problem of distributed learning, where a network of agents collectively aim to agree on a hypothesis that best explains a set of distributed observations of conditionally independent random processes. We propose a distributed algorithm and establish consistency, as well as a nonasymptotic, explicit, and geometric convergence rate for the concentration of the beliefs around the set of optimal hypotheses. Additionally, if the agents interact over static networks, we provide an improved learning protocol with better scalability with respect to the number of nodes in the network.
This paper presents a single-chip, high-performance, and energy-efficient stereo vision depth-estimation processor for micro aerial vehicles (MAVs). The proposed processor implements the state-of-the-art semi-global m...
详细信息
This paper presents a single-chip, high-performance, and energy-efficient stereo vision depth-estimation processor for micro aerial vehicles (MAVs). The proposed processor implements the state-of-the-art semi-global matching (SGM) algorithm to deliver full high-definition (HD, 1920 × 1080) stereo-depth outputs with a maximum of 38 frames/s throughput. algorithm-architecture co-optimization is conducted, introducing overlapping block-based processing that eliminates very large on-chip memory and off-chip DRAM. We exploit inherent data parallelism in the algorithm by processing 128 local disparity costs and aggregating the SGM costs along four paths for all 128 disparities in parallel. A dependence-resolving scan associated with 16-stage deep pipeline is introduced to hide the data dependence between neighboring pixels in the SGM algorithm. Moreover, we propose a customized ultra-high bandwidth dual-port SRAM that utilizes the unique memory access characteristic of SGM to achieve highly energy-efficient memory access at a very high on-chip memory bandwidth of 1.64 Tb/s. The fabricated processor produces 512 levels of depth information for each pixel at full HD resolution with 30-frames/s performance, consuming 836 mW from a 0.75-V supply in TSMC 40-nm GP CMOS. We ported the design on a quadcopter MAV to demonstrate its performance in realistic real-time flight.
In this study, we propose two simple analytical reference drag profile (RDP) update algorithms for drag-based Mars atmospheric entry guidance. First, the dynamic model for the predictive range-to-go is modeled. Then, ...
详细信息
In this study, we propose two simple analytical reference drag profile (RDP) update algorithms for drag-based Mars atmospheric entry guidance. First, the dynamic model for the predictive range-to-go is modeled. Then, a parameter sensitivity theory in dynamic systems is applied to investigate this dynamic model and design RDP update algorithms. The two algorithms are, respectively, named as the constant update algorithm and the linear update algorithm. In the developed algorithms, a constant correction and a linear correction are used to update the current RDP. The two update algorithms are implemented without any iterative procedure. The linear update algorithm is expected to obtain higher range control accuracy than that of the constant update algorithm, because it is designed by considering the range control authority. A quasi-crossrange parameter is employed to design the bank-reversal logic. The damping coefficient for the quasi-crossrange parameter is updated with the bank reversals, using a simple gain scheduling method. Comparisons of the proposed algorithms with the entry terminal point controller and the drag-based guidance without RDP updates demonstrate the excellent performance of the proposed algorithms.
WiFi offloading, where mobile users opportunistically obtain data through WiFi rather than cellular networks, is a promising technique for greatly improving spectrum efficiency and reduce cellular network congestion. ...
详细信息
WiFi offloading, where mobile users opportunistically obtain data through WiFi rather than cellular networks, is a promising technique for greatly improving spectrum efficiency and reduce cellular network congestion. We consider a system where the service provider deploys multiple WiFi hotspots to offload mobile traffic, and study the scheduling policy to maximize the amount of offloaded data. Since users' movements are unpredictable, we focus on online scheduling policy, where APs have no knowledge of users' mobility patterns. We study the performance of online policies by comparing them against the optimal offline policy. We prove that any work-conserving policy is able to offload at least half as much data as the offline policy, and then propose an online policy such that when the requested data by each user is very large, the policy can offload (e-1)/e as much data as the offline policy, where e is Euler's constant. We further study the case where the service provider can increase the capacity of WiFi so as to provide some guarantees on the amount of offloaded data. We derive a lower-bound on the trade-off between capacity and the amount of offloaded data, and propose a simple online policy that achieves this lower bound. In addition, we show that our policy only needs half as much capacity as current mechanisms to provide the same performance guarantee.
Which test cases should be selected to save the time of software testing? Due to the large time cost of running all test cases, it is necessary to run representative test cases to shorten the software development cycl...
详细信息
Which test cases should be selected to save the time of software testing? Due to the large time cost of running all test cases, it is necessary to run representative test cases to shorten the software development cycle. Test suite reduction, an NP-hard problem in software engineering, aims to select a subset of test cases to reduce the time cost of test execution in satisfying test requirements. Recently, search based software engineering provides a new direction to test suite reduction by connecting software engineering problems with computational intelligence methods. In this paper, we propose a multi-level optimization algorithm to simplify the original problem instance of test suite reduction. In each level, we search for local optimal solutions with random walk in potential subsets of the test suite. The problem scale is reduced by locking the intersection of local optima and by discarding shielded test cases with no contribution to test requirements. We compare our algorithm with state-of-the-art methods on test suites of ten large-scale open source projects. Experiments show that our algorithm can more efficiently find optima on five out of six projects, in which Integer Linear Programming (ILP) can find optima;for the other four projects that ILP fails to solve, our algorithm provides the best solutions among heuristics in comparison.
The area of target tracking is a mature field with a great many algorithms having been developed over the years. Although this means that algorithms exist to suit a large number of specializations, such as radar, sona...
详细信息
The area of target tracking is a mature field with a great many algorithms having been developed over the years. Although this means that algorithms exist to suit a large number of specializations, such as radar, sonar, and image tracking, this also means that it can be difficult to determine which algorithm is the best. Additionally, the literature does not, for the most part, present complete algorithms for target tracking, but rather components of tracking algorithms. For example, measurements might be processed in various filters, which might themselves be incorporated into a framework for handling multiple dynamic models, which might be incorporated into a procedure for handling target measurement assignments, which could be part of a general track initiation and termination procedure, and all of which would tie into scheduling algorithms that select waveforms and dwell times for a radar. On top of that, various physical models are needed for handling atmospheric refraction and other effects. Consequently, the Tracking Component Framework described here has been created as a first step to simplifying the rapid design and evaluation of target-tracking algorithms.
This paper considers the phase-only sequence design problem for a cognitive radar in order to achieve both the desired autocorrelation and the stopband properties, which is useful to obtain good range compression as w...
详细信息
This paper considers the phase-only sequence design problem for a cognitive radar in order to achieve both the desired autocorrelation and the stopband properties, which is useful to obtain good range compression as well as the spectral compatibility. We develop a new objective function accounting for the weighted integrated sidelobe level and the spectral power within specific stopbands. An iteration algorithm based on pattern search (PS) is proposed to minimize the nonconvex multidimensional objective function with the continuous phase case, which is split into multiple one-dimensional problems that are simplified and solved with closed-form solutions. In particular, the PS algorithm can be applied to the discrete phase case. Finally, we evaluate the effectiveness of the PS algorithm compared with the weighted-stopband cyclic algorithm new algorithm via numerical simulations in terms of the autocorrelation function, the spectral power function, and the convergence speed.
This article presents the following contributions: 1) a novel mapping of a firefly algorithm (FA) to a multiobjective DSE process, 2) a novel FA-driven DSE (FA-DSE) methodology during HLS for an application-specific c...
详细信息
This article presents the following contributions: 1) a novel mapping of a firefly algorithm (FA) to a multiobjective DSE process, 2) a novel FA-driven DSE (FA-DSE) methodology during HLS for an application-specific computing system based on an area-execution time tradeoff, 3) a novel boundary outreach algorithm to thwart explosion during the exploration process, 4) a novel sensitivity analysis that provides optimal tuning of FA control parameters (such as the absorption coefficient, control step-size parameter, population size, and so forth) for performing DSE that leads to faster convergence, and 5) the results of a comparison during experiments indicating a reduction factor of up to 2.90 times in the proposed design cost as well as a minimum exploration-time reduction of ~35% compared to other DSE approaches.
暂无评论