检索结果-内蒙古大学图书馆

Survey of Bio-Inspired Resource Allocation algorithms and MAC Protocol design Based on a Bio-Inspired algorithm for Mobile Ad Hoc Networks

引用

IEEE COMMUNICATIONS MAGAZINE 2018年第1期56卷 119-127页

作者： Jung, Ji-Young Choi, Hyun-Ho Lee, Jung-Ryun Chung Ang Univ Seoul South Korea Hankyong Natl Univ Dept Elect Elect & Control Engn Anseong South Korea Chung Ang Univ Sch Elect Engn Seoul South Korea

A variety of recent studies have attempted to apply biologically inspired (bio-inspired) algorithms to distributed resource allocation problems because they promise to enable efficient decentralized communication. In this article, we discuss the key challenges of MANETs with respect to bandwidth utilization, fairness, scalability, QoS, energy efficiency, and mobility. We also provide an overview of the state of the art of bio-inspired algorithms for resource allocation and describe the key benefits of using bio-inspired resource allocation algorithms in order to solve the various challenges of MANETs. Using the underlying key features of such bio-inspired algorithms, we design and implement a framework for a bio-inspired MAC protocol suited to MANETs and evaluate its performance. A simulation verifies that the proposed MAC protocol outperforms the existing MAC protocols in terms of throughput, delay, fairness, overhead, and energy efficiency. Finally, we discuss open issues associated with application of bio-inspired algorithms to resource allocation in MANETs.

关键词： Ad hoc networks Resource management Mobile computing algorithm design and analysis Quality of service Media Access Protocol Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Multiagent-Based Coordination Consensus algorithm for State-of-Charge Balance of Energy Storage Unit

引用

COMPUTING IN SCIENCE & ENGINEERING 2018年第2期20卷 64-77页

作者： Yang, Hanqing Yin, Liangzhen Li, Qi Chen, Weirong Zhou, Lijun Southwest Jiaotong Univ Chengdu Sichuan Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu Sichuan Peoples R China

A multiagent-based coordination consensus algorithm was designed to simultaneously meet state-of-charge consensus and DC bus voltage stability requirements. A distributed energy storage system model with four batteries was built in Matlab/Simulink, and local droop control was employed to achieve the proposed algorithm. A multiagent system and agent weak communication network were constructed in the JADE platform, and the effectiveness of the proposed algorithm was verified by Simulink and JADE interactive simulation. The effect of communication delay on the system was also analyzed.

关键词： Digital Simulation Energy Storage Multi Agent Systems Power Engineering Computing Energy Storage Unit Multiagent Based Coordination Consensus algorithm State Of Charge Consensus DC Bus Voltage Stability Requirements Distributed Energy Storage System Model Multiagent System State Of Charge Balance Matlab Simulink Local Droop Control Agent Weak Communication Network JADE Platform JADE Interactive Simulation Information Processing Object Recognition Prediction algorithms Classification algorithms algorithm design and analysis Mathematical Model Intelligent Systems Multi Agent Systems Intelligent Information Processing Scientific Computing Green Computing Distributed Energy Storage System Multiagent System Consensus algorithm Weak Communication Network

来源：评论

学校读者我要写书评

暂无评论

A Heuristic algorithm for a Low Autocorrelation Binary Sequence Problem With Odd Length and High Merit Factor'

引用

IEEE ACCESS 2018年 6卷 4127页

作者： Brest, Janez Boskovic, Borko Univ Maribor Inst Comp Sci Fac Elect Engn & Comp Sci SLO-2000 Maribor Slovenia

A low autocorrelation binary sequence (LABS) problem is a hard combinatorial problem and its solutions are important in many practical applications. Till now, the largest best-known skew-symmetric sequence with merit factor greater than 9 had a length of 189. In this paper, a new heuristic algorithm is presented for the LABS problem. The proposed algorithm stores promising solutions and this mechanism enables the algorithm to perform local searches on these solutions in a systematic way. Our algorithm was tested on skew-symmetric sequences and the obtained results are compared with results of the state-of-the-art algorithms. The proposed algorithm was able to find some new best-known skew-symmetric solutions with merit factor greater than 9 in sequence lengths over 200. The obtained results improve the suggestion from 1985 (Beenker et al.) and 1987 (Bernasconi) greatly, where the merit factor is approximately equal to 6 for long skew-symmetric sequences with length up to 199. Now, the largest best-known skew-symmetric sequence with merit factor greater than 9 has the length 225. Additionally, now all merit factors are greater than 8 : 5 on the interval from 159 up to 225 for odd lengths.

关键词： algorithm design and analysis combinatorial optimization heuristic algorithms aperiodic autocorrelation merit factor skew-symmetric sequences

来源：评论

学校读者我要写书评

暂无评论

Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2018年第3期26卷 1151-1164页

