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

A localized algorithm for bi-connectivity of connected mobile robots

TELECOMMUNICATION SYSTEMS 2009年第3-4期40卷 129-140页

作者： Das, Shantanu Liu, Hai Nayak, Amiya Stojmenovic, Ivan ETH Dept Comp Sci Zurich Switzerland Hong Kong Baptist Univ Dept Comp Sci Kowloon Hong Kong Peoples R China Univ Ottawa Sch Informat Technol & Engn Ottawa ON Canada Univ Birmingham Birmingham W Midlands England

Teams of multiple mobile robots may communicate with each-other using a wireless ad-hoc network. Fault-tolerance in communication can be achieved by making the communication network bi-connected. We present the first localized protocol for constructing a fault-tolerant bi-connected robotic network topology from a connected network, in such a way that the total movement of robots is minimized. The proposed distributed algorithm uses p-hop neighbor information to identify critical head robots that can direct two neighbors to move toward each other and bi-connect their neighborhood. Simulation results show that the total distance of movement of robots decreases significantly (e.g. about 2.5 times for networks with density 10) with our localized algorithm when compared to the existing globalized one. Proposed localized algorithm does not guarantee bi-connectivity, may partition the network, and may even stop at connected but not bi-connected stage. However, our algorithm achieved 100% success on all networks with average degrees a parts per thousand yen10, and over 70% success on sparse networks with average degrees a parts per thousand yen5.

关键词： Mobile sensors Robot networks Fault tolerance distributed algorithm Localized movement control

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a Leader Election algorithm in Hierarchy Mobile Ad hoc Network

Design and Implementation of a Leader Election Algorithm in ...

引用

4th International Conference on Computer Science and Education

作者： Zhang, Gang Kuang, Xiaoyan Chen, Jing Zhang, Yu Tianjin Univ Dept Comp Sci & Technol Tianjin 300072 Peoples R China

ISBN: (纸本)9781424435197

Leader election is a very important problem in wired networks and mobile ad hoc networks. In this paper, we propose a leader election algorithm for hierarchy ad hoc network. For high-level ad hoc network, we adopt synchronous leader election algorithm plus a vice president mechanism. For bottom-level ad hoc network, we design an algorithm with the collision avoidance mechanism which can decrease the message and time complexity. Numerical results show that in the same network environment synchronous algorithm is better than asynchronous for time complexity, if the vice president exists, the time complexity can be tremendously reduced. Our experimental results shows that our proposed algorithm is quite effective, and it can adapt to hierarchy ad hoc network in which high-level nodes are relatively static and bottom-level nodes frequently move.

关键词： Hierarchy ad hoc network distributed algorithm Leader election algorithm

来源：评论

学校读者我要写书评

暂无评论

Evolution of Probabilistic Consensus in Digital Organisms

Evolution of Probabilistic Consensus in Digital Organisms

引用

3rd IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2009)

作者： Knoester, David B. McKinley, Philip K. Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

ISBN: (纸本)9781424448906

The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and resilience to attack. Based on their reliance on heuristics, algorithms for consensus, where members of a group agree on a course of action, are particularly sensitive to these conditions. Given the ability of natural organisms to respond to adversity, many researchers have investigated biologically-inspired approaches to designing robust distributed systems. In this paper, we describe a study in the use of digital evolution, a type of artificial life system, to produce a distributed behavior for reaching consensus. The evolved algorithm employs a novel mechanism for probabilistically reaching consensus based on the frequency of messaging. Moreover, this design approach enables us to change parameters based on the specifics of the desired system, with evolution producing corresponding flavors of consensus algorithms. Our results demonstrate that artificial life systems can be used to discover solutions to engineering problems, and that experiments in artificial life can inspire new studies in distributed protocol development.

关键词： distributed algorithm consensus evolutionary computation digital evolution self-organization

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks

Fast Algorithms and Performance Bounds for Sum Rate Maximiza...

