Difference between revisions of "Resource:Seminar"

From MobiNetS
Jump to: navigation, search
(7 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{SemNote
{{SemNote
|time='''Thursday 9:00-10:30'''
|time='''Friday 10:30-12:00'''
|addr=4th Research Building A518
|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]].
Line 7: Line 7:
===Latest===
===Latest===
{{Latest_seminar
{{Latest_seminar
|abstract=LoRa and its enabled LoRa wide-area network (LoRaWAN) have been seen as an important part of the next-generation network for massive Internet-of-Things (IoT). Due to LoRa's low-power and long-range nature, LoRa signals are much weaker than the noise floor, particularly in complex urban or semi-indoor environments. Therefore, weak signal decoding is critical to achieve the desired wide-area coverage in general. Existing work has shown the advantages of exploring deep neural networks (DNN) for weak signal decoding. However, the existing single-gateway based DNN decoder is hard to fully leverage the spatial information in multi-gateway scenarios. In this paper, we propose SRLoRa, an efficient DNN LoRa decoder that fully utilizes the spatial information from multiple gateways to decode extremely weak LoRa signals. Specifically, we design interleaving denoising and merging layers to improve signal quality at ultra-low SNR. We develop efficient merging on feature maps extracted by denoising DNNs to tolerate time misalignments among different signals. We define max and min operations in the merging layer to efficiently extract salient features and reduce noise, merging the features extracted from multiple gateways to guide future DNN layers to gradually improve signal quality. We implement SRLoRa with USPR N210 and commercial LoRa nodes and evaluate its performance indoors and outdoors. The results show that with four gateways, SRLoRa achieves SNR gain at 4.53--4.82 dB, which is 2.51× of Charm, leading to a 1.84× coverage area compared to standard LoRa in an urban deployment.
|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=MobiHoc '23
|confname=SIGCOMM 2020
|link=https://dl.acm.org/doi/10.1145/3565287.3610254
|link=https://dl.acm.org/doi/10.1145/3387514.3405853
|title=SRLoRa: Neural-enhanced LoRa Weak Signal Decoding with Multi-gateway Super Resolution
|title=Concurrent Entanglement Routing for Quantum Networks: Model and Designs
|speaker=Pengfei
|speaker=Yaliang
|date=2024-01-18}}
|date=2024-04-28}}
{{Latest_seminar
|abstract=Various interconnected Internet of Things (IoT) devices have emerged, led by the intelligence of the IoT, to realize exceptional interaction with the physical world. In this context, UAV swarm-enabled Multiple Targets Tracking (UAV-MTT), which can sense and track mobile targets for many applications such as hit-and-run, is an appealing topic. Unfortunately, UAVs cannot implement real-time MTT based on the traditional centralized pattern due to the complicated road network environment. It is also challenging to realize low-overhead UAV swarm cooperation in a distributed architecture for the real-time MTT. To address the problem, we propose a cyber-twin-based distributed tracking algorithm to update and optimize a trained digital model for real-time MTT. We then design a distributed cooperative tracking framework to promote MTT performance. In the design, both short-distance and long-distance distributed tracking cooperation manners are first realized with low energy consumption in communication by integrating resources of sensing and communication. Resource integration promotes target sensing efficiency with a highly successful tracking ratio as well. Theoretical derivation proves our algorithmic convergence. Hardware-in-the-loop simulation results demonstrate that our proposed algorithm can remarkably save 65.7% energy consumption in communication compared to other benchmarks while efficiently promoting 20.0% sensing performance.
|confname=TMC '23
|link=https://ieeexplore.ieee.org/document/9839387
|title=Integrated Sensing and Communication in UAV Swarms for Cooperative Multiple Targets Tracking
|speaker=Kun Wang
|date=2024-01-18}}
{{Latest_seminar
|abstract=This paper tries to answer a question: "Can we achieve spatial-selective transmission on IoT devices?" A positive answer would enable more secure data transmission among IoT devices. The challenge, however, is how to manipulate signal propagation without relying on beamforming antenna arrays which are usually unavailable on low-end IoT devices. We give an affirmative answer by introducing SpotSound, a novel acoustic communication system that exploits the diversity of multi-path indoors as a natural beamformer. By judiciously controlling the way how the information is embedded into the signal, SpotSound can make the signal decodable only when this signal propagates along a certain multipath channel. Since the multipath channel decorrelates rapidly over the distance between different receivers, Spot-Sound can ensure the signal is decodable only at the target position, achieving precise physical isolation. SpotSound is a purely software-based solution that can run on most IoT devices where speakers and microphones are widely used. We implement SpotSound on Raspberry Pi connected with COTS microphone and speaker. Experimental results show that SpotSound achieves a 0.25m2 location isolation.
|confname=MobiCom '23
|link=https://dl.acm.org/doi/10.1145/3570361.3592496
|title=Towards Spatial Selection Transmission for Low-end IoT devices with SpotSound
|speaker=Jiajun
|date=2024-01-18}}
{{Latest_seminar
|abstract=Video analytics pipelines have steadily shifted to edge deployments to reduce bandwidth overheads and privacy violations, but in doing so, face an ever-growing resource tension. Most notably, edge-box GPUs lack the memory needed to concurrently house the growing number of (increasingly complex) models for real-time inference. Unfortunately, existing solutions that rely on time/space sharing of GPU resources are insufficient as the required swapping delays result in unacceptable frame drops and accuracy loss. We present model merging, a new memory management technique that exploits architectural similarities between edge vision models by judiciously sharing their layers (including weights) to reduce workload memory costs and swapping delays. Our system, Gemel, efficiently integrates merging into existing pipelines by (1) leveraging several guiding observations about per-model memory usage and inter-layer dependencies to quickly identify fruitful and accuracy-preserving merging configurations, and (2) altering edge inference schedules to maximize merging benefits. Experiments across diverse workloads reveal that Gemel reduces memory usage by up to 60.7%, and improves overall accuracy by 8-39% relative to time or space sharing alone.
|confname=NSDI '23
|link=https://www.usenix.org/conference/nsdi23/presentation/padmanabhan
|title=Gemel: Model Merging for Memory-Efficient, Real-Time Video Analytics at the Edge
|speaker=Mengqi
|date=2024-01-18}}
{{Resource:Previous_Seminars}}
{{Resource:Previous_Seminars}}

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=
}}