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

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING 2018年第2期2卷 327-335页

作者： Dhif-Allah, Oussama Dahrouj, Hayssam Al-Naffouri, Tareq Y. Alouini, Mohamed-Slim Harvard Univ John A Paulson Sch Engn & Appl Sci Cambridge MA 02138 USA Effat Univ Dept Elect Engn Jeddah 22332 Saudi Arabia King Abdullah Univ Sci & Technol Div Comp Elect & Math Sci & Engn Thuwal 239556900 Saudi Arabia

Conventional cloud radio access networks (CRANs) assume single cloud processing and treat inter-cloud interference as background noise. This paper considers the downlink of a multi-CRAN where each cloud is connected to several base-stations (BSs) through limited-capacity wireline backhaul links. The set of BSs connected to each cloud, called cluster, serves a set of pre-known mobile users. The performance of the system becomes therefore a function of both inter-cloud and intra-cloud interference, as well as the compression schemes of the limited capacity backhaul links. This paper assumes independent compression scheme and imperfect channel state information (CSI) where the CSI errors belong to an ellipsoidal bounded region. The problem of interest becomes one of minimizing the network total transmit power subject to BS power and quality of service constraints, as well as backhaul capacity and CSI error constraints. This paper suggests solving the problem using the alternating direction method of multipliers (ADMMs). One highlight of this paper is that the proposed ADMM-based algorithm can be implemented in a distributed fashion across the multi-cloud network by allowing a limited amount of information exchange between the coupled clouds. Simulation results show that the proposed distributed algorithm provides a similar performance to the centralized algorithm in a reasonable number of iterations.

关键词： Multi-cloud radio access network ADMM limited capacity backhaul links imperfect CSI distributed implementation

来源：评论

学校读者我要写书评

暂无评论

Fast Consensus by the Alternating Direction Multipliers Method

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2011年第11期59卷 5523-5537页

作者： Erseghe, Tomaso Zennaro, Davide Dall'Anese, Emiliano Vangelista, Lorenzo Univ Padua Dept Informat Engn I-35131 Padua Italy Univ Minnesota Dept Elect Engn Minneapolis MN 55455 USA

The alternating direction multipliers method (ADMM) has been recently proposed as a practical and efficient algorithm for distributed computing. We discuss its applicability to the average consensus problem in this paper. By carefully relaxing ADMM augmentation coefficients we are able to analytically investigate its properties, and to propose simple and strict analytical bounds. These provide a clear indication on how to choose system parameters for optimized performance. We prove both analytically and via simulations that the proposed approach exhibits convergence speed between the best in the literature (classical and optimized solutions), while providing the most powerful resilience to noise.

关键词： Alternating direction multipliers method (ADMM) consensus convergence speed distributed implementation noise resilience optimization methods sensor networks

来源：评论

学校读者我要写书评

暂无评论

A simple, object-based view of multiprogramming

引用

FORMAL METHODS IN SYSTEM DESIGN 2002年第1期20卷 23-45页

作者： Misra, J Univ Texas Dept Comp Sci Austin TX 78712 USA

Object-based sequential programming has had a major impact on software engineering. However, object-based concurrent programming remains elusive as an effective programming tool. The class of applications that will be implemented on future high-bandwidth networks of processors will be significantly more ambitious than the current applications (which are mostly involved with transmissions of digital data and images), and object-based concurrent programming has the potential to simplify designs of such applications. Many of the programming concepts developed for databases, object-oriented programming and designs of reactive systems can be unified into a compact model of concurrent programs that can serve as the foundation for designing these future applications. We propose a model of multiprograms and a discipline of programming that addresses the issues of reasoning (e.g., understanding) and efficient implementation. The major point of departure is the disentanglement of sequential and multiprogramming features. We propose a sparse model of multiprograms that distinguishes these two forms of computations and allows their disciplined interactions.

关键词： multiprogramming concurrency object-based programming distributed implementation semaphore communicating processes

来源：评论

学校读者我要写书评

暂无评论

Linear forwarders

引用

INFORMATION AND COMPUTATION 2007年第10期205卷 1526-1550页

作者： Gardner, Philippa Laneve, Cosimo Wischik, Lucian Univ Bologna I-40126 Bologna Italy Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England Microsoft Corp Redmond WA 98052 USA