引用

IEEE INFOCOM Conference 2009

作者： Tan, Chee Wei Chiang, Mung Srikant, R. CALTECH Pasadena CA 91125 USA Princeton Univ Dept Elect Engn Princeton NJ USA Univ Illinois Dept Elect & Comp Engn Urbana IL USA

ISBN: (纸本)9781424435128

Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and achieves a rate region that is in general nonconvex. We derive approximation ratios to the sum rate objective by studying the solutions to two related problems, sum rate maximization using an SIR approximation and max-min weighted SIR optimization. We also show that these two problems can be solved very efficiently, using much faster algorithms than the existing ones in the literature. Furthermore, using a new parameterization of the sum rate maximization problem, we obtain a characterization of the power controlled rate region and its convexity property in various asymptotic regimes. Engineering implications are discussed for IEEE 802.11 networks.

关键词： Duality distributed algorithm Power control Weighted sum rate maximization Nonnegative matrices and applications Nonconvex optimization Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A Learning Based Method for Topology Control in Wireless Sensor Networks

A Learning Based Method for Topology Control in Wireless Sen...

引用

5th International Conference on Autonomic and Autonomous Systems

作者： Khasteh, Seyed Hossein Shouraki, Saeed Bagheri Sharif Univ Technol Dept Comp Engn Tehran Iran Sharif Univ Technol Dept Elect Engn Tehran Iran

ISBN: (纸本)9781424436842

Topology Control (TC) is one of the most important techniques used in wireless ad hoe and sensor networks to reduce energy consumption and radio interference, The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this paper we present a new distributed learning based method to choose nodes transmitting range, in this method we run a range adjustment mechanism periodically to choose a near optimal transmitting range, we don't need any information about location of nodes or distance between nodes or received signal strength, the communication overhead of this method is very low, performance evaluation results show that this method decrease the energy consumption and overcome other existing methods in some scenarios.

关键词： Sensor Network Topology Control Machine Learning distributed algorithm Transmitting Range

来源：评论

学校读者我要写书评

暂无评论

Power Allocation in Interference Relay Channels Based on Non-cooperative Game Theory

Power Allocation in Interference Relay Channels Based on Non...

引用

International Conference on Wireless Communications and Signal Processing

作者： Wu, Dan Cai, Yueming PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Peoples R China

ISBN: (纸本)9781424448562

In the paper, we consider the interference as a detriment to the performance of the relay enhanced cellular system. Then we build up the interference channel model based on amplify-and-forward protocol and decode-and-forward protocol, respectively. The interference comes not only from the adjacent cells, but also from the inner of the same cell. Moreover, proper power allocation can obtain a good tradeoff between the performance and the interference. Power allocation in interference relay channels based on non-cooperative game theory is proposed. Concretely, two stages constitute the game model, namely power allocation among the source nodes and among the relay nodes. The two utility functions are different from the different stations of the source nodes and relay nodes. But the two utility functions are designed to guarantee the target SINR. For the two-stage game, we prove the existence and uniqueness of Nash equilibriums, and the proposed distributed algorithm always converges to the unique Nash equilibrium from an arbitrary starting point. Meanwhile, simulation results show our allocation scheme has good convergence.

关键词： Non-cooperative game theory power allocation distributed algorithm interference relay channels cellular

来源：评论

学校读者我要写书评

暂无评论

A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks

A Straightforward Path Routing in Wireless Ad Hoc Sensor Net...

引用

29th IEEE International Conference on distributed Computing Systems

作者： Jiang, Zhen Ma, Junchao Lou, Wei Wu, Jie West Chester Univ Dept Comp Sci W Chester PA 19383 USA Hong Kong Polytech Univ Dept Comp Kowloon Peoples R China Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA

ISBN: (纸本)9781424444465

