Change search
Refine search result
1 - 6 of 6
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Choi, Okyoung
    et al.
    Kim, Seokhyun
    Jeong, Jaeseong
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Lee, Hyang-Won
    Chong, Song
    Delay-Optimal Data Forwarding in Vehicular Sensor Networks2016In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 65, no 8, p. 6389-6402Article in journal (Refereed)
    Abstract [en]

    The vehicular sensor network (VSN) is emerging as a new solution for monitoring urban environments such as intelligent transportation systems and air pollution. One of the crucial factors that determine the service quality of urban monitoring applications is the delivery delay of sensing data packets in the VSN. In this paper, we study the problem of routing data packets with minimum delay in the VSN by exploiting 1) vehicle traffic statistics, 2) anycast routing, and 3) knowledge of future trajectories of vehicles such as busses. We first introduce a novel road network graph model that incorporates the three factors into the routing metric. We then characterize the packet delay on each edge as a function of the vehicle density, speed, and the length of the edge. Based on the network model and delay function, we formulate the packet routing problem as a Markov decision process (MDP) and develop an optimal routing policy by solving the MDP. Evaluations using real vehicle traces in a city show that our routing policy significantly improves the delay performance compared with existing routing protocols. Specifically, optimal VSN data forwarding (OVDF) yields, on average, 96% better delivery ratio and 72% less delivery delay than existing algorithms in some areas distant from destinations.

  • 2.
    Jeong, Jaeseong
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Leconte, M.
    Proutiere, Alexandre
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Cluster-aided mobility predictions2016In: Proceedings - IEEE INFOCOM, IEEE conference proceedings, 2016Conference paper (Refereed)
    Abstract [en]

    Predicting the future location of users in wireless networks has numerous applications, and can help service providers to improve the quality of service perceived by their clients. The location predictors proposed so far estimate the next location of a specific user by inspecting the past individual trajectories of this user. As a consequence, when the training data collected for a given user is limited, the resulting prediction is inaccurate. In this paper, we develop cluster-aided predictors that exploit past trajectories collected from all users to predict the next location of a given user. These predictors rely on clustering techniques and extract from the training data similarities among the mobility patterns of the various users to improve the prediction accuracy. Specifically, we present CAMP (Cluster-Aided Mobility Predictor), a cluster-aided predictor whose design is based on recent non-parametric Bayesian statistical tools. CAMP is robust and adaptive in the sense that it exploits similarities in users' mobility only if such similarities are really present in the training data. We analytically prove the consistency of the predictions provided by CAMP, and investigate its performance using two large-scale datasets. CAMP significantly outperforms existing predictors, and in particular those that only exploit individual past trajectories.

  • 3.
    Jeong, Jaeseong
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Lee, K.
    Abdikamalov, B.
    Chong, S.
    TravelMiner: On the benefit of path-based mobility prediction2016In: 2016 13th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2016, Institute of Electrical and Electronics Engineers (IEEE), 2016, article id 7733023Conference paper (Refereed)
    Abstract [en]

    Mobility predictions are becoming more valuable in various applications with the rise of mobile devices. Given that existing prediction techniques are composed of two key procedures: 1) profiling past mobility trajectories as sequences of discrete atomic states (e.g., grid locations, semantic locations) and capturing them with an appropriate statistical model, 2) making a prediction on the next state using the statistical model, TravelMiner tackles the former with paths utilized as the atomic states for the first time, where the paths are defined as sub-trajectories with no branches. Comparing to available location-based predictors, TravelMiner makes a fundamental difference in that it is able to predict the sequence of paths rather than locations, which is far more detailed in the perspective of knowing the exact route to follow. TravelMiner enables this benefit by extracting disjoint paths from GPS trajectories via a similarity metric for curves, called Frechet distance and keeping the sequences of such paths in a statistical model, called probabilistic radix tree. Our extensive simulations over the GPS trajectories of 124 users reveal that TravelMiner outperforms other predictors in diverse popular performance metrics including predictability, prediction accuracy and prediction resolution.

  • 4.
    Jeong, Jaeseong
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Yi, Yung
    Cho, Jeong-Woo
    KTH, School of Information and Communication Technology (ICT).
    Eun, Do Young
    Chong, Song
    Energy-Efficient Wi-Fi Sensing Policy Under Generalized Mobility Patterns With Aging2016In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 24, no 4, p. 2416-2428Article in journal (Refereed)
    Abstract [en]

    An essential condition precedent to the success of mobile applications based on Wi-Fi (e. g., iCloud) is an energy-efficient Wi-Fi sensing. Clearly, a good Wi-Fi sensing policy should factor in both inter-access point (AP) arrival time (IAT) and contact duration time (CDT) distributions of each individual. However, prior work focuses on limited cases of those two distributions (e. g., exponential) or proposes heuristic approaches such as Additive Increase (AI). In this paper, we first formulate a generalized functional optimization problem on Wi-Fi sensing under general inter-AP and contact duration distributions and investigate how each individual should sense Wi-Fi APs to strike a good balance between energy efficiency and performance, which is in turn intricately linked with users mobility patterns. We then derive a generic optimal condition that sheds insights into the aging property, underpinning energy-aware Wi-Fi sensing polices. In harnessing our analytical findings and the implications thereof, we develop a new sensing algorithm, called Wi-Fi Sensing with AGing (WiSAG), and demonstrate that WiSAG outperforms the existing sensing algorithms up to 37% through extensive trace-driven simulations for which real mobility traces gathered from hundreds of smartphones is used.

  • 5. Kim, Y.
    et al.
    Lee, J.
    Jeong, Jaeseong
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Chong, S.
    Multi-flow rate control in delayed Wi-Fi offloading systems2016In: 2016 International Conference on Information Networking (ICOIN), IEEE Computer Society, 2016, Vol. 2016, p. 274-279Conference paper (Refereed)
    Abstract [en]

    Explosive growth of mobile data traffic becomes an increasingly serious problem in cellular networks. Delayed Wi-Fi offloading is the concept to shift the delay-tolerant mobile traffic from cellular networks to Wi-Fi networks at the cost of additional delay. Existing studies mainly focused on a single-flow management or a multi-flow case without specified deadlines. In this paper, we address a multi-flow offloading problem in which a mobile user has multiple traffic flows whose loads and deadlines are different. More precisely, we formulate a multi-flow rate control based on a discrete and finite-horizon Markov decision problem. We develop a dynamic programming (DP)-based optimal rate control algorithm to maximize user satisfaction defined as offloading efficiency minus disutility due to deadline violations. Moreover, we propose a threshold-based rate control algorithm which requires low-complexity and low-memory but achieves high performance. Trace driven simulations based on measurements show that our proposed algorithms achieve high user satisfaction compared to existing algorithms.

  • 6. Lee, Kyunghan
    et al.
    Jeong, Jaeseong
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Yi, Yung
    Won, Hyungsuk
    Rhee, Injong
    Chong, Song
    Max Contribution: An Online Approximation of Optimal Resource Allocation in Delay Tolerant Networks2015In: IEEE Transactions on Mobile Computing, ISSN 1536-1233, E-ISSN 1558-0660, Vol. 14, no 3, p. 592-605Article in journal (Refereed)
    Abstract [en]

    In this paper, a joint optimization of link scheduling, routing and replication for delay-tolerant networks (DTNs) has been studied. The optimization problems for resource allocation in DTNs are typically solved using dynamic programming which requires knowledge of future events such as meeting schedules and durations. This paper defines a new notion of approximation to the optimality for DTNs, called snapshot approximation where nodes are not clairvoyant, i.e., not looking ahead into future events, and thus decisions are made using only contemporarily available knowledges. Unfortunately, the snapshot approximation still requires solving an NP-hard problem of maximum weighted independent set (MWIS) and a global knowledge of who currently owns a copy and what their delivery probabilities are. This paper proposes an algorithm, Max-Contribution (MC) that approximates MWIS problem with a greedy method and its distributed online approximation algorithm, Distributed Max-Contribution (DMC) that performs scheduling, routing and replication based only on locally and contemporarily available information. Through extensive simulations based on real GPS traces tracking over 4,000 taxies and 500 taxies for about 30 days and 25 days in two different large cities, DMC is verified to perform closely to MC and outperform existing heuristically engineered resource allocation algorithms for DTNs.

1 - 6 of 6
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf