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

IEEE Conference on Communications and network Security (CNS)

作者： Dongdi Wei Xiaofeng Qiu Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

We categorize the malicious code in IoT devices, analyze their characters and disassemble them as far as basic actions. Then we simulate these basic malicious code running in the background and show that we indeed can find out the malicious activity of the IoT device by monitoring the runtime of identified service tasks. We choose fluctuation and abrupt change point as our detection features according to the simulation result, then we design and implement our detection system to detect the activity of a web camera. Our result show that malicious code can be detected by monitoring the device's running status.

关键词： Malware Task analysis Runtime Internet of Things Feature extraction Hardware Cryptography

来源：评论

学校读者我要写书评

暂无评论

Geographic Routing Based on Social Dynamic Features Aware in Vehicle Social network

Geographic Routing Based on Social Dynamic Features Aware in...

引用

International Symposium on Wireless Communication systems (ISWCS)

作者： Qing Liao Jingyi Zhang Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

Vehicular ad-hoc network has the characteristics of Delay Tolerant network and social network. In this background, we take the social attributes of Delay Tolerant network as starting point and study the macroscopic dynamic features, micro dynamic features and dynamic contact features of vehicles. In this paper, we proposed a geographic multicast routing based on social dynamic features aware which solves messages transmission problems in vehicular ad hoc network. Different from the existing mobility-aware geocast algorithm, our algorithm takes into account not only the relationships between vehicles mobility and geographical location, but also the contact features between vehicles and destination areas. Finally, it is proved that our algorithm is superior to the existing mobility-aware geocast algorithm in term of delivery rate, network overhead and average delay by the real mobile data model simulation in large vehicular ad-hoc network. The results prove the effectiveness of our algorithm, and the routing protocol we proposed is suited for large urban vehicular ad hoc networks.

关键词： Routing Vehicle dynamics Public transportation Trajectory Social network services Entropy Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Community-Based Opportunistic Routing Protocol in Delay Tolerant networks

A Community-Based Opportunistic Routing Protocol in Delay To...

引用

International Conference on Computer and Communications (ICCC)

作者： Sun Haoran Wu Muqing Cao Yanan Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Post and Telecommunications Beijing China

ISBN: (纸本)9781538683408

In Delay Tolerant networks (DTN), the nodes are sparse and intermittently connected, the end-to-end connectivity between nodes is rare. To overcome the intermittent connectivity, DTN routing protocols employ the “store-carry-forward” strategy to transmit messages. A message is delivered to a destination node from a source node via opportunistic contacts between intermediate nodes. In addition, nodes in DTN have a feature of community. In a community, network node meet each other regularly, while between communities there are only few encounter opportunities. In this paper, we propose a community-based opportunistic routing protocol which works in two modes, the Intra-community mode and the inter-community mode. In Intra-community message transmission, we adopt reasonable forwarding conditions and E-PRoPHET algorithm to design the transmission mechanism. In inter-community message transmission, we use the communication probability and the remaining energy to select the most suitable forwarding node. All of these are designed to limit the number of copies of messages, so as to ensure the performance of the algorithm. We extensively simulated our proposal and have shown that our proposed protocol can raise the delivery ratio, reduce the delivery delay and improve the efficiency of forwarding messages.

关键词： Routing protocols Delays Relays Probability Mathematical model Routing

来源：评论

学校读者我要写书评

暂无评论

Optimized Trajectory Design in UAV Based Cellular networks: A Double Q-Learning Approach

Optimized Trajectory Design in UAV Based Cellular Networks: ...

引用

International Conference on Communication systems

作者： Xuanlin Liu Mingzhe Chen Changchuan Yin Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781538678657;9781538678640

In this paper, the problem of trajectory design of unmanned aerial vehicles (UAVs) for maximizing the number of satisfied users is studied in a UAV based cellular network. In this network, the UAV works as a flying base station that serves users, and the user indicates its satisfaction in terms of completion of its data request within an allowable maximum waiting time. The trajectory design is formulated as an optimization problem whose goal is to maximize the number of satisfied users. To solve this problem, a machine learning framework based on double Q-learning algorithm is proposed. The algorithm enables the UAV to find the optimal trajectory that maximizes the number of satisfied users. Compared to the traditional learning algorithms, such as Q-learning that selects and evaluates the action using the same Q-table, the proposed algorithm can decouple the selection from the evaluation, therefore avoid overestimation which leads to sub-optimal policies. Simulation results show that the proposed algorithm can achieve up to 19.4% and 6.7% gains in terms of the number of satisfied users compared to random algorithm and Q-learning algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Data Correlation-Aware Resource Management in Wireless Virtual Reality (VR): An Echo State Transfer Learning Approach

