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

IEEE Global Communications Conference (GLOBECOM)

作者： Li, Juan Zhu, Yanmin Yu, Jiadi Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China

ISBN: (纸本)9781479935123

This paper focuses on workload allocation among mobile nodes in a mobile crowd sensing system. We take both two important objectives into account, including load balance and sensing data utility maximization. However, workload allocation achieving both objectives is particularly challenging. First, there is an intrinsic tradeoff between load balance and utility maximization. The system should strike a good balance between the two important objectives. Second, the number of mobile users can be large. A simple exhaustive search of workload allocation results can be prohibitively expensive. In this paper, we model workload allocation as a Nash bargaining game. We propose a distributed algorithm to solve the Nash bargaining game and determine the workload to each individual smartphone. It effectively decomposes the complex optimization problem into subproblems, and obtains the workload allocation solution by an iterative procedure imitating the bargaining process. This distributed algorithm can achieve a fair tradeoff between workload balance and data utility maximization, which is provably Pareto-efflcient. We have conducted extensive simulations, and the results demonstrate that our algorithm achieves Pareto optimality and fairness between the two important objectives.

关键词： Mobile Crowd Sensing Load Balance Utility Maximization Smartphone Nash Bargaining distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Energy and Spectrum Cooperation for Cellular Communication Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第10期62卷 3678-3691页

作者： Guo, Yinghao Xu, Jie Duan, Lingjie Zhang, Rui Natl Univ Singapore Dept Elect & Comp Engn Singapore 117576 Singapore Singapore Univ Technol & Design Singapore 138682 Singapore ASTAR Inst Infocomm Res Singapore 138632 Singapore

Powered by renewable energy sources, cellular communication systems usually have different wireless traffic loads and available resources over time. To match their traffics, it is beneficial for two neighboring systems to cooperate in resource sharing when one is excessive in one resource (e.g., spectrum), while the other is sufficient in another (e.g., energy). In this paper, we propose a joint energy and spectrum cooperation scheme between different cellular systems to reduce their operational costs. When the two systems are fully cooperative in nature (e.g., belonging to the same entity), we formulate the cooperation problem as a convex optimization problem to minimize their weighted sum cost and obtain the optimal solution in closed form. We also study another partially cooperative scenario where the two systems have their own interests. We show that the two systems seek for partial cooperation as long as they find inter-system complementarity between the energy and spectrum resources. Under the partial cooperation conditions, we propose a distributed algorithm for the two systems to gradually and simultaneously reduce their costs from the non-cooperative benchmark to the Pareto optimum. This distributed algorithm also has proportional fair cost reduction by reducing each system's cost proportionally over iterations. Finally, we provide numerical results to validate the convergence of the distributed algorithm to the Pareto optimality and compare the centralized and distributed cost reduction approaches for fully and partially cooperative scenarios.

关键词： Energy harvesting energy and spectrum cooperation convex optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Role of Communication on the Convergence Rate of Fully distributed DC Optimal Power Flow

Role of Communication on the Convergence Rate of Fully Distr...

引用

2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Mohammadi, Javad Hug, Gabriela Kar, Soummya Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9781479949342

In a grid with highly distributed resources, an effective distributed algorithm for solving Optimal Power Flow (OPF) will result in eff cient resource allocation across the system. This paper investigates the impact of communication on the performance of a fully distributed DC OPF algorithm, which solves the f rst order optimality conditions through an iterative process. In this distributed algorithm, at each iteration, every bus exchanges information with its physically connected neighboring buses and updates the local variables by evaluating a simple function. This paper suggests that sharing additional information between buses without physical connections across the system can speed up the convergence of the algorithm. A key aspect is the constrained selection of these additional communication links and the effective integration of this information in the update of the local variables which is the focus of this paper. A proof of concept is given using the IEEE-118 bus test system as a test case.

关键词： DC power transmission IEEE standards iterative methods load flow resource allocation telecommunication links IEEE-118 bus test system OPF communication link distributed algorithm distributed dc optimal power flow convergence rate distributed resource information sharing iterative process Conferences Decision support systems Niobium Smart grids Telecommunication links Resource utilization distributed algorithms DC power transmission Iterative Process Smart grids iterative methods load flow Information Sharing management of resources decision support systems distributed energy resources niobium Motor buses IEEE Standards

来源：评论

学校读者我要写书评

暂无评论

An optimal distributed trigger counting algorithm for large-scale networked systems

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2013年第7期89卷 846-859页

作者： Kim, Seokhyun Lee, Jaeheung Park, Yongsu Cho, Yookun Seoul Natl Univ Sch Comp Sci & Engn Seoul South Korea Hanyang Univ Div Comp Sci & Engn Seoul 133791 South Korea

