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

IEEE Global Communications Conference

作者： Juan Li Yanmin Zhu Jiadi Yu Department of Computer Science and Engineering Shanghai Jiao Tong University

ISBN: (纸本)9781479935130

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-efficient. 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

来源：评论

学校读者我要写书评

暂无评论

A message complexity oriented design of distributed algorithm for long-lived multicasting in wireless sensor networks

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2009年第3-4期6卷 180-190页

作者： Guo, Song Guo, Minyi Leung, Victor C. M. Univ Aizu Sch Engn & Comp Sci Aizu Wakamatsu Fukushima Japan Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC V5Z 1M9 Canada

We consider an optimisation problem in Wireless Sensor Networks (WSNs) that is to find a multicast tree rooted at the source node and including all the destination nodes such that the lifetime of the tree is maximised. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, we show that its high message complexity may prevent such contribution from being practically used in resource-constrained WSNs. In this paper, we proposed a new distributed sub-optimal algorithm that achieves a good balance on the algorithm-optimality and message complexity. In particular, we prove that it has a linear-message complexity. The trade-off between algorithm sub-optimality and message complexity is also studied by simulations.

关键词： WSN wireless sensor network multicasting distributed algorithm communication complexity energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Signature-Free Asynchronous Byzantine Consensus with t < n/3 and O(n²) Messages 14

Signature-Free Asynchronous Byzantine Consensus with <i>t</i...

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Mostefaoui, Achour Moumen, Hamouma Raynal, Michel Univ Nantes LINA F-44322 Nantes France Univ Bejaia Bejaia Algeria Univ Rennes Inst Univ France Rennes France Univ Rennes IRISA Rennes France

ISBN: (纸本)9781450329446

This paper presents a new round-based asynchronous consensus algorithm that copes with up to t < n/3 Byzantine processes, where n is the total number of processes. In addition of not using signature, not assuming a computationally-limited adversary, while being optimal with respect to the value of t, this algorithm has several noteworthy properties: the expected number of rounds to decide is four, each round is composed of two or three communication steps and involves O(n(2)) messages, and a message is composed of a round number plus a single bit. To attain this goal, the consensus algorithm relies on a common coin as defined by Rabin, and a new extremely simple and powerful broadcast abstraction suited to binary values. The main target when designing this algorithm was to obtain a cheap and simple algorithm. This was motivated by the fact that, among the first-class properties, simplicity -albeit sometimes under-estimated or even ignored- is a major one.

关键词： Abstraction Asynchronous message-passing system Broadcast abstraction Byzantine process Common coin Consensus distributed algorithm Optimal resilience Randomized algorithm Signature-free algorithm Simplicity

来源：评论

学校读者我要写书评

暂无评论

Maximum lifetime broadcast communications in cooperative multihop wireless ad hoc networks: Centralized and distributed approaches

引用

AD HOC NETWORKS 2013年第6期11卷 1667-1682页

作者： Acharya, Tamaghna Paul, Goutam Bengal Engn & Sci Univ Shibpur Dept Elect & Telecommun Engn Howrah 711103 India Jadavpur Univ Dept Comp Sci & Engn Kolkata 700032 India Rhein Westfal TH Aachen Inst Commun Technol & Embedded Syst ICE Aachen Germany

We investigate the problem of broadcast routing in energy constrained stationary wireless ad hoc networks with an aim to maximizing the network lifetime measured as the number of successive broadcast sessions that can be supported. We propose an energy-aware spanning tree construction scheme supporting a broadcast request, considering three different signal transmission schemes in the physical layer: (a) point-to-point, (b) point-to-multipoint, and (c) multipoint-to-point. First we present a centralized algorithm that requires global topology information. Next, we extend this to design an approximate distributed algorithm, assuming the availability of k-hop neighborhood information at each node, with k as a parameter. We prove that the centralized scheme has time complexity polynomial in the number of nodes and the distributed scheme has a message complexity that is linear in the number of nodes. Results of numerical experiments demonstrate significant improvement in network lifetime following our centralized scheme compared to existing prominent non-cooperative broadcasting schemes proposed to solve the same lifetime maximization problem in wireless ad hoc networks. Due to lack of global topology information, the distributed solution does not produce as much advantage as the centralized solution. However, we demonstrate that with increasing value of k, the performance of the distributed scheme also improves significantly. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Broadcast communications Cooperative transmission distributed algorithm Lifetime maximization Spanning tree Wireless ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A distributed MAC Layer Congestion Control Method to Achieve High Network Performance for EAST Experiments

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 2013年第5期60卷 3758-3763页

