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

Optimal power/rate trade-off for internet of multimedia things lifetime maximization under dynamic links capacity

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2019年 93卷 737-750页

作者： Khernane, Nesrine Couchot, Jean-Francois Mostefaoui, Ahmed Univ Bourgogne Franche Comte FEMTO ST Inst Disc dep F-9000 Belfort France

Today, wireless cameras are widely deployed in various applications such as in commercial and military domains (eg. patients monitored in smart hospitals, multimedia surveillance deployed in smart cities, intelligent multimedia monitoring of an ecological system, etc.). The design of such systems can be achieved by allowing the interaction between all their component objects (i.e., internet of things), which is one of the preoccupations of the researchers this last decade. However, using the multimedia sensor nodes for the internet of things (IoT) is problematic in term of power consumption, since these latter would be wireless and battery powered. Within the wider context of IoT, Wireless Multimedia Sensor Networks (WMSNs) can be a promising technology for the aforementioned domains. However, in a such network, the captured data is usually voluminous and requires local processing, and thus, entailing a higher energy requirement. Therefore, the most important issue is to balance the video data coding versus the perceived video quality at the sink, while maximizing the overall network lifetime. To this end, we propose a fully distributed algorithm, that considers the problem of allocating the resources in wireless video sensor network, in a way to ensure a trade-off between both: the encoding power and the source rate at each node, while serving the desired video quality requirement. In opposition to existing approaches, our algorithm, of distributed nature, is provided to find such a trade-off whatever the initial network configuration is. In addition, a dynamic change of links capacity is considered with the limited transmission and reception powers. A new problem is then formulated to cope with the channel transmission error and it is solved. (C) 2017 Elsevier B.V. All rights reserved.

关键词： IoT WMSNs Video quality Network lifetime distributed algorithm Encoding power Source rate

来源：评论

学校读者我要写书评

暂无评论

Deterministic rendezvous with different maps

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2019年 106卷 49-59页

作者： Farrugia, Ashley Gasieniec, Leszek Kuszner, Lukasz Pacheco, Eduardo Capgemini Warrington Cheshire England Univ Liverpool Dept Comp Sci Liverpool Merseyside England Univ Gdansk Fac Math Phys & Comp Sci Inst Informat Gdansk Poland Oracle Zapopan 45116 Jalisco Mexico

We consider a rendezvous problem in which two identical anonymous mobile entities A and B, called later robots, are asked to meet at some node in the network modelled by an arbitrary undirected graph G = (V, E). Most of the work devoted to rendezvous in graphs assumes robots have access to the same sets of nodes and edges, and the topology of connections is either known or unknown to the robots. In this work we assume that each robot may access only specific nodes and edges in G of which full map is given to the robot in advance. We consider three variants of rendezvous differentiated by the level of restricted maneuverability of robots in both synchronous and asynchronous models of computation. In each adopted variant and model of computation we study feasibility of rendezvous, and if rendezvous is possible we propose the relevant algorithms and discuss their efficiency. (C) 2019 Elsevier Inc. All rights reserved.

关键词： distributed algorithm Mobile agents Rendezvous

来源：评论

学校读者我要写书评

暂无评论

Interference Management in D2D-Enabled Heterogeneous Cellular Networks Using Matching Theory

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2019年第9期18卷 2091-2102页

作者： Shamaei, Shiva Bayat, Siavash Hemmatyar, Ali Mohammad Afshin Sharif Univ Technol Dept Comp Engn Tehran Iran Sharif Univ Technol Elect Res Inst Tehran Iran

To support the increasing data traffic demand in wireless communications networks, a multi-tier architecture that consists of multiple small cells is adopted in traditional (macro) cellular networks. Nevertheless, due to the expansion of various wireless devices and services, there is still a need to increase the network capacity in new generation networks such as 5G. Hence, the integration of Device-to-Device (D2D) communication as a promising technology with heterogeneous networks has been proposed. This integration not only increases network capacity but also improves spectral efficiency and alleviates the traffic load of base stations. However, the co/cross-tier interferences between D2D and cellular communications caused by resource sharing is a significant challenge. In this paper, we propose a distributed resource allocation algorithm based on matching theory to minimize these interferences and optimize the network performance. It is shown in this paper that the proposed algorithm converges to a stable matching and terminates after finite iterations. Simulation results show that the proposed algorithm is able to achieve more than 90 percent of the optimum network performance with much lower overhead and complexity.

关键词： Interference management heterogeneous networks device-to-device (D2D) communication matching theory resource allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient coverage hole-healing algorithm for area-coverage improvements in mobile sensor networks

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2019年第3期12卷 541-552页

作者： So-In, Chakchai Tri Gia Nguyen Nhu Gia Nguyen Khon Kaen Univ Dept Comp Sci Appl Network Technol ANT Lab Fac Sci Khon Kaen Thailand Duy Tan Univ Fac Informat Technol Da Nang Vietnam Duy Tan Univ Grad Sch Da Nang Vietnam

