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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

4,043 篇 会议
2,101 篇 期刊文献
26 篇 学位论文

馆藏范围

6,170 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,869 篇 工学
- 2,120 篇 计算机科学与技术...
- 1,869 篇 电气工程
- 957 篇 信息与通信工程
- 902 篇 控制科学与工程
- 389 篇 软件工程
- 151 篇 仪器科学与技术
- 147 篇 电子科学与技术（可...
- 135 篇 机械工程
- 70 篇 交通运输工程
- 39 篇 石油与天然气工程
- 21 篇 网络空间安全
- 20 篇 动力工程及工程热...
- 15 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 8 篇 材料科学与工程（可...
- 7 篇 航空宇航科学与技...
654 篇 理学
- 344 篇 数学
- 269 篇 系统科学
- 70 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
234 篇 管理学
- 226 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
36 篇 医学
- 31 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
2 篇 农学
1 篇 艺术学

主题

6,170 篇 distributed algo...
552 篇 convergence
544 篇 wireless sensor ...
533 篇 algorithm design...
414 篇 optimization
382 篇 computer science
366 篇 distributed comp...
363 篇 network topology
331 篇 routing
279 篇 resource managem...
217 篇 protocols
215 篇 computational mo...
210 篇 computer network...
206 篇 costs
202 篇 approximation al...
197 篇 fault tolerance
187 篇 ad hoc networks
183 篇 bandwidth
180 篇 peer to peer com...
179 篇 interference

机构

24 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
15 篇 univ liverpool d...
14 篇 suny stony brook...
14 篇 swiss fed inst t...
14 篇 purdue univ sch ...
13 篇 northeastern uni...
12 篇 univ penn dept e...
12 篇 department of el...
12 篇 weizmann inst sc...
11 篇 department of in...
11 篇 georgia state un...
11 篇 purdue univ sch ...
11 篇 univ cyprus dept...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
22 篇 notarstefano giu...
21 篇 hong yiguang
20 篇 dagdeviren orhan
20 篇 scutari gesualdo
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 khan usman a.
16 篇 schmid stefan
16 篇 sharma gokarna
15 篇 peleg david
15 篇 korman amos
15 篇 navarra alfredo
15 篇 mou shaoshuai
15 篇 zeng xianlin
15 篇 cortes jorge

语言

6,066 篇 英文
59 篇 其他
38 篇 中文
3 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

检索条件"主题词=distributed algorithms"

共 6170 条记录，以下是1721-1730 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Game Theoretic Perspective of Optimal CSMA

Game Theoretic Perspective of Optimal CSMA

引用

IEEE International Conference on Computer Communications (INFOCOM)

作者： Jang, Hyeryung Yun, Se-Young Shin, Jinwoo Yi, Yung Korea Adv Inst Sci & Technol Dept Elect Engn Daejeon 34141 South Korea Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Daejeon 34141 South Korea

Game-theoretic approaches have provided valuable insights into the design of robust local control rules for the individuals in multi-agent systems, e.g., Internet congestion control, road transportation networks, and so on. In this paper, we introduce a non-cooperative medium access control game for wireless networks and propose new fully distributed carrier sense multiple access (CSMA) algorithms that are provably optimal in the sense that their long-term throughputs converge to the optimal solution of a utility maximization problem over the maximum throughput region. The most significant part of our approach lies in introducing novel price functions in agents' utilities so that the proposed game admits an ordinal potential function with no price-of-anarchy. The game formulation naturally leads to game-based dynamics finding a Nash equilibrium, but they often require global information. Toward our goal of designing fully distributed operations, we propose new game-inspired dynamics by utilizing a certain property of CSMA that enables links to estimate their temporary throughputs without message passing. They can be thought of as stochastic approximations to the standard dynamics, which is a new feature in our work, not prevalent in other traditional game-theoretic approaches. We show that they converge to a Nash equilibrium, and numerically evaluate their performance to support our theoretical findings.

关键词： CSMA distributed algorithms game theory wireless ad-hoc network stochastic approximation

来源：评论

学校读者我要写书评

暂无评论

Real-Time Power Control of Wireless Chargers in Battery-Free Body Area Networks

Real-Time Power Control of Wireless Chargers in Battery-Free...

引用

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Yinan Zhu Xianzhong Tian Kaikai Chi Chenyiming Wen Yi-hua Zhu School of Computer Science and Technology Zhejiang University of Technology Hangzhou China School of Information Engineering Zhejiang University of Technology Hangzhou China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

