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

34th Chinese Control Conference (CCC)

作者： Zhang, Peng Liu, Zhixin Zhao, Ling Yang, Hongjiu Li, Xinbin Yanshan Univ Inst Elect Engn Qinhuangdao 066004 Peoples R China Yanshan Univ Coll Mech Engn Minist Educ China Key Lab Adv Forging & Stamping Technol & Sci Qinhuangdao 066004 Peoples R China

ISBN: (纸本)9789881563897

In this paper, a robust optimization problem is formulated for decode-and-forward relay network via game theory. The uncertainty of channel gain is considered to overcome the performance degradation in practical environment. In this study, a probability threshold method is used to suppress the channel fluctuation. Besides, a seller-buyer game is formulated to jointly consider the maximum utility of source node and relay node. To reduce the overhead information exchanging, a distributed iteration algorithm is applied. Numerical results show the effectiveness of the proposed schemes, and also present the robustness of the relay network. Moreover, the proposed game is proved to converge to the unique equilibrium point.

关键词： Relay network game theory robust optimization outage probability distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy-Saving User Association for Uplink Heterogeneous Cellular Networks

Energy-Saving User Association for Uplink Heterogeneous Cell...

引用

IEEE International Conference on Communication Software and Networks (ICCSN)

作者： Zhou, Tianqing Wang, Yafang Yang, Luxi Wu, Sifan Southeast Univ Sch Informat Sci & Engn Nanjing Jiangsu Peoples R China Univ Elect Sci & Technol China Sch Optoelect Informat Chengdu Peoples R China

ISBN: (纸本)9781479919840

In this paper, we present a scheme that jointly designs user association and power control in uplink heterogeneous cellular networks. Specifically, we formulate a general problem which performs user association and meanwhile minimizes the uplink sum-power under signal-to-interference-plus-noise ratio (SINR) constraints. This is a nonlinear mixed-integer optimization problem, and its optimum solutions are very difficult to be obtained when the problem is large-scale. To solve this problem, we decompose it into a user association problem and a power control problem, and then iteratively solve these two subproblems by designing a two-sided scalable (2.s.s.) algorithm. The proposed algorithm can be well implied in a distributed manner due to its simplification and efficiency. Numerical results show that, compared with the scheme proposed by Roy, the proposed scheme can significantly reduce energy consumption and increase the system throughput..

关键词： heterogeneous cellular network sum-power minimization energy effiency distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

The distributed algorithm Design Based on Web Service

The Distributed Algorithm Design Based on Web Service

引用

2nd International Conference on E-Business and Information System Security (EBISS)

作者： Pan Bin Guo Hong-xia Liu Kun Chengdu Univ Technol Coll Informat Management Chengdu Peoples R China Chengdu Univ Coll Elect & Informat Engn Chengdu Peoples R China Southwest Oil & Gas Field Co Inst Res Dev & Explorat Chengdu Peoples R China

ISBN: (纸本)9781424458950

Take the forward reasoning algorithm as an example, this paper describes how to design a distributed algorithm with WEB service technology. Based on message passing programming model, the partitioning, communication and the task-scheduling of distributed algorithm are discussed. Finally, the distributed algorithm has been implemented with .NET platform, and tested by the parallel performance measures, and then the results are analyzed.

关键词： WEB service distributed algorithm forward reasoning .NET platform performance testing

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for finding maximum barrier coverage in wireless sensor networks

A distributed algorithm for finding maximum barrier coverage...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： He, Jun Shi, Hongchi SW Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

ISBN: (纸本)9781424456383

Constructing sensor barriers to detect intruders crossing restricted regions, such as country borders, is one of the major application categories for wireless sensor networks. In this paper, we present a distributed algorithm to find the maximum number of disjoint sensor barriers in wireless sensor networks. Our solution works for any sensor deployment, for any size and shape of a covered region, and even for heterogeneous sensor nodes. In particular, our algorithm is distributed and works perfectly in an asynchronous communication environment. It utilizes the property of wireless channel and has lower complexity compared with other algorithms. For a deployment of n sensors, our algorithm spends O(n(2)) messages and O(n(2)) time.

关键词： disjoint sensor barrier distributed algorithm intruder detection maximum barrier coverage safety systems sensor deployment sensor placement wireless sensor networks wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Social-based Data Forwarding Mechanism for V2V Communication in VANETs 10

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

引用

10th International Conference on Communications and Networking in China (CHINACOM)

作者： Tian, Rui Jiao, Zhenzhen Bian, Guiyun Huang, Zhiqing Hou, Yibin Beijing Engn Res Ctr IoT Software & Syst Beijing Peoples R China Beijing Univ Technol Sch Software Engn Beijing Peoples R China China Acad Infounat & Commun Technol Beijing Peoples R China

ISBN: (纸本)9781479987955

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 inter-meeting 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.

关键词： VANET V2V communication Movement model Social learning distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Consistent Approach Towards Clustering in Low Energy Adaptive Clustering Hierarchy Protocol 12

A Consistent Approach Towards Clustering in Low Energy Adapt...

引用

2015 12th International Conference on High Capacity Optical Networks and Enabling Emerging Technologies (HONET)

作者： Rafiq, Asma Munir, Ehsan Ullah Rafique, M. Mustafa Khan, Samee U. COMSATS Inst Informat Technol Dept Comp Sci Wah Cantt Pakistan IBM Res Dublin Ireland N Dakota State Univ Fargo ND USA

ISBN: (纸本)9781467392686

