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

Optimization of charging and data collection in wireless rechargeable sensor networks 1

2nd International Conference on Human Centered Computing, HCC 2016

作者： Hu, Cheng Wang, Yun Key Lab of Computer Network and Information Integration MOE Southeast University Nanjing211189 China

ISBN: (数字)9783319318547

ISBN: (纸本)9783319318530

Wireless Rechargeable Sensor networks (WRSNs) can significantly prolong the lifetime by employing a mobile charger to replenish the depleted energy of the sensor nodes. This paper considers the scenario that the mobile charger cannot maintain full operation of the WRSN. In this case, the first and foremost problem is how to allocate the insufficient energy to the sensor nodes and decide their corresponding data sensing rates. The objective is to maximize the utility of data collection, which concerns data fairness as well as data amount. To address this problem, we first formulate and simplify its optimization form. Then based on two observations, we propose the BalanceFlow scheme, which coordinates data sensing of the sensor nodes with charging of the mobile charger. Numerical results show that, the BalanceFlow scheme achieves near optimal utility compared with the optimization results. © Springer International Publishing Switzerland 2016.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Veca: A High-Performance Consensus Algorithm for State Machine Replication 4th

Veca: A High-Performance Consensus Algorithm for State Machi...

引用

4th International Conference on Human Centered Computing, HCC 2018

作者： Yan, Xiangguang Wang, Yun Southeast University Nanjing China Key Lab of Computer Network and Information Integration MOE Nanjing China

ISBN: (纸本)9783030151263

Consensus algorithm is fundamental for distributed systems. It requires high throughput, low latency and high availab.lity. However, to the best of our knowledge, these requirements cannot be satisfied well at the same time in any existing consensus algorithm. In this paper, we propose Veca, a consensus algorithm for state machine replication that tries to satisfy the requirements at the same time as well as possible. Veca is a leaderless consensus algorithm for which all replicas can commit commands concurrently at any time, and each command can be committed after just one round of communication with a majority of replicas in the normal case. Veca separates agreement from ordering and execution, which allows all replicas to commit commands concurrently without determining their order, but to track their dependencies using vector clocks. Then a subsequent replay phase assigns an order to the commands and executes them in that order. Commands are committed out of order and then be executed in the same order by all replicas. A replica can take the initiative to learn the decision for an instance using a failure recovery protocol. The leaderless design makes the systems built with Veca provide continuous service as long as more than half of the replicas are availab.e. We show that Veca has higher throughput, lower latency and higher availab.lity than several typical consensus algorithms. The correctness of Veca has been proved theoretically and its advantages are demonstrated through an experimental evaluation in LAN and WAN. © 2019, Springer Nature Switzerland AG.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

On accuracy rate of community detection and pairing in mobile social network 19

On accuracy rate of community detection and pairing in mobil...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalab.e Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Tu, Jinbin Li, Qing Wang, Yun Southeast University Key Lab of Computer Network and Information Integration School of Computer Science and Engineering Moe Nanjing China

ISBN: (纸本)9798350346558

Mobile Social network(MSN) is an opportunity network that considers the social attributes of nodes, and also uses the 'store-carry-forward' model to carry out data transfer between nodes. The community nature of nodes is an important reference in MSN to select messaging path. In this paper, a new community cluster problem based on our observed pickup strategies for car-hailing is proposed, which is involving community detection and community pairing. Then we formulate it by using T-Sorokin mobility model. The Cluster-First algorithm and Pair-First algorithm are proposed based on the defined community dependency metric to maximize the accuracy rate. Simulation experimental results show that both CFA and PFA can effectively solve this problem with an accuracy rate of over 70%. And it is concluded that cluster-first is superior to pair-first for this considered problem. © 2022 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

DP-GenFL: a local differentially private federated learning system through generative data

引用

Science China(information Sciences) 2023年第8期66卷 275-276页

作者： Jun LI Kang WEI Chuan MA Feng SHU School of Electronic and Optical Engineering Nanjing University of Science and Technology Zhejiang Lab Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education School of Information and Communication Engineering Hainan University

