Difference between revisions of "Resource:Seminar"

From MobiNetS
Jump to: navigation, search
(wenliang updates seminars)
Line 7: Line 7:
===Latest===
===Latest===
{{Latest_seminar
{{Latest_seminar
|abstract =Low Power Wide Area Networks (LPWANs) have been shown promising in connecting large-scale low-cost devices with low-power long-distance communication. However, existing LPWANs cannot work well for real deployments due to severe packet collisions. We propose OrthoRa, a new technology which significantly improves the concurrency for low-power long distance LPWAN transmission. The key of OrthoRa is a novel design, Orthogonal Scatter Chirp Spreading Spectrum (OSCSS), which enables orthogonal packet transmissions while providing low SNR communication in LPWANs. Different nodes can send packets encoded with different orthogonal scatter chirps, and the receiver can decode collided packets from different nodes. We theoretically prove that OrthoRa provides very high concurrency for low SNR communication under different scenarios. For real networks, we address practical challenges of multiple-packet detection for collided packets, scatter chirp identification for decoding each packet and accurate packet synchronization with Carrier Frequency Offset. We implement OrthoRa on HackRF One and extensively evaluate its performance. The evaluation results show that OrthoRa improves the network throughput and concurrency by 50⇥ compared with LoRa.
|abstract =Low-power wireless networks have the potential to enable applications that are of great importance to industry and society. However, existing network protocols do not meet the dependability requirements of many scenarios as the failure of a single node or link can completely disrupt communication and take significant time and energy to recover. This paper presents Hydra, a low-power wireless protocol that guarantees robust communication despite arbitrary node and link failures. Unlike most existing deterministic protocols, Hydra steers clear of centralized coordination to avoid a single point of failure. Instead, all nodes are equivalent in terms of protocol logic and configuration, performing coordination tasks such as synchronization and scheduling concurrently. This concept of concurrent coordination relies on a novel distributed consensus algorithm that yields provably unique decisions with low delay and energy overhead. In addition to a theoretical analysis, we evaluate Hydra in a multi-hop network of 23 nodes. Our experiments demonstrate that Hydra withstands random node failures without increasing coordination overhead and that it re-establishes efficient and reliable data exchange within seconds after a major disruption.
|confname=INFOCOM 2023
|confname=IPSN 2023
|link=https://www.jianguoyun.com/p/DaSn-A0Q_LXjBxjS9f8EIAA
|link=https://www.research-collection.ethz.ch/bitstream/handle/20.500.11850/602741/ipsn23-22.pdf?sequence=1&isAllowed=y
|title=Push the Limit of LPWANs with Concurrent Transmissions
|title=Hydra: Concurrent Coordination for Fault-tolerant Networking
|speaker=Wenliang}}
|speaker=Pengfei}}
{{Latest_seminar
{{Latest_seminar
|abstract = Mobile edge computing is a promising computing paradigm enabling mobile devices to offload computation-intensive tasks to nearby edge servers. However, within small-cell networks, the user mobilities can result in uneven spatio-temporal loads, which have not been well studied by considering adaptive load balancing, thus limiting the system performance. Motivated by the data analytics and observations on a real-world user association dataset in a large-scale WiFi system, in this paper, we investigate the mobility-aware online task offloading problem with adaptive load balancing to minimize the total computation costs. However, the problem is intractable directly without prior knowledge of future user mobility behaviors and spatio-temporal computation loads of edge servers. To tackle this challenge, we transform and decompose the original task offloading optimization problem into two sub-problems, i.e., task offloading control ( ToC ) and server grouping ( SeG ). Then, we devise an online control scheme, named MOTO (i.e., M obility-aware O nline T ask O ffloading), which consists of two components, i.e., Long Short Term Memory based algorithm and Dueling Double DQN based algorithm, to efficiently solve the ToC and SeG sub-problems, respectively. Extensive trace-driven experiments are carried out and the results demonstrate the effectiveness of MOTO in reducing computational costs of mobile devices and achieving load balancing when compared to the state-of-the-art benchmarks.
|abstract = We report our experiences of developing, deploying, and evaluating MLoc, a smartphone-based indoor localization system for malls. MLoc uses Bluetooth Low Energy RSSI and geomagnetic field strength as fingerprints. We develop efficient approaches for large-scale, outsourced training data collection. We also design robust online algorithms for localizing and tracking users' positions in complex malls. Since 2018, MLoc has been deployed in 7 cities in China, and used by more than 1 million customers. We conduct extensive evaluations at 35 malls in 7 cities, covering 152K m2 mall areas with a total walking distance of 215 km (1,100 km training data). MLoc yields a median location tracking error of 2.4m. We further characterize the behaviors of MLoc's customers (472K users visiting 12 malls), and demonstrate that MLoc is a promising marketing platform through a promotion event. The e-coupons delivered through MLoc yield an overall conversion rate of 22%. To facilitate future research on mobile sensing and indoor localization, we have released a large dataset (43 GB at the time when this paper was published) that contains IMU, BLE, GMF readings, and the localization ground truth collected by trained testers from 37 shopping malls.
|confname=TMC 2022
|confname=MobiCom 2022
|link=https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9942345
|link=https://dl.acm.org/doi/pdf/10.1145/3495243.3517021
|title=MOTO: Mobility-Aware Online Task Offloading with Adaptive Load Balancing in Small-Cell MEC
|title=Experience: practical indoor localization for malls
|speaker=Xianyang}}
|speaker=Zhuoliu}}
{{Latest_seminar
{{Latest_seminar
|abstract = Edge computing capabilities in 5G wireless networks promise to benefit mobile users: computing tasks can be offloaded from user devices to nearby edge servers, reducing users’ experienced latencies. Few works have addressed how this offloading should handle long-term user mobility: as devices move, they will need to offload to different edge servers, which may require migrating data or state information from one edge server to another. In this paper, we introduce MoDEMS, a system model and architecture that provides a rigorous theoretical framework and studies the challenges of such migrations to minimize the service provider cost and user latency. We show that this cost minimization problem can be expressed as an integer linear programming problem, which is hard to solve due to resource constraints at the servers and unknown user mobility patterns. We show that finding the optimal migration plan is in general NP-hard, and we propose alternative heuristic solution algorithms that perform well in both theory and practice. We finally validate our results with real user mobility traces, ns-3 simulations, and an LTE testbed experiment. Migrations reduce the latency experienced by users of edge applications by 33% compared to previously proposed migration approaches.
|abstract = Low-earth-orbit (LEO) satellite mega-constellations promise broadband, low-latency network infrastructure from space for terrestrial users in remote areas. However, they face new QoS bottlenecks from infrastructure mobility due to the fast-moving LEO satellites and earth’s rotations. Both cause frequent space-ground link churns and challenge the network latency, bandwidth, and availability at the global scale. Today’s LEO networks mask infrastructure mobility with fixed anchors (ground stations) but cause single-point bandwidth/latency bottlenecks. Instead, we design LBP to remove the LEO network’s QoS bottlenecks from infrastructure mobility. LBP removes remote terrestrial fixed anchors via geographic addressing for shorter latencies and more bandwidth. It adopts local, orbit direction-aware geographic routing to avoid global routing updates for high network availability. LBP further shortens the routing paths by refining handover policies by satellites’ orbital directions. Our experiments in controlled testbeds and trace-driven emulations validate LBP’s 1.64× network latency reduction, 9.66× more bandwidth, and improve network availability to 100%.
|confname=INFOCOM 2022
|confname=IWQoS 2022
|link=https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9796680
|link=https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9796680
|title=MoDEMS: Optimizing Edge Computing Migrations For User Mobility
|title=Geographic Low-Earth-Orbit Networking without QoS Bottlenecks from Infrastructure Mobility
|speaker=Zhenguo}}
|speaker=Kun}}




