Difference between revisions of "Resource:Seminar"

From MobiNetS
Jump to: navigation, search
(wenliang updates seminars)
 
(157 intermediate revisions by 5 users not shown)
Line 1: Line 1:
{{SemNote
{{SemNote
|time=2021-11-19 8:40
|time='''Friday 10:30-12:00'''
|addr=Main Building B1-612
|addr=4th Research Building A518
|note=Useful links: [[Resource:Reading_List|Readling list]]; [[Resource:Seminar_schedules|Schedules]]; [[Resource:Previous_Seminars|Previous seminars]].
|note=Useful links: [[Resource:Reading_List|Readling list]]; [[Resource:Seminar_schedules|Schedules]]; [[Resource:Previous_Seminars|Previous seminars]].
}}
}}


===Latest===
===Latest===
{{Latest_seminar
|abstract = The network control plays a vital role in the mega satellite constellation (MSC) to coordinate massive network nodes to ensure the effectiveness and reliability of operations and services for future space wireless communications networks. One of the critical issues in satellite network control is how to design an optimal network control structure (ONCS) by configuring the least number of controllers to achieve efficient control interaction within a limited number of hops. Considering the wide coverage, rising capacity, and no geographical constraints of space platforms, this paper contributes to designing the ONCS by constructing an optimal space control network (SCN) to improve the temporal effectiveness of network control. Specifically, we formulate the optimal SCN construction problem from the perspective of satellite coverage factors, and apply geometric topology analysis to derive both the conditions for constructing the optimal SCN and the formulaic conclusions for SCN and MSC configurations (i.e., scale and structure). From numerical results, we investigate the tradeoff between network scale, the number of controllers, and control delays in several satellite network control scenarios, to provide guidelines for the MSC control. We also design the optimal SCN for an existing MSC system to demonstrate the effectiveness of the proposed ONCS.
|confname= TWC 2021
|link=https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9505263
|title=Mega Satellite Constellation System Optimization: From Network Control Structure Perspective
|speaker=Shiqi
}}
{{Latest_seminar
{{Latest_seminar
|abstract = Massive machine-type communications (mMTC) is one of the main services delivered by the fifth Generation (5G) mobile network. The traditional cellular architecture where all devices connect to the base station is not energy efficient. For this reason, the use of device-to-device (D2D) communications is considered to reduce the energy consumption of mMTC devices. The main idea is to use nearby user equipment (UE) as a relay and establish with it D2D communication. However, the relay selection process also consumes energy, and this consumption can be significant compared to the energy consumed during the data transmission phase. In this paper, we propose a distributed energy-efficient D2D relaying mechanism for mMTC applications. This mechanism favors the selection of the UEs with low path loss with the mMTC device. Through mathematical analysis and simulations, we show that our mechanism allows a reduction of the total energy consumption of mMTC devices (up to 75% compared to direct transmission) when they have an unfavorable link budget. Moreover, our mechanism achieves almost constant energy consumption for a large range of UE densities and distances between the mMTC device and the base station.
|abstract=Quantum entanglement enables important computing applications such as quantum key distribution. Based on quantum entanglement, quantum networks are built to provide long-distance secret sharing between two remote communication parties. Establishing a multi-hop quantum entanglement exhibits a high failure rate, and existing quantum networks rely on trusted repeater nodes to transmit quantum bits. However, when the scale of a quantum network increases, it requires end-to-end multi-hop quantum entanglements in order to deliver secret bits without letting the repeaters know the secret bits. This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements via untrusted repeaters for concurrent source-destination pairs through multiple hops. Different from existing work that analyzes the traditional routing techniques on special network topologies, we present a comprehensive entanglement routing model that reflects the differences between quantum networks and classical networks as well as a new entanglement routing algorithm that utilizes the unique properties of quantum networks. Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods. The model and simulator developed by this work may encourage more network researchers to study the entanglement routing problem.
|confname= TWC 2021
|confname=SIGCOMM 2020
|link= https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9357996
|link=https://dl.acm.org/doi/10.1145/3387514.3405853
|title=Distance-Aware Relay Selection in an Energy-Efficient Discovery Protocol for 5G D2D Communication
|title=Concurrent Entanglement Routing for Quantum Networks: Model and Designs
|speaker=Luwei
|speaker=Yaliang
}}
|date=2024-04-28}}
{{Latest_seminar
|abstract = The revolution of online shopping in recent years demands corresponding evolution in delivery services in urban areas. To cater to this trend, delivery by the crowd has become an alternative to the traditional delivery services thanks to the advances in ubiquitous computing. Notably, some studies use public transportation for crowdsourcing delivery, given its low-cost delivery network with millions of passengers as potential couriers. However, multiple practical impact factors are not considered in existing public-transport-based crowdsourcing delivery studies due to a lack of data and limited ubiquitous computing infrastructures in the past. In this work, we design a crowdsourcing delivery system based on public transport, considering the practical factors of time constraints, multi-hop delivery, and profits. To incorporate the impact factors, we build a reinforcement learning model to learn the optimal order dispatching strategies from massive passenger data and package data. The order dispatching problem is formulated as a sequential decision making problem for the packages routing, i.e., select the next station for the package. A delivery time estimation module is designed to accelerate the training process and provide statistical delivery time guarantee. Three months of real-world public transportation data and one month of package delivery data from an on-demand delivery platform in Shenzhen are used in the evaluation. Compared with existing crowdsourcing delivery algorithms and widely used baselines, we achieve a 40% increase in profit rates and a 29% increase in delivery rates. Comparison with other reinforcement learning algorithms shows that we can improve the profit rate and the delivery rate by 9% and 8% by using time estimation in action filtering. We share the data used in the project to the community for other researchers to validate our results and conduct further research.1 [1].
|confname= IMWUT 2021
|link= https://dl.acm.org/doi/pdf/10.1145/3478117
|title=A City-Wide Crowdsourcing Delivery System with Reinforcement Learning
|speaker=Wenjie
}}
 