distributed trigger counting (DTC) is a problem related to the detection of triggers with nodes in large-scale distributed systems that have general characteristics of complex adaptive systems. The triggers come from an external source, and no a priori information about the triggers is given. DTC algorithms can be used for distributed monitoring and global snapshots. When designing an efficient DTC algorithm, the following goals should be considered: minimizing the overall message complexity and distributing the loads for detecting triggers among nodes. In this paper, we propose a randomized algorithm called TreeFill, which satisfies the message complexity of with high probability. The maximum number of received messages to detect triggers in each node is with high probability. These results satisfy the lower bounds of DTC problems. We prove the upper bounds of TreeFill. The performance of TreeFill is also evaluated by means of an agent-based simulation using NetLogo. The simulation results show that TreeFill uses about 54-69% of the messages used in a previous work called CoinRand. The maximum number of received messages in each node of TreeFill is also smaller than that in the previous work.

关键词： distributed trigger counting distributed algorithm complex adaptive systems multi-agent systems randomized algorithm data aggregation distributed systems

来源：评论

学校读者我要写书评

暂无评论

A Social-based Data Forwarding Mechanism for V2V communication in VANETs

A Social-based Data Forwarding Mechanism for V2V communicati...

引用

International Conference on Communications and Networking in China (CHINACOM)

作者： Rui Tian Zhenzhen Jiao Guiyun Bian Zhiqing Huang Yibin Hou School of Software Engineering Beijing University of Technology Beijing China Beijing Engineering Research Center for IoT Software and Systems Beijing China China Academy of Information and Communications Technology Beijing China Beijing Engineering Research Center for IoT Software and Systems China

ISBN: (纸本)9781479987962

In order to deliver messages between moving vehicles in cities, this paper proposes a Social-based Data Forwarding Mechanism (SDFM) for V2V communication in VANETs. The SDFM learns vehicles' social characteristics in a distributed manner, and then transfers messages in a “Store-Carry-Forward” pattern. SDFM describes the sociality of a vehicle as centrality and community. Based on these two metrics, for each message, a vehicle forwards it to the vehicle with higher global centrality than itself till it meets a vehicle within the same community as the message's final destination, and then forwards the message to the vehicle with higher local centrality till it is finally delivered. The SDFM calculates vehicles' centralities by computing the mobile entropies of vehicles, and determines vehicles' communities by adopting a distributed K-Clique algorithm on recorded intermeeting time as well as meeting frequencies between vehicles. Experimental results show that, for civic moving vehicles, SDFM mechanism has significantly improved the message delivery ratio and the average delivery delay performances when compared with a social based routing protocol bubble rap which is designed for data forwarding in packet switch networks.

关键词： distributed algorithm Movement model Social learning V2V communication VANET vehicle V2V distributed algorithms Social Learning data forwarding Messages message passing

来源：评论

学校读者我要写书评

暂无评论

Computation of an Equilibrium in Spectrum Markets for Cognitive Radio Networks

引用

IEEE TRANSACTIONS ON COMPUTERS 2014年第2期63卷 304-316页

作者： Byun, Sang-Seon Balashingham, Ilangko Vasilakos, Athanasios V. Lee, Heung-No Daegu Gyeongbuk Med Innovat Fdn Taegu 701310 South Korea Oslo Univ Hosp Rikshosp Intervent Ctr N-0027 Oslo Norway Univ Western Macedonia Dept Comp & Telecommun Engn GR-50100 Kozani Greece Gwangju Inst Sci & Technol Sch Informat & Commun Oh Ryong Dong 500712 Gwangju South Korea

In this paper, we investigate a market equilibrium in multichannel sharing cognitive radio networks (CRNs): it is assumed that every subchannel is orthogonally licensed to a single primary user (PU), and can be shared with multiple secondary users (SUs). We model this sharing as a spectrum market where PUs offer SUs their subchannels with limiting the interference from SUs;the SUs purchase the right to transmit over the subchannels while observing the inference limits set by the PUs and their budget constraints. Moreover, we consider each SU limits the total interference that can be invoked from all other SUs, and assume that every transmitting SU marks the interference charges to other transmitting SUs. The utility function of SU is defined as least achievable transmission rate, and that of PU is given by the net profit. We define a market equilibrium in the context of extended Fisher model, and show that the equilibrium is yielded by solving an optimization problem, Eisenberg-Gale convex program. To make the solutions of the convex program meet the market equilibrium, we apply monotone-transformation to the utility function of each SU. Furthermore, we develop a distributed algorithm that yields the stationary solutions asymptotically equivalent to the solutions given by the convex program.

关键词： Cognitive radio networks Fisher model market equilibrium Eisenberg-Gale convex program distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Prediction-Based Cross-Layer Resource Allocation for Wireless Multi-Hop Networks with Outdated CSI

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2014年第4期E97B卷 746-754页

作者： Feng, Wei Feng, Suili Ding, Yuehua Zhang, Yongzhong S China Univ Technol Sch Elect & Informat Engn Guangzhou Guangdong Peoples R China