Building a "Straightforward" path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved in the transmission. This plays an important role in recent WASN applications that require a streaming service to deliver large amount of data. In this paper;we extend our early work on the straightforward path routing in WASNs in the presence of the "local minima". where the routing is blocked due to the lack of available forwarding successors. We bring some new insights of the safety information model for a forwarding routing that is limited in the request zone. A new routing is proposed to make a more intelligent decision in greedy advance and achieve more straightforward paths. The experimental results show substantial improvements of our approach compared with the best result known to date.

关键词： distributed algorithm information model routing wireless ad-hoc sensor networks

来源：评论

学校读者我要写书评

暂无评论

Network Pricing and Rate Allocation with Content Provider Participation

Network Pricing and Rate Allocation with Content Provider Pa...

引用

IEEE INFOCOM Conference 2009

作者： Hande, Prashanth Chiang, Mung Calderbank, Robert Rangan, Sundeep Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Qualcomm Flar Technol Asurion NJ 08807 USA

ISBN: (纸本)9781424435128

Pricing content-providers for connectivity to end-users and setting connection parameters based on the price is an evolving model on the Internet. The implications are heavily debated in telecom policy circles, and some advocates of "Network Neutrality" have opposed price based differentiation in connectivity. However, pricing content providers can possibly subsidize the end-user's cost of connectivity, and the consequent increase in end-user demand can benefit ISPs and content providers. This paper provides a framework to quantify the precise trade-off in the distribution of benefits among ISPs, content-providers, and end-users. The framework generalizes the well-known utility maximization based rate allocation model, which has been extensively studied as an interplay between the ISP and the end-users, to incorporate pricing of content-providers. We derive the resulting equilibrium prices and data rates in two different ISP market conditions: competition and monopoly. Network neutrality based restriction on content-provider pricing is then modeled as a constraint on the maximum price that can be charged to content-providers. We demonstrate that, in addition to gains in total and end-user surplus, content-provider experiences a net surplus from participation in rate allocation under low cost of connectivity. The surplus gains are, however, limited under monopoly conditions in comparison to competition in the ISP market.

关键词： Pricing Network Neutrality ISP Market Rate Allocation Optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Locality-Based Aggregate Computation in Wireless Sensor Networks

Brief Announcement: Locality-Based Aggregate Computation in ...

引用

28th Annual ACM Symposium on Principles of distributed Computing

作者： Chen, Jen-Yeu Pandurangan, Gopal Hu, Jianghai Natl Dong Haw Univ Hualien 974 Taiwan

ISBN: (纸本)9781605583969

We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages and O(n(3/2)/log(1/2)n) one-hop wireless transmissions to obtain aggregates on a random geometric graph. This reduces the energy consumption by at least a factor of 1/log(n) over the standard uniform gossip algorithm. Experiments validate the theoretical results and show that DRR-gossip needs much less transmissions than other gossip-based schemes.

关键词： wireless sensor networks aggregate computation gossip distributed algorithm randomized algorithm random geometric graph

来源：评论

学校读者我要写书评

暂无评论

Implementing Utility-Optimal CSMA

Implementing Utility-Optimal CSMA

引用

47th Annual Allerton Conference on Communication, Control, and Computing

作者： Lee, Jinsung Lee, Junhee Yi, Yung Chong, Song Proutiere, Alexandre Chiang, Mung Korea Adv Inst Sci & Technol Dept Elect Engn Seoul South Korea Microsoft Res Cambridge England Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

ISBN: (纸本)9781424458707

Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first deployment of such random access algorithms through an implementation over conventional 802.11 hardware, an on-going effort that started in summer 2009. It shows both a confirmation that Utility Optimal CSMA may work well in practice even with an implementation over legacy equipment, and a wide array of gaps between theory and practice in the field of wireless scheduling. This paper therefore also brainstorms the discovery of and bridging over these gaps, and the implementation-inspired questions on modeling and analysis of scheduling algorithms.

关键词： Scheduling Random Access CSMA Optimization distributed algorithm Wireless Networks Systems 802.11

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：