=== History ===
{{Resource:Previous_Seminars}}
{{Resource:Previous_Seminars}}

Latest revision as of 10:45, 28 April 2024

Time: Friday 10:30-12:00
Address: 4th Research Building A518
Useful links: Readling list; Schedules; Previous seminars.

Latest

  1. [SIGCOMM 2020] Concurrent Entanglement Routing for Quantum Networks: Model and Designs, Yaliang
    Abstract: Quantum entanglement enables important computing applications such as quantum key distribution. Based on quantum entanglement, quantum networks are built to provide long-distance secret sharing between two remote communication parties. Establishing a multi-hop quantum entanglement exhibits a high failure rate, and existing quantum networks rely on trusted repeater nodes to transmit quantum bits. However, when the scale of a quantum network increases, it requires end-to-end multi-hop quantum entanglements in order to deliver secret bits without letting the repeaters know the secret bits. This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements via untrusted repeaters for concurrent source-destination pairs through multiple hops. Different from existing work that analyzes the traditional routing techniques on special network topologies, we present a comprehensive entanglement routing model that reflects the differences between quantum networks and classical networks as well as a new entanglement routing algorithm that utilizes the unique properties of quantum networks. Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods. The model and simulator developed by this work may encourage more network researchers to study the entanglement routing problem.

History

2024

2023

2022

2021

2020

  • [Topic] [ The path planning algorithm for multiple mobile edge servers in EdgeGO], Rong Cong, 2020-11-18

2019

2018

2017

Template loop detected: Resource:Previous Seminars

Instructions

请使用Latest_seminar和Hist_seminar模板更新本页信息.

    • 修改时间和地点信息
    • 将当前latest seminar部分的code复制到这个页面中
    • 将{{Latest_seminar... 修改为 {{Hist_seminar...，并增加对应的日期信息|date=
    • 填入latest seminar各字段信息
    • link请务必不要留空，如果没有link则填本页地址 https://mobinets.org/index.php?title=Resource:Seminar
  • 格式说明
    • Latest_seminar:

{{Latest_seminar
|confname=
|link=
|title=
|speaker=
}}

    • Hist_seminar

{{Hist_seminar
|confname=
|link=
|title=
|speaker=
|date=
}}

Retrieved from "http://mobinets.cn/site/index.php?title=Resource:Seminar&oldid=2801"