Revision as of 15:38, 19 April 2023

Time: 2023-04-06 9:30
Address: 4th Research Building A527-B
Useful links: Readling list; Schedules; Previous seminars.

Latest

  1. [IPSN 2023] Hydra: Concurrent Coordination for Fault-tolerant Networking, Pengfei
    Abstract: Low-power wireless networks have the potential to enable applications that are of great importance to industry and society. However, existing network protocols do not meet the dependability requirements of many scenarios as the failure of a single node or link can completely disrupt communication and take significant time and energy to recover. This paper presents Hydra, a low-power wireless protocol that guarantees robust communication despite arbitrary node and link failures. Unlike most existing deterministic protocols, Hydra steers clear of centralized coordination to avoid a single point of failure. Instead, all nodes are equivalent in terms of protocol logic and configuration, performing coordination tasks such as synchronization and scheduling concurrently. This concept of concurrent coordination relies on a novel distributed consensus algorithm that yields provably unique decisions with low delay and energy overhead. In addition to a theoretical analysis, we evaluate Hydra in a multi-hop network of 23 nodes. Our experiments demonstrate that Hydra withstands random node failures without increasing coordination overhead and that it re-establishes efficient and reliable data exchange within seconds after a major disruption.
  2. [MobiCom 2022] Experience: practical indoor localization for malls, Zhuoliu
    Abstract: We report our experiences of developing, deploying, and evaluating MLoc, a smartphone-based indoor localization system for malls. MLoc uses Bluetooth Low Energy RSSI and geomagnetic field strength as fingerprints. We develop efficient approaches for large-scale, outsourced training data collection. We also design robust online algorithms for localizing and tracking users' positions in complex malls. Since 2018, MLoc has been deployed in 7 cities in China, and used by more than 1 million customers. We conduct extensive evaluations at 35 malls in 7 cities, covering 152K m2 mall areas with a total walking distance of 215 km (1,100 km training data). MLoc yields a median location tracking error of 2.4m. We further characterize the behaviors of MLoc's customers (472K users visiting 12 malls), and demonstrate that MLoc is a promising marketing platform through a promotion event. The e-coupons delivered through MLoc yield an overall conversion rate of 22%. To facilitate future research on mobile sensing and indoor localization, we have released a large dataset (43 GB at the time when this paper was published) that contains IMU, BLE, GMF readings, and the localization ground truth collected by trained testers from 37 shopping malls.
  3. [IWQoS 2022] Geographic Low-Earth-Orbit Networking without QoS Bottlenecks from Infrastructure Mobility, Kun
    Abstract: Low-earth-orbit (LEO) satellite mega-constellations promise broadband, low-latency network infrastructure from space for terrestrial users in remote areas. However, they face new QoS bottlenecks from infrastructure mobility due to the fast-moving LEO satellites and earth’s rotations. Both cause frequent space-ground link churns and challenge the network latency, bandwidth, and availability at the global scale. Today’s LEO networks mask infrastructure mobility with fixed anchors (ground stations) but cause single-point bandwidth/latency bottlenecks. Instead, we design LBP to remove the LEO network’s QoS bottlenecks from infrastructure mobility. LBP removes remote terrestrial fixed anchors via geographic addressing for shorter latencies and more bandwidth. It adopts local, orbit direction-aware geographic routing to avoid global routing updates for high network availability. LBP further shortens the routing paths by refining handover policies by satellites’ orbital directions. Our experiments in controlled testbeds and trace-driven emulations validate LBP’s 1.64× network latency reduction, 9.66× more bandwidth, and improve network availability to 100%.


History

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=2614"