2018
Jang, Si Young; Lee, Yoonhyung; Shin, Byoungheon; Lee, Dongman
Towards application-aware virtualization for edge iot clouds Proceedings Article
In: Proceedings of the 13th International Conference on Future Internet Technologies, pp. 1–4, 2018.
@inproceedings{jang2018towards,
title = {Towards application-aware virtualization for edge iot clouds},
author = {Si Young Jang and Yoonhyung Lee and Byoungheon Shin and Dongman Lee},
url = {https://dl.acm.org/doi/abs/10.1145/3226052.3226059},
doi = {https://doi.org/10.1145/3226052.3226059},
year = {2018},
date = {2018-06-20},
urldate = {2018-01-01},
booktitle = {Proceedings of the 13th International Conference on Future Internet Technologies},
pages = {1–4},
abstract = {We explore issues and challenges for application-aware virtualization in edge Internet-of-Things (IoT) clouds. Since a large number of IoT devices reside in network edges, it is necessary for a current edge computing technology to virtualize them not only as computational resources but also functional resources for achieving the goal of a specific service, which we call application-aware virtualization. This requires translation of abstract application requirements into IoT resource allocation policies using the knowledge of relationships between application layer semantics and underlying device functionalities and status. We implement a prototype for proof-of-concept and show that it is able to dynamically allocate and reallocate IoT resources to applications according to the application's requirements and contexts changes with a reasonably small processing overhead.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We explore issues and challenges for application-aware virtualization in edge Internet-of-Things (IoT) clouds. Since a large number of IoT devices reside in network edges, it is necessary for a current edge computing technology to virtualize them not only as computational resources but also functional resources for achieving the goal of a specific service, which we call application-aware virtualization. This requires translation of abstract application requirements into IoT resource allocation policies using the knowledge of relationships between application layer semantics and underlying device functionalities and status. We implement a prototype for proof-of-concept and show that it is able to dynamically allocate and reallocate IoT resources to applications according to the application's requirements and contexts changes with a reasonably small processing overhead.
2017
Lee, Soojeon; Lee, Dongman; Lee, Myungjin; Jung, Hyungsoo; Lee, Byoung-Sun
Randomizing TCP payload size for TCP fairness in data center networks Journal Article
In: Computer Networks, vol. 129, pp. 79–92, 2017.
@article{lee2017randomizing,
title = {Randomizing TCP payload size for TCP fairness in data center networks},
author = {Soojeon Lee and Dongman Lee and Myungjin Lee and Hyungsoo Jung and Byoung-Sun Lee},
url = {https://www.sciencedirect.com/science/article/pii/S1389128617303584},
doi = {https://doi.org/10.1016/j.comnet.2017.09.007},
year = {2017},
date = {2017-12-24},
urldate = {2017-01-01},
journal = {Computer Networks},
volume = {129},
pages = {79–92},
publisher = {Elsevier},
abstract = {As many-to-one traffic patterns prevail in data center networks, TCP flows often suffer from severe unfairness in sharing bottleneck bandwidth, which is known as the TCP outcast problem. The cause of the TCP outcast problem is the bursty packet losses by a drop-tail queue that triggers TCP timeouts and leads to decreasing the congestion window. This paper proposes TCPRand, a transport layer solution to TCP outcast. The main idea of TCPRand is the randomization of TCP payload size, which breaks synchronized packet arrivals between flows from different input ports. Based on the current congestion window size and the CUBIC’s congestion window growth function, TCPRand adaptively determines the proper level of randomness. With extensive ns-3 simulations and experiments, we show that TCPRand guarantees the superior enhancement of TCP fairness by reducing the TCP timeout period noticeably even in an environment where serious TCP outcast happens. TCPRand also minimizes the total goodput loss since its adaptive mechanism avoids unnecessary payload size randomization. Compared with DCTCP, TCPRand performs fairly well and only requires modification at the transport layer of the sender which makes its deployment relatively easier.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
As many-to-one traffic patterns prevail in data center networks, TCP flows often suffer from severe unfairness in sharing bottleneck bandwidth, which is known as the TCP outcast problem. The cause of the TCP outcast problem is the bursty packet losses by a drop-tail queue that triggers TCP timeouts and leads to decreasing the congestion window. This paper proposes TCPRand, a transport layer solution to TCP outcast. The main idea of TCPRand is the randomization of TCP payload size, which breaks synchronized packet arrivals between flows from different input ports. Based on the current congestion window size and the CUBIC’s congestion window growth function, TCPRand adaptively determines the proper level of randomness. With extensive ns-3 simulations and experiments, we show that TCPRand guarantees the superior enhancement of TCP fairness by reducing the TCP timeout period noticeably even in an environment where serious TCP outcast happens. TCPRand also minimizes the total goodput loss since its adaptive mechanism avoids unnecessary payload size randomization. Compared with DCTCP, TCPRand performs fairly well and only requires modification at the transport layer of the sender which makes its deployment relatively easier.
Jang, Si Young; Choi, Hayoung; Lee, Yoonhyung; Shin, Byoungheon; Lee, Dongman
Semantic virtualization for edge-IoT cloud: Issues and challenges Proceedings Article
In: Proceedings of the 2nd Workshop on Cloud-Assisted Networking, pp. 55–60, 2017.
@inproceedings{jang2017semantic,
title = {Semantic virtualization for edge-IoT cloud: Issues and challenges},
author = {Si Young Jang and Hayoung Choi and Yoonhyung Lee and Byoungheon Shin and Dongman Lee},
url = {https://dl.acm.org/doi/abs/10.1145/3155921.3157052},
doi = {https://doi.org/10.1145/3155921.3157052},
year = {2017},
date = {2017-12-11},
urldate = {2017-01-01},
booktitle = {Proceedings of the 2nd Workshop on Cloud-Assisted Networking},
pages = {55–60},
abstract = {It is well expected that a collection of smart objects such as IoT devices dynamically form an edge cloud allowing acquiring, storing, communicating, and processing of information done at the edge of the network. Edge cloud workers (i.e. IoT devices) usually have service specific characteristics while legacy cloud workers are more computing oriented. However, existing cloudlet architectures continue to take their allocation policy centered around computation resource virtualization without considering such characteristics of edge IoT clouds. In order to provide service specific QoS driven virtualization of an edge IoT cloud, which we call semantic virtualization, a new approach is required. In this paper, we investigate research issues and directions for realizing semantic virtualization for an edge IoT cloud.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
It is well expected that a collection of smart objects such as IoT devices dynamically form an edge cloud allowing acquiring, storing, communicating, and processing of information done at the edge of the network. Edge cloud workers (i.e. IoT devices) usually have service specific characteristics while legacy cloud workers are more computing oriented. However, existing cloudlet architectures continue to take their allocation policy centered around computation resource virtualization without considering such characteristics of edge IoT clouds. In order to provide service specific QoS driven virtualization of an edge IoT cloud, which we call semantic virtualization, a new approach is required. In this paper, we investigate research issues and directions for realizing semantic virtualization for an edge IoT cloud.
Kim, Taehun; Lim, Junsung; Son, Heesuk; Shin, Byoungheon; Lee, Dongman; Hyun, Soon J
A multi-dimensional smart community discovery scheme for IoT-enriched smart homes Journal Article
In: ACM Transactions on Internet Technology (TOIT), vol. 18, no. 1, pp. 1–20, 2017.
@article{kim2017multi,
title = {A multi-dimensional smart community discovery scheme for IoT-enriched smart homes},
author = {Taehun Kim and Junsung Lim and Heesuk Son and Byoungheon Shin and Dongman Lee and Soon J Hyun},
url = {https://dl.acm.org/doi/abs/10.1145/3062178},
doi = {https://doi.org/10.1145/3062178},
year = {2017},
date = {2017-10-26},
urldate = {2017-01-01},
journal = {ACM Transactions on Internet Technology (TOIT)},
volume = {18},
number = {1},
pages = {1–20},
publisher = {ACM New York, NY, USA},
abstract = {The proliferation of the Internet into every household has provided more opportunities for residents to become closer to each other than before. However, solid structural barrier is raised and social relationships within such neighborhoods are weak compared to those in traditional towns. Accordingly, activating communities and ultimately enhancing a sense of community through constructive participation and communal sharing of labor among residents has currently emerged as a challenging issue in a contemporary housing complex. In an effort to activate those communities, a notion of smart community is presented in which multiple smart homes are equipped with Internet of Things and interconnected with each other. Beyond the unadorned smart community composed by physical proximity, it is essential to discover a human-centric community that achieves communal benefits and enables residents to maximize individual economic gain by leveraging collective intelligence. In this article, we present a multi-dimensional smart community discovery scheme that enables householders to find human-centric community considering multi-dimensional factors in terms of physical, social, and economical aspects. We conduct experiments with 30 real households by applying a community-based energy saving scenario. Experiment results show that the proposed scheme performs better when compared to the physical proximity-based one in energy consumption and user satisfaction.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The proliferation of the Internet into every household has provided more opportunities for residents to become closer to each other than before. However, solid structural barrier is raised and social relationships within such neighborhoods are weak compared to those in traditional towns. Accordingly, activating communities and ultimately enhancing a sense of community through constructive participation and communal sharing of labor among residents has currently emerged as a challenging issue in a contemporary housing complex. In an effort to activate those communities, a notion of smart community is presented in which multiple smart homes are equipped with Internet of Things and interconnected with each other. Beyond the unadorned smart community composed by physical proximity, it is essential to discover a human-centric community that achieves communal benefits and enables residents to maximize individual economic gain by leveraging collective intelligence. In this article, we present a multi-dimensional smart community discovery scheme that enables householders to find human-centric community considering multi-dimensional factors in terms of physical, social, and economical aspects. We conduct experiments with 30 real households by applying a community-based energy saving scenario. Experiment results show that the proposed scheme performs better when compared to the physical proximity-based one in energy consumption and user satisfaction.
Lim, Junsung; Son, Heesuk; Lee, Daekeun; Lee, Dongman
An MARL-based distributed learning scheme for capturing user preferences in a smart environment Conference
2017 IEEE International Conference on Services Computing (SCC), IEEE 2017, ISSN: 2474-2473.
@conference{lim2017marl,
title = {An MARL-based distributed learning scheme for capturing user preferences in a smart environment},
author = {Junsung Lim and Heesuk Son and Daekeun Lee and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/8034977},
doi = {10.1109/SCC.2017.24},
issn = {2474-2473},
year = {2017},
date = {2017-09-14},
urldate = {2017-07-14},
booktitle = {2017 IEEE International Conference on Services Computing (SCC)},
pages = {132–139},
organization = {IEEE},
abstract = {Providing a personalized service to a user in a smart environment has been one of the key goals in the area of pervasive computing. The proliferation of individually developed smart devices in the name of Internet of Things opens up a possibility of providing personalized services to a user in an autonomous and distributed manner. As a user's task often involves services supported by multiple devices, capturing a device-specific service preference is not enough to maximize a user's comfort. In this paper, we propose a distributed learning scheme for capturing multiple device service preferences in a smart environment. We exploit multi-agent reinforcement learning (MARL) method where each smart device acts as a reinforcement learning agent to incrementally and cooperatively capture a user specific preference of a task. Experiments confirm that smart devices with the proposed scheme are able to capture multiple device service preferences from a small number of interactions with a user and an environment. Also, the proposed transfer learning method improves learning performance for a new task.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Providing a personalized service to a user in a smart environment has been one of the key goals in the area of pervasive computing. The proliferation of individually developed smart devices in the name of Internet of Things opens up a possibility of providing personalized services to a user in an autonomous and distributed manner. As a user's task often involves services supported by multiple devices, capturing a device-specific service preference is not enough to maximize a user's comfort. In this paper, we propose a distributed learning scheme for capturing multiple device service preferences in a smart environment. We exploit multi-agent reinforcement learning (MARL) method where each smart device acts as a reinforcement learning agent to incrementally and cooperatively capture a user specific preference of a task. Experiments confirm that smart devices with the proposed scheme are able to capture multiple device service preferences from a small number of interactions with a user and an environment. Also, the proposed transfer learning method improves learning performance for a new task.
Gwak, B; Son, H; Kang, J; Lee, D
IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), IEEE, 2017, ISSN: 2324-9013.
@conference{gwak2017iot,
title = {Iot trust estimation in an unknown place using the opinions of I-sharing friends, Trustcom/BigDataSE/ICESS, 2017 IEEE},
author = {B Gwak and H Son and J Kang and D Lee},
url = {https://ieeexplore.ieee.org/abstract/document/8029493},
doi = {10.1109/Trustcom/BigDataSE/ICESS.2017.290},
issn = {2324-9013},
year = {2017},
date = {2017-09-11},
urldate = {2017-01-01},
booktitle = {IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)},
publisher = {IEEE},
abstract = {Advances of IoT have enabled users to use intelligent services from surrounding smart objects. As the needs of preventing the misusage of personal information increases, the estimation of the trustworthiness of interaction counterparts before interaction is important to prevent potential dangers. Existing trust estimation solutions are based on Social IoT, which is hard to adopt in reality. Another approach uses indirect interaction history to estimate trustworthiness, which is not efficient in an unknown place. In this paper, we propose a trust estimation scheme that allows a user to evaluate the trust value of target device in an unknown place, by leveraging I-sharing friend's subjective experience. Evaluation results show that the proposed scheme decreases RMSE up to 2.5 times compared with the existing approach.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Advances of IoT have enabled users to use intelligent services from surrounding smart objects. As the needs of preventing the misusage of personal information increases, the estimation of the trustworthiness of interaction counterparts before interaction is important to prevent potential dangers. Existing trust estimation solutions are based on Social IoT, which is hard to adopt in reality. Another approach uses indirect interaction history to estimate trustworthiness, which is not efficient in an unknown place. In this paper, we propose a trust estimation scheme that allows a user to evaluate the trust value of target device in an unknown place, by leveraging I-sharing friend's subjective experience. Evaluation results show that the proposed scheme decreases RMSE up to 2.5 times compared with the existing approach.
Son, Heesuk; Kang, Namyong; Gwak, Bumjin; Lee, Dongman
An adaptive IoT trust estimation scheme combining interaction history and stereotypical reputation Conference
2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC), IEEE 2017, ISSN: 2331-9860.
@conference{son2017adaptive,
title = {An adaptive IoT trust estimation scheme combining interaction history and stereotypical reputation},
author = {Heesuk Son and Namyong Kang and Bumjin Gwak and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/7983132},
doi = {10.1109/CCNC.2017.7983132},
issn = {2331-9860},
year = {2017},
date = {2017-07-20},
urldate = {2017-07-20},
booktitle = {2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC)},
pages = {349–352},
organization = {IEEE},
abstract = {As IoT devices become prevalent in our daily lives, estimation of their trustworthiness plays an important role for privacy protection complementary to security solutions. Existing trust estimation solutions are based on SIoT whose full social network is not likely to be observable in a public space or do not reflect situation-dependent dynamism of trust. In this paper, we propose a new trust estimation scheme that computes a user's trust value of an IoT device combining both the personal trust from the interaction history and non-personal stereotypical reputation from the general public.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
As IoT devices become prevalent in our daily lives, estimation of their trustworthiness plays an important role for privacy protection complementary to security solutions. Existing trust estimation solutions are based on SIoT whose full social network is not likely to be observable in a public space or do not reflect situation-dependent dynamism of trust. In this paper, we propose a new trust estimation scheme that computes a user's trust value of an IoT device combining both the personal trust from the interaction history and non-personal stereotypical reputation from the general public.
Ko, Han-Gyu; Ko, In-Young; Lee, Dongman
Multi-criteria matrix localization and integration for personalized collaborative filtering in IoT environments Journal Article
In: Multimedia Tools and Applications, vol. 77, pp. 4697–4730, 2017.
@article{ko2018multi,
title = {Multi-criteria matrix localization and integration for personalized collaborative filtering in IoT environments},
author = {Han-Gyu Ko and In-Young Ko and Dongman Lee},
url = {https://link.springer.com/article/10.1007/s11042-017-4849-9},
doi = {https://doi.org/10.1007/s11042-017-4849-9},
year = {2017},
date = {2017-06-30},
urldate = {2018-01-01},
journal = {Multimedia Tools and Applications},
volume = {77},
pages = {4697–4730},
publisher = {Springer},
abstract = {Collaborative filtering (CF)-based recommender systems can be used to deal with the complexity problem of users when they want to identify possible tasks on the fly and perform desired tasks by using various smart objects in Internet of Things (IoT) environments. However, in order to use CF-based recommender systems, users need to provide their feedbacks and there are usually more than one criterion considered when users choose an item. Although there have been studies of multi-criteria recommendations, existing approaches require multi-criteria ratings that are explicitly given by users. It is usually a burden for a user to provide more than one instance of feedback on an item; therefore, user feedback datasets are usually sparse when users are asked to provide multi-criteria ratings. Due to the sparsity of multi-criteria rating data, the similarity measurements used by the existing approaches may produce biased results, possibly leading to degradation of the recommendation accuracy. This problem becomes worse as the sparsity of a dataset increases. To alleviate the effects of the data-sparsity problem, and to take advantage of using multi-criteria ratings, we proposed a multi-criteria matrix localization and integration (MCMLI) approach for collaborative filtering in this paper. The main goal of MCMLI is to find cohesive user-item subgroups (CUISs) for each criterion from sparse data, and to predict users’ interests for each criterion in a more precise manner. The proposed approach is composed of three phases. At the first phase, a given user-item matrix is divided into a set of CUIS matrices, each of which is organized with correlated users and items for each criterion. MCMLI repeats this CUIS generation process until the generated subgroups cover all elements of the given user-item matrix. To generate prediction results for each criterion, MCMLI then predicts user ratings on new items for each CUIS and aggregates the prediction results to make recommendations to users. To enable personalized recommendations, during the aggregation process, each user’s preferences on multiple criteria are weighted differently according to the number of CUISs to which the user belongs. We demonstrate the effectiveness of our approach by conducting an experiment with real-world datasets from TripAdvisor and Yahoo! Movies. The experimental results show that MCMLI outperforms existing multi-criteria collaborative-filtering-based recommendation methods in terms of the recommendation accuracy. In addition, unlike the existing multi-criteria recommendation approaches, even when the sparsity level of a dataset increases, the recommendation accuracy of MCMLI does not decrease significantly.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Collaborative filtering (CF)-based recommender systems can be used to deal with the complexity problem of users when they want to identify possible tasks on the fly and perform desired tasks by using various smart objects in Internet of Things (IoT) environments. However, in order to use CF-based recommender systems, users need to provide their feedbacks and there are usually more than one criterion considered when users choose an item. Although there have been studies of multi-criteria recommendations, existing approaches require multi-criteria ratings that are explicitly given by users. It is usually a burden for a user to provide more than one instance of feedback on an item; therefore, user feedback datasets are usually sparse when users are asked to provide multi-criteria ratings. Due to the sparsity of multi-criteria rating data, the similarity measurements used by the existing approaches may produce biased results, possibly leading to degradation of the recommendation accuracy. This problem becomes worse as the sparsity of a dataset increases. To alleviate the effects of the data-sparsity problem, and to take advantage of using multi-criteria ratings, we proposed a multi-criteria matrix localization and integration (MCMLI) approach for collaborative filtering in this paper. The main goal of MCMLI is to find cohesive user-item subgroups (CUISs) for each criterion from sparse data, and to predict users’ interests for each criterion in a more precise manner. The proposed approach is composed of three phases. At the first phase, a given user-item matrix is divided into a set of CUIS matrices, each of which is organized with correlated users and items for each criterion. MCMLI repeats this CUIS generation process until the generated subgroups cover all elements of the given user-item matrix. To generate prediction results for each criterion, MCMLI then predicts user ratings on new items for each CUIS and aggregates the prediction results to make recommendations to users. To enable personalized recommendations, during the aggregation process, each user’s preferences on multiple criteria are weighted differently according to the number of CUISs to which the user belongs. We demonstrate the effectiveness of our approach by conducting an experiment with real-world datasets from TripAdvisor and Yahoo! Movies. The experimental results show that MCMLI outperforms existing multi-criteria collaborative-filtering-based recommendation methods in terms of the recommendation accuracy. In addition, unlike the existing multi-criteria recommendation approaches, even when the sparsity level of a dataset increases, the recommendation accuracy of MCMLI does not decrease significantly.
Park, Chunjong; Lim, Junsung; Kim, Juho; Lee, Sung-Ju; Lee, Dongman
Don't bother me. I'm socializing! A breakpoint-based smartphone notification system Proceedings Article
In: Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing, pp. 541–554, 2017.
@inproceedings{park2017don,
title = {Don't bother me. I'm socializing! A breakpoint-based smartphone notification system},
author = {Chunjong Park and Junsung Lim and Juho Kim and Sung-Ju Lee and Dongman Lee},
url = {https://dl.acm.org/doi/abs/10.1145/2998181.2998189},
doi = {https://doi.org/10.1145/2998181.2998189},
year = {2017},
date = {2017-02-25},
urldate = {2017-01-01},
booktitle = {Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing},
pages = {541–554},
abstract = {Smartphone notifications provide application-specific information in real-time, but could distract users from in-person social interactions when delivered at inopportune moments. We explore breakpoint-based notification management, in which the smartphone defers notifications until an opportune moment. With a video survey where participants selected appropriate moments for notifications from a video-recorded social interaction, we identify four breakpoint types: long silence, a user leaving the table, others using smartphones, and a user left alone. We introduce a Social Context-Aware smartphone Notification system, SCAN, that uses build-in sensors to detect social context and identifies breakpoints to defer smartphone notifications until a breakpoint. We conducted a controlled study with ten friend groups who had SCAN installed on their smartphones while dining at a restaurant. Results show that SCAN accurately detects breakpoints (precision=92.0%, recall=82.5%), and reduces notification interruptions by 54.1%. Most participants reported that SCAN helped them to focus better on in-person social interaction and found selected breakpoints appropriate.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Smartphone notifications provide application-specific information in real-time, but could distract users from in-person social interactions when delivered at inopportune moments. We explore breakpoint-based notification management, in which the smartphone defers notifications until an opportune moment. With a video survey where participants selected appropriate moments for notifications from a video-recorded social interaction, we identify four breakpoint types: long silence, a user leaving the table, others using smartphones, and a user left alone. We introduce a Social Context-Aware smartphone Notification system, SCAN, that uses build-in sensors to detect social context and identifies breakpoints to defer smartphone notifications until a breakpoint. We conducted a controlled study with ten friend groups who had SCAN installed on their smartphones while dining at a restaurant. Results show that SCAN accurately detects breakpoints (precision=92.0%, recall=82.5%), and reduces notification interruptions by 54.1%. Most participants reported that SCAN helped them to focus better on in-person social interaction and found selected breakpoints appropriate.
2016
Shin, Byoungheon; Abdullayev, Jalil; Lee, Dongman
An efficient MAC layer packet fragmentation scheme with priority queuing for real-time video streaming Proceedings Article
In: 2016 IEEE 41st Conference on Local Computer Networks (LCN), pp. 69–77, IEEE 2016, ISBN: 978-1-5090-2054-6.
@inproceedings{shin2016efficient,
title = {An efficient MAC layer packet fragmentation scheme with priority queuing for real-time video streaming},
author = {Byoungheon Shin and Jalil Abdullayev and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/7796764},
doi = {10.1109/LCN.2016.18},
isbn = {978-1-5090-2054-6},
year = {2016},
date = {2016-12-26},
urldate = {2016-12-26},
booktitle = {2016 IEEE 41st Conference on Local Computer Networks (LCN)},
pages = {69–77},
organization = {IEEE},
abstract = {This paper proposes a novel priority-aware packet fragmentation extension to high throughput WLANs such as IEEE 802.11n for streaming of H264/AVC encoded videos. Unlike existing fragmentation schemes, the proposed scheme fragments IP packets based on the priority of video packets and the characteristics of MPEG-2 TS, where the original IP packet is fragmented into smaller IP packets containing fewer TS packets and prioritizes individual TS packets, allocated to an appropriate priority queue. The proposed scheme is evaluated on a testbed with various network congestion levels and channel conditions. The results show that the proposed scheme achieves higher quality of the streaming video in terms of PSNR than existing schemes as the network congestion level and the bit error rate increase.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes a novel priority-aware packet fragmentation extension to high throughput WLANs such as IEEE 802.11n for streaming of H264/AVC encoded videos. Unlike existing fragmentation schemes, the proposed scheme fragments IP packets based on the priority of video packets and the characteristics of MPEG-2 TS, where the original IP packet is fragmented into smaller IP packets containing fewer TS packets and prioritizes individual TS packets, allocated to an appropriate priority queue. The proposed scheme is evaluated on a testbed with various network congestion levels and channel conditions. The results show that the proposed scheme achieves higher quality of the streaming video in terms of PSNR than existing schemes as the network congestion level and the bit error rate increase.
Bourbia, Amine Lotfi; Son, Heesuk; Shin, Byoungheon; Kim, Taehun; Lee, Dongman; Hyun, Soon J
Temporal dependency rule learning based group activity recognition in smart spaces Conference
2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC), vol. 1, IEEE 2016, ISSN: 0730-3157.
@conference{bourbia2016temporal,
title = {Temporal dependency rule learning based group activity recognition in smart spaces},
author = {Amine Lotfi Bourbia and Heesuk Son and Byoungheon Shin and Taehun Kim and Dongman Lee and Soon J Hyun},
url = {https://ieeexplore.ieee.org/abstract/document/7552086},
doi = {10.1109/COMPSAC.2016.202},
issn = {0730-3157},
year = {2016},
date = {2016-08-25},
urldate = {2016-01-01},
booktitle = {2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC)},
volume = {1},
pages = {658–663},
organization = {IEEE},
abstract = {We present a generic framework for group activity recognition using simple non-obtrusive sensors. The proposed scheme is based on that group activity patterns can be derived from mining interval-based relationships between users' temporally overlapped actions. We leverage a hybrid architecture of probabilistic and logic knowledge that can capture the essence of the temporal dependencies, represented as a set of weighed rules. It can also learn different weights for common rules between similar group activities, which share most of sensor events and events order. The evaluation results show that our scheme outperforms the sequential baseline model, a mixture of Gaussian Hidden Markov Models.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
We present a generic framework for group activity recognition using simple non-obtrusive sensors. The proposed scheme is based on that group activity patterns can be derived from mining interval-based relationships between users' temporally overlapped actions. We leverage a hybrid architecture of probabilistic and logic knowledge that can capture the essence of the temporal dependencies, represented as a set of weighed rules. It can also learn different weights for common rules between similar group activities, which share most of sensor events and events order. The evaluation results show that our scheme outperforms the sequential baseline model, a mixture of Gaussian Hidden Markov Models.
Jang, Si Young; Shin, Byoungheon; Lee, Dongman
An adaptive tail time adjustment scheme based on inter-packet arrival time for IEEE 802.11 WLAN Conference
2016 IEEE International Conference on Communications (ICC), IEEE 2016, ISSN: 1938-1883.
@conference{jang2016adaptive,
title = {An adaptive tail time adjustment scheme based on inter-packet arrival time for IEEE 802.11 WLAN},
author = {Si Young Jang and Byoungheon Shin and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/7511457},
doi = {10.1109/ICC.2016.7511457},
issn = {1938-1883},
year = {2016},
date = {2016-07-14},
urldate = {2016-01-01},
booktitle = {2016 IEEE International Conference on Communications (ICC)},
pages = {1–6},
organization = {IEEE},
abstract = {Power management of Wi-Fi interfaces can greatly impact the battery life time of a smart device. Thus, many commercial devices utilize the Power Save Mode - Adaptive (PSM-A) mechanism for energy saving by switching wireless radio between high and low power. Tail time is introduced in PSM-A to put the radio in high power state until the time expires, allowing near future packets to arrive without much delay. However, this fixed tail time may result in a considerable amount of energy drainage under various types of traffic. This paper proposes an adaptive tail time adjustment scheme, a simple yet efficient way to save energy wastage by adaptively resizing the tail time according to prediction of data packet arrival times. The simulation results show up to 28.4% energy savings and reduces packet delivery delay compared to existing schemes.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Power management of Wi-Fi interfaces can greatly impact the battery life time of a smart device. Thus, many commercial devices utilize the Power Save Mode - Adaptive (PSM-A) mechanism for energy saving by switching wireless radio between high and low power. Tail time is introduced in PSM-A to put the radio in high power state until the time expires, allowing near future packets to arrive without much delay. However, this fixed tail time may result in a considerable amount of energy drainage under various types of traffic. This paper proposes an adaptive tail time adjustment scheme, a simple yet efficient way to save energy wastage by adaptively resizing the tail time according to prediction of data packet arrival times. The simulation results show up to 28.4% energy savings and reduces packet delivery delay compared to existing schemes.
Jang, Si Young; Shin, Byoung Heon; Lee, Dongman
Implementing a Dynamically Reconfigurable Wireless Mesh Network Testbed for Multi-Faceted QoS Support Proceedings Article
In: Proceedings of the 11th International Conference on Future Internet Technologies, pp. 95–98, 2016.
@inproceedings{jang2016implementing,
title = {Implementing a Dynamically Reconfigurable Wireless Mesh Network Testbed for Multi-Faceted QoS Support},
author = {Si Young Jang and Byoung Heon Shin and Dongman Lee},
url = {https://dl.acm.org/doi/abs/10.1145/2935663.2935678},
doi = {https://doi.org/10.1145/2935663.2935678},
year = {2016},
date = {2016-06-15},
urldate = {2016-01-01},
booktitle = {Proceedings of the 11th International Conference on Future Internet Technologies},
pages = {95–98},
abstract = {Various mobile applications require different QoS requirements, thus there is a need to resolve the application requirement into the underlying mesh network to support them. Existing approach to coordinate the application traffic requirement to underlying network has been applied in wired domains. However, it is complex in the wireless domain due to the mobility and diversity of mobile applications. Much interest is focused on resolving application QoS and match request to mesh network link availability. We propose a testbed architecture which allows dynamic configuration of mesh networks and coordination of each flow to support application-aware QoS. Our prototype testbed shows adaptive change in mesh network routing configuration depending on application requests.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Various mobile applications require different QoS requirements, thus there is a need to resolve the application requirement into the underlying mesh network to support them. Existing approach to coordinate the application traffic requirement to underlying network has been applied in wired domains. However, it is complex in the wireless domain due to the mobility and diversity of mobile applications. Much interest is focused on resolving application QoS and match request to mesh network link availability. We propose a testbed architecture which allows dynamic configuration of mesh networks and coordination of each flow to support application-aware QoS. Our prototype testbed shows adaptive change in mesh network routing configuration depending on application requests.
Han, Seon Yeong; Abu-Ghazaleh, Nael B.; Lee, Dongman
Efficient and Consistent Path Loss Model for Mobile Network Simulation Journal Article
In: IEEE/ACM Transactions on Networking, vol. 24, no. 3, pp. 1774-1786, 2016, ISSN: 1558-2566.
@article{7113922,
title = {Efficient and Consistent Path Loss Model for Mobile Network Simulation},
author = {Seon Yeong Han and Nael B. Abu-Ghazaleh and Dongman Lee},
url = {https://ieeexplore.ieee.org/document/7113922},
doi = {10.1109/TNET.2015.2431852},
issn = {1558-2566},
year = {2016},
date = {2016-06-01},
urldate = {2016-06-01},
journal = {IEEE/ACM Transactions on Networking},
volume = {24},
number = {3},
pages = {1774-1786},
abstract = {The accuracy of wireless network packet simulation critically depends on the quality of wireless channel models. Path loss is the stationary component of the channel model affected by the shadowing in the environment. Existing path loss models are inaccurate, require excessive measurement or computational overhead, and/or often cannot be made to represent a given environment. This paper contributes a flexible path loss model that uses a novel approach for spatially coherent interpolation from available nearby channels to allow accurate and efficient modeling of path loss. We show that the proposed model, called Double Regression (DR), generates a correlated space, allowing both the sender and the receiver to move without abrupt change in path loss. Combining DR with a traditional temporal fading model, such as Rayleigh fading, provides an accurate and efficient channel model that we integrate with the NS-2 simulator. We use measurements to validate the accuracy of the model for a number of scenarios. We also show that there is substantial impact on simulation behavior when path loss is modeled accurately. Finally, we show that unlike statistical models, DR can make a simulation representative of a given environment by using a small number of seeding measurements. Thus, DR provides a cost-effective alternative to ray tracing or detailed site surveys.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The accuracy of wireless network packet simulation critically depends on the quality of wireless channel models. Path loss is the stationary component of the channel model affected by the shadowing in the environment. Existing path loss models are inaccurate, require excessive measurement or computational overhead, and/or often cannot be made to represent a given environment. This paper contributes a flexible path loss model that uses a novel approach for spatially coherent interpolation from available nearby channels to allow accurate and efficient modeling of path loss. We show that the proposed model, called Double Regression (DR), generates a correlated space, allowing both the sender and the receiver to move without abrupt change in path loss. Combining DR with a traditional temporal fading model, such as Rayleigh fading, provides an accurate and efficient channel model that we integrate with the NS-2 simulator. We use measurements to validate the accuracy of the model for a number of scenarios. We also show that there is substantial impact on simulation behavior when path loss is modeled accurately. Finally, we show that unlike statistical models, DR can make a simulation representative of a given environment by using a small number of seeding measurements. Thus, DR provides a cost-effective alternative to ray tracing or detailed site surveys.
Tegelund, Bjorn; Son, Heesuk; Lee, Dongman
A task-oriented service personalization scheme for smart environments using reinforcement learning Workshop
2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), IEEE 2016, ISBN: 978-1-5090-1941-0.
@workshop{tegelund2016task,
title = {A task-oriented service personalization scheme for smart environments using reinforcement learning},
author = {Bjorn Tegelund and Heesuk Son and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/7457110},
doi = {10.1109/PERCOMW.2016.7457110},
isbn = {978-1-5090-1941-0},
year = {2016},
date = {2016-04-21},
urldate = {2016-01-01},
booktitle = {2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)},
pages = {1–6},
organization = {IEEE},
abstract = {Users want IoT environments to provide them with personalized support. These environments therefore need to be able to learn user preferences, such as what temperature the room should be or which lights should be turned on. We propose a novel system that separates the tasks of learning a user's preferences and realizing them within the environment. The system is able to capture user preferences by reinterpreting the problem as an optimization problem and applying inverse reinforcement learning to it. The system is shown to be able to accurately extract simple preferences given a small number of user demonstrations. These preferences are then realized by actuates devices running reinforcement learning-based agents to provide an environment consistent with the learnt preferences, also in situations not included in any user demonstration.},
keywords = {},
pubstate = {published},
tppubtype = {workshop}
}
Users want IoT environments to provide them with personalized support. These environments therefore need to be able to learn user preferences, such as what temperature the room should be or which lights should be turned on. We propose a novel system that separates the tasks of learning a user's preferences and realizing them within the environment. The system is able to capture user preferences by reinterpreting the problem as an optimization problem and applying inverse reinforcement learning to it. The system is shown to be able to accurately extract simple preferences given a small number of user demonstrations. These preferences are then realized by actuates devices running reinforcement learning-based agents to provide an environment consistent with the learnt preferences, also in situations not included in any user demonstration.
Lim, Junsung; Son, Heesuk; Shin, Byoungheon; Lee, Dongman
CASPRE: A context-aware standby power reduction scheme for household appliances Workshop
2016 IEEE international conference on pervasive computing and communication workshops (PerCom Workshops), IEEE 2016, ISBN: 978-1-5090-1941-0.
@workshop{lim2016caspre,
title = {CASPRE: A context-aware standby power reduction scheme for household appliances},
author = {Junsung Lim and Heesuk Son and Byoungheon Shin and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/7457146},
doi = {10.1109/PERCOMW.2016.7457146},
isbn = {978-1-5090-1941-0},
year = {2016},
date = {2016-04-21},
urldate = {2016-04-21},
booktitle = {2016 IEEE international conference on pervasive computing and communication workshops (PerCom Workshops)},
pages = {1–6},
organization = {IEEE},
abstract = {Many household appliances draw standby power, which can be reduced to save total energy consumption of a household. Smart plugs are proposed for effectively reducing standby power of an appliance by monitoring and cutting power when the appliance is no longer in use. However, the level of intelligence it leverages is minimal such that it still requires a direct manipulation by the user and does not make a use out of any other contexts. In this paper, we propose a context-aware standby power reduction scheme, CASPRE that reduces the total standby power of household appliances by controlling smart plugs through context reasoning. The proposed scheme leverages the notion of correlations that exist among appliances when conducting a specific task at home. An ongoing task can be inferred from contexts of multiple appliances and those that do not belong to the current task can be turned off. Experiments on real world power datasets show that the proposed scheme more effectively reduces total standby power than existing ones.},
keywords = {},
pubstate = {published},
tppubtype = {workshop}
}
Many household appliances draw standby power, which can be reduced to save total energy consumption of a household. Smart plugs are proposed for effectively reducing standby power of an appliance by monitoring and cutting power when the appliance is no longer in use. However, the level of intelligence it leverages is minimal such that it still requires a direct manipulation by the user and does not make a use out of any other contexts. In this paper, we propose a context-aware standby power reduction scheme, CASPRE that reduces the total standby power of household appliances by controlling smart plugs through context reasoning. The proposed scheme leverages the notion of correlations that exist among appliances when conducting a specific task at home. An ongoing task can be inferred from contexts of multiple appliances and those that do not belong to the current task can be turned off. Experiments on real world power datasets show that the proposed scheme more effectively reduces total standby power than existing ones.
Son, Heesuk; Lee, Dongman
An intelligent SDP discovery scheme using knowledge-based adaptive probing Proceedings Article
In: 2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), pp. 1–6, IEEE 2016, ISBN: 978-1-5090-1941-0.
@inproceedings{son2016intelligent,
title = {An intelligent SDP discovery scheme using knowledge-based adaptive probing},
author = {Heesuk Son and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/7457125},
doi = {10.1109/PERCOMW.2016.7457125},
isbn = {978-1-5090-1941-0},
year = {2016},
date = {2016-04-21},
urldate = {2016-01-01},
booktitle = {2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)},
pages = {1–6},
organization = {IEEE},
abstract = {As Internet of Things advances, various smart objects and services permeate in our living environment. Due to their dynamic join/leave behaviors, service discovery protocols (SDPs) have been proposed. As new SDPs are introduced and legacy SDPs evolve, the incompatible islands of smart objects inevitably arise. To solve this issue, many research works are presented, but they cannot accommodate a new protocol or a new version of the legacy protocol. To solve this limitation, we propose an intelligent SDP discovery scheme based on knowledge-based adaptive probing. It is composed of two main building blocks, SDP knowledge base and adaptive probing procedure. In the case study, a user device successfully discovers a new SDP version by means of the proposed scheme.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
As Internet of Things advances, various smart objects and services permeate in our living environment. Due to their dynamic join/leave behaviors, service discovery protocols (SDPs) have been proposed. As new SDPs are introduced and legacy SDPs evolve, the incompatible islands of smart objects inevitably arise. To solve this issue, many research works are presented, but they cannot accommodate a new protocol or a new version of the legacy protocol. To solve this limitation, we propose an intelligent SDP discovery scheme based on knowledge-based adaptive probing. It is composed of two main building blocks, SDP knowledge base and adaptive probing procedure. In the case study, a user device successfully discovers a new SDP version by means of the proposed scheme.
2015
Lim, Junsung; Son, Heesuk; Lee, Dongman
Enhancing Flexibility for Smart Object Middleware Update by Separation of Behavioral Logic and Executable Code Masters Thesis
KAIST School of Computing, 2015.
@mastersthesis{nokey,
title = {Enhancing Flexibility for Smart Object Middleware Update by Separation of Behavioral Logic and Executable Code},
author = {Junsung Lim and Heesuk Son and Dongman Lee},
url = {https://www.dbpia.co.kr/pdf/pdfView.do?nodeId=NODE06602409&googleIPSandBox=false&mark=0&minRead=5&ipRange=false&b2cLoginYN=false&icstClss=010000&isPDFSizeAllowed=true&accessgl=Y&language=ko_KR&hasTopBanner=true},
year = {2015},
date = {2015-12-17},
urldate = {2015-12-17},
issue = {2015년 동계학술발표회 논문집},
school = {KAIST School of Computing},
abstract = {As we move towards world of Internet of Things (IoT), more and more smart objects appear. Existing context-aware middleware for those smart objects focus heavily on use of domain-specific knowledge base to interpret given situations and provide personalized services accordingly. However, whenever the system or service requirements change, with the existing middleware, service developers need to recompile and redistribute the executable code of the smart objects. This can decrease the system update efficiency and even harm the usability. In this work, we present a smart object middleware with enhanced flexibility in which the smart object’s behavioral logic on communication, service methods and context types are described in the knowledge base. The separation of the logic as a knowledge base from the actual executable code can remove the needs for recompiling and redistributing the service as a whole.},
keywords = {},
pubstate = {published},
tppubtype = {mastersthesis}
}
As we move towards world of Internet of Things (IoT), more and more smart objects appear. Existing context-aware middleware for those smart objects focus heavily on use of domain-specific knowledge base to interpret given situations and provide personalized services accordingly. However, whenever the system or service requirements change, with the existing middleware, service developers need to recompile and redistribute the executable code of the smart objects. This can decrease the system update efficiency and even harm the usability. In this work, we present a smart object middleware with enhanced flexibility in which the smart object’s behavioral logic on communication, service methods and context types are described in the knowledge base. The separation of the logic as a knowledge base from the actual executable code can remove the needs for recompiling and redistributing the service as a whole.
Lee, Dongman; Shin, Byoungheon
20150356623, 2015.
@patent{patent:20150356623,
title = {System And Method For Recommending Customized Tourism Content Based On Collecting And Structurizing Of Unstructured Tourism Data},
author = {Dongman Lee and Byoungheon Shin},
url = {https://www.freepatentsonline.com/y2015/0356623.html},
year = {2015},
date = {2015-12-10},
urldate = {2015-12-01},
number = {20150356623},
abstract = {A customized tourism content recommending system is provided which collects and structurizes unstructured tourism data. The customized tourism content recommending system includes a data collecting unit, a data structurizing unit, a user emotion analyzing unit, and a schedule providing unit. The data collecting unit collects unstructured data about a tourism at one time, and the data structurizing unit structurizes the unstructured data, collected by the data collecting unit, based on one or more of a time, a place, or an occasion. The user emotion analyzing unit analyzes an emotion of a user about an individual tourism experience. The schedule providing unit reflects the analysis of the emotion analyzing unit about the user's emotion, derives a customized travel schedule from the data, structurized by the data structurizing unit, according to one or more of the time, the place, or the occasion, and provides the derived result to the user.},
keywords = {},
pubstate = {published},
tppubtype = {patent}
}
A customized tourism content recommending system is provided which collects and structurizes unstructured tourism data. The customized tourism content recommending system includes a data collecting unit, a data structurizing unit, a user emotion analyzing unit, and a schedule providing unit. The data collecting unit collects unstructured data about a tourism at one time, and the data structurizing unit structurizes the unstructured data, collected by the data collecting unit, based on one or more of a time, a place, or an occasion. The user emotion analyzing unit analyzes an emotion of a user about an individual tourism experience. The schedule providing unit reflects the analysis of the emotion analyzing unit about the user's emotion, derives a customized travel schedule from the data, structurized by the data structurizing unit, according to one or more of the time, the place, or the occasion, and provides the derived result to the user.
Lee, Soojeon; Lee, Myungjin; Lee, Dongman; Jung, Hyungsoo; Lee, Byoung-Sun
TCPRand: Randomizing TCP payload size for TCP fairness in data center networks Conference
2015 IEEE Conference on Computer Communications (INFOCOM), IEEE 2015, ISSN: 0743-166X.
@conference{lee2015tcprand,
title = {TCPRand: Randomizing TCP payload size for TCP fairness in data center networks},
author = {Soojeon Lee and Myungjin Lee and Dongman Lee and Hyungsoo Jung and Byoung-Sun Lee},
url = {https://ieeexplore.ieee.org/abstract/document/7218550},
doi = {10.1109/INFOCOM.2015.7218550},
issn = {0743-166X},
year = {2015},
date = {2015-08-24},
urldate = {2015-01-01},
booktitle = {2015 IEEE Conference on Computer Communications (INFOCOM)},
pages = {1697–1705},
organization = {IEEE},
abstract = {As many-to-one traffic patterns prevail in data center networks, TCP flows often suffer from severe unfairness in sharing bottleneck bandwidth, which is known as the TCP outcast problem. The cause of the TCP outcast problem is the bursty packet losses by a drop-tail queue that triggers TCP timeouts and leads to decreasing the congestion window. This paper proposes TCPRand, a transport layer solution to TCP outcast. The main idea of TCPRand is the randomization of TCP payload size, which breaks synchronized packet arrivals between flows from different input ports. We investigate how TCPRand reduces consecutive packet drops and demonstrate various benefits of TCPRand with extensive experiments and ns-3 simulation. Our evaluation results show that TCPRand guarantees the superior enhancement of TCP fairness with negligible overheads in all of our test cases.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
As many-to-one traffic patterns prevail in data center networks, TCP flows often suffer from severe unfairness in sharing bottleneck bandwidth, which is known as the TCP outcast problem. The cause of the TCP outcast problem is the bursty packet losses by a drop-tail queue that triggers TCP timeouts and leads to decreasing the congestion window. This paper proposes TCPRand, a transport layer solution to TCP outcast. The main idea of TCPRand is the randomization of TCP payload size, which breaks synchronized packet arrivals between flows from different input ports. We investigate how TCPRand reduces consecutive packet drops and demonstrate various benefits of TCPRand with extensive experiments and ns-3 simulation. Our evaluation results show that TCPRand guarantees the superior enhancement of TCP fairness with negligible overheads in all of our test cases.
Son, Heesuk; Tegelund, Bjorn; Kim, Taehun; Lee, Dongman; Hyun, Soon J.; Lim, Junsung; Lee, Hyunseok
A Distributed Middleware for a Smart Home with Autonomous Appliances Proceedings Article
In: 2015 IEEE 39th Annual Computer Software and Applications Conference, pp. 23-32, 2015, ISSN: 0730-3157.
@inproceedings{7273592,
title = {A Distributed Middleware for a Smart Home with Autonomous Appliances},
author = {Heesuk Son and Bjorn Tegelund and Taehun Kim and Dongman Lee and Soon J. Hyun and Junsung Lim and Hyunseok Lee},
url = {https://ieeexplore.ieee.org/document/7273592},
doi = {10.1109/COMPSAC.2015.101},
issn = {0730-3157},
year = {2015},
date = {2015-07-01},
urldate = {2015-07-01},
booktitle = {2015 IEEE 39th Annual Computer Software and Applications Conference},
volume = {2},
pages = {23-32},
abstract = {This paper presents a distributed smart home middleware where each appliance is able to learn user behavior and customize their actions by themselves as well as cooperate with other appliances through a more light-weight smart home gateway. As the key components, we present a knowledge base which describes common- and appliance-specific concepts in a smart home domain, and design libraries for smart appliances and a smart home gateway. We implement the proposed middleware on our testbed and conduct evaluations. The result shows that our scheme reduces the interaction time and the runtime memory allocation.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper presents a distributed smart home middleware where each appliance is able to learn user behavior and customize their actions by themselves as well as cooperate with other appliances through a more light-weight smart home gateway. As the key components, we present a knowledge base which describes common- and appliance-specific concepts in a smart home domain, and design libraries for smart appliances and a smart home gateway. We implement the proposed middleware on our testbed and conduct evaluations. The result shows that our scheme reduces the interaction time and the runtime memory allocation.
Abdullayev, Jalil; Shin, Byoungheon; Lee, Dongman
A Dynamic Packet Fragmentation Extension to High Throughput WLANs for Real-Time H264/AVC Video Streaming Proceedings Article
In: The 10th International Conference on Future Internet, pp. 1–4, Association for Computing Machinery, Seoul, Republic of Korea, 2015, ISBN: 9781450335645.
@inproceedings{10.1145/2775088.2775089,
title = {A Dynamic Packet Fragmentation Extension to High Throughput WLANs for Real-Time H264/AVC Video Streaming},
author = {Jalil Abdullayev and Byoungheon Shin and Dongman Lee},
url = {https://doi.org/10.1145/2775088.2775089},
doi = {10.1145/2775088.2775089},
isbn = {9781450335645},
year = {2015},
date = {2015-06-08},
urldate = {2015-01-01},
booktitle = {The 10th International Conference on Future Internet},
pages = {1–4},
publisher = {Association for Computing Machinery},
address = {Seoul, Republic of Korea},
series = {CFI '15},
abstract = {This paper proposes an extension to high throughput WLANs such as IEEE 802.11n and IEEE 802.11ac for efficient streaming of H264/AVC encoded videos. The main idea is to fragment IP packets containing several TS packets into smaller IP packets containing fewer TS packets which leads to higher transmission success rate and TS level prioritization of H264/AVC frames. Unlike existing fragmentation schemes, it is done without any modification to the MAC layer at the receiver side. Evaluation results show that the proposed scheme achieves up to 5 dB gain on PSNR and 3.5 times higher goodput than legacy WLANs.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes an extension to high throughput WLANs such as IEEE 802.11n and IEEE 802.11ac for efficient streaming of H264/AVC encoded videos. The main idea is to fragment IP packets containing several TS packets into smaller IP packets containing fewer TS packets which leads to higher transmission success rate and TS level prioritization of H264/AVC frames. Unlike existing fragmentation schemes, it is done without any modification to the MAC layer at the receiver side. Evaluation results show that the proposed scheme achieves up to 5 dB gain on PSNR and 3.5 times higher goodput than legacy WLANs.
Son, Heesuk; Kim, Byoungoh; Kim, Taehun; Lee, Dongman; Hyun, Soon-Joo
Sherlock-SD: A light-weight universal service discovery for Web of Things (WoT) services Proceedings Article
In: 2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC), pp. 276-282, 2015, ISSN: 2331-9860.
@inproceedings{7157989,
title = {Sherlock-SD: A light-weight universal service discovery for Web of Things (WoT) services},
author = {Heesuk Son and Byoungoh Kim and Taehun Kim and Dongman Lee and Soon-Joo Hyun},
url = {https://ieeexplore.ieee.org/document/7157989},
doi = {10.1109/CCNC.2015.7157989},
issn = {2331-9860},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
booktitle = {2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC)},
pages = {276-282},
abstract = {Since the Web of Things (WoT) term was first proposed, there has a big trend in IT vendors providing users with various services through their smart products. To enable users to discover and leverage these services, SDPs play an important role. However, so many variations of SDPs have been introduced it has caused a heterogeneity issue. Including standardization, many solutions have been proposed, but they require too much overhead or have practicality issues. In this paper, we propose a system composed of fundamental building blocks, including a knowledge base and probing packets to address this issue. We evaluate the performance of our system by conducting real world experiments using smart object services in a local network. The experiment results show that Sherlock-SD identifies up to 92% of target services correctly only with 3 probing packets out of 6 in the best case, without any of the overhead that existing solutions impose. In terms of resource consumption overhead, compared to 4 SDPs enumeration, Sherlock-SD requires 67.6% of the memory and consumes 30.7% of power.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Since the Web of Things (WoT) term was first proposed, there has a big trend in IT vendors providing users with various services through their smart products. To enable users to discover and leverage these services, SDPs play an important role. However, so many variations of SDPs have been introduced it has caused a heterogeneity issue. Including standardization, many solutions have been proposed, but they require too much overhead or have practicality issues. In this paper, we propose a system composed of fundamental building blocks, including a knowledge base and probing packets to address this issue. We evaluate the performance of our system by conducting real world experiments using smart object services in a local network. The experiment results show that Sherlock-SD identifies up to 92% of target services correctly only with 3 probing packets out of 6 in the best case, without any of the overhead that existing solutions impose. In terms of resource consumption overhead, compared to 4 SDPs enumeration, Sherlock-SD requires 67.6% of the memory and consumes 30.7% of power.
Choi, In-Kyung; Kim, Won-Sup; Lee, Dongman; Kwon, Dong-Soo
A Weighted QFD-Based Usability Evaluation Method for Elderly in Smart Cars Journal Article
In: International Journal of Human-Computer Interaction, vol. 31, pp. 703-716, 2015.
@article{articleb,
title = {A Weighted QFD-Based Usability Evaluation Method for Elderly in Smart Cars},
author = {In-Kyung Choi and Won-Sup Kim and Dongman Lee and Dong-Soo Kwon},
doi = {10.1080/10447318.2015.1070553},
year = {2015},
date = {2015-01-01},
journal = {International Journal of Human-Computer Interaction},
volume = {31},
pages = {703-716},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2014
Sandholm, Thomas; Lee, Dongman
Notes on Cloud computing principles Journal Article
In: Journal of Cloud Computing, vol. 3, 2014.
@article{Sandholm2014NotesOC,
title = {Notes on Cloud computing principles},
author = {Thomas Sandholm and Dongman Lee},
url = {https://api.semanticscholar.org/CorpusID:2050078},
year = {2014},
date = {2014-12-01},
urldate = {2014-01-01},
journal = {Journal of Cloud Computing},
volume = {3},
abstract = {This letter provides a review of fundamental distributed systems and economic Cloud computing principles. These principles are frequently deployed in their respective fields, but their interdependencies are often neglected. Given that Cloud Computing first and foremost is a new business model, a new model to sell computational resources, the understanding of these concepts is facilitated by treating them in unison. Here, we review some of the most important concepts and how they relate to each other.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This letter provides a review of fundamental distributed systems and economic Cloud computing principles. These principles are frequently deployed in their respective fields, but their interdependencies are often neglected. Given that Cloud Computing first and foremost is a new business model, a new model to sell computational resources, the understanding of these concepts is facilitated by treating them in unison. Here, we review some of the most important concepts and how they relate to each other.
Han, Seon Yeong; Shin, Byoungheon; Lee, Dongman
A fine-grain partial MAC virtualization to support cross layer design in wireless ad hoc networks Proceedings Article
In: 39th Annual IEEE Conference on Local Computer Networks, pp. 506-509, 2014, ISSN: 0742-1303.
@inproceedings{6925828,
title = {A fine-grain partial MAC virtualization to support cross layer design in wireless ad hoc networks},
author = {Seon Yeong Han and Byoungheon Shin and Dongman Lee},
url = {https://ieeexplore.ieee.org/document/6925828},
doi = {10.1109/LCN.2014.6925828},
issn = {0742-1303},
year = {2014},
date = {2014-09-01},
urldate = {2014-09-01},
booktitle = {39th Annual IEEE Conference on Local Computer Networks},
pages = {506-509},
abstract = {Cross layer approach is a promising technology to satisfy applications' fastidious requirements and maximize the wireless channel usage in wireless ad hoc networks. Existing cross layer architecture either adopts a specific MAC for an application type or does not change the MAC behavior because the MAC is commonly used for all types of applications in a node. MAC virtualization is an appropriate method to associate the MAC behavior with a specific application's requirement without impacting on other types of application. In this paper, we propose a partial MAC virtualization to support cross layer design in wireless ad hoc networks. In the proposed scheme, a MAC scheme is divided into a set of controllable condition variables and common MAC executor. A MAC control manager generates a virtual MAC with a set of controllable condition variables and related state variables. This paper also proposes an interface through which an application or an agent of the application can control the MAC for its own purpose, which allows a cross-layer mechanism for each application in a node. We show the feasibility of the proposed scheme by an example and experiments.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Cross layer approach is a promising technology to satisfy applications' fastidious requirements and maximize the wireless channel usage in wireless ad hoc networks. Existing cross layer architecture either adopts a specific MAC for an application type or does not change the MAC behavior because the MAC is commonly used for all types of applications in a node. MAC virtualization is an appropriate method to associate the MAC behavior with a specific application's requirement without impacting on other types of application. In this paper, we propose a partial MAC virtualization to support cross layer design in wireless ad hoc networks. In the proposed scheme, a MAC scheme is divided into a set of controllable condition variables and common MAC executor. A MAC control manager generates a virtual MAC with a set of controllable condition variables and related state variables. This paper also proposes an interface through which an application or an agent of the application can control the MAC for its own purpose, which allows a cross-layer mechanism for each application in a node. We show the feasibility of the proposed scheme by an example and experiments.
Shin, Byoungheon; Abdullayev, Jalil; Lee, Dongman
Cross-layer network parameterization for application-aware networking in wireless ad-hoc networks Proceedings Article
In: Proceedings of The Ninth International Conference on Future Internet Technologies, pp. 1-2, Association for Computing Machinery, Tokyo, Japan, 2014, ISBN: 9781450329422.
@inproceedings{10.1145/2619287.2619309,
title = {Cross-layer network parameterization for application-aware networking in wireless ad-hoc networks},
author = {Byoungheon Shin and Jalil Abdullayev and Dongman Lee},
url = {https://doi.org/10.1145/2619287.2619309},
doi = {10.1145/2619287.2619309},
isbn = {9781450329422},
year = {2014},
date = {2014-06-18},
urldate = {2014-01-01},
booktitle = {Proceedings of The Ninth International Conference on Future Internet Technologies},
number = {22},
pages = {1-2},
publisher = {Association for Computing Machinery},
address = {Tokyo, Japan},
series = {CFI '14},
abstract = {Cross-layer networking is a promising approach which provides an optimal routing solution for achieving the goal of a target application. However, existing cross-layer networking approaches mostly support only a specific application type and do not fully satisfy other application types because each application has distinguished network requirements. In this paper, we propose a paradigm that several network parameters in routing and MAC layers dynamically adapt to various applications by understanding their requirements. To achieve the paradigm, we propose a joint routing and MAC parameterization scheme which adapts to application requirements and changing network conditions.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Cross-layer networking is a promising approach which provides an optimal routing solution for achieving the goal of a target application. However, existing cross-layer networking approaches mostly support only a specific application type and do not fully satisfy other application types because each application has distinguished network requirements. In this paper, we propose a paradigm that several network parameters in routing and MAC layers dynamically adapt to various applications by understanding their requirements. To achieve the paradigm, we propose a joint routing and MAC parameterization scheme which adapts to application requirements and changing network conditions.
Han, Seon Yeong; Shin, Byoungheon; Lee, Dongman
An application-driven path discovery mechanism for MANET routing protocols Proceedings Article
In: 2014 IEEE International Conference on Communications (ICC), pp. 2822-2827, 2014, ISSN: 1938-1883.
@inproceedings{6883752,
title = {An application-driven path discovery mechanism for MANET routing protocols},
author = {Seon Yeong Han and Byoungheon Shin and Dongman Lee},
url = {https://ieeexplore.ieee.org/document/6883752},
doi = {10.1109/ICC.2014.6883752},
issn = {1938-1883},
year = {2014},
date = {2014-06-01},
urldate = {2014-06-01},
booktitle = {2014 IEEE International Conference on Communications (ICC)},
pages = {2822-2827},
abstract = {In mobile ad hoc networks (MANETs), a layered approach to networks makes a routing protocol to be responsible on discovery of a path between two nodes. However, this approach has fundamental limitations in diversifying the strategies of routing in a network when various types of applications require different routing support. In this paper, we propose an application-driven path discovery mechanism. In the proposed architecture, a routing packet controller resides in each MANET node and each application can control path discovery process by installing rules in the routing packet controller. Several examples are described to show the feasibility of our approach.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In mobile ad hoc networks (MANETs), a layered approach to networks makes a routing protocol to be responsible on discovery of a path between two nodes. However, this approach has fundamental limitations in diversifying the strategies of routing in a network when various types of applications require different routing support. In this paper, we propose an application-driven path discovery mechanism. In the proposed architecture, a routing packet controller resides in each MANET node and each application can control path discovery process by installing rules in the routing packet controller. Several examples are described to show the feasibility of our approach.
Kim, Byoungoh; Kim, Taehun; Lee, Dongman; Hyun, Soon
SpinRadar: A spontaneous service provision middleware for place-aware social interactions Journal Article
In: Personal and Ubiquitous Computing, vol. 18, 2014.
@article{article,
title = {SpinRadar: A spontaneous service provision middleware for place-aware social interactions},
author = {Byoungoh Kim and Taehun Kim and Dongman Lee and Soon Hyun},
url = {https://link.springer.com/article/10.1007/s00779-013-0659-x},
doi = {10.1007/s00779-013-0659-x},
year = {2014},
date = {2014-04-12},
urldate = {2014-01-01},
journal = {Personal and Ubiquitous Computing},
volume = {18},
abstract = {With the advancements of mobile phones and the integration of multiple communication interfaces, online social interaction between users is no longer restricted to a specific place with connectivity to the Internet but can happen anywhere and at any time. This has promoted the development of mobile social applications to enable opportunistic interactions with co-located users. One of the challenging problems in such interactions is to discover interaction opportunities with nearby users. Existing works focus on properties related to mobile users in order to find similar users in the surrounding area; these works depend on predefined logic such as conditional statements to recommend spontaneous social interaction opportunities. However, the social implications of the place in which the interaction is taking place are an important factor for recommendations, as those implications provide hints about the most plausible types of interactions among co-located users. In this work, we present a middleware called SpinRadar which is designed to support spontaneous interactions between co-located users by taking into account the semantics of a place, which we call ‘placeness.’ Our evaluation shows that the proposed scheme satisfies users much more than existing schemes.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
With the advancements of mobile phones and the integration of multiple communication interfaces, online social interaction between users is no longer restricted to a specific place with connectivity to the Internet but can happen anywhere and at any time. This has promoted the development of mobile social applications to enable opportunistic interactions with co-located users. One of the challenging problems in such interactions is to discover interaction opportunities with nearby users. Existing works focus on properties related to mobile users in order to find similar users in the surrounding area; these works depend on predefined logic such as conditional statements to recommend spontaneous social interaction opportunities. However, the social implications of the place in which the interaction is taking place are an important factor for recommendations, as those implications provide hints about the most plausible types of interactions among co-located users. In this work, we present a middleware called SpinRadar which is designed to support spontaneous interactions between co-located users by taking into account the semantics of a place, which we call ‘placeness.’ Our evaluation shows that the proposed scheme satisfies users much more than existing schemes.
Sandholm, Thomas; Lee, Dongman; Tegelund, Bjorn; Han, Seonyeong; Shin, Byoungheon; Kim, Byoungoh
CloudFridge: A Testbed for Smart Fridge Interactions Miscellaneous
2014.
@misc{sandholm2014cloudfridgetestbedsmartfridge,
title = {CloudFridge: A Testbed for Smart Fridge Interactions},
author = {Thomas Sandholm and Dongman Lee and Bjorn Tegelund and Seonyeong Han and Byoungheon Shin and Byoungoh Kim},
url = {https://doi.org/10.48550/arXiv.1401.0585},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
abstract = {We present a testbed for exploring novel smart refrigerator interactions, and identify three key adoption-limiting interaction shortcomings of state-of-the-art smart fridges: lack of 1) user experience focus, 2) low-intrusion object recognition and 2) automatic item position detection. Our testbed system addresses these limitations by a combination of sensors, software filters, architectural components and a RESTful API to track interaction events in real-time, and retrieve current state and historical data to learn patterns and recommend user actions. We evaluate the accuracy and overhead of our system in a realistic interaction flow. The accuracy was measured to 83-88% and the overhead compared to a representative state-of-the-art barcode scanner improved by 27%. We also showcase two applications built on top of our testbed, one for finding expired items and ingredients of dishes; and one to monitor your health. The pattern that these applications have in common is that they cast the interaction as an item-recommendation problem triggered when the user takes something out. Our testbed could help reveal further user-experience centric interaction patterns and new classes of applications for smart fridges that inherently, by relying on our testbed primitives, mitigate the issues with existing approaches.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
We present a testbed for exploring novel smart refrigerator interactions, and identify three key adoption-limiting interaction shortcomings of state-of-the-art smart fridges: lack of 1) user experience focus, 2) low-intrusion object recognition and 2) automatic item position detection. Our testbed system addresses these limitations by a combination of sensors, software filters, architectural components and a RESTful API to track interaction events in real-time, and retrieve current state and historical data to learn patterns and recommend user actions. We evaluate the accuracy and overhead of our system in a realistic interaction flow. The accuracy was measured to 83-88% and the overhead compared to a representative state-of-the-art barcode scanner improved by 27%. We also showcase two applications built on top of our testbed, one for finding expired items and ingredients of dishes; and one to monitor your health. The pattern that these applications have in common is that they cast the interaction as an item-recommendation problem triggered when the user takes something out. Our testbed could help reveal further user-experience centric interaction patterns and new classes of applications for smart fridges that inherently, by relying on our testbed primitives, mitigate the issues with existing approaches.
Ko, Han-Gyu; Kim, Taehun; Kim, Byoungoh; Lee, Dongman; Ko, In-Young; Hyun, Soon J.
Place-aware opportunistic service recommendation scheme in a smart space with Internet of Things Proceedings Article
In: 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC), pp. 477-482, 2014, ISSN: 2331-9860.
@inproceedings{6866613,
title = {Place-aware opportunistic service recommendation scheme in a smart space with Internet of Things},
author = {Han-Gyu Ko and Taehun Kim and Byoungoh Kim and Dongman Lee and In-Young Ko and Soon J. Hyun},
url = {https://ieeexplore.ieee.org/document/6866613},
doi = {10.1109/CCNC.2014.6866613},
issn = {2331-9860},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
booktitle = {2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)},
pages = {477-482},
abstract = {In this paper, we present an opportunistic service recommendation scheme in a place with smart objects to provide users with appropriate composite services to accomplish their task goals. The proposed scheme infers possible tasks from interactions that people have experienced with smart objects including other places that are similar to a given place. The proposed scheme then evaluates the candidate tasks by measuring quality satisfaction of each task against given QoS constraints. We test the proposed scheme on our three smart testbeds where various smart objects equipped. Experiment results show that the proposed scheme finds potential tasks in the testbeds in a reasonable time.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we present an opportunistic service recommendation scheme in a place with smart objects to provide users with appropriate composite services to accomplish their task goals. The proposed scheme infers possible tasks from interactions that people have experienced with smart objects including other places that are similar to a given place. The proposed scheme then evaluates the candidate tasks by measuring quality satisfaction of each task against given QoS constraints. We test the proposed scheme on our three smart testbeds where various smart objects equipped. Experiment results show that the proposed scheme finds potential tasks in the testbeds in a reasonable time.
Yoon, Wonyong; Lee, Dongman; Shin, Byoungheon; Han, Seon Yeong
Price-based congestion control and local channel-link assignment for multi-radio wireless mesh networks Journal Article
In: Computers & Electrical Engineering, vol. 40, no. 2, pp. 651-662, 2014, ISSN: 0045-7906.
@article{YOON2014651,
title = {Price-based congestion control and local channel-link assignment for multi-radio wireless mesh networks},
author = {Wonyong Yoon and Dongman Lee and Byoungheon Shin and Seon Yeong Han},
url = {https://www.sciencedirect.com/science/article/pii/S004579061300284X},
doi = {https://doi.org/10.1016/j.compeleceng.2013.11.002},
issn = {0045-7906},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Computers & Electrical Engineering},
volume = {40},
number = {2},
pages = {651-662},
abstract = {In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max–min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max–min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.
2013
Shin, Byoungheon; Han, Seon Yeong; Lee, Dongman; Yoon, Wonyong
Application-awareness support for QoS-aware routing protocols in wireless ad-hoc networks Proceedings Article
In: 2013 Fourth International Conference on the Network of the Future (NoF), pp. 1-5, 2013.
@inproceedings{6724507,
title = {Application-awareness support for QoS-aware routing protocols in wireless ad-hoc networks},
author = {Byoungheon Shin and Seon Yeong Han and Dongman Lee and Wonyong Yoon},
url = {https://ieeexplore.ieee.org/document/6724507},
doi = {10.1109/NOF.2013.6724507},
year = {2013},
date = {2013-10-01},
urldate = {2013-10-01},
booktitle = {2013 Fourth International Conference on the Network of the Future (NoF)},
pages = {1-5},
abstract = {In order to support QoS in wireless ad-hoc networks, each node needs to monitor the network status and to determine whether the current network status satisfies the requirements of an application or not. Since the network requirements on an intermediate node are usually different from those on the end nodes, there is a need to convert the application requirement into a hop-by-hop network requirement. This paper induces link validation formulas for each node to determine if a link can satisfy the requirement of a specific application. The simulation results show the effectiveness of application-awareness on discovering appropriate routes for a specific application type in wireless ad-hoc networks.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In order to support QoS in wireless ad-hoc networks, each node needs to monitor the network status and to determine whether the current network status satisfies the requirements of an application or not. Since the network requirements on an intermediate node are usually different from those on the end nodes, there is a need to convert the application requirement into a hop-by-hop network requirement. This paper induces link validation formulas for each node to determine if a link can satisfy the requirement of a specific application. The simulation results show the effectiveness of application-awareness on discovering appropriate routes for a specific application type in wireless ad-hoc networks.
Son, Heesuk; Kim, Byoungoh; Kim, Taehun; Lee, Dongman; Hyun, Soon Joo
SemanticRadar: AR-Based Pervasive Interaction Support via Semantic Communications Proceedings Article
In: Streitz, Norbert; Stephanidis, Constantine (Ed.): Distributed, Ambient, and Pervasive Interactions. DAPI 2013. Lecture Notes in Computer Science,, pp. 163–172, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, ISBN: 978-3-642-39351-8.
@inproceedings{10.1007/978-3-642-39351-8_19,
title = {SemanticRadar: AR-Based Pervasive Interaction Support via Semantic Communications},
author = {Heesuk Son and Byoungoh Kim and Taehun Kim and Dongman Lee and Soon Joo Hyun},
editor = {Norbert Streitz and Constantine Stephanidis},
url = {https://doi.org/10.1007/978-3-642-39351-8_19},
doi = {10.1007/978-3-642-39351-8_19},
isbn = {978-3-642-39351-8},
year = {2013},
date = {2013-07-26},
urldate = {2013-07-26},
booktitle = {Distributed, Ambient, and Pervasive Interactions. DAPI 2013. Lecture Notes in Computer Science,},
volume = {8028},
pages = {163–172},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
abstract = {Augmented Reality (AR) overlays relevant virtual information onto a real world view and allows the user to interact and virtually manipulate surroundings. Since virtual information resides not only in a virtual space, but also in a physical space, users can be spontaneously given a number of opportunities for enriched interactions with their environments. In this paper, we propose an AR-based pervasive interaction support, SemanticRadar, which allows a user to spontaneously interact with smart objects through semantic communications, leveraging the placeness of a user's current location.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Augmented Reality (AR) overlays relevant virtual information onto a real world view and allows the user to interact and virtually manipulate surroundings. Since virtual information resides not only in a virtual space, but also in a physical space, users can be spontaneously given a number of opportunities for enriched interactions with their environments. In this paper, we propose an AR-based pervasive interaction support, SemanticRadar, which allows a user to spontaneously interact with smart objects through semantic communications, leveraging the placeness of a user's current location.
Huerta-Canepa, Gonzalo; Han, Seungwook; Lee, Dongman; Kim, Byoungoh
A Place-Aware Stereotypical Trust Supporting Scheme Proceedings Article
In: 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, pp. 821-828, 2013, ISSN: 2324-9013.
@inproceedings{6680920,
title = {A Place-Aware Stereotypical Trust Supporting Scheme},
author = {Gonzalo Huerta-Canepa and Seungwook Han and Dongman Lee and Byoungoh Kim},
url = {https://ieeexplore.ieee.org/document/6680920},
doi = {10.1109/TrustCom.2013.100},
issn = {2324-9013},
year = {2013},
date = {2013-07-01},
urldate = {2013-07-01},
booktitle = {2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications},
pages = {821-828},
abstract = {Proliferation of smartphones enables interaction among nearby users anywhere, anytime. Despite that these interaction opportunities may provide benefit to users, they also involve risks since nearby users may not be known. In this paper, we propose a decentralized stereotypical trust model that supports variation in human behavior based on context changes, specifically place. We leverage previous studies that show how the place of interaction affects the level of trust of users and applied them to a stereotypical trust scheme. Our results show that the proposed scheme not only performs faster in terms of stereotypes creation time (average 200% faster) but also reduces the rate of regarding a malicious user as a trustworthy one (average 75%) when compared to existing approach.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Proliferation of smartphones enables interaction among nearby users anywhere, anytime. Despite that these interaction opportunities may provide benefit to users, they also involve risks since nearby users may not be known. In this paper, we propose a decentralized stereotypical trust model that supports variation in human behavior based on context changes, specifically place. We leverage previous studies that show how the place of interaction affects the level of trust of users and applied them to a stereotypical trust scheme. Our results show that the proposed scheme not only performs faster in terms of stereotypes creation time (average 200% faster) but also reduces the rate of regarding a malicious user as a trustworthy one (average 75%) when compared to existing approach.
Han, Seon Yeong; Lee, Dongman
An Adaptive Hello Messaging Scheme for Neighbor Discovery in On-Demand MANET Routing Protocols Journal Article
In: IEEE Communications Letters, vol. 17, no. 5, pp. 1040-1043, 2013, ISSN: 1558-2558.
@article{6496994,
title = {An Adaptive Hello Messaging Scheme for Neighbor Discovery in On-Demand MANET Routing Protocols},
author = {Seon Yeong Han and Dongman Lee},
url = {https://ieeexplore.ieee.org/document/6496994},
doi = {10.1109/LCOMM.2013.040213.130076},
issn = {1558-2558},
year = {2013},
date = {2013-05-01},
urldate = {2013-05-01},
journal = {IEEE Communications Letters},
volume = {17},
number = {5},
pages = {1040-1043},
abstract = {In mobile ad-hoc networks, local link connectivity information is extremely important for route establishment and maintenance. Periodic Hello messaging is a widely-used scheme to obtain local link connectivity information. However, unnecessary Hello messaging can drain batteries while mobile devices are not in use. This paper proposes an adaptive Hello messaging scheme to suppress unnecessary Hello messages without reduced detectability of broken links. Simulation results show that the proposed scheme reduces energy consumption and network overhead without any explicit difference in throughput.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In mobile ad-hoc networks, local link connectivity information is extremely important for route establishment and maintenance. Periodic Hello messaging is a widely-used scheme to obtain local link connectivity information. However, unnecessary Hello messaging can drain batteries while mobile devices are not in use. This paper proposes an adaptive Hello messaging scheme to suppress unnecessary Hello messages without reduced detectability of broken links. Simulation results show that the proposed scheme reduces energy consumption and network overhead without any explicit difference in throughput.
Han, Seon Yeong; Abu-Ghazaleh, Nael B.; Lee, Dongman
Double Regression: Efficient spatially correlated path loss model for wireless network simulation Proceedings Article
In: 2013 Proceedings IEEE INFOCOM, pp. 1824-1832, 2013, ISSN: 0743-166X.
@inproceedings{6566981,
title = {Double Regression: Efficient spatially correlated path loss model for wireless network simulation},
author = {Seon Yeong Han and Nael B. Abu-Ghazaleh and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/6566981},
doi = {10.1109/INFCOM.2013.6566981},
issn = {0743-166X},
year = {2013},
date = {2013-04-01},
urldate = {2013-04-01},
booktitle = {2013 Proceedings IEEE INFOCOM},
pages = {1824-1832},
abstract = {The accuracy of wireless network packet simulation critically depends on the quality of the wireless channel models. These models directly affect the fundamental network characteristics, such as link quality, transmission range, and capture effect, as well as their dynamic variation in time and space. Path loss is the stationary component of the channel model affected by the shadowing in the environment. Existing path loss models are inaccurate, require very high measurement or computational overhead, and/or often cannot be made to represent a given environment. The paper contributes a flexible path loss model that uses a novel approach for spatially coherent interpolation from available nearby channels to allow accurate and efficient modeling of path loss. We show that the proposed model, called Double Regression (DR), generates a correlated space, allowing both the sender and the receiver to move without abrupt change in path loss. Combining DR with a traditional temporal fading model, such as Rayleigh fading, provides an accurate and efficient channel model that we integrate with the NS-2 simulator. We use measurements to validate the accuracy of the model for a number of scenarios. We also show that there is substantial impact on simulation behavior (e.g., up to 600% difference in throughput for simple scenarios) when path loss is modeled accurately.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The accuracy of wireless network packet simulation critically depends on the quality of the wireless channel models. These models directly affect the fundamental network characteristics, such as link quality, transmission range, and capture effect, as well as their dynamic variation in time and space. Path loss is the stationary component of the channel model affected by the shadowing in the environment. Existing path loss models are inaccurate, require very high measurement or computational overhead, and/or often cannot be made to represent a given environment. The paper contributes a flexible path loss model that uses a novel approach for spatially coherent interpolation from available nearby channels to allow accurate and efficient modeling of path loss. We show that the proposed model, called Double Regression (DR), generates a correlated space, allowing both the sender and the receiver to move without abrupt change in path loss. Combining DR with a traditional temporal fading model, such as Rayleigh fading, provides an accurate and efficient channel model that we integrate with the NS-2 simulator. We use measurements to validate the accuracy of the model for a number of scenarios. We also show that there is substantial impact on simulation behavior (e.g., up to 600% difference in throughput for simple scenarios) when path loss is modeled accurately.
Boettcher, Alexander; Lee, Dongman
Eventradar: A real-time local event detection scheme using twitter stream Proceedings Article
In: 2012 IEEE International Conference on Green Computing and Communications, pp. 358–367, IEEE 2013.
@inproceedings{boettcher2012eventradarb,
title = {Eventradar: A real-time local event detection scheme using twitter stream},
author = {Boettcher, Alexander and Lee, Dongman},
year = {2013},
date = {2013-02-25},
urldate = {2013-02-25},
booktitle = {2012 IEEE International Conference on Green Computing and Communications},
pages = {358–367},
organization = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Hammash, Deema; Kim, Myungchul; Lee, Ben; Kang, Sungwon; Lee, Younghee; Lee, Dongman
HIAM: hidden node and interference aware routing metric for multi-channel multi-radio mesh networks Proceedings Article
In: Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, pp. 1-10, Association for Computing Machinery, Kota Kinabalu, Malaysia, 2013, ISBN: 9781450319584.
@inproceedings{10.1145/2448556.2448663,
title = {HIAM: hidden node and interference aware routing metric for multi-channel multi-radio mesh networks},
author = {Deema Hammash and Myungchul Kim and Ben Lee and Sungwon Kang and Younghee Lee and Dongman Lee},
url = {https://doi.org/10.1145/2448556.2448663},
doi = {10.1145/2448556.2448663},
isbn = {9781450319584},
year = {2013},
date = {2013-01-17},
urldate = {2013-01-17},
booktitle = {Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication},
number = {107},
pages = {1-10},
publisher = {Association for Computing Machinery},
address = {Kota Kinabalu, Malaysia},
series = {ICUIMC '13},
abstract = {In wireless mesh networks, throughput degrades drastically as the network size grows mainly due to the hidden node problem and carrier sense interference. These phenomena can be avoided in multi-channel, multi-radio mesh networks by choosing a path consisting of channels in which the two problems can be mitigated. This paper proposes a new routing metric, the Hidden node and Interference Aware routing Metric (HIAM), which considers both problems when choosing paths. The effect of the hidden node problem for a path is represented by estimating the packet transmission time with respect to the number of collisions that can occur due to hidden nodes. The effect of carrier sense interference for a path is represented by estimating the packet transmission time with respect to inter-flow and intra-flow interference. Our simulation results show that HIAM results in significantly higher routing stability and throughput, and lower control packet overhead than the existing methods.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In wireless mesh networks, throughput degrades drastically as the network size grows mainly due to the hidden node problem and carrier sense interference. These phenomena can be avoided in multi-channel, multi-radio mesh networks by choosing a path consisting of channels in which the two problems can be mitigated. This paper proposes a new routing metric, the Hidden node and Interference Aware routing Metric (HIAM), which considers both problems when choosing paths. The effect of the hidden node problem for a path is represented by estimating the packet transmission time with respect to the number of collisions that can occur due to hidden nodes. The effect of carrier sense interference for a path is represented by estimating the packet transmission time with respect to inter-flow and intra-flow interference. Our simulation results show that HIAM results in significantly higher routing stability and throughput, and lower control packet overhead than the existing methods.
Kim, Byoungoh; Kim, Taehun; Ko, Han-Gyu; Lee, Dongman; Hyun, Soon J.; Ko, In-Young
Personal genie: a distributed framework for spontaneous interaction support with smart objects in a place Proceedings Article
In: Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, pp. 1-10, Association for Computing Machinery, Kota Kinabalu, Malaysia, 2013, ISBN: 9781450319584.
@inproceedings{10.1145/2448556.2448653,
title = {Personal genie: a distributed framework for spontaneous interaction support with smart objects in a place},
author = {Byoungoh Kim and Taehun Kim and Han-Gyu Ko and Dongman Lee and Soon J. Hyun and In-Young Ko},
url = {https://doi.org/10.1145/2448556.2448653},
doi = {10.1145/2448556.2448653},
isbn = {9781450319584},
year = {2013},
date = {2013-01-17},
urldate = {2013-01-01},
booktitle = {Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication},
number = {97},
pages = {1-10},
publisher = {Association for Computing Machinery},
address = {Kota Kinabalu, Malaysia},
series = {ICUIMC '13},
abstract = {With advancements on computing devices and the integration of multiple communication interfaces, everyday objects become interconnected with each other through the Internet – so called Internet of Things (IoT). As filled with these smart objects, many of public places are getting smarter and users utilize proper services by means of smart objects. While the services can be provided based on certain servers, it's hard to expect that there are local servers for public places. In this paper, we present a distributed middleware framework for spontaneous interaction with smart objects, Personal Genie, which supports smart object discovery, selective context acquisition, situation inference and task suggestion, task composition, and distributed task execution with a smartphone as the center. With Personal Genie, heterogeneous smart objects in a public place can collaborate to interpret current situations and provide necessary services and information to users. As a proof of concept, we build up a smart seminar room as a testbed of Personal Genie and implement a series of tasks upon the testbed for evaluation and show performance assessments with example scenarios.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
With advancements on computing devices and the integration of multiple communication interfaces, everyday objects become interconnected with each other through the Internet – so called Internet of Things (IoT). As filled with these smart objects, many of public places are getting smarter and users utilize proper services by means of smart objects. While the services can be provided based on certain servers, it's hard to expect that there are local servers for public places. In this paper, we present a distributed middleware framework for spontaneous interaction with smart objects, Personal Genie, which supports smart object discovery, selective context acquisition, situation inference and task suggestion, task composition, and distributed task execution with a smartphone as the center. With Personal Genie, heterogeneous smart objects in a public place can collaborate to interpret current situations and provide necessary services and information to users. As a proof of concept, we build up a smart seminar room as a testbed of Personal Genie and implement a series of tasks upon the testbed for evaluation and show performance assessments with example scenarios.
Ko, Han-Gyu; Ko, In-Young; Kim, Taehun; Lee, Dongman; Hyun, Soon J.
Identifying User Interests from Online Social Networks by Using Semantic Clusters Generated from Linked Data Proceedings Article
In: Revised Selected Papers of the ICWE 2013 International Workshops on Current Trends in Web Engineering, pp. 302–309, Springer-Verlag, Berlin, Heidelberg, 2013, ISBN: 9783319042435.
@inproceedings{10.1007/978-3-319-04244-2_27,
title = {Identifying User Interests from Online Social Networks by Using Semantic Clusters Generated from Linked Data},
author = {Han-Gyu Ko and In-Young Ko and Taehun Kim and Dongman Lee and Soon J. Hyun},
url = {https://doi.org/10.1007/978-3-319-04244-2_27},
doi = {10.1007/978-3-319-04244-2_27},
isbn = {9783319042435},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
booktitle = {Revised Selected Papers of the ICWE 2013 International Workshops on Current Trends in Web Engineering},
volume = {8295},
pages = {302–309},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
abstract = {Recently, online social network services (SNSs) are being spotlighted as a means to understand users' implicit interests out of abundant online social information. Since SNS contents such as message posts and comments are however less informative comparing with news articles and blog posts, it is difficult to identify users' implicit interests by analyzing the topics of the SNS contents of users. In this paper, we propose a semantic cluster based method of combining SNS contents with Linked Data. By traversing and merging relevant concepts, the proposed method expands keywords that are helpful to understand the topic similarity between SNS contents. By using Facebook data, we demonstrate that the proposed method increases the coverage of potential interests by 28.85% and the user satisfaction by 17.24% compared to existing works.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Recently, online social network services (SNSs) are being spotlighted as a means to understand users' implicit interests out of abundant online social information. Since SNS contents such as message posts and comments are however less informative comparing with news articles and blog posts, it is difficult to identify users' implicit interests by analyzing the topics of the SNS contents of users. In this paper, we propose a semantic cluster based method of combining SNS contents with Linked Data. By traversing and merging relevant concepts, the proposed method expands keywords that are helpful to understand the topic similarity between SNS contents. By using Facebook data, we demonstrate that the proposed method increases the coverage of potential interests by 28.85% and the user satisfaction by 17.24% compared to existing works.
2012
Shin, Byoungheon; Han, Seon Yeong; Lee, Dongman
Application-aware self-reconfigurable routing support for multi-radio MANET protocols Proceedings Article
In: Proceedings of the 7th International Conference on Future Internet Technologies, pp. 50–50, 2012.
@inproceedings{shin2012applicationb,
title = {Application-aware self-reconfigurable routing support for multi-radio MANET protocols},
author = {Byoungheon Shin and Seon Yeong Han and Dongman Lee},
url = {https://dl.acm.org/doi/abs/10.1145/2377310.2377330},
doi = {10.1145/2377310.2377330},
year = {2012},
date = {2012-09-11},
urldate = {2012-09-11},
booktitle = {Proceedings of the 7th International Conference on Future Internet Technologies},
pages = {50–50},
abstract = {Recently, dynamic reconfiguration of routes using link quality metrics is required to support application requirements such as throughput or jitter in dynamically changing environments in mobile ad-hoc networks (MANETs). Since multiple types of applications will be running over a MANET, the route reconfiguration should be aware of application characteristics and requirements rather than a single application type. We propose an application-aware self-reconfiguration scheme for multi-radio routing protocols that supports distinguished route reconfiguration for each application type. The detection of a deteriorated link and the selection of an alternative link are done separately based on application types and the bandwidth requirement.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Recently, dynamic reconfiguration of routes using link quality metrics is required to support application requirements such as throughput or jitter in dynamically changing environments in mobile ad-hoc networks (MANETs). Since multiple types of applications will be running over a MANET, the route reconfiguration should be aware of application characteristics and requirements rather than a single application type. We propose an application-aware self-reconfiguration scheme for multi-radio routing protocols that supports distinguished route reconfiguration for each application type. The detection of a deteriorated link and the selection of an alternative link are done separately based on application types and the bandwidth requirement.
Son, Heesuk; Han, Seungwook; Lee, Dongman
Contextual information provision on augmented reality with iot-based semantic communication Proceedings Article
In: 2012 International Symposium on Ubiquitous Virtual Reality, pp. 46–49, IEEE 2012, ISBN: 978-1-4673-2258-4.
@inproceedings{son2012contextual,
title = {Contextual information provision on augmented reality with iot-based semantic communication},
author = {Son, Heesuk and Han, Seungwook and Lee, Dongman},
url = {https://ieeexplore.ieee.org/abstract/document/6296807},
doi = {10.1109/ISUVR.2012.22},
isbn = {978-1-4673-2258-4},
year = {2012},
date = {2012-09-10},
urldate = {2012-09-10},
booktitle = {2012 International Symposium on Ubiquitous Virtual Reality},
pages = {46–49},
organization = {IEEE},
abstract = {During the last decades, a number of researches have been focusing on contextual information provisioning in ubiquitous environment. Among many research works from them, AR and IoT are recently getting many attentions as promising technologies for next generation of contextual information provisioning and invested for their potentials. However, current ARUI for real world browsing has limitations that it doesn't take care of variability on meanings of things depending on contexts. AR as well as IoT field has many issues to address this problem, but one of the most fundamental challenges is how to synthesize exploding information in IoT environment and which information to view on ARUI out of them. To address this problem, we suggest IoT platform side communication scheme, semantic communication, as a core component and its architecture based on design considerations. To provide situation-appropriate contextual information over the whole system with ARUI, we're currently collaborating with other Vision and UI groups and expecting to expand the dimension of contextual information to be provided to users.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
During the last decades, a number of researches have been focusing on contextual information provisioning in ubiquitous environment. Among many research works from them, AR and IoT are recently getting many attentions as promising technologies for next generation of contextual information provisioning and invested for their potentials. However, current ARUI for real world browsing has limitations that it doesn't take care of variability on meanings of things depending on contexts. AR as well as IoT field has many issues to address this problem, but one of the most fundamental challenges is how to synthesize exploding information in IoT environment and which information to view on ARUI out of them. To address this problem, we suggest IoT platform side communication scheme, semantic communication, as a core component and its architecture based on design considerations. To provide situation-appropriate contextual information over the whole system with ARUI, we're currently collaborating with other Vision and UI groups and expecting to expand the dimension of contextual information to be provided to users.
Gaete-Villegas, Jorge; Cha, Meeyoung; Lee, Dongman; Ko, In-Young
Tramsnet: A mobile social network application for tourism Proceedings Article
In: Proceedings of the 2012 ACM Conference on Ubiquitous Computing, pp. 1004–1011, 2012.
@inproceedings{gaete2012tramsnet,
title = {Tramsnet: A mobile social network application for tourism},
author = {Gaete-Villegas, Jorge and Cha, Meeyoung and Lee, Dongman and Ko, In-Young},
url = {https://dl.acm.org/doi/abs/10.1145/2370216.2370433},
doi = {10.1145/2370216.2370433},
year = {2012},
date = {2012-09-05},
urldate = {2012-09-05},
booktitle = {Proceedings of the 2012 ACM Conference on Ubiquitous Computing},
pages = {1004–1011},
abstract = {By leveraging location data in online social networks, Location-based Social Networks (LBSNs) can support diverse human activities such as tourism. Different applications aim to aid tourists and provide better experience in their travels by matching co-located users based on what they have in common. However, users with little in common but with potential to help each other given the context and place could not be matched. In this paper we introduce traMSNet, a LBSN that implements a matching algorithm considering homophily, as well as users complementary skills in a touristic location. Our idea is validated with a survey that asked potential travelers about their needs when looking for a travel partner. Moreover, we present a matching algorithm that is evaluated it with real tourists. The evaluation shows that considering complementarity when matching individuals is preferred by users. Therefore, by only considering similarities, important issues are left aside.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
By leveraging location data in online social networks, Location-based Social Networks (LBSNs) can support diverse human activities such as tourism. Different applications aim to aid tourists and provide better experience in their travels by matching co-located users based on what they have in common. However, users with little in common but with potential to help each other given the context and place could not be matched. In this paper we introduce traMSNet, a LBSN that implements a matching algorithm considering homophily, as well as users complementary skills in a touristic location. Our idea is validated with a survey that asked potential travelers about their needs when looking for a travel partner. Moreover, we present a matching algorithm that is evaluated it with real tourists. The evaluation shows that considering complementarity when matching individuals is preferred by users. Therefore, by only considering similarities, important issues are left aside.
Pushp, Saumay; Cho, Tae Hun; Han, Jongwon; Lee, Dongman; Song, Junehwa; Choi, Sunghee
An efficient way to track peers in mobile P2P network Proceedings Article
In: Proceedings of the 18th annual international conference on Mobile computing and networking, pp. 431–434, 2012.
@inproceedings{pushp2012efficient,
title = {An efficient way to track peers in mobile P2P network},
author = {Pushp, Saumay and Cho, Tae Hun and Han, Jongwon and Lee, Dongman and Song, Junehwa and Choi, Sunghee},
url = {https://dl.acm.org/doi/abs/10.1145/2348543.2348602},
doi = {10.1145/2348543.2348602},
year = {2012},
date = {2012-08-22},
urldate = {2012-08-22},
booktitle = {Proceedings of the 18th annual international conference on Mobile computing and networking},
pages = {431–434},
abstract = {In this paper, we propose a new class of message routing scheme for a distributed network which can scale up to the needs of a very large number of mobile users. We leverage the work in the GeoKad paper which uses the Distributed Geographic Table, allowing node retrieval from resources that are close to any given region. The paper addresses the problem regarding efficient message passing and peer misses. We propose a new routing scheme that addresses this kind of limitation. In fact, the problem can be solved in two ways, either by preserving the state of peer and further use a prediction algorithm or by better message routing. The proposed scheme is based on swarm intelligence (SI) and its attribute of exploit and explore. We leverage the statistical properties of time-varying network connectivity for opportunistic message forwarding. Considering the present 3G or Wi-Fi environment this approach can also help in optimizing energy as it can prevent query over flooding which is mostly encountered in such network scenarios.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we propose a new class of message routing scheme for a distributed network which can scale up to the needs of a very large number of mobile users. We leverage the work in the GeoKad paper which uses the Distributed Geographic Table, allowing node retrieval from resources that are close to any given region. The paper addresses the problem regarding efficient message passing and peer misses. We propose a new routing scheme that addresses this kind of limitation. In fact, the problem can be solved in two ways, either by preserving the state of peer and further use a prediction algorithm or by better message routing. The proposed scheme is based on swarm intelligence (SI) and its attribute of exploit and explore. We leverage the statistical properties of time-varying network connectivity for opportunistic message forwarding. Considering the present 3G or Wi-Fi environment this approach can also help in optimizing energy as it can prevent query over flooding which is mostly encountered in such network scenarios.
Shin, Byoungheon; Han, Seon Yeong; Lee, Dongman
Dynamic link quality aware routing protocol for multi-radio wireless mesh networks Proceedings Article
In: 2012 IEEE 26th International Conference on Advanced Information Networking and Applications, pp. 44–50, IEEE 2012, ISBN: 978-1-4673-0714-7.
@inproceedings{shin2012dynamic,
title = {Dynamic link quality aware routing protocol for multi-radio wireless mesh networks},
author = {Byoungheon Shin and Seon Yeong Han and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/6184851},
doi = {10.1109/AINA.2012.67},
isbn = {978-1-4673-0714-7},
year = {2012},
date = {2012-04-19},
urldate = {2012-04-19},
booktitle = {2012 IEEE 26th International Conference on Advanced Information Networking and Applications},
pages = {44–50},
organization = {IEEE},
abstract = {Wireless mesh networks (WMNs) are promising networks in the future Internet environments due to their self-configuration and ease of deployment. Although streaming and real time applications are possible using current mobile devices, these applications still suffer from low quality. Because link failures are not reported in congested situations, the existing routing protocols do not capture these deteriorations. An extension of the AODV-MR that is adaptive to changes in link quality is proposed in order to detect deteriorated situations and to recover the path in WMNs. The path is recovered proactively by route discovery if the quality difference of the current link and other available links exceeds the threshold which is determined by the network status. The simulation results demonstrate that the proposed method is effective in multi-radio WMNs and achieve higher throughput, lower average jitter, and lower end-to-end delay.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Wireless mesh networks (WMNs) are promising networks in the future Internet environments due to their self-configuration and ease of deployment. Although streaming and real time applications are possible using current mobile devices, these applications still suffer from low quality. Because link failures are not reported in congested situations, the existing routing protocols do not capture these deteriorations. An extension of the AODV-MR that is adaptive to changes in link quality is proposed in order to detect deteriorated situations and to recover the path in WMNs. The path is recovered proactively by route discovery if the quality difference of the current link and other available links exceeds the threshold which is determined by the network status. The simulation results demonstrate that the proposed method is effective in multi-radio WMNs and achieve higher throughput, lower average jitter, and lower end-to-end delay.
Lee, Dongman; Ko, Yangwoo
Mobile Communication Terminal and Network System Including the Same Miscellaneous
2012, (US Patent App. 12/874,466).
@misc{lee2012mobile,
title = {Mobile Communication Terminal and Network System Including the Same},
author = {Dongman Lee and Yangwoo Ko},
url = {https://patents.google.com/patent/US20120059928A1/en},
year = {2012},
date = {2012-03-01},
urldate = {2012-03-01},
publisher = {Google Patents},
abstract = {A mobile communication terminal includes a network knowledge manager collecting information required to seize an opportunity to execute an application by forming a network with a plurality of mobile communication terminals, and when a condition for executing a specific application is satisfied through the collected information, informing that the condition is satisfied, and a network instance manager generating a network instance which is a component of a network supporting the specific application, and performs management of the generated network instance including maintenance of the network instance when the specific application is executed by the network knowledge manager. A network can be promptly and ephemerally formed for a plurality of mobile communication terminals including smart phones to execute one application simultaneously, thereby reducing network management traffic required to form and maintain the network.},
note = {US Patent App. 12/874,466},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
A mobile communication terminal includes a network knowledge manager collecting information required to seize an opportunity to execute an application by forming a network with a plurality of mobile communication terminals, and when a condition for executing a specific application is satisfied through the collected information, informing that the condition is satisfied, and a network instance manager generating a network instance which is a component of a network supporting the specific application, and performs management of the generated network instance including maintenance of the network instance when the specific application is executed by the network knowledge manager. A network can be promptly and ephemerally formed for a plurality of mobile communication terminals including smart phones to execute one application simultaneously, thereby reducing network management traffic required to form and maintain the network.
Kim, Taehyun; Huerta-Canepa, Gonzalo; Park, Jongheon; Hyun, Soon J; Lee, Dongman
What's happening: Finding spontaneous user clusters nearby using twitter Proceedings Article
In: 2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third International Conference on Social Computing, pp. 806–809, IEEE 2012, ISBN: 978-1-4577-1931-8.
@inproceedings{kim2011s,
title = {What's happening: Finding spontaneous user clusters nearby using twitter},
author = {Kim, Taehyun and Huerta-Canepa, Gonzalo and Park, Jongheon and Hyun, Soon J and Lee, Dongman},
url = {https://ieeexplore.ieee.org/abstract/document/6113220},
doi = {10.1109/PASSAT/SocialCom.2011.135},
isbn = {978-1-4577-1931-8},
year = {2012},
date = {2012-01-02},
urldate = {2012-01-02},
booktitle = {2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third International Conference on Social Computing},
pages = {806–809},
organization = {IEEE},
abstract = {Twitter is a public social service that allows users to share information as short-text messages. Previous researchers have tried to analyze the information available on Twitter to discover topic trending. However, these topics are associated with the whole network, and are not associated to a particular place. In this work, we propose a scheme to discover places where something is happening by analyzing geo-tagged tweets in a timely manner. By using the proposed scheme, users will be able to recognize spontaneous events happening nearby, and be notified about it through their smart phones. Experimental results show that by using geo-tagged information associated to tweets, events related to a particular place can be detected using clustering techniques and semantic interpretation of keywords.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Twitter is a public social service that allows users to share information as short-text messages. Previous researchers have tried to analyze the information available on Twitter to discover topic trending. However, these topics are associated with the whole network, and are not associated to a particular place. In this work, we propose a scheme to discover places where something is happening by analyzing geo-tagged tweets in a timely manner. By using the proposed scheme, users will be able to recognize spontaneous events happening nearby, and be notified about it through their smart phones. Experimental results show that by using geo-tagged information associated to tweets, events related to a particular place can be detected using clustering techniques and semantic interpretation of keywords.
Huerta-Canepa, Gonzalo; Lee, Dongman; Han, Seon Yeong
Trust me: A trust decision framework for mobile environments Proceedings Article
In: 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, pp. 464–471, IEEE 2012, ISBN: 978-1-4577-2135-9.
@inproceedings{huerta2011trust,
title = {Trust me: A trust decision framework for mobile environments},
author = {Gonzalo Huerta-Canepa and Dongman Lee and Seon Yeong Han},
url = {https://ieeexplore.ieee.org/abstract/document/6120853},
doi = {10.1109/TrustCom.2011.60},
isbn = {978-1-4577-2135-9},
year = {2012},
date = {2012-01-02},
urldate = {2012-01-02},
booktitle = {2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications},
pages = {464–471},
organization = {IEEE},
abstract = {Recent advancement in smart phones enables users to collaborate in mobile environments. Their diverse communication interfaces allow them to interact with nearby devices, enabling the sharing of computing capabilities and resources among collocated users. Given the personal nature of smart phones, the selection of trustworthy users must be incorporated to enable this sharing process. In this work, a context-aware trust decision scheme for mobile ad-hoc environments is presented. This scheme is decentralized as uses information acquired by mobile phones, while leveraging social theories to reflect real-life aspects properly. The proposed scheme is validated against required properties of trust decision schemes for mobile ad-hoc environments.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Recent advancement in smart phones enables users to collaborate in mobile environments. Their diverse communication interfaces allow them to interact with nearby devices, enabling the sharing of computing capabilities and resources among collocated users. Given the personal nature of smart phones, the selection of trustworthy users must be incorporated to enable this sharing process. In this work, a context-aware trust decision scheme for mobile ad-hoc environments is presented. This scheme is decentralized as uses information acquired by mobile phones, while leveraging social theories to reflect real-life aspects properly. The proposed scheme is validated against required properties of trust decision schemes for mobile ad-hoc environments.
Kim, Byoungoh; Huerta-Canepa, Gonzalo; Lee, Dongman
Urban Radar: An Enabler for Place-Aware Spontaneous Interactions Proceedings Article
In: 2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third International Conference on Social Computing, pp. 595–598, IEEE 2012, ISBN: 978-1-4577-1931-8.
@inproceedings{kim2011urban,
title = {Urban Radar: An Enabler for Place-Aware Spontaneous Interactions},
author = {Byoungoh Kim and Gonzalo Huerta-Canepa and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/6113176},
doi = {10.1109/PASSAT/SocialCom.2011.115},
isbn = {978-1-4577-1931-8},
year = {2012},
date = {2012-01-02},
urldate = {2012-01-02},
booktitle = {2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third International Conference on Social Computing},
pages = {595–598},
organization = {IEEE},
abstract = {With the advancements on mobile phones and the integration of multiple communication interfaces, interaction between users is no longer restricted to spaces with connectivity with the Internet but can happen anywhere, anytime. This has promoted the development of frameworks to enable the interaction of co-located users. One of the challenging points of this interaction is to find similar and trustable users to interact with. Existing works focus mostly on properties related to mobile users to find similar users in the surroundings. However, the features of the space in which the interaction is taking place are an important factor for recommendation since it provides hints about the most suitable type of interaction among co-located users. In this work we present a mediator application called Urban Radar, designed for supporting spontaneous interaction of co-located users taking into account the semantics of the place. Our evaluation shows that the mobile social application recommendation based on placeness either extremely or mostly satisfies 60% of users.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
With the advancements on mobile phones and the integration of multiple communication interfaces, interaction between users is no longer restricted to spaces with connectivity with the Internet but can happen anywhere, anytime. This has promoted the development of frameworks to enable the interaction of co-located users. One of the challenging points of this interaction is to find similar and trustable users to interact with. Existing works focus mostly on properties related to mobile users to find similar users in the surroundings. However, the features of the space in which the interaction is taking place are an important factor for recommendation since it provides hints about the most suitable type of interaction among co-located users. In this work we present a mediator application called Urban Radar, designed for supporting spontaneous interaction of co-located users taking into account the semantics of the place. Our evaluation shows that the mobile social application recommendation based on placeness either extremely or mostly satisfies 60% of users.