Maximizing network coverage is among the key factors in designing efficient sensor-deployment algorithms for wireless sensor networks (WSNs). In this study, we consider a WSN in which mobile sensor nodes (SNs) are randomly deployed over a two-dimensional region with the existence of coverage holes due to the absence of any SNs. To improve the network coverage, we thus propose a novel distributed deployment algorithm - coverage hole-healing algorithm (CHHA) - to maximize the area coverage by healing the coverage holes such that the total SN moving distance is minimized. Once the network is formed after an initial random placement of the SNs, CHHA is applied to detect coverage holes, including hole-boundary SNs, based on computational geometry, i.e., Delaunay triangulation. The distributed deployment feature of CHHA applies a concept to virtual forces that is used to decide the movement of mobile SNs to heal the coverage holes. The simulation results show that our proposed algorithm is capable of exact detection of coverage holes in addition to area-coverage improvement by healing the holes. The results also demonstrate the effectiveness of CHHA compared with other competitive approaches, namely, VFA, VEDGE, and HEAL, in terms of total moving distance.

关键词： Area coverage Boundary detection Coverage hole distributed algorithm Sensor deployment Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous linear multi-agent consensus with nonconvex input constraints and switching graphs

引用

INFORMATION SCIENCES 2019年 501卷 397-405页

作者： Li, Xue Li, Cancan Yang, Yikang Univ Elect Sci & Technol China Sch Astronaut & Aeronaut Chengdu 611731 Sichuan Peoples R China Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Shaanxi Peoples R China

This study focuses on a constrained consensus problem of heterogeneous linear multi-agent systems with nonconvex input constraints and switching graphs. A distributed control algorithm with the time-varying gain is presented to ensure the control input of each agent to stay in a nonconvex set and make all agents reach to a common point. Through the method of nonnegative matrices, we obtain the sufficient conditions for the consensus of the system. It is shown that all agents can reach a consensus as long as the union of communication graphs contains spanning trees. Finally, simulations are provided to show the effectiveness of the proposed algorithm. (C) 2019 The Authors. Published by Elsevier Inc.

关键词： Heterogeneous multi-agent systems Control input constraints Switching graphs distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision

引用

THEORY OF COMPUTING SYSTEMS 2019年第2期63卷 261-305页

作者： Khanchandani, Pankaj Lenzen, Christoph Swiss Fed Inst Technol Zurich Switzerland Max Planck Inst Informat Saarland Informat Campus Saarbrucken Germany

In the Byzantine-tolerant clock synchronization problem, the goal is to synchronize the clocks of n fully connected nodes. The clocks run at rates between 1 and ? >1, and messages have a delay (including computation) between d - U and d. Moreover, up to f < n/3 of the nodes can fail by deviating arbitrarily from the protocol, i.e., are Byzantine. Despite this interference, correct nodes need to generate distinguished events (or pulses) almost simultaneously and periodically. The quality of the solution is measured by the skew, which is the maximum real time difference between corresponding pulses. In the self-stabilizing setting, in addition we allow for transient failures, possibly of all nodes. Once transient faults have ceased and at most f nodes remain faulty, the system should start generating synchronized pulses again. We design a self-stabilizing solution to this problem with asymptotically optimal skew. We achieve our goal by refining and extending the protocol of Lynch and Welch and make the following contributions in the process. We give a simple analysis of the Lynch and Welch protocol with improved bounds on skew and tolerable difference in clock rates by rebuilding upon the main ingredient of their protocol, called approximate *** give a modified version of the protocol so that the frequency and amount of communication between the nodes is reduced. The modification adds a step to adjust the clock rates by another application of approximate agreement. The skew bound achieved is asymptotically optimal for suitable choices of *** present a method to add self-stabilization to the above protocols while preserving their skew bounds. The heart of the method is a coupling scheme that leverages a self-stabilizing protocol with a larger skew.

关键词： distributed algorithm Stabilization time Phase and frequency correction

来源：评论

学校读者我要写书评

暂无评论

Minimum Connected Dominating Set Under Routing Cost Constraint in Wireless Sensor Networks With Different Transmission Ranges

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2019年第2期27卷 546-559页

作者： Song, Liang Liu, Chunyan Huang, Hejiao Du, Hongwei Jia, Xiaohua Xiamen Univ Dept Software Engn Xiamen 361005 Peoples R China Nanjing Univ Aeronaut & Astronaut Dept Comp Sci & Technol Nanjing 211106 Jiangsu Peoples R China Harbin Inst Technol Dept Comp Sci & Technol Shenzhen 518055 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

