Difference between revisions of "Resource:Seminar"

From MobiNetS
Jump to: navigation, search
(wenliang updates seminar)
(wenliang updates seminars)
Line 1: Line 1:
{{SemNote
{{SemNote
|time=2021-10-15 8:40
|time=2021-10-22 8:40
|addr=Main Building B1-612
|addr=Main Building B1-612
|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=Low Power Wide Area Networks (LPWAN) such as Long Range (LoRa) show great potential in emerging aquatic IoT applications. However, our deployment experience shows that the floating LPWAN suffer significant performance degradation, compared to the static terrestrial deployments. Our measurement results reveal the reason behind this is due to the polarization and directivity of the antenna. The dynamic attitude of a floating node incurs varying signal strength losses, which is ignored by the attitude-oblivious link model adopted in most of the existing methods. When accessing the channel at a misaligned attitude, packet errors can happen. In this paper, we propose an attitude-aware link model that explicitly quantifies the impact of node attitude on link quality. Based on the new model, we propose PolarTracker, a novel channel access method for floating LPWAN. PolarTracker tracks the node attitude alignment state and schedules the transmissions into the aligned periods with better link quality. We implement a prototype of PolarTracker on commercial LoRa platforms and extensively evaluate its performance in various real-world environments. The experimental results show that PolarTracker can efficiently improve the packet reception ratio by 48.8%, compared with ALOHA in LoRaWAN.
|abstract=information. In this paper, an enhanced flooding-based routing protocol is designed based on random network coding (RNC) and clustering for swarm UAV networks, enabling the efficient routing process without any routing path discovery or network topology information. RNC can naturally accelerate the routing process, with which in some hops fewer generations need to be transmitted. To address the issue of numerous hops and further expedite routing process, a clustering method is leveraged, where UAV networks are partitioned into multiple clusters and generations are only flooded from representatives of each cluster rather than flooded from each UAV. By this way, the amount of hops can be significantly reduced. The technical details of the introduced routing protocol are designed. Moreover, to capture the dynamic network topology, the Poisson cluster process is employed to model UAV networks. Afterwards, stochastic geometry tools are utilized to derive the distance distribution between two random selected UAVs and analytically evaluate performance. Extensive simulation studies are conducted to prove the validation of performance analysis, demonstrate the effectiveness of our designed routing protocol, and reveal its design insight.
|confname=INFOCOM 2021
|confname=INFOCOM 2021
|link=https://ieeexplore.ieee.org/document/9488714
|link=https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9488721
|title=PolarTracker: Attitude-aware Channel Access for Floating Low Power Wide Area Networks
|title=Enhanced Flooding-Based Routing Protocol for Swarm UAV Networks: Random Network Coding Meets Clustering
|speaker=Wenliang
|speaker=Luwei
}}
}}
{{Latest_seminar
{{Latest_seminar
|abstract=Due to the limited computing capacity in mobile devices, device-to-device (D2D) computation offloading has been proposed as a promising solution to improving the quality of service in the Internet of things (IoT) networks, by allowing mobile devices to exploit spare computing resources in nearby user devices. However, a major challenge to realizing this new paradigm is how to effectively motivate user devices to participate as computation providers (CPs) for computation requesters (CRs), which is further exacerbated by the fact that user incentives are usually coupled with information asymmetry between the network operator and user devices. This has not been sufficiently studied for D2D computation offloading. In this paper, we propose a signaling-based incentive mechanism that leverages contract theory to address information asymmetry for D2D computation offloading. Based on the proposed contract-based incentive mechanism, we also solve the many-to-many CP-CR pairing problem by devising a polynomial-complexity matching scheme. Simulation results show that our proposed algorithm can effectively motivate user devices to participate in D2D computation offloading and select the most appropriate CPs to perform the computation tasks for corresponding CRs.
|abstract=In recent years, device-to-device (D2D) communication has attained significant attention in the research community. The advantages of D2D communication can be fully realized in multi-hop communication scenario. The integration of cellular and multi-hop networks not only provides guaranteed quality of service and reliability as a traditional cellular network, but also has the flexibility and adaptability as a multi-hop network. Routing in such multi-hop cellular D2D networks is a critical issue, since the multi-hop network can perform worse than a traditional cellular network if wrong routing decisions are made. This is because routing in these multi-hop networks needs to take care of the node mobility, dynamic network topology, and network fragmentation, which did not exist in traditional cellular networking. This paper provides a comprehensive survey of routing in multi-hop D2D networks. Some future research directions for the routing in D2D networks are also discussed at the end of this paper.
|confname=IoTJ 2021
|confname=IEEE Communications Surveys & Tutorials 2018
|link=https://ieeexplore.ieee.org/abstract/document/9523573
|link=https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8386758
|title=Signaling-based Incentive Mechanism for D2D Computation Offloading
|title=Routing in Multi-Hop Cellular Device-to-Device(D2D) Networks: A Survey
|speaker=Wenjie
|speaker=Wenjie
}}
}}