Wireless Sensor Networks (WSNs) facilitate efficient and reliable monitoring of specified area for multiple applications. Variety of protocols are designed to increase the effectiveness and lifetime of WSNs. Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of them. LEACH is a hierarchical clustering based protocol where data is transferred to the data evaluation center through an intermediary node i.e., cluster head (CH). Cluster heads (CHs) consume much more energy than normal sensor nodes which requires CH's job to be rotated among all the nodes. CHs are chosen randomly with a predefined probability of fixed update intervals (round) to preserve energy of each node and to increase the lifetime of the whole network. In this paper, we propose an enhancement to the LEACH protocol. The clustering mechanism in LEACH protocol is not efficient to endorse optimal number of CHs. The proposed clustering algorithm selects nearly equal number of CHs in each round to evenly distribute the energy dissipation and therefore delays node failures and increases the network lifetime.

关键词： Sensor networks distributed algorithm clustering protocol energy efficient routing LEACH

来源：评论

学校读者我要写书评

暂无评论

distributed Computation of Connected Dominating Set for Multi-Hop Wireless Networks

引用

Procedia Computer Science 2015年 63卷 482-487页

作者： Simi Surendran Sreelakshmy Vijayan AMRITA University Kollam-690525 India

In large wireless multi-hop networks, routing is a main issue as they include many nodes that span over relatively a large area. In such a scenario, finding smallest set of dominant nodes for forwarding packets would be a good approach for better communication. Connected dominating set (CDS) computation is one of the method to find important nodes in the network. As CDS computation is an NP problem, several approximation algorithms are available but these algorithms have high message complexity. This paper discusses the design and implementation of a distributed algorithm to compute connected dominating sets in a wireless network with the help of network spectral properties. Based on local neighborhood, each node in the network finds its ego centric network. To identify dominant nodes, it uses bridge centrality value of ego centric network. A distributed algorithm is proposed to find nodes to connect dominant nodes which approximates CDS. The algorithm has been applied on networks with different network sizes and varying edge probability distributions. The algorithm outputs 40% important nodes in the network to form back haul communication links with an approximation ratio ≤ 0.04 * ∂ + 1, where ∂ is the maximum node degree. The results confirm that the algorithm contributes to a better performance with reduced message complexity.

关键词： Connected Dominating Set distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems [Extended Abstract] 15

Stabilizing Server-Based Storage in Byzantine Asynchronous M...

引用

34th Annual ACM Symposium on Principles of distributed Computing (PODC)

作者： Bonomi, Silvia Dolev, Shlomi Potop-Butucaru, Maria Raynal, Michel Univ Roma La Sapienza DIAG Rome Italy Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel Univ P&M Curie LIP6 Paris France Univ Rennes IRISA Inst Univ France Rennes France

ISBN: (纸本)9781450336178

A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering inversions are eliminated by the use of a (bounded) sequence number for writes, obtaining a practically stabilizing SWSR atomic register. A practically stabilizing Byzantine single-writer multi-reader (SWMR) atomic register is then obtained by using several copies of SWSR atomic registers. Finally, bounded time-stamps, with a time-stamp per writer, together with SWMR atomic registers, are used to construct a practically stabilizing Byzantine multi-writer multi-reader (MWMR) atomic register. In a system of n servers implementing an atomic register, and in addition to transient failures, the constructions tolerate t < n/8 Byzantine servers if communication is asynchronous, and t < n/3 Byzantine servers if it is synchronous. The noteworthy feature of the proposed algorithms is that (to our knowledge) these are the first that build an atomic read/write storage on top of asynchronous servers prone to transient failures, and where up to t of them can be Byzantine.

关键词： Asynchronous message-passing system Atomic read/write register Byzantine server Clients/servers architecture distributed algorithm Fault-tolerance Read/write register Regular register Self-stabilization Transient failures

来源：评论

学校读者我要写书评

暂无评论

ABC-Center: Approximate-Center Election in Modular Robots

ABC-Center: Approximate-Center Election in Modular Robots

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Naz, Andre Piranda, Benoit Goldstein, Seth Copen Bourgeois, Julien Univ Franche Comte FEMTO ST Inst UMR CNRS 6174 1 Cours Leprince Ringuet F-25200 Montbeliard France Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781479999941

Modular robots are composed of many independent connected modules which are able to achieve common goals through communications. Many distributed algorithms have better performance if the modules that have to communicate with all the others, are placed at the center of the system. In this paper, we propose ABC-Center, an iterative algorithm for electing an approximate-center module in modular robots. ABC-Center uses O(1) space per module and O(kd) time, where k is the number of iterations required to terminate and d the diameter of the system. We evaluated our algorithm both on hardware modular robots and in a simulator for large ensemble of robots. The average expected eccentricity of the module elected by ABC-Center is less than 1.25 blocks off for random systems composed of up to 1000 modules. Furthermore, experiments show that our algorithm terminates after a few iterations. Hence, ABC-Center is scalable and adapted to modular robots with low memory resources.

关键词： distributed algorithm Modular robotic Center election

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor Networks and Satellite Simulation 7th

Wireless Sensor Networks and Satellite Simulation

引用

7th International Conference on Wireless and Satellite Systems (WiSATS)

作者： Lucas, P-Y. Nguyen Huu Van Long Tuyen Phong Truong Pottier, B. Univ Bretagne Occidentale Brest France Can Tho Univ Can Tho Vietnam

ISBN: (纸本)9783319254791;9783319254784

Connecting wireless sensor networks (WSN) by the air becomes attractive due to advances in Satellites and Unmanned aerial vehicle (UAV). This work focus on specification and simulation of situations where several distant WSN have gateways visited periodically by a mobile on a static path. To develop and evaluate collection and control services, it is first needed to run system level simulation. This paper reports on producing automatically representations of complex topology where mobile cooperate with sensor fields with respect to timing constraints from both sides. Simulation programs are produced for graphic accelerators (GPU), and concurrent process architectures.

关键词： Simulation Satellite Sensor network distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：