作者： Yu, Ye Belazzougui, Djamal Qian, Chen Zhang, Qin Univ Kentucky Dept Comp Sci Lexington KY 40508 USA CERIST DTISI Ben Aknoun Algeria Univ Calif Santa Cruz Dept Comp Engn Santa Cruz CA 95064 USA Indiana Univ Comp Sci Dept Bloomington IN 47405 USA

Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding information base (FIB), as a typical network processing component, requires a scalable and memory-efficient algorithm to support fast lookups. In this paper, we present a new network algorithm, Othello hashing, and its application of a FIB design called concise, which uses very little memory to support ultra-fast lookups of network names. Othello hashing and concise make use of minimal perfect hashing and relies on the programmable network framework to support dynamic updates. Our conceptual contribution of concise is to optimize the memory efficiency and query speed in the data plane and move the relatively complex construction and update components to the resource-rich control plane. We implemented concise on three platforms. Experimental results show that concise uses significantly smaller memory to achieve much faster query speed compared to existing solutions of network name lookups.

关键词： Packet switching software defined networking algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Distributed Submodular Maximization With Limited Information

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2018年第4期5卷 1635-1645页

作者： Gharesifard, Bahman Smith, Stephen L. Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

We consider a class of distributed submodular maximization problems in which each agent must choose a single strategy from its strategy set. The global objective is to maximize a submodular function of the strategies chosen by each agent. When choosing a strategy, each agent has access to only a limited number of other agents' choices. For each of its strategies, an agent can evaluate its marginal contribution to the global objective given its information. The main objective is to investigate how this limitation of information about the strategies chosen by other agents affects the performance when agents make choices according to a local greedy algorithm. In particular, we provide lower bounds on the performance of greedy algorithms for submodular maximization, which depend on the clique number of a graph that captures the information structure. We also characterize graph-theoretic upper bounds in terms of the chromatic number of the graph. Finally, we demonstrate how certain graph properties limit the performance of the greedy algorithm. Simulations on several common models for random networks demonstrate our results.

关键词： algorithm design and analysis control systems distributed optimization greedy algorithms multiagent systems submodular functions

来源：评论

学校读者我要写书评

暂无评论

Air-to-Ground NOMA Systems for the "Internet-Above-the-Clouds"

引用

IEEE ACCESS 2018年 6卷 47442-47460页

作者： Botsinis, Panagiotis Alanis, Dimitrios Xu, Chao Babar, Zunaira Chandra, Daryus Ng, Soon Xin Hanzo, Lajos Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

The provision of high-speed Internet access in an aircraft is mainly supported by satellite links at the time of writing, aided by links between the aircraft and the ground stations. It is anticipated that Air-To-Ground (A2G) communications between en-route aircraft and the ground stations will have a major role in providing the required quality of service, while complying with the low latency requirements of next-generation of communications networks. Non-orthogonal multiple access (NOMA) systems will increase the system throughput by allowing multiple aircraft to simultaneously communicate with the ground station, while requiring fewer resource slots. Given the limited number of orthogonal resource "slots" and the high number of aircraft to be supported, a potentially high level of interference is expected. In this contribution, we employ beamforming based on the angle of arrival of the signals and antenna arrays having multiple antenna elements, as well as a novel interference-exploiting sphere decoder, which detects the signals of the supported users, while beneficially exploiting those of the interfering users. We show that an improved performance may be achieved in both hard-input hard-output scenarios, as well as in iterative soft-input soft-output scenarios, when compared with the conventional sphere decoder, the maximum likelihood detector and the maximum a posteriori probability detector. We also characterize the complexity of the proposed receiver and evaluate its performance with the aid of bit error ratio simulations and extrinsic information transfer charts.

关键词： Aircraft communications algorithm design and analysis beamforming multiuser detection non-orthogonal multiple access optimization sphere decoder wireless communication

来源：评论

学校读者我要写书评

暂无评论

A Semi-Open Loop GNSS Carrier Tracking algorithm for Monitoring Strong Equatorial Scintillation

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2018年第2期54卷 722-738页

作者： Xu, Dongyang Morton, Yu Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80523 USA Univ Colorado Dept Aerosp Engn Sci Boulder CO 80309 USA

Strong equatorial ionospheric scintillation of radio signals is often associated with simultaneous deep amplitude fading and rapid random carrier phase fluctuations. It poses a challenge for satellite navigation receiver carrier phase tracking loop operation. This paper presents a semi-open loop algorithm that utilizes the known position of a stationary receiver and satellite orbit information to estimate carrier phase variations during deep signal fading. Strong GPS scintillation data collected on Ascension Island in March 2013 are processed to reveal fast phase changes of half and full cycles over tens of milliseconds on all three GPS frequencies. Simulated signals are used to validate the algorithm and confirm that the fast phase changes are true scintillation effects rather than receiver processing artifacts. The algorithm performance is demonstrated through comparison with several closed-loop implementations. Potential errors associated with receiver clock bias and other environmental factors are also analyzed. A statistical summary of the concurrent fast phase changes and deep fades based on the processing results of the Ascension Island data is presented.

关键词： Receivers Fading channels Phase locked loops Tracking loops Global navigation satellite system algorithm design and analysis Phase estimation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Minimum-Latency Collision-Free Scheduling algorithm for Data Aggregation in Wireless Sensor Networks