With the rapid development of the Internet of Things(Io T),the amount of data from intelligent devices is propagating at unprecedented scales. Meanwhile, machine learning(ML),which relies heavily on such data, is revolutionizing many aspects of our lives [1]. However, conventional centralized ML offers little scalab.lity for efficiently processing this huge amount of data.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

T-Sorokin: A General Mobility Model in Opportunistic networks 26

T-Sorokin: A General Mobility Model in Opportunistic Network...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Tu, Jinbin Li, Qing Wang, Yun Southeast University Key Lab of Computer Network and Information Integration Moe School of Computer Science and Engineering Nanjing China

ISBN: (纸本)9798350331684

The opportunistic networks are a kind of ad hoc networks that rely on the chance of nodes meeting to transmit messages. Acting as an effective supplement to 4G and 5G networks in some special scenarios where hardware devices are limited, the opportunistic networks have a significant application in health monitoring, warning broadcasting, disaster relief, and so on. The mobility model is one of the research focuses on the opportunistic networks. On the basis of the social mobility theory proposed by Sorokin, a general mobility model, which is suited for various scenarios, called T-Sorokin is proposed. This model is described as a seven-tuple and implemented on the Opportunistic network Environment simulator and fits both Infocom06 and Rome taxi data set, which includes different areas ranging from hotel to city and different mobile units ranging from person to taxi. The results of experiments demonstrate that the T-Sorokin model has the advantage of generality, simplicity, and accuracy. It can simply establish movement tracks close to real data under different scenarios. © 2023 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of UAV Deployment and Task Computation Offloading Decision in UAV-assisted Edge Computing network 25

Joint Optimization of UAV Deployment and Task Computation Of...

引用

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data Science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Liu, Yichuan Tu, Jinbin Wang, Yun School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration Moe Nanjing China

ISBN: (纸本)9798350330014

The UAVs' deployment decision and task computation offloading decision in the UAV-assisted edge computing network significantly impact the operating efficiency of edge network. On the basis of this, the Optimization Model for UAV Cluster Deployment and Computation Offloading Decision (OMUCDCOD) is established. The model jointly optimizes the number, location of UAV s, and task computation offloading decision. Different from previous studies, this model regards the terminal devices in the edge network as virtual MEC servers, and introduces the collab.rative computing mode. The task computation offloading decision made can effectively utilize the computing capabilities offered by the edge network. Considering that the two problems of UAV deployment decision and task computation offloading decision are intricately interconnected, we propose a two-layer optimization algorithm combining K-Means and ant colony algorithm (ToKmAc) to solve OMUCDCOD. ToKmAc is divided into upper and lower layers to solve this optimization problem. The upper layer uses K-Means to solve the UAV deployment decision, that is, the number and location of UAVS;the lower layer employs ant colony algorithm to solve computation offloading decision. Finally, extensive experiments verify the effectiveness of OMUCDCOD and ToKmAc. © 2023 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

A robust and secure overlay storage scheme based on erasure coding

A robust and secure overlay storage scheme based on erasure ...

引用

5th International Conference on Pervasive Computing and Applications, ICPCA10

作者： Li, Chuanyou Wang, Yun School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration Nanjing 210096 China

ISBN: (纸本)9781424491421

Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection, encoded strips are stored and dual distinct hash functions are deployed to construct hash chains to protect location information for encoded strips. Simulation results show that with different percentage of malicious peers, by adjusting encoding parameters, the scheme is availab.e to provide durable data storage service. ©2010 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

PPO-Based Vehicle Control for Ramp Merging Scheme Assisted by Enhanced C-V2X

arXiv

引用

arXiv 2025年

作者： Wu, Qiong Ji, Maoxin Fan, Pingyi Wang, Kezhi Cheng, Nan Chen, Wen Letaief, Khaled B. The School of Internet of Things Engineering Jiangnan University Wuxi214122 China The Department of Electronic Engineering State Key laboratory of Space Network and Communications Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China The Department of Computer Science Brunel University Middlesex LondonUB8 3PH United Kingdom The State Key Lab. of ISN School of Telecommunications Engineering Xidian University Xi’an710071 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China Hong Kong