A linear forwarder is a process that receives one message on a channel and sends it on a different channel. We use linear forwarders to provide a distributed implementation of Milner's asynchronous pi calculus. Such a distributed implementation is known to be difficult due to input capability, where a received name is used as the subject of a subsequent input. This allows the dynamic creation of large input processes in the wrong place, thus requiring comparatively large code migrations in order to avoid consensus problems. Linear forwarders constitute a small atom of input capability that is easy to move. We show that the full input capability can be simply encoded using linear forwarders. We also design a distributed machine, demonstrating the ease with which we can implement the pi calculus using linear forwarders. We also show that linear forwarders allow for a simple encoding of distributed choice and have "clean" behaviour in the presence of failures. (C) 2007 Elsevier Inc. All rights reserved.

关键词： pi-calculus distributed implementation input capability linear forwarders

来源：评论

学校读者我要写书评

暂无评论

A compiler to implement LOTOS specifications in distributed environments

引用

COMPUTER NETWORKS 2001年第2-3期36卷 291-310页

作者： Yasumoto, K Higashino, T Taniguchi, K Shiga Univ Fac Econ Dept Informat Proc & Managment Shiga Japan Osaka Univ Dept Informat & Math Sci Osaka Japan

In this paper, we propose a method for implementing distributed systems using the formal description language LOTOS. First, we give a sub-class of LOTOS for specifying distributed systems. In the sub-class, each system's behavior is described as a set of interacting processes where each process is assigned to a specific node of a distributed system and inter-node process interaction is specified with LOTOS operators such as choice, disabling and multi-way synchronization. We propose a method to implement such a LOTOS specification as a set of programs which run on the corresponding nodes cooperating with each other by exchanging messages. In the proposed method, we transform processes assigned to a node into a multi-threaded executable program, and implement LOTOS operators specified among processes on distributed nodes with total-order broadcast communication. We have developed a LOTOS compiler based on the proposed method. Some experimental results show that programs generated from distributed systems' specifications can be used as prototypes for practical use or for performance evaluation/analysis. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： LOTOS multi-way synchronization distributed implementation compiler formal description techniques multi-thread

来源：评论

学校读者我要写书评

暂无评论

distributed Cooperative Localization for Mobile Wireless Sensor Networks

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2018年第1期7卷 18-21页

作者： Salari, Soheil Kim, Il-Min Chan, Francois Queens Univ Fac Engn & Appl Sci Kingston ON K7K6W8 Canada Royal Mil Coll Canada Dept Elect & Comp Engn Kingston ON K7K 7B4 Canada

In this letter, we consider a mobile wireless sensor network (WSN), in which all nodes have some knowledge about their movements. Exploiting the sensor mobility information in the localization process, we develop novel cooperative second-order cone programming-based localization algorithms for both time-of-arrival and received signal strength measurement models. We show that the developed algorithms can also be implemented in a distributed manner, and hence, are suitable for large-scale WSNs. The proposed mobility-aided localization framework significantly improves the localization accuracy and addresses some typical positioning problems.

关键词： Cooperative localization distributed implementation mobile wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

A Regularization Framework for Learning Over Multitask Graphs

引用

IEEE SIGNAL PROCESSING LETTERS 2019年第2期26卷 297-301页

作者： Nassif, Roula Vlaski, Stefan Richard, Cedric Sayed, Ali H. Ecole Polytech Fed Lausanne Inst Elect Engn CH-1015 Lausanne Switzerland Univ Nice Sophia Antipolis F-06100 Nice France

This letter proposes a general regularization framework for inference over multitask networks. The optimization approach relies on minimizing a global cost consisting of the aggregate sum of individual costs regularized by a term that allows to incorporate global information about the graph structure and the individual parameter vectors into the solution of the inference problem. An adaptive strategy, which responds to streaming data and employs stochastic approximations in place of actual gradient vectors, is devised and studied. Methods allowing the distributed implementation of the regularization step are also discussed. This letter shows how to blend real-time adaptation with graph filtering and a generalized regularization framework to result in a graph diffusion strategy for distributed learning over multitask networks.

关键词： Multitask graphs spectral based regularization gradient noise distributed implementation

来源：评论

学校读者我要写书评

暂无评论

Optimal Primary-Secondary User Cooperation Policies in Cognitive Radio Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2015年第6期14卷 3443-3455页