arXiv

引用

arXiv 2019年

作者： Chen, Mingzhe Saad, Walid Yin, Changchuan Debbah, Mérouane Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China Wireless@VT Bradley Department of Electrical and Computer Engineering Virginia Tech BlacksburgVA United States Mathematical and Algorithmic Sciences Lab Huawei France R and D Paris

Providing seamless connectivity for wireless virtual reality (VR) users has emerged as a key challenge for future cloud-enabled cellular networks. In this paper, the problem of wireless VR resource management is investigated for a wireless VR network in which VR contents are sent by a cloud to cellular small base stations (SBSs). The SBSs will collect tracking data from the VR users, over the uplink, in order to generate the VR content and transmit it to the end-users using downlink cellular links. For this model, the data requested or transmitted by the users can exhibit correlation, since the VR users may engage in the same immersive virtual environment with different locations and orientations. As such, the proposed resource management framework can factor in such spatial data correlation, so as to better manage uplink and downlink traffic. This potential spatial data correlation can be factored into the resource allocation problem to reduce the traffic load in both uplink and downlink. In the downlink, the cloud can transmit 360 contents or specific visible contents (e.g., user field of view) that are extracted from the original 360 contents to the users according to the users' data correlation so as to reduce the backhaul traffic load. In the uplink, each SBS can associate with the users that have similar tracking information so as to reduce the tracking data size. This data correlation-Aware resource management problem is formulated as an optimization problem whose goal is to maximize the users' successful transmission probability, defined as the probability that the content transmission delay of each user satisfies an instantaneous VR delay target. To solve this problem, a machine learning algorithm that uses echo state networks (ESNs) with transfer learning is introduced. By smartly transferring information on the SBS's utility, the proposed transfer-based ESN algorithm can quickly cope with changes in the wireless networking environment due to users' conten

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Adaptive resource allocation scheme for wireless cellular networks 2

Adaptive resource allocation scheme for wireless cellular ne...

引用

2nd IEEE International Conference on Energy Internet, ICEI 2018

作者： Wang, Yue Miao, Jiansong Liang, Xinyu Wang, Jianmin Yue Wang Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China Beijing Laboratory of Advanced Information Networks Beijing University of Posts and Telecommunications Beijing China Beijing University of Posts and Telecommunications Beijing China 6th Research Institute of China Electronics Corporation Beijing China

ISBN: (纸本)9781538641316

As spectrum scarcity and inter cell interference (ICI) are both limiting factors in wireless cellular system, ICI coordination (ICIC) techniques play an important role in improving system performance. Soft Frequency Reuse (SFR) is an effective way to manage the spectrum and reduce ICI in cellular system. It carries out resource allocation prior to system deployment, and dynamic schemes allocate resource regardless of the actual network traffic and interference distribution, both of which limit the potential system performance. Energy Internet's deployment is becoming more and more intensive. It is important to increase system throughput and reduce data error rate. In this paper, an adaptive resource allocation scheme (ARAS) is proposed which first dynamically optimizes resource allocation according to interference distribution and traffic load. In ARAS, the interference thresholds and the roles of victim and aggressor require to be specific. For each victim user, their dominant interferer (DI) applies the Different Evolution (DE) to find the optimal transmission power reduction, aiming at improving victim users' performance and guaranteeing data requirement. To improve system performance, extra resources are allocated to balance ICIC and system capacity. Simulation results show that the ARAS achieves better SINR and throughput compared with existing ICIC schemes. © 2018 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Uplink Resource Allocation in Cellular networks with Energy-constrained UAV Relay

Uplink Resource Allocation in Cellular Networks with Energy-...

引用

IEEE Vehicular Technology Conference

作者： Sixing Yin Zhaowei Qu Lihua Li Beijing Key Laboratory of Network System Architecture and Convergence Beijing China Beijing University of Posts and Telecommunications Beijing China