Wireless sensor networks (WSNs) are used to cover destination areas for a lot of practical applications. To enhance the performance of the WSN, the virtual backbone based on the connected dominating set is an efficient way with respect to the routing cost between sensors, lifetime of entire network, and so on. In this paper, especially for the WSN with different transmission radii among different sensors, we study the problem of constructing the minimum rho-range connected dominating set under the constraint alpha-times of the minimum routing cost (alpha MOC-rho CDS), where alpha >= 5 and rho is the ratio of the maximum-to-minimum transmission radius. Our contributions are three folds. First, we propose a polynomial time approximation scheme which generates the alpha MOC-rho CDS with the size of at most (1 + epsilon) times of the optimum solution, where epsilon is the error parameter. Second, we propose a polynomial time algorithm and prove that it has two approximation ratios (6 rho + 1)(2)(2 rho + 1)(2) and 10 inverted right perpendicular (2 pi/theta)inverted left perpendicular right perpendicular (ln 3 rho/(ln(1/cos theta))) left perpendicular right perpendicular (ln rho/(ln(2 cos(pi/5)))) left perpendicular, where theta < arcsin(1/3 rho). Finally, we propose the distributed version of the constant approximation ratio algorithm which has both the time complexity and message complexity O(n(3)), where n is the number of sensor nodes. Besides, the simulation results demonstrate the efficiency of our algorithms.

关键词： WSN alpha MOC-rho CDS PTAS approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Markov Approximation Method for Optimal Service Orchestration in IoT Network

引用

IEEE ACCESS 2019年 7卷 49538-49548页

作者： He, Wenchen Guo, Shaoyong Liang, Yun Qiu, Xuesong Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Global Energy Interconnect Res Inst Co Ltd Beijing 102200 Peoples R China

With the evolution toward 5G, the Internet of Things (IoT) is expected to manage resource dynamically and provide customized services for different users in a cost-effective manner. Many technologies, such as edge computing and network function virtualization (NFV), have responded to these demands and been even more critical for system mobility, scalability, flexibility, and resource utilization. In this vein, the efficient provisioning method of the IoT services in distributed clouds based on the diverse quality of experience (QoE) requirements is highly needed. This paper focuses on service chain (SC) orchestration and studies the optimal placement of virtual network functions (VNFs) with multiple instances to minimize cost and delay, as well as guarantee network load balancing. We propose a multi-objective optimization problem model and then convert this combinatorial optimization problem to the one which can be solved by distributed methods based on the Markov approximation. At last, a VNF placement with multiple instances algorithm (VPMIA) based on Markov chain is designed to solve the above problem in a distributed manner. The simulation results show that the proposed algorithm can outperform the random placement algorithm and the single-path placement algorithm in cost saving by 22% and 31%, respectively, with a high SC acceptance rate. Besides, it can guarantee the QoE requirements and make the network load balanced with the different numbers of SCs.

关键词： distributed algorithm Internet of Things load balancing Markov approximation multiple instances service chain VNF placement

来源：评论

学校读者我要写书评

暂无评论

Data Center Demand Response in Deregulated Electricity Markets

引用

IEEE TRANSACTIONS ON SMART GRID 2019年第3期10卷 2820-2832页

作者： Bahrami, Shahab Wong, Vincent W. S. Huang, Jianwei Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China

With the development of deregulated electricity markets, a customer can enter a contract with one of several competing utility companies. Meanwhile, a utility company is motivated to increase its market share by helping its customers manage their energy usage and save money through demand response programs. In this paper, we study the demand response program in deregulated electricity markets for data centers that often have significant flexibility in workload scheduling. We consider the real-time pricing and model the data centers' coupled decisions of utility company choices and workload scheduling as a many-to-one matching game with externalities. To solve such a game, we show that it admits an exact potential function, whose local minima correspond to the stable outcomes of the game. We further develop a distributed algorithm that guarantees to converge to a stable outcome. Compared with the scenario without data centers' demand response, we show through simulation that the proposed algorithm can reduce the average contract payment of data centers by 18.7% and increase the revenue of the utility companies that offer lower electricity tariffs up to 80% by attracting more data centers as customers.

关键词： Deregulated electricity market many-to-one matching game stable outcome distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Optima Network Parameter Estimation: Single-Shot Exchange of Local Decisions

引用

IEEE SIGNAL PROCESSING LETTERS 2019年第9期26卷 1280-1284页

作者： Sihag, Saurabh Tajer, Ali Rensselaer Polytech Inst Elect Comp & Syst Engn Dept Troy NY 12180 USA

This letter considers a network of sensors that collectively sense a number of unknown parameters. Each sensor can possibly sense only a subset of the parameters, gather data only about these parameters, and has access to only the statistical model of the data that it collects locally. The objective is that each sensor forms optimal estimates for its designated parameters (i.e., the parameters that it can sense). This letter proposes an estimation cost function that strikes a balance between the sensors being autonomous in forming local estimates based on their locally available data and statistical models, and enforcing consistency among the local estimates formed for the parameters that are sensed by multiple sensors. Exact optimal estimators are characterized, and it is shown that the optimal estimators can be implemented in a distributed way, through a single-shot exchange of local decisions. Specifically, the distributed implementation consists of forming local estimates and exchanging certain sufficient statistics values in a single round of communication exchange among some of the sensors. Furthermore, the optimal performance under the proposed cost function is also compared analytically with the performance of the widely used mean squared error estimator.

关键词： Autonomous systems distributed algorithm estimation theory networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：