作者： Chatzidiamantis, Nestor D. Matskani, Evangelia Georgiadis, Leonidas Koutsopoulos, Iordanis Tassiulas, Leandros Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki 54124 Greece AUEB Dept Informat Athens 11362 Greece Ctr Res & Technol Hellas CERTH Thessaloniki 57001 Greece Yale Univ New Haven CT 06520 USA

In cognitive radio networks, secondary users (SUs) may cooperate with the primary user (PU) so that the success probability of PU transmissions are improved, while SUs obtain more transmission opportunities. However, SUs have limited power resources and, therefore, they have to take intelligent decisions on whether to cooperate or not and at which power level, to maximize their throughput. Cooperation policies in this framework require the solution of a constrained Markov decision problem with infinite state space. In our work, we restrict attention to the class of stationary policies that take randomized decisions of an SU activation and its transmit power in every time slot based only on spectrum sensing. Assuming infinitely back-logged SUs queues, the proposed class of policies is shown to achieve the maximum throughput for the SUs, while significantly enlarging the stability region of PU queue. The structure of the optimal policies remains the same even if the assumption of infinitely backlogged SU queues is relaxed. Furthermore, the model is extended for the case of imperfect channel sensing. Finally, a lightweight distributed protocol for the implementation of the proposed policies is presented, which is applicable to realistic scenarios.

关键词： Opportunistic cooperation resource allocation imperfect sensing distributed implementation

来源：评论

学校读者我要写书评

暂无评论

Toward Real-Time Seismic Feature Analysis for Bright Spot Detection: A distributed Approach

引用

IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING 2018年第1期11卷 322-331页

作者： Rizk, Yara Partamian, Hmayag Awad, Mariette Amer Univ Beirut Dept Elect & Comp Engn Beirut 11072020 Lebanon

Bright spots have been the primary approach to identify hydrocarbon bearing formations. Specifically, three-dimensional (3-D) seismic texture analysis has been employed to identify such locations of interest. However, raw seismic data are large in volume and require a plethora of preprocessing techniques before meaningful information can be extracted. Hence, bright spot detection from seismic data is a computationally expensive problem. In this paper, we implemented distributed feature extraction workflows of two-dimensional (2-D) and 3-D statistical and texture features for bright spot detection and achieved at least 9x speed up on a cluster of 12 workers. We also applied a 2-D continuous wavelet transform to the seismic images before feature extraction, which resulted in clearer bright spot images. Support vector machines, k-nearest neighbor, and extreme learning machines (ELM) classifiers were trained on the imbalanced 2-D and 3-D feature sets. ELM, known for its fast training time, achieved the highest f-measure of 91.5% on some 3-D seismic F3 block volume data, from the offshore of The Netherlands (North Sea) available on the OpenDtect software, which motivates follow-on research.

关键词： Bright spot dectection distributed implementation extreme learning machines (ELM) seismic analysis wavelet transformation

来源：评论

学校读者我要写书评

暂无评论

distributed source-relay selection scheme for vehicular relaying networks under eavesdropping attacks

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2014年第1期2014卷 1页

作者： Sun, Li Ren, Pinyi Du, Qinghe Xi An Jiao Tong Univ Dept Informat & Commun Engn Xian 710049 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

The recent development of vehicular networking technologies brings the promise of improved driving safety and traffic efficiency. Cooperative communication is recognized as a low-complexity solution for enhancing both the reliability and the throughput of vehicular networks. However, due to the openness of wireless medium, the vehicular wireless communications (VWC) is also vulnerable to potential eavesdropping attacks. To tackle with this issue, we in this paper propose a novel user-cooperation scheme with anti-eavesdropping capabilities. Specifically, prior to any frame transmission, a source-relay pair is jointly selected to maximize the achievable secrecy rate. After that, the selected relay assists the source to deliver its data to the destination. The proposed selection scheme can be realized in a fully distributed manner, and the security is guaranteed without using any encryption techniques at the upper layers. The closed-form expressions for the secrecy outage probability and the intercept probability are derived, and the achievable diversity order is also analyzed. Simulation results show that the proposed scheme outperforms the competing counterparts in terms of both the secrecy outage probability and the average secrecy rate.

关键词： Vehicular relaying networks Cooperative communications Physical layer security Source-relay selection distributed implementation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：