In this paper, we focus on a cellular network with a energy-constrained unmanned aerial vehicle (UAV), which serves as a relay for all the users to improve their uplink rates via cooperative communication. Uplink resource allocation in terms of power and time allocation among users is investigated to optimize the uplink sum-rate. By leveraging the local search strategy, the sum-rate optimization problem is decomposed into two subproblems, i.e., energy allocation and time allocation. We derived the optimal solution for both amplify-and-forward (AF) and decode-and-forward (DF) protocols with in-depth analysis. Numerical results show that path loss exponent has non-trivial impact on the sum-rate while higher energy replenishment rate of the UAV relay brings little performance gain. In addition, location of the UAV is also non-negligible and the cellular network can significantly benefit from proper deployment of the UAV relay.

关键词： Resource management Cellular networks Relays Protocols Uplink Unmanned aerial vehicles Linear programming

来源：评论

学校读者我要写书评

暂无评论

Power Control and Trajectory Design for UAV-assisted Communications

Power Control and Trajectory Design for UAV-assisted Communi...

引用

IEEE Vehicular Technology Conference

作者： Sixing Yin Jing Tan Lihua Li Zhaowei Qu Beijing Key Laboratory of Network System Architecture and Convergence Beijing China Beijing University of Posts and Telecommunications Beijing Beijing CN

In this paper, we consider a multiuser downlink communication system, where ground users are served by a UAV base station flying on an aerial plane. For the sake of computational complexity and energy economy, we propose a polygonal-line trajectory for the UAV base station and each ground user is served one by one while the UAV base station is travelling along one of the line segments on the trajectory. With the polygonal-line trajectory, joint optimization for power control and trajectory design for the UAV base station is investigated to maximize total capacity of all the ground users. Such a problem is decomposed into three subproblems for single-user downlink power profile, transmission energy allocation and waypoints location selection, respectively, and solved via alternate optimization, with which one of the three subproblems is solved given solutions to the other two. Simulation results show that the proposed scheme with optimized power profile and trajectory for the UAV base station outperforms two baselines. We also show that trajectory design significantly impact the system performance and is indispensable in UAV-assisted communications.

关键词： Base stations Trajectory Downlink Resource management Unmanned aerial vehicles Optimization

来源：评论

学校读者我要写书评

暂无评论

Orthogonal Polarizations Based Channel Estimation for Dual-polarized Massive MIMO Under Pilot Contamination

Orthogonal Polarizations Based Channel Estimation for Dual-p...

引用

IEEE International Conference on Communications in China Workshops (ICCC)

作者： Li Han Fangfang Liu Chunyan Feng Shulun Zhao Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781538670125;9781538670118

Pilot contamination limits the accuracy of channel state information (CSI). In this paper, we propose an orthogonal polarizations based channel estimation algorithm in multi-cell multi-user dual-polarized massive multiple-input multiple-output (MIMO) system. The algorithm exploits orthogonal polarizations effectively reduce the mean square error (MSE) under pilot contamination. Meanwhile, for the high complexity of the minimum mean square error (MMSE) channel estimation, the algorithm uses unbiased estimation for the combination term of interference caused by pilot contamination and the noise. Then we deduce and evaluate the approximate MSE analytical expression of the proposed channel estimation. Finally, the simulation results show that the proposed algorithm is simpler than the MMSE estimation, and more practical than least squares (LS) channel estimation.

关键词： Channel estimation Contamination Antennas Estimation MIMO communication Covariance matrices Partial transmit sequences

来源：评论

学校读者我要写书评

暂无评论

Fast Software-based Table-less Algorithm for CRC Generation

Fast Software-based Table-less Algorithm for CRC Generation

引用

International Symposium on Wireless Personal Multimedia Communications (WPMC)

作者： Mucong Chi Dazhong He Jun Liu Beijing Laboratory of Advanced Information Networks and Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781538657584;9781538657577

This paper proposes a software-based CRC algorithm, which can be applied to CRCs with check values of different lengths. The proposed algorithm can be implemented by shift and XOR operations, and no look-up tables are needed. Therefore, it is suitable for processors with limited memory resources. Compared with table-based CRC algorithms, the proposed algorithm takes more instructions; however, the memory accesses are reduced significantly. As a result, for CRCs with specific generator polynomials, the implementation of the proposed algorithm achieves a high throughput. In the best cases, the proposed algorithm is 29% faster than the Sarwate algorithm for 16-bit CRC generation, and 45% faster than the Slicing-by-4 algorithm for 32-bit CRC generation. Furthermore, for 64-bit CRC generation, the proposed algorithm quadruples the throughput of the Slicing-by-4 algorithm at best.

关键词： Generators Throughput Wireless communication Program processors Software algorithms Multimedia communication Table lookup

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：