作者： Shi, Kai Yang, Oliver Shu, Yantai Lin, Sheng Wang, Jinsong Luo, Jiarong Tianjin Univ Technol Sch Comp & Commun Engn Tianjin 300384 Peoples R China Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON K1N 6N5 Canada Tianjin Univ Dept Comp Sci Tianjin 300072 Peoples R China Acad Sinica Inst Plasma Phys Hefei 230031 Anhui Peoples R China

Many applications would require fast data transfer in Wireless Local Area Networks (WLANs) nowadays. A representative example is the EAST (Experimental Advanced Superconducting Tokamak) project where physics researchers need to transport massive experiment data using the TCP (Transmission Control Protocol). However, the high contention level and the high error rate in wireless networks have a great impact on the TCP performance. To alleviate this problem, this paper proposes a MAC layer congestion control method to deal with wireless packet loss due to errors (as opposed to congestion). Our mechanism is implemented at the end wireless nodes based on the IEEE 802.11 DCF mechanism but without any modification to the TCP layer. We first propose the concept of the MAC layer congestion window in which the MAC layer will send all the packets in a window when it obtains access to the wireless channel (unlike the traditional DCF mechanism that just sends only one packet). Then we allow our congestion control mechanism to adjust its MAC congestion window based on the contention degree and the packet loss rate at the MAC layer. By performing wireless congestion control at the MAC layer, our mechanism can mitigate the effect of wireless packet loss on TCP, and therefore improve the TCP performance. The simulation and experiment results show that our mechanism can achieve better performance than the traditional MAC layer mechanisms in WLANs.

关键词： distributed algorithm IEEE 80211 WLAN MAC layer congestion control TCP performance

来源：评论

学校读者我要写书评

暂无评论

An Auction Approach to distributed Power Allocation for Multiuser Cooperative Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2013年第1期12卷 237-247页

作者： Liu, Yuan Tao, Meixia Huang, Jianwei Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China

This paper studies a wireless network where multiple users cooperate with each other to improve the overall network performance. Our goal is to design an optimal distributed power allocation algorithm that enables user cooperation, in particular, to guide each user on the decision of transmission mode selection and relay selection. Our algorithm has the nice interpretation of an auction mechanism with multiple auctioneers and multiple bidders. Specifically, in our proposed framework, each user acts as both an auctioneer (seller) and a bidder (buyer). Each auctioneer determines its trading price and allocates power to bidders, and each bidder chooses the demand from each auctioneer. By following the proposed distributed algorithm, each user determines how much power to reserve for its own transmission, how much power to purchase from other users, and how much power to contribute for relaying the signals of others. We derive the optimal bidding and pricing strategies that maximize the weighted sum rates of the users. Extensive simulations are carried out to verify our proposed approach.

关键词： Cooperative communications user cooperation power allocation distributed algorithm auction theory

来源：评论

学校读者我要写书评

暂无评论

distributed Throughput Optimization for Large-Scale Scientific Workflows Under Fault-Tolerance Constraint

引用

JOURNAL OF GRID COMPUTING 2013年第3期11卷 361-379页

作者： Gu, Yi Wu, Chase Qishi Liu, Xin Yu, Dantong Univ Tennessee Dept Management Mkt Comp Sci & Info Syst Martin TN 38237 USA Univ Memphis Dept Comp Sci Memphis TN 38152 USA Brookhaven Natl Lab Computat Sci Ctr Upton NY 11973 USA

