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

Stochastic Poisson game for an online decentralized and coordinated parking mechanism

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2016年 87卷 44-63页

作者： Du, Lili Gong, Siyuan IIT Dept Civil Architectural & Environm Engn 3201 South Dearborn St Chicago IL 60616 USA

This paper proposes a decentralized and coordinated online parking mechanism (DCPM), which seeks to reduce parking congestion at multiple parking facilities in a central business district (CBD) through guiding the parking decisions of a parking coordination group. To establish this DCPM, this study develops a stochastic Poisson game to model the competitions among parking vehicles en route at multiple parking facilities. The equilibrium condition for the proposed stochastic Poisson game is formulated through involving travelers' parking choice behavior described by multinomial logit model. Furthermore, we prove that the stochastic Poisson game is a potential game with a unique equilibrium. A simultaneously updating distributed algorithm is developed to search the equilibrium solution of the DCPM. Its convergence is proved by both mathematical analysis and numerical experiments. The numerical experiments are conducted to test the efficiency of the DCPM, based on a real-world CBD covering Guicheng Community, Nanhai District at Foshan in China. The performance of the DCPM is compared to three greedy strategies following the nearest first, cheapest first, and least cruise first policies, respectively. The experimental results demonstrate that the DCPM significantly reduces cruise vehicles and average cruise distance per vehicle from all other three greedy strategies;the least cruise first strategy, which takes advantage of the real-time open spots information at parking facilities, performs better than the nearest first and the cheapest first strategies without the access to real-time information. The DCPM can further improve the benefit of the real-time information. Additionally, in terms of walking distance and parking cost, the DCPM provide a trade-off solution between the nearest first and the cheapest first strategies. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Parking Stochastic Poisson game Equilibrium distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An Asynchronous Fixed-Point algorithm for Resource Sharing With Coupled Objectives

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2016年第5期24卷 2593-2606页

作者： Niu, Di Li, Baochun Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2V4 Canada Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

distributed resource allocation and sharing can often be formulated as a utility maximization problem, with the objective being the sum of user utilities minus a coupled cost. A traditional distributed solution to such problems, called "consistency pricing," decouples the objective function via dual decomposition, which is then iteratively solved by the subgradient method. However, such gradient-based approaches may require many iterations of message passing to converge, which may not be sufficient in large-scale real-time applications. In this paper, we propose a new fixed-point-like distributed solution to resource sharing problems with coupled objective functions. While preserving the simple pricing interpretation, our approach speeds up convergence by exploiting the structural difference between user utilities and the coupled cost function. We theoretically analyze the asynchronous algorithm convergence conditions based on contraction mapping. Through a detailed case study of cloud bandwidth reservation based on real-world workload traces, we demonstrate the benefits of the proposed algorithm over state-of-the-art distributed optimization techniques including gradient descent, dual decomposition, and ADMM. In addition, we also extend the proposed algorithm to approach a more general class of consensus optimization problems with not only a coupled objective function, but also a certain class of coupled constraints.

关键词： Network utility maximization coupled objective resource allocation distributed algorithm decomposition pricing network control sharing consensus optimization fixed-point iteration asynchronous convergence

来源：评论

学校读者我要写书评

暂无评论

Joint User Association and Interference Mitigation for D2D-Enabled Heterogeneous Cellular Networks

引用

MOBILE NETWORKS & APPLICATIONS 2016年第4期21卷 589-602页

作者： Zhou, Tianqing Huang, Yongming Yang, Luxi Southeast Univ Sch Informat Sci & Engn Nanjing 210096 Jiangsu Peoples R China

The heterogeneous cellular networks (HCNs) with device-to-device (D2D) communications have been a promising solution to cost-efficient delivery of high data rates. A key challenge in such D2D-enabled HCNs is how to design an effective association scheme with D2D mode selection for load balancing. Moreover, the offloaded users and D2D receivers (RXs) would suffer strong interference from BSs, especially from high-power BSs. Evidently, a good association scheme should integrate with interference mitigation. Thus, we first propose an effective resource partitioning strategy that can mitigate the interference received by offloaded users from high-power BSs and the one received by D2D RXs from BSs. Based on this, we then design a user association scheme for load balancing, which jointly considers user association and D2D mode selection to maximize network-wide utility. Considering that the formulated problem is in a nonlinear and mixted-integer form and hard to tackle, we adopt a dual decomposition method to develop an efficient distributed algorithm. Simulation results show that the proposed scheme provides a load balancing gain and a resource partitioning gain.

关键词： Load balancing User association Heterogeneous cellular networks distributed algorithm D2D communications

来源：评论

学校读者我要写书评

暂无评论