RF Energy harvesting technology has been proved one of the effective approaches for powering battery-free wearable devices in wireless body area networks. However, excessive electromagnetic radiation is harmful to human body. In this paper, we consider real-time healthcare scenario where wearable devices worn by mobile users collect their physiological data in real time and multiple wireless chargers are deployed for energy provision. Our goal is to minimize the maximal radiation degree among mobile users while maintaining normal work of wearable devices via adaptive power control of wireless chargers. We first discrete the users' moving trajectories and transform the stubborn problem into a docile one. Then we propose a distributed algorithm with interaction of wireless chargers, wearable devices and base station to solve it. Our proposed real-time power control scheme achieves an approximation ratio of (1+e) in general case. Furthermore, one special case is discussed. Simulation results reveal that our scheme is efficient and the maximal radiation degree among users can be reduced by almost 20\% as compared to the baseline scheme.

关键词： Wireless communication Real-time systems Wireless sensor networks distributed algorithms Power control Base stations Radio frequency

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Communication in Systems of Home Based Mobile Agents 18

Brief Announcement: Communication in Systems of Home Based M...

引用

30th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)

作者： der Heide, Friedhelm Meyer Auf Schaefer, Johannes Paderborn Univ Heinz Nixdorf Inst Paderborn Germany

ISBN: (纸本)9781450357999

We consider a scenario where agents have to exchange data in a wireless ad-hoc network, although it is not connected. We assume that each agent has a static home base. To improve connectivity, each agent is allowed to move away from his home base, but only for a limited distance which may be different for different agents. These distances might be dictated by limited batteries of the agents, which forces them to return to their home charging station after a while. An application currently widely considered in literature (and in projects and applications) is disaster management, where helpers are equipped with smartphones to submit important local information to a coordinating station. In case of the network being disconnected, mobile "postmen" are used for long distance connections. In this paper, we focus on the aspect of "communication by postmen". We model such a scenario by a weighted directed graph. It consists of n (static) nodes describing the home bases of the agents. Adirected edge from basevi to base v(j) withweight w(v(i), v(j)) indicates that agent ai can walk from his home base to the home base of a(j), which needs time w(v(i), v(j)). If agent a(j) is at home when agent ai arrives, they can exchange messages. Alongside with the introduction of the model, we present a randomized distributed algorithm for all-to-all message dissemination and show that its performance is, in many cases, close to optimal.

关键词： self-organization distributed algorithms mobile agents dynamic networks

来源：评论

学校读者我要写书评

暂无评论

Detecting Gaps and Voids in WSNs and IoT Networks: the Angle-based Method 18

Detecting Gaps and Voids in WSNs and IoT Networks: the Angle...

引用

2nd International Conference on Future Networks and distributed Systems (ICFNDS)

作者： Bezoui, Madani Bounceur, Ahcene Lagadec, Loic Euler, Reinhardt Hammoudeh, Mohammad Laouid, Abdelkader Tari, Abdelkamel Univ Boumerdes Dept Math Boumerdes Algeria Univ Bretagne Occidentale CNRS Lab STICC UMR 6285 Brest France ENSTA Bretagne CNRS Lab STICC UMR 6285 Brest France Manchester Metropolitan Univ Sch SCMDT Manchester Lancs England Univ El Oued LIMED Lab El Oued Algeria Univ Bejaia LIMED Lab Bejaia Algeria

ISBN: (纸本)9781450364287

A random deployment of Wireless Sensor Networks (WSNs) is often the basic structure used in the context of fire forest detection, military applications or any situation where the zone-of-interest is not accessible by humans. The main problematic in this kind of deployment is the formation of gaps or voids, which represent a zone which is not covered in the network. This reduces significantly its Quality of Service and can lead to serious problems, like a non-detected starting fire, the presence of unexpected persons or attacks, etc. Therefore, detecting zones that are not covered by the WSN is of great importance. In this paper, we present a new method allowing to detect gaps and voids in WSNs or in IoT networks by using some characteristics of the angles of the polygon formed by the boundary as determined by the D-LPCN algorithm. These angles can be interior or exterior. Characterizing the angles of the polygon formed by these boundary nodes allows to specify whether this boundary is a gap or a void, in case where the obtained polygon is interior. Since D-LPCN is fault-tolerant, the simulation results show that it is possible to use it for the detection of faulty nodes and intrusions.(1)

关键词： Wireless Sensor Network IoT gap void distributed algorithms polygons interior and exterior angles security D-LPCN

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems 18

Brief Announcement: A Local Stochastic Algorithm for Separat...