{{Latest_seminar
|abstract=Internet path failure recovery relies on routing protocols, such as BGP. However, routing can take minutes to detect failures and reconverge; in some cases, like partial failures or severe performance degradation, it may never intervene. For large scale network outages, such as those caused by route leaks, bypassing the affected party completely may be the only effective solution. This paper presents Connection Path Reselection (CPR), a novel system that operates on edge networks such as Content Delivery Networks and edge peering facilities and augments TCP to deliver transparent, scalable, multipath-aware end-to-end path failure recovery. The key intuition behind it is that edge networks need not rely on BGP to learn of path impairments: they can infer the status of a path by monitoring transport-layer forward progress, and then reroute stalled flows onto healthy paths. Unlike routing protocols such as BGP, CPR operates at the timescale of round-trip times, providing connection recovery in seconds rather than minutes. By delegating routing responsibilities to the edge hosts themselves, CPR achieves per-connection re-routing protection for all destination prefixes without incurring additional costs reconstructing transport protocol state within the network. Unlike previous multipath-aware transport protocols, CPR is unilaterally deployable and has been running in production at a large edge network for over two years.
|confname=NSDI 2021
|link=https://www.usenix.org/system/files/nsdi21-landa.pdf
|title=Staying Alive: Connection Path Reselection at the Edge
|speaker=Zhuoliu
}}
=== History ===
=== History ===
{{Resource:Previous_Seminars}}
{{Resource:Previous_Seminars}}

Revision as of 15:09, 18 October 2021

Time: 2021-10-22 8:40
Address: Main Building B1-612
Useful links: Readling list; Schedules; Previous seminars.

Latest

  1. [INFOCOM 2021] Enhanced Flooding-Based Routing Protocol for Swarm UAV Networks: Random Network Coding Meets Clustering, Luwei
    Abstract: information. In this paper, an enhanced flooding-based routing protocol is designed based on random network coding (RNC) and clustering for swarm UAV networks, enabling the efficient routing process without any routing path discovery or network topology information. RNC can naturally accelerate the routing process, with which in some hops fewer generations need to be transmitted. To address the issue of numerous hops and further expedite routing process, a clustering method is leveraged, where UAV networks are partitioned into multiple clusters and generations are only flooded from representatives of each cluster rather than flooded from each UAV. By this way, the amount of hops can be significantly reduced. The technical details of the introduced routing protocol are designed. Moreover, to capture the dynamic network topology, the Poisson cluster process is employed to model UAV networks. Afterwards, stochastic geometry tools are utilized to derive the distance distribution between two random selected UAVs and analytically evaluate performance. Extensive simulation studies are conducted to prove the validation of performance analysis, demonstrate the effectiveness of our designed routing protocol, and reveal its design insight.
  1. [IEEE Communications Surveys & Tutorials 2018] Routing in Multi-Hop Cellular Device-to-Device(D2D) Networks: A Survey, Wenjie
    Abstract: In recent years, device-to-device (D2D) communication has attained significant attention in the research community. The advantages of D2D communication can be fully realized in multi-hop communication scenario. The integration of cellular and multi-hop networks not only provides guaranteed quality of service and reliability as a traditional cellular network, but also has the flexibility and adaptability as a multi-hop network. Routing in such multi-hop cellular D2D networks is a critical issue, since the multi-hop network can perform worse than a traditional cellular network if wrong routing decisions are made. This is because routing in these multi-hop networks needs to take care of the node mobility, dynamic network topology, and network fragmentation, which did not exist in traditional cellular networking. This paper provides a comprehensive survey of routing in multi-hop D2D networks. Some future research directions for the routing in D2D networks are also discussed at the end of this paper.
  1. [NSDI 2021] Staying Alive: Connection Path Reselection at the Edge, Zhuoliu
    Abstract: Internet path failure recovery relies on routing protocols, such as BGP. However, routing can take minutes to detect failures and reconverge; in some cases, like partial failures or severe performance degradation, it may never intervene. For large scale network outages, such as those caused by route leaks, bypassing the affected party completely may be the only effective solution. This paper presents Connection Path Reselection (CPR), a novel system that operates on edge networks such as Content Delivery Networks and edge peering facilities and augments TCP to deliver transparent, scalable, multipath-aware end-to-end path failure recovery. The key intuition behind it is that edge networks need not rely on BGP to learn of path impairments: they can infer the status of a path by monitoring transport-layer forward progress, and then reroute stalled flows onto healthy paths. Unlike routing protocols such as BGP, CPR operates at the timescale of round-trip times, providing connection recovery in seconds rather than minutes. By delegating routing responsibilities to the edge hosts themselves, CPR achieves per-connection re-routing protection for all destination prefixes without incurring additional costs reconstructing transport protocol state within the network. Unlike previous multipath-aware transport protocols, CPR is unilaterally deployable and has been running in production at a large edge network for over two years.

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

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