With the advent of next-generation scientific applications, the workflow approach that integrates various computing and networking technologies has provided a viable solution to managing and optimizing large-scale distributed data transfer, processing, and analysis. This paper investigates a problem of mapping distributed scientific workflows for maximum throughput in faulty networks where nodes and links are subject to probabilistic failures. We formulate this problem as a bi-objective optimization problem to maximize both throughput and reliability. By adapting and modifying a centralized fault-free workflow mapping scheme, we propose a new mapping algorithm to achieve high throughput for smooth data flow in a distributed manner while satisfying a pre-specified bound of the overall failure rate for a guaranteed level of reliability. The performance superiority of the proposed solution is illustrated by both extensive simulation-based comparisons with existing algorithms and experimental results from a real-life scientific workflow deployed in wide-area networks.

关键词： Fault tolerance Throughput Workflow mapping distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Research of distributed algorithm Based on Usage Mining

Research of Distributed Algorithm Based on Usage Mining

引用

2nd International Workshop on Knowledge Discovery Data Mining

作者： Han, Qingtian Gao, Xiaoyan Naval Aeronaut & Astronaut Univ Dept Control Engn Yantai Peoples R China Shandong Business Inst Dept Informat Engn Yantai Peoples R China

ISBN: (纸本)9780769535432

Web mining applies the data mining, the artificial intelligence and the chart technology and so on to the web data and traces users' visiting characteristics, and then extracts the users' using pattern. This article will study on Web Mining algorithm based on Usage Mining. And it also produces the design mentality of the electronic commerce website application algorithm. Web usage mining is an application of data mining technology to mining the data of the web server log file. It can discover the browsing patterns of user and some kind of correlations between the web pages. Web usage mining provides the support for the web site design, providing personalization server and other business making decision, etc. This algorithm is simple, effective and easy to realize, it is suitable to the web usage mining demand of construct a low cost B2C website.

关键词： data mining distributed algorithm web usage mining

来源：评论

学校读者我要写书评

暂无评论

On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups

引用

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 2013年第3期15卷 101-118页

作者： Kowalski, Dariusz R. Krzywdzinski, Krzysztof Univ Liverpool Dept Comp Sci Liverpool Merseyside England Adam Mickiewicz Univ Fac Math & Comp Sci Poznan Poland

We study time and message complexity of the problem of building a BFS tree by a spontaneously awaken node in ad hoc network. Computation is in synchronous rounds, and messages are sent via point-to-point bi-directional links. Network topology is modeled by a graph. Each node knows only its own id and the id's of its neighbors in the network and no pre-processing is allowed;therefore the solutions to the problem of spanning a BFS tree in this setting must be distributed. We deliver a deterministic distributed solution that trades time for messages, mainly, with time complexity O(D . min (D, n/f (n)) . log D . log n) and with the number of point-to-point messages sent O (n . (min (D, n = f (n)) + f (n)) . log D . log n), for any n-node network with diameter D and for any monotonically non-decreasing sub-linear integer function f. Function f in the above formulas come from the threshold value on node degrees used by our algorithms, in the sense that nodes with degree at most f (n) are treated differently that the other nodes. This yields the first BFS-finding deterministic distributed algorithm in ad hoc networks working in time o (n) and with o(n(2)) message complexity, for some suitable functions f (n) = o (n/log(2) n), provided D = o (n/log(4) n).

关键词： BFS tree ad hoc network distributed algorithm message complexity

来源：评论

学校读者我要写书评

暂无评论

Network Size Estimation Using distributed Orthogonalization

引用

IEEE SIGNAL PROCESSING LETTERS 2013年第4期20卷 347-350页

作者： Sluciak, Ondrej Rupp, Markus Vienna Univ Technol Inst Telecommun A-1040 Vienna Austria

We present novel distributed algorithms for estimating the number of nodes in a wireless sensor network without any a-priori knowledge or node preferences. The algorithms originate from distributed forms of Gram-Schmidt orthogonalization algorithms where the goal is to distributively find a set of orthogonal vectors. Using concepts from linear algebra, by finding the number of independent (orthogonal) vectors, we also find the number of nodes in a network.

关键词： distributed algorithm network size orthogonal vectors wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：