引用

37th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Cannon, Sarah Daymude, Joshua J. Gokmen, Cem Randall, Dana Richa, Andrea W. Georgia Inst Technol Atlanta GA 30332 USA Arizona State Univ Tempe AZ USA

ISBN: (纸本)9781450357951

We investigate stochastic, distributed algorithms that can accomplish separation and integration behaviors in self-organizing particle systems, an abstraction of programmable matter. These particle systems are composed of individual computational units known as particles that have limited memory, strictly local communication abilities, and modest computational power, and which collectively solve system-wide problems of movement and coordination. In this work, we extend the usual notion of a particle system to treat heterogeneous systems by considering particles of different colors. We present a fully distributed, asynchronous, stochastic algorithm for separation, where the particle system self-organizes into segregated color classes using only local information about each particle's preference for being near others of the same color. Conversely, by simply changing the particles' preferences, the color classes become well-integrated. We rigorously analyze the convergence of our distributed, stochastic algorithm and prove that under certain conditions separation occurs. We also present simulations demonstrating our algorithm achieves both separation and integration.

关键词： Programmable matter self-organization separation distributed algorithms stochastic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Stackelberg Game Framework for Mobile Data Gathering in Leasing Residential Sensor Networks 26

A Stackelberg Game Framework for Mobile Data Gathering in Le...

引用

26th IEEE/ACM International Symposium on Quality of Service (IWQoS)

作者： Zeng, Yiming Zhou, Pengzhan Liu, Ji Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)9781538625422

This paper studies a data gathering problem in a wireless sensor network containing multiple private residual sub-networks. The interaction between the wireless sensor network operator and the owners of residual sub-networks is modeled by a Stackelberg game, which forms a novel framework for jointly analyzing the pricing, gathering data, and planning routes. It is shown that the game has a unique Stackelberg equilibrium at which the wireless sensor network operator sets prices to minimize total cost, while owners of residual sub-networks respond accordingly to maximize their utilities subject to their bandwidth constraints. An algorithm and theoretical analyses are provided for the corresponding strategies of the operator and owners, and validated by extensive simulations. It is demonstrated that the algorithm achieves lower network cost compared with existing data gathering strategies.

关键词： Wireless sensor networks Stackelberg game equilibrium mobile data gathering distributed algorithms convex optimization

来源：评论

学校读者我要写书评

暂无评论

Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs 18

Dispersion of Mobile Robots: A Study of Memory-Time Trade-of...

引用

19th International Conference on distributed Computing and Networking (ICDCN)

作者： Augustine, John Moses, William K., Jr. Indian Inst Technol Madras Dept Comp Sci & Engn Chennai Tamil Nadu India

ISBN: (纸本)9781450363723

We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, n robots are placed in an n node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion. Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally, dispersion has an immediate real world application due to its relationship to the problem of recharging electric cars, as each car can be considered a robot and recharging stations and the roads connecting them nodes and edges of a graph respectively. Since recharging is a costly affair relative to traveling, we want to distribute these cars amongst the various available recharge points where communication should be limited to car-to-car interactions. We provide lower bounds on both the memory required for robots to achieve dispersion and the minimum running time to achieve dispersion on any type of graph. We then analyze the trade-offs between time and memory for various types of graphs. We provide time optimal and memory optimal algorithms for several types of graphs and show the power of a little memory in terms of running time.

关键词： Dispersion Load balancing Mobile robots Collective robot exploration Scattering Uniform deployment Graph algorithms Deterministic algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Incentive Mechanisms and Influence of Negotiation Power in Multi-Relay Cooperative Wireless Networks

Incentive Mechanisms and Influence of Negotiation Power in M...

引用

IEEE Global Conference on Communications (GLOBECOM) / Workshop on Wireless Networking and Control for UAV

作者： Wu, Nanmiao Zhou, Xiangwei Sun, Mingxuan Louisiana State Univ Sch Elect Engn & Comp Sci Baton Rouge LA 70803 USA

ISBN: (纸本)9781538647271

Cooperative relaying in wireless networks is strongly affected by the way that the source and relays are incentivized. However, existing studies have not paid enough attention to the influence of negotiation power of the involved parties. In this paper, two incentive mechanisms for cooperative relaying are proposed, wherein the source possesses different degrees of negotiation power. One mechanism is for the source with strong negotiation power posting a series of take-it-or-leave-it contract offers for the relays while the relays are not entitled to negotiate the counteroffers, and the other mechanism is for the source with weak negotiation power while the relays confer substantial negotiation power, i.e., are capable of doing business with the source by crafting more profitable deals. The relay selection rules, the optimal amounts of relaying service, and the optimal rewards for the relays, are derived for the proposed mechanisms, respectively. A distributed algorithm is further proposed to iteratively obtain the optimal solution for the second mechanism. A case study is also presented to show the influence of negotiation power on the behaviors of the participants and the efficiency and distribution of profits. Numerical results are provided to verify the theoretical analyses of the proposed mechanisms.

