An official website of the United States government
Mobile-application fingerprinting of network traffic is valuable for many security solutions as it provides insights into the apps active on a network. Unfortunately, existing techniques require prior knowledge of apps to be able to recognize them. However, mobile environments are constantly evolving, i.e., apps are regularly installed, updated, and uninstalled. Therefore, it is infeasible for existing fingerprinting approaches to cover all apps that may appear on a network. Moreover, most mobile traffic is encrypted, shows similarities with other apps, e.g., due to common libraries or the use of content delivery networks, and depends on user input, further complicating the fingerprinting process. As a solution, we propose FlowPrint, a semi-supervised approach for fingerprinting mobile apps from (encrypted) network traffic. We automatically find temporal correlations among destination-related features of network traffic and use these correlations to generate app fingerprints. Our approach is able to fingerprint previously unseen apps, something that existing techniques fail to achieve. We evaluate our approach for both Android and iOS in the setting of app recognition, where we achieve an accuracy of 89.2%, significantly outperforming state-of-the-art solutions. In addition, we show that our approach can detect previously unseen apps with a precision of 93.5%, detecting 72.3% of apps within the first five minutes of communication.
more »
« less
LaCAVR: Load and Constraints Aware Vehicle Rerouting
We present a prototype system for effective management of a delivery fleet in the settings in which the traffic abnormalities may necessitate rerouting of (some of) the trucks. Unforeseen congestions (e.g., due to accidents) may affect the average speed along road segments that were used to calculate the routes of a particular truck. Complementary to the traditional (re)routing approaches where the main objective is to find the new shortest route to the same destination but under the changed traffic circumstances, we incorporate two additional constraints. Namely, we aim at striking a balance between minimizing the additional expenses due to drivers overtime pay and maximizing the delivery of the goods still available on the truck’s load, possibly by changing the original destinations. The project is developed with an actual industry partner with main business of managing supplies for office pantries, kitchens and caf´es.
more »
« less
- PAR ID:
- 10122598
- Date Published:
- Journal Name:
- 20th {IEEE} International Conference on Mobile Data Management, {MDM} 2019, Hong Kong, SAR, China, June 10-13, 2019
- Page Range / eLocation ID:
- 359 to 360
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each link are delivered within their deadlines, which is referred to as delivery ratio. This problem has been studied before under restrictive frame-based traffic models, or greedy maximal scheduling schemes like LDF (Largest-Deficit First) that can lead to poor delivery ratio for general traffic patterns. In this paper, we pursue a different approach through randomization over the choice of maximal links that can transmit at each time. We design randomized policies in collocated networks, multipartite networks, and general networks, that can achieve delivery ratios much higher than what is achievable by LDF. Further, our results apply to traffic (arrival and deadline) processes that evolve as positive recurrent Markov chains. Hence, this work is an improvement with respect to both efficiency and traffic assumptions compared to the past work. We further present extensive simulation results over various traffic patterns and interference graphs to illustrate the gains of our randomized policies over LDF variants.more » « less
-
Ride-sourcing services play an increasingly important role in meeting mobility needs in many metropolitan areas. Yet, aside from delivering passengers from their origins to destinations, ride-sourcing vehicles generate a significant number of vacant trips from the end of one customer delivery trip to the start of the next. These vacant trips create additional traffic demand and may worsen traffic conditions in urban networks. Capturing the congestion effect of these vacant trips poses a great challenge to the modeling practice of transportation planning agencies. With ride-sourcing services, vehicular trips are the outcome of the interactions between service providers and passengers, a missing ingredient in the current traffic assignment methodology. In this paper, we enhance the methodology by explicitly modeling those vacant trips, which include cruising for customers and deadheading for picking up them. Because of the similarity between taxi and ride-sourcing services, we first extend previous taxi network models to construct a base model, which assumes intranode matching between customers and idle ride-sourcing vehicles and thus, only considers cruising vacant trips. Considering spatial matching among multiple zones commonly practiced by ride-sourcing platforms, we further enhance the base model by encapsulating internode matching and considering both the cruising and deadheading vacant trips. A large set of empirical data from Didi Chuxing is applied to validate the proposed enhancement for internode matching. The extended model describes the equilibrium state that results from the interactions between background regular traffic and occupied, idle, and deadheading ride-sourcing vehicles. A solution algorithm is further proposed to solve the enhanced model effectively. Numerical examples are presented to demonstrate the model and solution algorithm. Although this study focuses on ride-sourcing services, the proposed modeling framework can be adapted to model other types of shared use mobility services.more » « less
-
Electric vertical takeoff and landing aircraft (eVTOLs) are gaining growing interest recently. However, limited attention has been paid to the prospect of using eVTOLs for package delivery. To fill this void, this paper explores the attractiveness of eVTOL-based package delivery in terms of cost, energy consumption, and CO2 emissions. Given that eVTOLs cannot take off/land at customer doorsteps, a two-leg system design is proposed and formulated as an optimization model. To implement the model, we consider multiple plausible eVTOL and ground vehicle types, their cost economics, and energy use and CO2 emission characteristics. Applying the model in the Chicago metro region, we find that the attractiveness of eVTOL-based package delivery depends critically on the eVTOL and ground vehicle types. With an appropriate eVTOL-ground vehicle combination, eVTOL-based delivery can be attractive compared to van-only delivery in terms of total shipping cost, but not necessarily so from the energy and mission perspectives. This highlights the need for future R&D to further enhance the energy efficiency of eVTOLs. When designing eVTOL-based package delivery systems, the importance to account for the potential interactions between eVTOL traffic and commercial air traffic should also be recognized.more » « less
-
As Autonomous Vehicles (AVs) become possible for E-hailing services operate, especially when telecom companies start deploying next-generation wireless networks (known as 5G), many new technologies may be applied in these vehicles. Dynamic-route-switching is one of these technologies, which could help vehicles find the best possible route based on real-time traffic information. However, allowing all AVs to choose their own optimal routes is not the best solution for a complex city network, since each vehicle ignores its negative effect on the road system due to the additional congestion it creates. As a result, with this system, some of the links may become over-congested, causing the whole road network system performance to degrade. Meanwhile, the travel time reliability, especially during the peak hours, is an essential factor to improve the customers' ride experience. Unfortunately, these two issues have received relatively less attention. In this paper, we design a link-based dynamic pricing model to improve the road network system and travel time reliability at the same time. In this approach, we assume that all links are eligible with the dynamic pricing, and AVs will be perfect informed with update traffic condition and follow the dynamic road pricing. A heuristic approach is developed to address this computationally difficult problem. The output includes link-based surcharge, new travel demand and traffic condition which would improve the system performance close to the System Optimal (SO) solution and maintain the travel time reliability. Finally, we evaluate the effectiveness and efficiency of the proposed model to the well-known test Sioux Falls network.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/MDM.2019.00-32