Compressive network coding for wireless sensor networks: Spatio-temporal coding and optimization design

引用

COMPUTER NETWORKS 2016年 108卷 345-356页

作者： Chen, Siguang Zhao, Chuanxin Wu, Meng Sun, Zhixin Zhang, Haijun Leung, Victor C. M. Nanjing Univ Posts & Telecommun Key Lab Broadband Wireless Commun & Sensor Networ Minist Educ Nanjing Jiangsu Peoples R China Curtin Univ Sch Elect Engn & Comp Perth WA Australia Univ British Columbia Dept Elect & Comp Engn Vancouver BC Canada Anhui Normal Univ Dept Network Engn Wuhu Peoples R China

Considering the temporal and spatial correlations of sensor readings in wireless sensor networks (WSNs), this paper develops a clustered spatio-temporal compression scheme by integrating network coding (NC), compressed sensing (CS) and spatio-temporal compression for correlated data. The proper selection of NC coefficients and measurement matrix is investigated for this scheme. This design ensures successful reconstruction of original data with a considerably high probability and enables successful deployment of NC and CS in a real field. Moreover, in contrast to other spatio-temporal schemes with the same computational complexity, the proposed scheme possesses lower reconstruction error by employing independent encoding in each sensor node (including the cluster head nodes) and joint decoding in the sink node. In order to further reduce the reconstruction error, we construct a new optimization model of reconstruction error for the clustered spatio-temporal compression scheme. A distributed algorithm is developed to iteratively determine the optimal solution. Finally, simulation results verify that the clustered spatio-temporal compression scheme outperforms other two categories of compression schemes significantly in terms of recovery error and compression gain and the distributed algorithm converges to the optimal solution with a fast and stable speed. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Network coding Compressed sensing Spatio-temporal compression Optimization distributed algorithm Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Information exchange with collision detection on multiple channels

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年第1期31卷 118-135页

作者： Wang, Yuepeng Wang, Yuexuan Yu, Dongxiao Yu, Jiguo Lau, Francis C. M. Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230027 Peoples R China Univ Hong Kong Dept Comp Sci Pokfulam Hong Kong Peoples R China Qufu Normal Univ Sch Comp Sci Rizhao 276800 Peoples R China

Information exchange is a fundamental communication primitive in radio networks. We study this problem in multi-channel single-hop networks. In particular, given pieces of information, initially stored in nodes respectively, the task is to broadcast these information pieces to the entire network via a set of channels. We develop efficient distributed algorithms for this task for the scenario where both the identities and the number of the initial information holders are unknown to the participating nodes. Assuming nodes with collision detection, we present an efficient randomized algorithm for unrestricted information exchange, where multiple information items can be combined into a single message. The algorithm disseminates all the information items within timeslots with high probability. To the best of our knowledge, this is the first algorithm that breaks the lower bound for unrestricted information exchange if only a single channel is available. This result establishes the superiority of multiple channels for the task of unrestricted information exchange. Moreover, for restricted information exchange, where each message can carry only one information item, we devise a randomized algorithm that completes the task in timeslots. When is large, both algorithms are asymptotically optimal, as they can reach the trivial lower bounds of and for unrestricted and restricted information exchange, respectively.

关键词： Wireless network Multiple channels Information exchange distributed algorithm Randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Self-diagnosis algorithm for VoIP service over IMS Network 7

Distributed Self-diagnosis algorithm for VoIP service over I...

引用

6th International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery (CyberC)

作者： Lu, Jingxian Dousson, Christophe Krief, Francine State Grid Customer Serv Ctr 1 Hongli Rd Nanjing 210000 Jiangsu Peoples R China Orange Labs F-22300 Lannion France Univ Bordeaux CNRS LaBRI UMR 5800 F-33400 Talence France

ISBN: (纸本)9781467392006

We have proposed a self-diagnosis algorithm using causal graph modeling to perform distributed diagnosis for a VoIP service in IMS network. Our solution achieves a global self-diagnosis process based on local knowledge of each network element. We implement this approach in an IMS platform and detail the corresponding causal graph and diagnosis process. The results of the implementation verify that our approach is effective and could be used to identify the primary cause of the alarm.

关键词： self-diagnosis causal graph VoIP service IMS network distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

QOS Routing Protocol to Detect Maximum Available Bandwidth in WMCs 2

QOS Routing Protocol to Detect Maximum Available Bandwidth i...

引用

2nd International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)

作者： Manikandan, R. Rajan, A. Renga Deborah, L. Jegatha St Peters Univ Dept CSE Dept IT Madras Tamil Nadu India Vel Tech Multi Tech Dept CSE Madras Tamil Nadu India Univ Coll Engn Tindivanam Dept CSE Tindivanam Tamil Nadu India