The rapid variation of wireless channels and feedback delay make the available channel state information (CSI) outdated in dynamic wireless multi-hop networks, which significantly degrades the accuracy of cross-layer resource allocation. To deal with this problem, a cross-layer resource allocation scheme is proposed for wireless multi-hop networks by taking the outdated CSI into account and basing compensation on the results of channel prediction. The cross-layer resource allocation is formulated as a network utility maximization problem, which jointly considers congestion control, channel allocation, power control, scheduling and routing with the compensated CSI. Based on a dual decomposition approach, the problem is solved in a distributed manner. Simulation results show that the proposed algorithm can reasonably allocate the resources, and significantly improve the throughput and energy efficiency in the network.

关键词： wireless multi-hop networks outdated CSI channel prediction cross-layer resource allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Hop-by-Hop Message Authentication and Source Privacy in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2014年第5期25卷 1223-1232页

作者： Li, Jian Li, Yun Ren, Jian Wu, Jie Michigan State Univ Dept Elect & Comp Engn E Lansing MI 48824 USA Microsoft Corp SPD Dept Redmond WA 98052 USA Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

Message authentication is one of the most effective ways to thwart unauthorized and corrupted messages from being forwarded in wireless sensor networks (WSNs). For this reason, many message authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems. Most of them, however, have the limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks. To address these issues, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial: when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. In this paper, we propose a scalable authentication scheme based on elliptic curve cryptography (ECC). While enabling intermediate nodes authentication, our proposed scheme allows any node to transmit an unlimited number of messages without suffering the threshold problem. In addition, our scheme can also provide message source privacy. Both theoretical analysis and simulation results demonstrate that our proposed scheme is more efficient than the polynomial-based approach in terms of computational and communication overhead under comparable security levels while providing message source privacy.

关键词： Hop-by-hop authentication symmetric-key cryptosystem public-key cryptosystem source privacy simulation wireless sensor networks (WSNs) distributed algorithm decentralized control

来源：评论

学校读者我要写书评

暂无评论

Adaptive wireless mesh networks: Surviving weather without sensing it

引用

COMPUTER COMMUNICATIONS 2014年第Dec.1期54卷 120-130页

作者： Javed, Nauman Lyons, Eric Zink, Michael Wolf, Tilman Univ Massachusetts Dept Elect & Comp Engn Amherst MA 01003 USA

Large-scale wireless mesh networks, like the ones used as cellular back-haul, operate under circumstances, where individual links are affected by weather conditions. Reliability requirements in wireless mesh networks necessitate the ability to reconfigure the network in the face of changing environmental conditions. In this paper, we present a predictive routing protocol for wireless mesh networks, which operate at millimeter-wave bands with directional links, that uses in-network parameter prediction to make the network adaptive, as opposed to using meteorological weather information from external sources, such as weather radars. We validate our approach through simulations based on real-world weather events, observed through a network of weather radars, and comparisons with approaches that do not make use of predictions but may use the link quality as a parameter in routing decision making. Our results show that our link quality-based predictive approach can achieve throughput performance that is almost 8% better than a link quality-based routing algorithm that does not use prediction for the real weather scenario we use for our simulations. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Routing Self-configuring network Wireless mesh network Prediction distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Content-aware optimization on rate-distortion and network traffic for scalable video multicast networks

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2014年第3期71卷 1975-1998页

作者： Zou, Junni Jiang, Lu Li, Chenglin Univ Calif San Diego Dept Elect & Comp Engn San Diego CA 92093 USA Shanghai Univ Key Lab Special Fiber Opt & Opt Access Networks Shanghai 200072 Peoples R China Shanghai Univ Dept Commun & Informat Engn Shanghai 200072 Peoples R China Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

This paper aims to optimize the content-aware prioritization of scalable video multicast, which is coupled with multipath streaming and network coding based routing. It constructs multiple layer distribution meshes for the scalable video stream to minimize the total video distortion at all the receivers, determines the base layer meshes with minimum costs to maintain application-layer QoS and the layer synchronization of SVC streaming, and improves the network throughput by encouraging path-overlapping transmissions and thus allowing bandwidth sharing among different receivers for the same video layer by utilizing network coding. The targeted problem is formulated into a minimization programming in which the quality variation between layers, the transmission cost of the base layer, as well as the efficient resource utilization are jointly considered. By decomposition and dual approach, the global convex problem is solved by a two-level decentralized iterative algorithm. The implementation of the distributed algorithm is discussed with regard to the communication overhead, and the convergence performance is validated by numerical experiments. Packet-level simulations demonstrate that the proposed algorithm could approximately achieve the maximum flow rates determined by Max-Flow Min-Cut Theorem and benefit the overall received video quality.

关键词： Scalable video coding Multicast Network coding Rate distortion distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：