On-ramp merging presents a critical challenge in autonomous driving, as vehicles from merging lanes need to dynamically adjust their positions and speeds while monitoring traffic on the main road to prevent collisions. To address this challenge, we propose a novel merging control scheme based on reinforcement learning, which integrates lateral control mechanisms. This approach ensures the smooth integration of vehicles from the merging lane onto the main road, optimizing both fuel efficiency and passenger comfort. Furthermore, we recognize the impact of vehicle-to-vehicle (V2V) communication on control strategies and introduce an enhanced protocol leveraging Cellular Vehicle-to-Everything (C-V2X) Mode 4. This protocol aims to reduce the Age of information (AoI) and improve communication reliability. In our simulations, we employ two AoI-based metrics to rigorously assess the protocol's effectiveness in autonomous driving scenarios. By combining the NS3 network simulator with Python, we simulate V2V communication and vehicle control simultaneously. The results demonstrate that the enhanced C-V2X Mode 4 outperforms the standard version, while the proposed control scheme ensures safe and reliable vehicle operation during on-ramp merging. Copyright © 2025, The Authors. All rights reserved.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

A common gateway for interoperability in multi-architecture LVC simulation 6

A common gateway for interoperability in multi-architecture ...

引用

6th International Conference on computer information Science and Application Technology, CISAT 2023

作者： Lin, Shichao Wang, Yun School of Computer Science and Engineering Southeast University Nanjing China Key Lab of Computer Network and Information Integration MOE China

ISBN: (纸本)9781510668546

With the development of Live-Virtual-Constructive (LVC) simulation technology, numerous LVC simulation resources have been developed. To construct more large-scale LVC simulation, it is necessary to integrate existing simulation resources. Due to the heterogeneity of LVC resources, the interoperability between heterogeneous simulation resources becomes a major concern. This paper proposes a common gateway in multi-architecture LVC simulation environment that converts messages between different simulation architectures and achieves a level of semantic interoperability. The gateway provides a collection of protocol-independent interfaces for simulation systems to access co-simulation conveniently. To maintain timing consistency in heterogeneous simulation environments, a time synchronization method is employed to coordinate logical time and real time. Experimental results show that the scheme is flexible and can maintain data transmission latency at a millisecond level in LVC simulation environment, which includes High Level Architecture (HLA), Data Distribution Service (DDS), and Distributed Interactive Simulation (DIS). © 2023 SPIE.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

KGRN: Knowledge Graph Relational Path network for Target Prediction of TCM Prescriptions 17th

KGRN: Knowledge Graph Relational Path Network for Target Pre...

引用

17th International Conference on Intelligent Computing, ICIC 2021

作者： Gong, Zhuo Zhang, Naixin He, Jieyue School of Computer Science and Engineering Key Lab of Computer Network and Information Integration MOE Southeast University Nanjing210018 China

ISBN: (纸本)9783030845315

Accurately predicting the effect targets of Traditional Chinese Medicine (TCM) prescriptions is essential for exploring the molecular mechanism and clarifying the mechanism of TCM. Although some scholars have used network pharmacology to study the target prediction of TCM prescriptions, all of them are for the analysis of a specific prescription-disease association, and the universal method for predicting effect targets of TCM prescriptions has not discovered yet. Therefore, this paper proposes a Knowledge Graph Relational Path network for Target Prediction of TCM Prescriptions (KGRN), which can integrate prescription’s molecular and target information through the Knowledge Graph (KG). At the same time, the semantic information and high-level structure of the knowledge graph are extracted through Knowledge Graph Embedding and Graph Neural networks, which can effectively capture the correlation between the prescriptions and the targets. Moreover, by emphasizing the KG relations when aggregating neighborhood information, the Relational Path network of the KGRN model has the ability to capture the relationship dependence in the KG path, which enhances the ability to predict the relationship between the prescriptions and the targets. The experiments under multiple configurations demonstrate that KGRN outperforms the related competitive benchmarks. © 2021, Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：