ISBN: (纸本)9781509047994

Wi-Fi Mesh Community has turn out to be an important area community to offer internet to challenge the thrown domains and wireless link in metropolitan environments. In this paper, hassle of figuring out the most to be had bandwidth direction is targeted, which is an essential problem in helping pleasant-of-carrier in WMCs. Due to the concept of interference, bandwidth, which is a familiar challenging metric in restive networks, a new direction is validated in which the weight captures the available route bandwidth statistics. It is also proved that the hop using the hop routing procedure based on the new path weight completely satisfies the consistency and loop-freeness necessities. The property of consistency ensures that each node follows a proper packet forwarding choice, in order that a statistics packet traverses over the supposed path. The experimental results additionally show that our proposed work on direction weight outperforms all the other existing direction metrics in figuring out excessive-throughput paths.

关键词： distributed algorithm Wireless mesh networks proactive hop-by-hop routing QOS routing

来源：评论

学校读者我要写书评

暂无评论

Optimized Base Station Sleeping and Renewable Energy Procurement Scheme Using PSO

引用

INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE RESEARCH 2017年第1期8卷 54-73页

作者： Wang, Qiang Liu, Hai-Lin Guangdong Univ Technol Guangzhou Guangdong Peoples R China Guangdong Univ Technol Sch Appl Math Guangzhou Guangdong Peoples R China

Energy efficiency of the wireless networks has drawn more and more attentions due to the requirement of the green communication. The base station sleeping strategy and resource allocation can effectively improve the energy efficiency for the wireless networks. Meanwhile, renewable energy is important to decrease the carbon emission. In this paper, the authors propose a joint BS sleeping strategy, resource allocation and renewable energy procurement scheme to maximize the profit of the network operators and minimize the carbon emission. Then, a joint optimization problem is formulated, which is a mixed integer programming problem. To solve it, they adopt the bi-velocity discrete particle swarm optimization (BVDPSO) algorithm to optimize the BS sleeping strategy. When the BS sleeping strategy is fixed, the authors propose an optimal algorithm based on Lagrange dual domain method to optimize the power allocation, subcarrier assignment and energy procurement. Numerical results illustrate the effectiveness of their proposed scheme and algorithm.

关键词： The BS Sleeping Strategy distributed algorithm Resource Allocation Smart Grid Energy Procurement

来源：评论

学校读者我要写书评

暂无评论

Optimal Mode Selection in D2D-Enabled Multibase Station Systems

引用

IEEE COMMUNICATIONS LETTERS 2016年第3期20卷 470-473页

作者： Liu, Yuan S China Univ Technol Sch Elect & Informat Engn Guangzhou 510641 Guangdong Peoples R China Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Jiangsu Peoples R China

In this letter, we consider device-to-device (D2D) communication underlaying uplink cellular networks with multiple base stations (BSs), where each user can switch between traditional cellular mode (through BS) and D2D mode (by connecting proximity user), namely mode selection. We impose load balancing constraints on BSs to efficient resource usage. The joint problem of mode selection and user association is formulated as a combinatorial problem and NP-complete. We adopt a graph-based approach to solve the problem globally optimally in polynomial time. To further reduce complexity, we also propose a distributed algorithm based on dual method. We show that the proposed distributed algorithm achieves nearly the same performance as the proposed optimal graph-based algorithm.

关键词： Device-to-device (D2D) communication mode selection load balancing graph theory distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimal distributed K-Means Clustering algorithm Based on CloudStack

An Optimal Distributed K-Means Clustering Algorithm Based on...

引用

IEEE International Conference on Information and Automation 2015

作者： Mao, Yingchi Xu, Ziyang Li, Xiaofang Ping, Ping Hohai Univ Coll Comp & Informat Engn Nanjing Jiangsu Peoples R China Changzhou Inst Technol Coll Comp & Informat Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781467391047

Clustering algorithm is applied to all kinds of fields, especially in the field of data mining. Due to the increasing number of the data, it's too hard for the clustering algorithm to afford the computation time in traditional computing model. When handling with big data, the corresponding algorithms of data mining have been transformed from the original single-core or single ported into the parallel and distributed processing. Parallel processing becomes the most popular way to improve the execution performace. This paper established a Hadoop distributed cluster based on the CloudStack and implemented the optimal distributed K-Means clustering algorithm based on MapReduce. The proposed optimal distributed K-Means clustering can obtain good quality of the results and the efficiency of the execution time. The experiment results show that the optimal distributed K-Means cluster algorithm can have better performance for dealing with large-scale data set.

关键词： K-Means Clustering distributed algorithm CloudStack optimal distributed K-Means

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：