引用

IEEE SYSTEMS JOURNAL 2018年第3期12卷 2214-2225页

作者： Ngoc-Tu Nguyen Liu, Bing-Hong Van-Trung Pham Liou, Ting-Yan Missouri Univ Sci & Technol Dept Mech & Aerosp Engn Rolla MO 65409 USA Natl Kaohsiung Univ Appl Sci Dept Elect Engn Kaohsiung 80778 Taiwan Pham Van Dong Univ Fac Informat Technol Quang Ngai 570000 Vietnam

Data collection is one of the most important operations in applications of wireless sensor networks (WSNs). In many emerging WSN applications, it is urgent to achieve a guarantee for the latency involved in collecting data. Many researchers have studied collecting data in WSNs with minimum latency but without data collision while assuming that any (or no) data are allowed to he aggregated into one packet. In addition, tree structures are often used for solutions. However, in some cases, a fixed number of data are allowed to be aggregated into one packet. This motivates us to study the problem of minimizing the latency for data aggregation without data collision in WSNs when a fixed number of data are allowed to be aggregated into one packet, termed the minimum-latency collision-avoidance multiple-data-aggregation scheduling (MLCAMDAS) problem. The MLCAMDAS problem is shown to be NP-complete here. In addition, a nontree-based method, termed the independent-set-based collision-avoidance scheduling (ISBCAS) algorithm, is proposed accordingly. The ISBCAS is demonstrated via simulations to have good performance.

关键词： algorithm design and analysis algorithms collision avoidance computer simulation wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

Traffic Events Oriented Dynamic Traffic Assignment Model for Expressway Network: A Network Flow Approach

引用

IEEE INTELLIGENT TRANSPORTATION SYSTEMS MAGAZINE 2018年第1期10卷 107-120页

作者： Du, Lun Song, Guojie Wang, Yiming Huang, Jipeng Yu, Zhanyuan Ruan, Mengfei Peking Univ Beijing 100871 Peoples R China Univ Southern Calif Los Angeles CA 90089 USA

In this paper, we focus on the dynamic traffic assignment (DTA) problem on large-scale expressway networks especially under the condition of traffic events (such as severe weather, large traffic accidents etc.). We formulate the expressway network DTA problem as a nonconvex optimization problem. Considering the difficulty of solving the problem, we put forward an approximate solution algorithm based on the network flow theory with high computational efficiency and strong applicability. Specifically, a machine learning approach and a series of customization strategies of network flow model (including multi-origin and multi-destination split, flow discretization and parallel edges addition methods) are proposed to transform the DTA problem into a resoluble network flow problem. After that, in order to improve the operational efficiency of an expressway network after traffic events occurring, the proposed network flow based two-layer DTA model (NTDM) is separated into two parts-traffic flow limitation model based on maximum flow algorithm and traffic assignment model based on minimum cost flow algorithm. Experiments on real expressway network data in some provinces of China show that our method can make a significant 26.03% reduction in saturation rate in a particular scenario. In efficiency test, the NTDM is at least 600 times faster than the traditional analytic method in a network with thousands of nodes.

关键词： Computational modeling algorithm design and analysis Analytical models Optimization Mathematical model High performance computing Heuristic algorithms Traffic control Accidents

来源：评论

学校读者我要写书评

暂无评论

Loihi: A Neuromorphic Manycore Processor with On-Chip Learning

引用

IEEE MICRO 2018年第1期38卷 82-99页

作者： Davies, Mike Srinivasa, Narayan Lin, Tsung-Han Chinya, Gautham Cao, Yongqiang Choday, Sri Harsha Dimou, Georgios Joshi, Prasad Imam, Nabil Jain, Shweta Liao, Yuyun Lin, Chit-Kwan Lines, Andrew Liu, Ruokun Mathaikutty, Deepak Mccoy, Steve Paul, Arnab Tse, Jonathan Venkataramanan, Guruguhanathan Weng, Yi-Hsin Wild, Andreas Yang, Yoonseok Wang, Hong Intel Corp Intel Labs Santa Clara CA 95054 USA Eta Compute Westlake Village CA 91362 USA Reduced Energy Microsyst San Francisco CA USA

Loihi is a 60-mm(2) chip fabricated in Intel's 14-nm process that advances the state-of-the-art modeling of spiking neural networks in silicon. It integrates a wide range of novel features for the field, such as hierarchical connectivity, dendritic compartments, synaptic delays, and, most importantly, programmable synaptic learning rules. Running a spiking convolutional form of the Locally Competitive algorithm, Loihi can solve LASSO optimization problems with over three orders of magnitude superior energy-delay product compared to conventional solvers running on a CPU isoprocess/voltage/area. This provides an unambiguous example of spike-based computation, outperforming all known conventional solutions.

关键词： algorithm design and analysis artificial intelligence Biological neural networks Computational modeling Computer architecture machine learning neuromorphic computing Neuromorphics Neurons

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：