关键词： Relays Contracts Signal to noise ratio Wireless networks Indexes distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A stack-vector routing protocol for automatic tunneling

A stack-vector routing protocol for automatic tunneling

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Mohamed Lamine Lamali Simon Lassourreuille Stephan Kunne Johanne Cohen LaBRI-CNRS Université de Bordeaux France LRI-CNRS Université Paris-Sud Université Paris Saclay France

In a network, a tunnel is a part of a path where a protocol is encapsulated in another one. A tunnel starts with an encapsulation and ends with the corresponding decapsulation. Several tunnels can be nested at some stage, forming a protocol stack. Tunneling is very important nowadays and it is involved in several tasks: IPv4/IPv6 transition, VPNs, security (IPsec, onion routing), etc. However, tunnel establishment is mainly performed manually or by script, which present obvious scalability issues. Some works attempt to automate a part of the process (e.g., TSP, ISATAP, etc.). However, the determination of the tunnel(s) endpoints is not fully automated, especially in the case of an arbitrary number of nested tunnels. The lack of routing protocols performing automatic tunneling is due to the unavailability of path computation algorithms taking into account encapsulations and decapsulations. There is a polynomial centralized algorithm to perform the task. However, to the best of our knowledge, no fully distributed path computation algorithm is known. Here, we propose the first fully distributed algorithm for path computation with automatic tunneling, i.e., taking into account encapsulation, decapsulation and conversion of protocols. Our algorithm is a generalization of the distributed Bellman-Ford algorithm, where the distance vector is replaced by a protocol stack vector. This allows to know how to route a packet with some protocol stack. We prove that the messages size of our algorithm is polynomial, even if the shortest path can be of exponential length. We also prove that the algorithm converges after a polynomial number of steps in a synchronized setting. We adapt our algorithm into aproto-protocol for routing with automatic tunneling and we show its efficiency through simulations.

关键词： Tunneling Routing protocols Encapsulation Routing distributed algorithms Interoperability

来源：评论

学校读者我要写书评

暂无评论

"Semi-Asynchronous": a new scheduler for robot based computing systems 38

"Semi-Asynchronous": a new scheduler for robot based computi...

引用

38th IEEE International Conference on distributed Computing Systems (ICDCS)

作者： Cicerone, Serafino Di Stefano, Gabriele Navarra, Alfredo Univ Aquila Dept Informat Engn Comp Sci & Maths Laquila Italy Univ Perugia Dept Maths & Comp Sci Perugia Italy

ISBN: (纸本)9781538668719

The study of mobile entities, called robots, that have to accomplish global tasks on the basis of local information has attracted many researchers. A well-known scenario is that in which robots operate in Look-Compute-Move (LCM) computational cycles. In each cycle, a robot takes a snapshot of the environment (Look phase), then executes a distributed algorithm on the basis of the obtained snapshot (Compute phase), and finally moves toward a desired destination, if any (Move phase). LCM cycles might be subject to different temporal constraints dictated by the considered schedule. The classic models for the activation and synchronization of mobile robots are the fully-synchronous, semi-synchronous, and asynchronous models. The three models have been shown to constitute a hierarchy, that is fully-synchronous robots can accomplish more tasks than semi-synchronous robots that in turn can accomplish more tasks than asynchronous robots. The computational power of robots based on the different models has been extensively investigated, revealing a big gap between asynchronous robots and the other models. For many problems it is still not known whether the synchronization is crucial for designing resolution algorithms or not. In order to better understand the asynchronous case, here we propose further models referred to as semi-asynchronous, showing that for robots moving on graphs, semi-synchronous robots can accomplish more tasks than semi-asynchronous robots that in turn can accomplish more tasks than asynchronous robots. Whether the same strict hierarchy also holds for robots moving on the Euclidean plane remains open, however our investigation reveals interesting consequences that may help in better characterizing the computational power of robots with respect to the different synchronization models.

关键词： distributed algorithms Mobile Robots Synchronization Obliviousness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 169 170 171 172 173 174 175 176 177 178 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：