2006
Lee, Kyungmin; Lee, Dongman; Park, Insuk; Han, Seunghyun
XVMF: an extensible and versatile matchmaking framework for supporting dynamic application adaptation in ubiquitous computing environments Proceedings Article
In: Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), pp. 5–pp, IEEE 2006.
@inproceedings{lee2006xvmf,
title = {XVMF: an extensible and versatile matchmaking framework for supporting dynamic application adaptation in ubiquitous computing environments},
author = {Kyungmin Lee and Dongman Lee and Insuk Park and Seunghyun Han},
url = {https://ieeexplore.ieee.org/abstract/document/1599006},
doi = {10.1109/PERCOMW.2006.151},
year = {2006},
date = {2006-05-27},
urldate = {2006-05-27},
booktitle = {Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)},
pages = {5–pp},
organization = {IEEE},
abstract = {This paper presents XVMF, an extensible and versatile matchmaking framework, which supports various service substitution mechanisms in dynamic application adaptation for ubiquitous computing environments. XVMF enables various substitution mechanisms to be easily developed by providing common abstracts for implementing a service substitution mechanism. It also allows an application or a user to select the most appropriate substitution mechanism with respect to its requirements by providing various substitution policies. The current Java implementation of XVMF supports three existing substitution mechanisms},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper presents XVMF, an extensible and versatile matchmaking framework, which supports various service substitution mechanisms in dynamic application adaptation for ubiquitous computing environments. XVMF enables various substitution mechanisms to be easily developed by providing common abstracts for implementing a service substitution mechanism. It also allows an application or a user to select the most appropriate substitution mechanism with respect to its requirements by providing various substitution policies. The current Java implementation of XVMF supports three existing substitution mechanisms
Kim, Woohyun; Kang, Saehoon; Lee, Younghee; Lee, Dongman; Ko, Inyoung
Activity policy-based service discovery for pervasive computing Proceedings Article
In: International Conference on Extending Database Technology, pp. 756–768, Springer 2006.
@inproceedings{kim2006activity,
title = {Activity policy-based service discovery for pervasive computing},
author = {Woohyun Kim and Saehoon Kang and Younghee Lee and Dongman Lee and Inyoung Ko},
url = {https://link.springer.com/chapter/10.1007/11896548_57},
year = {2006},
date = {2006-05-27},
urldate = {2006-05-27},
booktitle = {International Conference on Extending Database Technology},
pages = {756–768},
organization = {Springer},
abstract = {Service discovery is an essential technique to provide applications with appropriate resources. However, user mobility and heterogeneous environments make the discovery of appropriate resources difficult. The execution environments will be rapidly changed, so developers cannot predict available resources exactly in design time. Thus, service discovery frameworks for pervasive computing must guarantee transparent development environments to application developers. In this paper, we introduce how to semantically describe and discover a variety of services in different environments. This approach helps applications to find appropriate services even though the required ones are not available or not found. For this, we propose a fine-grained effect ontology which is used to reasonably evaluate functional similarity among different services, and a policy-based query coordination which is used to dynamically apply different resource constraints according to human activities. Finally, we show with a feasible scenario how to find appropriate services in different environments. Our approach helps applications to seamlessly perform their tasks across a dynamic range of environments.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Service discovery is an essential technique to provide applications with appropriate resources. However, user mobility and heterogeneous environments make the discovery of appropriate resources difficult. The execution environments will be rapidly changed, so developers cannot predict available resources exactly in design time. Thus, service discovery frameworks for pervasive computing must guarantee transparent development environments to application developers. In this paper, we introduce how to semantically describe and discover a variety of services in different environments. This approach helps applications to find appropriate services even though the required ones are not available or not found. For this, we propose a fine-grained effect ontology which is used to reasonably evaluate functional similarity among different services, and a policy-based query coordination which is used to dynamically apply different resource constraints according to human activities. Finally, we show with a feasible scenario how to find appropriate services in different environments. Our approach helps applications to seamlessly perform their tasks across a dynamic range of environments.
Youngjae Kim, Dongman Lee
A personal context-aware universal remote controller for a smart home environment Bachelor Thesis
2006.
@bachelorthesis{nokey,
title = {A personal context-aware universal remote controller for a smart home environment},
author = {Youngjae Kim, Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/1625879},
doi = {10.1109/ICACT.2006.206274},
year = {2006},
date = {2006-05-08},
urldate = {2006-05-08},
abstract = {An architecture for a personal context-based universal remote controller system is proposed. The proposed scheme allows user to apply preferable functions of appliance services to user contexts. We describe a method for handling and adapting user preferences interacting with home server. The result shows graphic user interfaces by adapting UI generation algorithm dynamically. This work is implemented using network enabled PDA in Active Surroundings smart home environments.},
keywords = {},
pubstate = {published},
tppubtype = {bachelorthesis}
}
An architecture for a personal context-based universal remote controller system is proposed. The proposed scheme allows user to apply preferable functions of appliance services to user contexts. We describe a method for handling and adapting user preferences interacting with home server. The result shows graphic user interfaces by adapting UI generation algorithm dynamically. This work is implemented using network enabled PDA in Active Surroundings smart home environments.
Lee, Kyungmin; Lee, Dongman; Ko, Yang Woo; Lee, Jaeik; Chung, Yoo Chul
An objectified naming system for providing context transparency to context-aware applications Proceedings Article
In: The Fourth IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, and the Second International Workshop on Collaborative Computing, Integration, and Assurance (SEUS-WCCIA'06), pp. 6–pp, IEEE 2006.
@inproceedings{lee2006objectified,
title = {An objectified naming system for providing context transparency to context-aware applications},
author = {Kyungmin Lee and Dongman Lee and Yang Woo Ko and Jaeik Lee and Yoo Chul Chung},
url = {https://ieeexplore.ieee.org/abstract/document/1611720},
doi = {10.1109/SEUS-WCCIA.2006.14},
year = {2006},
date = {2006-05-08},
urldate = {2006-05-08},
booktitle = {The Fourth IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, and the Second International Workshop on Collaborative Computing, Integration, and Assurance (SEUS-WCCIA'06)},
pages = {6–pp},
organization = {IEEE},
abstract = {This paper describes the design and implementation of the objectified naming system (ONS) that provides a context-aware application with context transparent identification and rebinding of services, despite changes in its context or administrative domain. ONS treats a name as a first-class object, called a name object, which hides the name resolution and service rebinding procedures required when the context or administrative domain changes. ONS provides a context-based name structure, a context-aware name resolution mechanism, and an automated service rebinding mechanism. With ONS, applications can use name objects to refer to services in a context transparent way, regardless of context or administrative domain. The prototype implementation and experimental results indicate that ONS can streamline the development process of context-aware applications with reasonable runtime overhead},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper describes the design and implementation of the objectified naming system (ONS) that provides a context-aware application with context transparent identification and rebinding of services, despite changes in its context or administrative domain. ONS treats a name as a first-class object, called a name object, which hides the name resolution and service rebinding procedures required when the context or administrative domain changes. ONS provides a context-based name structure, a context-aware name resolution mechanism, and an automated service rebinding mechanism. With ONS, applications can use name objects to refer to services in a context transparent way, regardless of context or administrative domain. The prototype implementation and experimental results indicate that ONS can streamline the development process of context-aware applications with reasonable runtime overhead
Chang, Hyun-Jun; Park, In-Suk; Hyun, Soon-J; Lee, Dong-Man
Context Life Cycle Management Mechanism considering User Life Pattern in Ubiquitous Computing Environments Journal Article
In: 한국 HCI 학회: 학술대회논문집, pp. 728–734, 2006.
@article{chang2006context,
title = {Context Life Cycle Management Mechanism considering User Life Pattern in Ubiquitous Computing Environments},
author = {Hyun-Jun Chang and In-Suk Park and Soon-J Hyun and Dong-Man Lee},
url = {https://koreascience.or.kr/article/CFKO200625752346275.page},
year = {2006},
date = {2006-02-13},
urldate = {2006-02-13},
journal = {한국 HCI 학회: 학술대회논문집},
pages = {728–734},
publisher = {The HCI Society of Korea},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Hyun, SoonJoo; Lee, Jaeho; Park, Insuk; Lee, Dongman
Application-Oriented Context Pre-fetch Method for Enhancing Inference Performance in Ontology-based Context Management Journal Article
In: Journal of KIISE: Computing Practices and Letters, vol. 12, no. 4, pp. 254–263, 2006.
@article{soon2006application,
title = {Application-Oriented Context Pre-fetch Method for Enhancing Inference Performance in Ontology-based Context Management},
author = {SoonJoo Hyun and Jaeho Lee and Insuk Park and Dongman Lee},
url = {https://disi.unitn.it/~pavel/cando/Pictures/Presentations/WS105JLee.pdf},
year = {2006},
date = {2006-01-01},
urldate = {2006-01-01},
journal = {Journal of KIISE: Computing Practices and Letters},
volume = {12},
number = {4},
pages = {254–263},
publisher = {Korean Institute of Information Scientists and Engineers},
abstract = {Ontology-based context models are widely used in ubiquitous computing environment because they have advantages in the acquisition of conceptual context through inferencing, context sharing, and context reusing. Among the benefits, inferencing enables context-aware applications to use conceptual contexts which cannot be acquired by sensors. However, inferencing causes processing delay and thus becomes the major obstacle to the implementation of context-aware applications. The delay becomes longer as the amount of contexts increases. In this paper, we propose a context pre-fetching method to reduce the size of contexts to be processed in a working memory in attempt to speed up inferencing. For this, we extend the query-tree method to identify contexts relevant to the queries of a context-aware application. Maintaining the pre-fetched contexts optimal in a working memory, the processing delay of inference reduces without the loss of the benefits of ontology-based context model. We apply the proposed scheme to our ubiquitous computing middleware, Active Surroundings, and demonstrate the performance enhancement by experiments.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Ontology-based context models are widely used in ubiquitous computing environment because they have advantages in the acquisition of conceptual context through inferencing, context sharing, and context reusing. Among the benefits, inferencing enables context-aware applications to use conceptual contexts which cannot be acquired by sensors. However, inferencing causes processing delay and thus becomes the major obstacle to the implementation of context-aware applications. The delay becomes longer as the amount of contexts increases. In this paper, we propose a context pre-fetching method to reduce the size of contexts to be processed in a working memory in attempt to speed up inferencing. For this, we extend the query-tree method to identify contexts relevant to the queries of a context-aware application. Maintaining the pre-fetched contexts optimal in a working memory, the processing delay of inference reduces without the loss of the benefits of ontology-based context model. We apply the proposed scheme to our ubiquitous computing middleware, Active Surroundings, and demonstrate the performance enhancement by experiments.
2005
Yoon, W.; Lee, D.; Youn, H. Y.
Comparison of tree-based reliable multicast protocols for many-to-many sessions Journal Article
In: IEE Proceedings - Communications, vol. 152, no. 6, pp. 923–931, 2005, ISSN: 1350-2425.
@article{Yoon2005,
title = {Comparison of tree-based reliable multicast protocols for many-to-many sessions},
author = {W. Yoon and D. Lee and H. Y. Youn},
url = {https://doi.org/10.1049/ip-com:20050159},
doi = {10.1049/ip-com:20050159},
issn = {1350-2425},
year = {2005},
date = {2005-12-01},
urldate = {2005-12-01},
journal = {IEE Proceedings - Communications},
volume = {152},
number = {6},
pages = {923–931},
publisher = {The Institution of Engineering and Technology},
abstract = {Tree-based reliable multicast protocols are well-known for being scalable for one-to-many sessions, but their behaviour in terms of throughput and bandwidth requirements has not been identifed for many-to-many sessions. In this paper, existing tree-based reliable multicast protocols are categorised into four classes according to their feedback/retransmission mechanisms. Analysing and comparing them using a new spatial multicast loss model that considers the correlation of packet loss events can yield realistic analysis results. The analysis reveals that for many-to-many sessions, tree-based protocols with unicast NACK, unicast retransmission, and periodic polling are most scalable with respect to throughput and network bandwidth for practical session sizes. The result is contrary to the one-to-many case and it is shown that the reason is that reducing the sender's processing time is a key factor for scaling one-to-many reliable multicast, whereas reducing the receiver's processing time is far more important factor for scalability of many-to-many reliable multicasts.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Tree-based reliable multicast protocols are well-known for being scalable for one-to-many sessions, but their behaviour in terms of throughput and bandwidth requirements has not been identifed for many-to-many sessions. In this paper, existing tree-based reliable multicast protocols are categorised into four classes according to their feedback/retransmission mechanisms. Analysing and comparing them using a new spatial multicast loss model that considers the correlation of packet loss events can yield realistic analysis results. The analysis reveals that for many-to-many sessions, tree-based protocols with unicast NACK, unicast retransmission, and periodic polling are most scalable with respect to throughput and network bandwidth for practical session sizes. The result is contrary to the one-to-many case and it is shown that the reason is that reducing the sender's processing time is a key factor for scaling one-to-many reliable multicast, whereas reducing the receiver's processing time is far more important factor for scalability of many-to-many reliable multicasts.
Park, Insuk; Lee, D.; Hyun, S. J.
A dynamic context-conflict management scheme for group-aware ubiquitous computing environments Proceedings Article
In: 29th Annual International Computer Software and Applications Conference (COMPSAC'05), pp. 359-364 Vol. 2, 2005, ISBN: 0-7695-2413-3.
@inproceedings{1510047,
title = {A dynamic context-conflict management scheme for group-aware ubiquitous computing environments},
author = {Insuk Park and D. Lee and S. J. Hyun},
url = {https://ieeexplore.ieee.org/abstract/document/1510047},
doi = {10.1109/COMPSAC.2005.21},
isbn = {0-7695-2413-3},
year = {2005},
date = {2005-07-26},
urldate = {2005-07-26},
booktitle = {29th Annual International Computer Software and Applications Conference (COMPSAC'05)},
volume = {1},
pages = {359-364 Vol. 2},
abstract = {In this paper, we propose a context-conflict management scheme for group-aware ubiquitous computing environments that allows context-aware applications to serve multiple users without distracting and sacrificing each other. The proposed scheme can detect semantic conflicts without explicit descriptions of the conflicts between different applications. Conflicts are resolved by a dynamically generated adaptation policy based on the weight value of user preference on each service. Individual context-aware applications can be reused without modification since middleware components for the context-conflict management take charge of detecting and resolving conflicts. Thus, the complicated context-conflict situation becomes more transparent to application programmers.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we propose a context-conflict management scheme for group-aware ubiquitous computing environments that allows context-aware applications to serve multiple users without distracting and sacrificing each other. The proposed scheme can detect semantic conflicts without explicit descriptions of the conflicts between different applications. Conflicts are resolved by a dynamically generated adaptation policy based on the weight value of user preference on each service. Individual context-aware applications can be reused without modification since middleware components for the context-conflict management take charge of detecting and resolving conflicts. Thus, the complicated context-conflict situation becomes more transparent to application programmers.
Lim, Mingyu; Lee, DongMan
A fine-grained load distribution scheme for multi-server-based distributed virtual environment systems Conference
CollabTech 2005, 2005.
@conference{lim2005fine,
title = {A fine-grained load distribution scheme for multi-server-based distributed virtual environment systems},
author = {Mingyu Lim and DongMan Lee},
year = {2005},
date = {2005-07-01},
urldate = {2005-01-01},
booktitle = {CollabTech 2005},
pages = {34–39},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Kim, W.; Ko, YangWoo; Lee, Soojeon
A fast mobile node configuration using address caching in hybrid wireless networks Proceedings Article
In: 25th IEEE International Conference on Distributed Computing Systems Workshops, pp. 237-243, IEEE, 2005, ISBN: 0-7695-2328-5.
@inproceedings{1437181,
title = {A fast mobile node configuration using address caching in hybrid wireless networks},
author = {W. Kim and YangWoo Ko and Soojeon Lee},
url = {https://ieeexplore.ieee.org/document/1437181},
doi = {10.1109/ICDCSW.2005.10},
isbn = {0-7695-2328-5},
year = {2005},
date = {2005-06-10},
urldate = {2005-06-10},
booktitle = {25th IEEE International Conference on Distributed Computing Systems Workshops},
pages = {237-243},
publisher = {IEEE},
abstract = {Many small devices in a pervasive computing environment have various wireless network interfaces that are used to exchange data for various network services. Recently, those devices usually compose an ad hoc network and communicate with each other without any infrastructure. Several host configuration methods for mobile nodes in a mobile ad hoc network without user's manual intervention have been suggested so far. If the number of ad hoc nodes in a network increases, it take long time for a newly joining node to configure itself with Zeroconf (A. Williams, 2002) or DHCP (R. Droms, 1997) server since the request messages for address allocation should be transmitted via multiple hops. In this paper, we propose a distributed host configuration scheme in which each ad hoc node temporarily caches host configuration information to reduce traffic sent to real (Zeroconf or DHCP) server and to shorten message delay between a node and a server.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Many small devices in a pervasive computing environment have various wireless network interfaces that are used to exchange data for various network services. Recently, those devices usually compose an ad hoc network and communicate with each other without any infrastructure. Several host configuration methods for mobile nodes in a mobile ad hoc network without user's manual intervention have been suggested so far. If the number of ad hoc nodes in a network increases, it take long time for a newly joining node to configure itself with Zeroconf (A. Williams, 2002) or DHCP (R. Droms, 1997) server since the request messages for address allocation should be transmitted via multiple hops. In this paper, we propose a distributed host configuration scheme in which each ad hoc node temporarily caches host configuration information to reduce traffic sent to real (Zeroconf or DHCP) server and to shorten message delay between a node and a server.
Lee, Soojeon; Kang, Kyungran; Lee, Dongman
OMFVS: overlay multicast for file distribution using virtual sources Proceedings Article
In: PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005., pp. 249-256, 2005, ISBN: 0-7803-8991-3.
@inproceedings{1460565,
title = {OMFVS: overlay multicast for file distribution using virtual sources},
author = {Soojeon Lee and Kyungran Kang and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/1460565},
doi = {10.1109/PCCC.2005.1460565},
isbn = {0-7803-8991-3},
year = {2005},
date = {2005-04-07},
urldate = {2005-04-07},
booktitle = {PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005.},
pages = {249-256},
abstract = {There have been many research efforts to enhance the throughput of file distribution using overlay multicast. The tree-based approach has limitations in enhancing throughput due to its single forwarder architecture. Recent approaches introduce multiple packet forwarders other than the parent in the delivery tree for throughput enhancement. However, the overhead of control packet exchanges is required to appoint proper forwarders and to avoid duplicate packet delivery. In this paper, we suggest a throughput enhancement scheme for a tree-based overlay multicast scheme with multiple forwarders. It exploits a forward error correction scheme and the fact that the members join the session with time interval. Thus, each set of packets that are delivered from a parent to a member after the member joins and before a succeeding member joins is not overlapped. By deploying a dedicated sender to manage the membership information and packet reception state, the overhead of control packet exchanges is alleviated significantly. The performance evaluation shows that the proposed scheme reduces file delivery time with low control overheads and small packet duplication ratio, compared with existing scheme, Bullet.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
There have been many research efforts to enhance the throughput of file distribution using overlay multicast. The tree-based approach has limitations in enhancing throughput due to its single forwarder architecture. Recent approaches introduce multiple packet forwarders other than the parent in the delivery tree for throughput enhancement. However, the overhead of control packet exchanges is required to appoint proper forwarders and to avoid duplicate packet delivery. In this paper, we suggest a throughput enhancement scheme for a tree-based overlay multicast scheme with multiple forwarders. It exploits a forward error correction scheme and the fact that the members join the session with time interval. Thus, each set of packets that are delivered from a parent to a member after the member joins and before a succeeding member joins is not overlapped. By deploying a dedicated sender to manage the membership information and packet reception state, the overhead of control packet exchanges is alleviated significantly. The performance evaluation shows that the proposed scheme reduces file delivery time with low control overheads and small packet duplication ratio, compared with existing scheme, Bullet.
Ko, YangWoo; Lee, Dongman; Kang, Kyungran
Tunecast - administratively scoped broadcast received by tuned receivers Proceedings Article
In: Third IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 243-247, 2005, ISBN: 0-7695-2300-5.
@inproceedings{1392841,
title = {Tunecast - administratively scoped broadcast received by tuned receivers},
author = {YangWoo Ko and Dongman Lee and Kyungran Kang},
url = {https://ieeexplore.ieee.org/abstract/document/1392841},
doi = {10.1109/PERCOMW.2005.89},
isbn = {0-7695-2300-5},
year = {2005},
date = {2005-03-08},
urldate = {2005-03-08},
booktitle = {Third IEEE International Conference on Pervasive Computing and Communications Workshops},
pages = {243-247},
abstract = {One of the challenges in ubiquitous computing is how effectively network substrates deliver and filter information fed by an information-rich environment. In this paper, we review the challenges that existing multicast protocols are facing in a ubiquitous computing environment and propose a new scheme - called "tunecast" - to give an alternative perspective in designing the network substrate for the future environment.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
One of the challenges in ubiquitous computing is how effectively network substrates deliver and filter information fed by an information-rich environment. In this paper, we review the challenges that existing multicast protocols are facing in a ubiquitous computing environment and propose a new scheme - called "tunecast" - to give an alternative perspective in designing the network substrate for the future environment.
Konidala, D. M.; Duc, D. N.; Lee, Dongman; Kim, Kwangjo
A capability-based privacy-preserving scheme for pervasive computing environments Proceedings Article
In: Third IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 136-140, IEEE, 2005, ISBN: 0-7695-2300-5.
@inproceedings{1392817,
title = {A capability-based privacy-preserving scheme for pervasive computing environments},
author = {D. M. Konidala and D. N. Duc and Dongman Lee and Kwangjo Kim},
url = {https://ieeexplore.ieee.org/abstract/document/1392817},
doi = {10.1109/PERCOMW.2005.3},
isbn = {0-7695-2300-5},
year = {2005},
date = {2005-03-08},
urldate = {2005-03-08},
booktitle = {Third IEEE International Conference on Pervasive Computing and Communications Workshops},
pages = {136-140},
publisher = {IEEE},
abstract = {In a pervasive computing environment, users interact with many smart devices or service providers (SPs) to obtain some useful services from them. These SPs can be either genuine or malicious. As a result, users privacy is at a greater risk, as they are prone to revealing their location, identity and transactions information to such SPs. On the other hand, user authentication is also required for SPs to provide service access control to only authorized users. In order to protect users privacy, they must be allowed to have anonymous interactions with SPs. But, authenticating and authorizing an anonymous user becomes a challenging task. In this paper, we propose a simple and efficient scheme that allows users to anonymously interact with SPs and the SPs can effectively authenticate and authorize the users based on the anonymous information submitted by the users.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In a pervasive computing environment, users interact with many smart devices or service providers (SPs) to obtain some useful services from them. These SPs can be either genuine or malicious. As a result, users privacy is at a greater risk, as they are prone to revealing their location, identity and transactions information to such SPs. On the other hand, user authentication is also required for SPs to provide service access control to only authorized users. In order to protect users privacy, they must be allowed to have anonymous interactions with SPs. But, authenticating and authorizing an anonymous user becomes a challenging task. In this paper, we propose a simple and efficient scheme that allows users to anonymously interact with SPs and the SPs can effectively authenticate and authorize the users based on the anonymous information submitted by the users.
Kang, Sae Hoon; Ryu, Seungbok; Kim, Namhoon; Lee, Younghee; Lee, Dongman; Moon, Keyong-Deok
An architecture for interoperability of service discovery protocols using dynamic service proxies Proceedings Article
In: Information Networking. Convergence in Broadband and Mobile Networking: International Conference, ICOIN 2005, Jeju Island, Korea, January 31-February 2, 2005. Proceedings, pp. 786–795, Springer 2005, ISBN: 978-3-540-30582-8.
@inproceedings{kang2005architecture,
title = {An architecture for interoperability of service discovery protocols using dynamic service proxies},
author = {Sae Hoon Kang and Seungbok Ryu and Namhoon Kim and Younghee Lee and Dongman Lee and Keyong-Deok Moon},
url = {https://link.springer.com/chapter/10.1007/978-3-540-30582-8_82#chapter-info},
doi = {https://doi.org/10.1007/978-3-540-30582-8_82},
isbn = {978-3-540-30582-8},
year = {2005},
date = {2005-01-01},
urldate = {2005-01-01},
booktitle = {Information Networking. Convergence in Broadband and Mobile Networking: International Conference, ICOIN 2005, Jeju Island, Korea, January 31-February 2, 2005. Proceedings},
pages = {786–795},
organization = {Springer},
abstract = {Although all existing service discovery middlewares provide similar functionality, they are incompatible with one another due to differences in approach and architecture. We believe that co-existence of various service discovery middlewares will be indispensable since their target services and network environments are quite different to each other. Considering the future pervasive computing environment, the interoperability between them must be essential toward minimum user distraction under the heterogeneous systems. As the requirements of this interoperability system under these environment, complete translation, accommodation of changes of legacy middlewares, and simplicity of managing available services must be very important aspects. We propose a novel architecture which satisfies these requirements, using dynamic service proxy concept. While this concept provides various advantages, it has a notable drawback such that it needs to prepare many proxy codes per each service. To alleviate the load, we design and implement a Service Code Development Toolkit. We implemented a sample application and proposed architecture, and the results show that this architecture fully satisfies targeted design objectives.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Although all existing service discovery middlewares provide similar functionality, they are incompatible with one another due to differences in approach and architecture. We believe that co-existence of various service discovery middlewares will be indispensable since their target services and network environments are quite different to each other. Considering the future pervasive computing environment, the interoperability between them must be essential toward minimum user distraction under the heterogeneous systems. As the requirements of this interoperability system under these environment, complete translation, accommodation of changes of legacy middlewares, and simplicity of managing available services must be very important aspects. We propose a novel architecture which satisfies these requirements, using dynamic service proxy concept. While this concept provides various advantages, it has a notable drawback such that it needs to prepare many proxy codes per each service. To alleviate the load, we design and implement a Service Code Development Toolkit. We implemented a sample application and proposed architecture, and the results show that this architecture fully satisfies targeted design objectives.
Lee, DongMan; Namgoong, H; Nam, D
Technical papers: Energy efficient topology for wireless microsensor networks Proceedings Article
In: 2nd ACM international workshop on PE-WASUN 2005, pp. 0–0, 2005.
@inproceedings{lee2005technical,
title = {Technical papers: Energy efficient topology for wireless microsensor networks},
author = {DongMan Lee and H Namgoong and D Nam},
year = {2005},
date = {2005-01-01},
urldate = {2005-01-01},
booktitle = {2nd ACM international workshop on PE-WASUN 2005},
pages = {0–0},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Kang, Saehoon; Kim, Woohyun; Lee, Dongman; Lee, Younghee
Group Context-aware Service Discovery for Supporting Continuous Service Availability Journal Article
In: CEUR Workshop Proceedings, vol. 149, 2005.
@article{articlec,
title = {Group Context-aware Service Discovery for Supporting Continuous Service Availability},
author = {Saehoon Kang and Woohyun Kim and Dongman Lee and Younghee Lee},
url = {https://ceur-ws.org/Vol-149/paper10.pdf},
year = {2005},
date = {2005-01-01},
urldate = {2005-01-01},
journal = {CEUR Workshop Proceedings},
volume = {149},
abstract = {This paper presents our research progress for group context-aware service discovery supporting continuous service availability by providing an alternative service. We believe that service discovery system need to have efficient method for representing the context of a service and a good algorithm for matching and evaluation. We adopt IOPE model from Semantic Web to represent service context and propose perception based effect ontology which is useful in ubiquitous home environment.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper presents our research progress for group context-aware service discovery supporting continuous service availability by providing an alternative service. We believe that service discovery system need to have efficient method for representing the context of a service and a good algorithm for matching and evaluation. We adopt IOPE model from Semantic Web to represent service context and propose perception based effect ontology which is useful in ubiquitous home environment.
Kang, Sae Hoon; Ryu, Seungbok; Kim, Namhoon; Lee, Younghee; Lee, Dongman; Moon, Keyong-Deok
An Architecture for Interoperability of Service Discovery Protocols Using Dynamic Service Proxies Proceedings Article
In: Kim, Cheeha (Ed.): Information Networking. Convergence in Broadband and Mobile Networking, pp. 786–795, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, ISBN: 978-3-540-30582-8.
@inproceedings{10.1007/978-3-540-30582-8_82,
title = {An Architecture for Interoperability of Service Discovery Protocols Using Dynamic Service Proxies},
author = {Sae Hoon Kang and Seungbok Ryu and Namhoon Kim and Younghee Lee and Dongman Lee and Keyong-Deok Moon},
editor = {Cheeha Kim},
url = {https://link.springer.com/chapter/10.1007/978-3-540-30582-8_82#chapter-info},
doi = {https://doi.org/10.1007/978-3-540-30582-8_82},
isbn = {978-3-540-30582-8},
year = {2005},
date = {2005-01-01},
urldate = {2005-01-01},
booktitle = {Information Networking. Convergence in Broadband and Mobile Networking},
pages = {786–795},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
abstract = {Although all existing service discovery middlewares provide similar functionality, they are incompatible with one another due to differences in approach and architecture. We believe that co-existence of various service discovery middlewares will be indispensable since their target services and network environments are quite different to each other. Considering the future pervasive computing environment, the interoperability between them must be essential toward minimum user distraction under the heterogeneous systems. As the requirements of this interoperability system under these environment, complete translation, accommodation of changes of legacy middlewares, and simplicity of managing available services must be very important aspects. We propose a novel architecture which satisfies these requirements, using dynamic service proxy concept. While this concept provides various advantages, it has a notable drawback such that it needs to prepare many proxy codes per each service. To alleviate the load, we design and implement a Service Code Development Toolkit. We implemented a sample application and proposed architecture, and the results show that this architecture fully satisfies targeted design objectives.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Although all existing service discovery middlewares provide similar functionality, they are incompatible with one another due to differences in approach and architecture. We believe that co-existence of various service discovery middlewares will be indispensable since their target services and network environments are quite different to each other. Considering the future pervasive computing environment, the interoperability between them must be essential toward minimum user distraction under the heterogeneous systems. As the requirements of this interoperability system under these environment, complete translation, accommodation of changes of legacy middlewares, and simplicity of managing available services must be very important aspects. We propose a novel architecture which satisfies these requirements, using dynamic service proxy concept. While this concept provides various advantages, it has a notable drawback such that it needs to prepare many proxy codes per each service. To alleviate the load, we design and implement a Service Code Development Toolkit. We implemented a sample application and proposed architecture, and the results show that this architecture fully satisfies targeted design objectives.
Ko, Bojung; Ahn, Soyeon; Kim, Namhoon; Lee, Younghee; Lee, Dongman
An Integration Scheme of Overlay Multicast Protocol for Wired Networks and Wireless Ad Hoc Networks. Masters Thesis
KAIST, 2005.
@mastersthesis{inproceedings,
title = {An Integration Scheme of Overlay Multicast Protocol for Wired Networks and Wireless Ad Hoc Networks.},
author = {Bojung Ko and Soyeon Ahn and Namhoon Kim and Younghee Lee and Dongman Lee},
year = {2005},
date = {2005-01-01},
urldate = {2005-01-01},
pages = {57-62},
school = {KAIST},
abstract = {다양한 디바이스의 사용이 늘어나고, 네트워크의 형태도 다양해지고 있다. 각각의 디바이스는 메모리 용량, 파워의 용량, 이동성 여부 등 서로 다른 특성을 가지고 있다. 뿐만 아니라, 네트워크의 형태마다 다른 특성을 지니고 있다. 예를 들어, 유선 망의 경우 충분한 대역폭과 정해진 인프라 구조를 가지고 있는데 반해 무선 애드 혹 망의 경우 대역폭이 제한되어 있으며 특별히 정해진 인프라 구조를 가지고 있지 않다. 오늘날, 화상 회의, 온라인 게임, 멀티미디어 스트리밍 등 멀티캐스트를 사용하는 그룹 기반 응용 프로그램이 많이 사용되고 있다. IP 멀티캐스트 서비스는 서비스 실현의 기술적, 비용적인 한계와 실제 사용상에 발생하는 많은 문제점으로 인하여 이에 대한 대안의 하나로 응용 계층 멀티캐스트 (Application Layer Multicast 또는 Overlay Multicast) 에 대한 연구가 활발하다. 응용 계층 멀티캐스트 역시 유선 네트워크에서 사용되는지, 무선 애드 혹 네트워크에서 사용되는지에 따라 다른 프로토콜들이 사용되고 있다. 사용자들이 여러 형태의 네트워크에 혼재되어 있더라도 멀티캐스트 서비스가 원활하게 이루어질 수 있어야 한다. 유선 네트워크와 무선 애드 혹 네트워크가 혼재되어 있을 때, 멀티캐스트를 제공할 수 있는 방법에는 크게 두 가지가 있다. 첫 번째, 단일 프로토콜을 양 네트워크에 똑같이 적용시키는 방법이다. 하지만, 이 방법은 두 네트워크의 상반된 특성을 동시에 만족시키기 힘들다. 두 번째, 각 프로토콜을 번역 시켜줄 수 있는 특별한 노드를 정의하고 각각의 네트워크에 적합한 프로토콜을 사용하도록 하는 방법이다. 이 방법에서는 번역 노드 (translation node)의 위치를 고려해 볼 수 있다. 본 논문에서는 두 번째 방법에서 번역 노드의 위치에 따른 스킴을 제안하고, 각각 스킴을 평가하였다.},
keywords = {},
pubstate = {published},
tppubtype = {mastersthesis}
}
다양한 디바이스의 사용이 늘어나고, 네트워크의 형태도 다양해지고 있다. 각각의 디바이스는 메모리 용량, 파워의 용량, 이동성 여부 등 서로 다른 특성을 가지고 있다. 뿐만 아니라, 네트워크의 형태마다 다른 특성을 지니고 있다. 예를 들어, 유선 망의 경우 충분한 대역폭과 정해진 인프라 구조를 가지고 있는데 반해 무선 애드 혹 망의 경우 대역폭이 제한되어 있으며 특별히 정해진 인프라 구조를 가지고 있지 않다. 오늘날, 화상 회의, 온라인 게임, 멀티미디어 스트리밍 등 멀티캐스트를 사용하는 그룹 기반 응용 프로그램이 많이 사용되고 있다. IP 멀티캐스트 서비스는 서비스 실현의 기술적, 비용적인 한계와 실제 사용상에 발생하는 많은 문제점으로 인하여 이에 대한 대안의 하나로 응용 계층 멀티캐스트 (Application Layer Multicast 또는 Overlay Multicast) 에 대한 연구가 활발하다. 응용 계층 멀티캐스트 역시 유선 네트워크에서 사용되는지, 무선 애드 혹 네트워크에서 사용되는지에 따라 다른 프로토콜들이 사용되고 있다. 사용자들이 여러 형태의 네트워크에 혼재되어 있더라도 멀티캐스트 서비스가 원활하게 이루어질 수 있어야 한다. 유선 네트워크와 무선 애드 혹 네트워크가 혼재되어 있을 때, 멀티캐스트를 제공할 수 있는 방법에는 크게 두 가지가 있다. 첫 번째, 단일 프로토콜을 양 네트워크에 똑같이 적용시키는 방법이다. 하지만, 이 방법은 두 네트워크의 상반된 특성을 동시에 만족시키기 힘들다. 두 번째, 각 프로토콜을 번역 시켜줄 수 있는 특별한 노드를 정의하고 각각의 네트워크에 적합한 프로토콜을 사용하도록 하는 방법이다. 이 방법에서는 번역 노드 (translation node)의 위치를 고려해 볼 수 있다. 본 논문에서는 두 번째 방법에서 번역 노드의 위치에 따른 스킴을 제안하고, 각각 스킴을 평가하였다.
1997
Sangjoon, A; Lee, Seungro; Lee, Dongman; Han, Sunyoung
An architecture for a tightly coupled conferencing system Proceedings Article
In: Proceedings Third International Workshop on Object-Oriented Real-Time Dependable Systems, pp. 249–255, IEEE 1997, ISBN: 0-8186-8046-6.
@inproceedings{sangjoon1997architecture,
title = {An architecture for a tightly coupled conferencing system},
author = {A Sangjoon and Seungro Lee and Dongman Lee and Sunyoung Han},
url = {https://ieeexplore.ieee.org/abstract/document/609964},
doi = {10.1109/WORDS.1997.609964},
isbn = {0-8186-8046-6},
year = {1997},
date = {1997-06-05},
urldate = {1997-01-01},
booktitle = {Proceedings Third International Workshop on Object-Oriented Real-Time Dependable Systems},
pages = {249–255},
organization = {IEEE},
abstract = {Describes an architecture for a tightly coupled conferencing system on an asynchronous transfer mode (ATM) network. In order to provide multicast service, we construct a multicast environment using a multicast address resolution server (MARS) and multicast servers (MCSs). The architecture provides conference control services which provide tight coordination of conference membership over the environment. The services are provided by a conference control server (CCS). We propose a secondary CCS in order to support fault tolerance. When the primary CCS fails to perform its service, the secondary CCS rakes over the control and continues conferencing without stopping.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Describes an architecture for a tightly coupled conferencing system on an asynchronous transfer mode (ATM) network. In order to provide multicast service, we construct a multicast environment using a multicast address resolution server (MARS) and multicast servers (MCSs). The architecture provides conference control services which provide tight coordination of conference membership over the environment. The services are provided by a conference control server (CCS). We propose a secondary CCS in order to support fault tolerance. When the primary CCS fails to perform its service, the secondary CCS rakes over the control and continues conferencing without stopping.
1996
Hao, MC; Lee, D; Sventek, JS
A light-weight application sharing infrastructure for graphics intensive applications Proceedings Article
In: Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing, pp. 127–131, IEEE 1996, ISBN: 0-8186-7582-9.
@inproceedings{hao1996lightb,
title = {A light-weight application sharing infrastructure for graphics intensive applications},
author = {MC Hao and D Lee and JS Sventek},
url = {https://ieeexplore.ieee.org/abstract/document/546181},
doi = {10.1109/HPDC.1996.546181},
isbn = {0-8186-7582-9},
year = {1996},
date = {1996-08-06},
urldate = {1996-01-01},
booktitle = {Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing},
pages = {127–131},
organization = {IEEE},
abstract = {We describe a lightweight application sharing infrastructure that enables collaborative design using graphics intensive applications over low bandwidth networks. The basis of the technology employs an event driven-mechanism to share a reduced event set among multiple copies of an application executing on different workstations. This technology is referred as RES-AP (Reduced Event Set Application Sharing). RES-AP allows geographically-dispersed engineers to work together on large complex problems with fast responses. This capability is achieved without modification to the applications or to the window system software.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We describe a lightweight application sharing infrastructure that enables collaborative design using graphics intensive applications over low bandwidth networks. The basis of the technology employs an event driven-mechanism to share a reduced event set among multiple copies of an application executing on different workstations. This technology is referred as RES-AP (Reduced Event Set Application Sharing). RES-AP allows geographically-dispersed engineers to work together on large complex problems with fast responses. This capability is achieved without modification to the applications or to the window system software.
1992
Lee, KS; Lee, DongMan; Chon, K
Incremental Modification Mechanism with Self-Reference in Lotos Proceedings Article
In: Computer Communication Workshop 1992, 1992.
@inproceedings{lee1992incremental,
title = {Incremental Modification Mechanism with Self-Reference in Lotos},
author = {KS Lee and DongMan Lee and K Chon},
url = {http://hdl.handle.net/10203/108100},
year = {1992},
date = {1992-02-01},
urldate = {1992-01-01},
booktitle = {Computer Communication Workshop 1992},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
1991
Park, Hyun Je; Lee, Dongman; Lee, Kilsup; Chon, Kil Nam
Configuration management of object groups Journal Article
In: Australian Computer Journal, vol. 23, no. 4, pp. 148–158, 1991, ISSN: 0004-8917.
@article{park1991configuration,
title = {Configuration management of object groups},
author = {Hyun Je Park and Dongman Lee and Kilsup Lee and Kil Nam Chon},
url = {http://hdl.handle.net/10203/59242},
issn = {0004-8917},
year = {1991},
date = {1991-11-01},
urldate = {1991-01-01},
journal = {Australian Computer Journal},
volume = {23},
number = {4},
pages = {148–158},
publisher = {AUSTRALIAN COMPUT SOC INC},
abstract = {Object groups provide a basis for replication and parallelism which increase the opportunities to improve performance, availability or fault tolerance. The improved performance is gained via parallel execution of multiple processes, possibly residing on different hosts. Improved availability and fault tolerance may be gained by replicating a program module in different locations. Conferencing is an example showing a cooperation of multiple objects. However, multiple members in the object group and coordination between them add a major degree of complexity; a large number of objects are involved and the membership continually changes. The configuration management provides automated support for the object group to selectively hide this complexity. Multiple objects are configured into an object group and behave towards other objects as if the multiple objects were collectively one object. Infrastructure and primitives to support dynamic configuration of object groups are introduced in this paper. The design and principles laid down in this paper are based on the ANSA and SE-ODP which develop open distributed processing models.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Object groups provide a basis for replication and parallelism which increase the opportunities to improve performance, availability or fault tolerance. The improved performance is gained via parallel execution of multiple processes, possibly residing on different hosts. Improved availability and fault tolerance may be gained by replicating a program module in different locations. Conferencing is an example showing a cooperation of multiple objects. However, multiple members in the object group and coordination between them add a major degree of complexity; a large number of objects are involved and the membership continually changes. The configuration management provides automated support for the object group to selectively hide this complexity. Multiple objects are configured into an object group and behave towards other objects as if the multiple objects were collectively one object. Infrastructure and primitives to support dynamic configuration of object groups are introduced in this paper. The design and principles laid down in this paper are based on the ANSA and SE-ODP which develop open distributed processing models.
Park, T. H.; Lee, Dongman; Chon, Kilnam
Suvey of agents Proceedings Article
In: Computer Communication Workshop 1991, 1991.
@inproceedings{park1991survey,
title = {Suvey of agents},
author = {T.H. Park and Dongman Lee and Kilnam Chon},
url = {http://hdl.handle.net/10203/108416},
year = {1991},
date = {1991-07-01},
urldate = {1991-07-01},
booktitle = {Computer Communication Workshop 1991},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
1989
Han, Sunyoung; Chon, Kilnam; Lee, Dongman
A virtual terminal protocol with windowing capability Journal Article
In: Computer networks and ISDN systems, vol. 16, no. 5, pp. 357–365, 1989.
@article{han1989virtual,
title = {A virtual terminal protocol with windowing capability},
author = {Sunyoung Han and Kilnam Chon and Dongman Lee},
url = {https://www.sciencedirect.com/science/article/pii/016975528990010X},
doi = {10.1016/0169-7552(89)90010-X},
year = {1989},
date = {1989-01-01},
urldate = {1989-01-01},
journal = {Computer networks and ISDN systems},
volume = {16},
number = {5},
pages = {357–365},
publisher = {Elsevier},
abstract = {Various kinds of terminals are used in a network environment. There arises the so-called m × n problem between one terminal and another or between one application and another or application and terminal. To solve this problem various virtual terminal protocols were proposed and are now being used in many networks. In this paper, we present a virtual terminal protocol with windowing capability based on the concept of the virtual terminal protocol proposed by ISO. The virtual terminal with windowing capability refers to a virtual terminal which has graphics primitives and image processing capabilities as well as character operations used in basic class terminals and which have windowing capability. In this paper, the model for the virtual terminal, its protocol architecture, model, data structure, the service facilities, and protocol messages are presented.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Various kinds of terminals are used in a network environment. There arises the so-called m × n problem between one terminal and another or between one application and another or application and terminal. To solve this problem various virtual terminal protocols were proposed and are now being used in many networks. In this paper, we present a virtual terminal protocol with windowing capability based on the concept of the virtual terminal protocol proposed by ISO. The virtual terminal with windowing capability refers to a virtual terminal which has graphics primitives and image processing capabilities as well as character operations used in basic class terminals and which have windowing capability. In this paper, the model for the virtual terminal, its protocol architecture, model, data structure, the service facilities, and protocol messages are presented.
1986
Lee, Dongman; Chon, Kilnam; Chung, Chul
A reliable datagram protocol on local area networks Journal Article
In: ACM SIGCOMM Computer Communication Review, vol. 16, no. 3, pp. 320–327, 1986, ISSN: 0146-4833.
@article{lee1986reliable,
title = {A reliable datagram protocol on local area networks},
author = {Dongman Lee and Kilnam Chon and Chul Chung},
url = {https://dl.acm.org/doi/abs/10.1145/1013812.18208},
doi = {10.1145/1013812.18208},
issn = {0146-4833},
year = {1986},
date = {1986-08-01},
urldate = {1986-08-01},
journal = {ACM SIGCOMM Computer Communication Review},
volume = {16},
number = {3},
pages = {320–327},
publisher = {ACM New York, NY, USA},
abstract = {Most of interprocess communications in transaction oriented distributed systems are based on client-server model, in which one process communicates with several processes simultaneously. Datagram service fits this type of communication rather than virtual circuit service. Transaction oriented distributed systems sometimes need to move large data such as a file or a part of database from a machine to other. The reliable delivery is fairly important since an error might cause retransmission of a whole data. In this paper, we propose the efficient mechanism for reliable datagram service, i) the concept of semi-virtual circuit and ii) the simple error detection and recovery algorithm based on our existing transport protocol, UDSTP. We describe implementation details supporting those facilities and performance results.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Most of interprocess communications in transaction oriented distributed systems are based on client-server model, in which one process communicates with several processes simultaneously. Datagram service fits this type of communication rather than virtual circuit service. Transaction oriented distributed systems sometimes need to move large data such as a file or a part of database from a machine to other. The reliable delivery is fairly important since an error might cause retransmission of a whole data. In this paper, we propose the efficient mechanism for reliable datagram service, i) the concept of semi-virtual circuit and ii) the simple error detection and recovery algorithm based on our existing transport protocol, UDSTP. We describe implementation details supporting those facilities and performance results.
0000
Huerta-Canepa, Gonzalo; Lee, Dongman; Kwak, Kyungman
MobiSAN: A Framework to Ease the Development of Mobile Social Software Journal Article
In: 0000.
@article{huertamobisan,
title = {MobiSAN: A Framework to Ease the Development of Mobile Social Software},
author = {Gonzalo Huerta-Canepa and Dongman Lee and Kyungman Kwak},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Namgoong, Han; Lee, Dongman; Nam, Dukyun
Message-Optimal Self-Configuration for Mobile Ad Hoc Networks Journal Article
In: SIGNALS AND COMMUNICATION TECHNOLOGY, pp. 215, 0000.
@article{namgoong2008messageb,
title = {Message-Optimal Self-Configuration for Mobile Ad Hoc Networks},
author = {Han Namgoong and Dongman Lee and Dukyun Nam},
url = {https://link.springer.com/content/pdf/10.1007/978-0-387-68567-0_9.pdf},
journal = {SIGNALS AND COMMUNICATION TECHNOLOGY},
pages = {215},
publisher = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Huerta-Canepa, Gonzalo; Lee, Dongman; Kwak, Kyungman
MobiSAN: A Framework to Ease the Development of Mobile Social Software Journal Article
In: 0000.
@article{huertamobisanc,
title = {MobiSAN: A Framework to Ease the Development of Mobile Social Software},
author = {Gonzalo Huerta-Canepa and Dongman Lee and Kyungman Kwak},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Hoang, XuanTung; Lee, Dongman; Lee, Younghee
Service Assignment Problem: Exploiting Group Context Information in Service Discovery for Multi-user Multi-service Ubiquitous Computing Environments Proceedings Article
In: 2008 International Symposium on Ubiquitous Multimedia Computing, pp. 160–165, IEEE 0000.
@inproceedings{hoang2008service,
title = {Service Assignment Problem: Exploiting Group Context Information in Service Discovery for Multi-user Multi-service Ubiquitous Computing Environments},
author = {XuanTung Hoang and Dongman Lee and Younghee Lee},
url = {https://ieeexplore.ieee.org/abstract/document/4656536},
urldate = {2008-01-01},
booktitle = {2008 International Symposium on Ubiquitous Multimedia Computing},
pages = {160–165},
organization = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
An, Ji-Sun; Ko, Yang-Woo; Lee, Dong-Man
Social-relation Aware Routing Protocol in Mobile Ad hoc Networks Journal Article
In: Journal of KIISE: Computing Practices and Letters, vol. 14, no. 8, pp. 798–802, 0000.
@article{an2008social,
title = {Social-relation Aware Routing Protocol in Mobile Ad hoc Networks},
author = {Ji-Sun An and Yang-Woo Ko and Dong-Man Lee},
url = {https://koreascience.kr/article/JAKO200800557077264.page},
urldate = {2008-01-01},
journal = {Journal of KIISE: Computing Practices and Letters},
volume = {14},
number = {8},
pages = {798–802},
publisher = {Korean Institute of Information Scientists and Engineers},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Ko, Yangwoo; Lee, Dongman
SGR: A shared generic routing support for ad hoc ubiquitous computing environments Conference
2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom), IEEE 0000.
@conference{ko2008sgr,
title = {SGR: A shared generic routing support for ad hoc ubiquitous computing environments},
author = {Yangwoo Ko and Dongman Lee},
url = {https://ieeexplore.ieee.org/abstract/document/4517421},
urldate = {2008-01-01},
booktitle = {2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom)},
pages = {360–365},
organization = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Han, Seunghyun; Lim, Mingyu; Lee, Dongman; Hyun, Soon J
A scalable interest management scheme for distributed virtual environments Journal Article
In: Computer Animation and Virtual Worlds, vol. 19, no. 2, pp. 129–149, 0000.
@article{han2008scalable,
title = {A scalable interest management scheme for distributed virtual environments},
author = {Seunghyun Han and Mingyu Lim and Dongman Lee and Soon J Hyun},
url = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/cav.218},
urldate = {2008-01-01},
journal = {Computer Animation and Virtual Worlds},
volume = {19},
number = {2},
pages = {129–149},
publisher = {Wiley Online Library},
abstract = {With the expansion of the internet and its bandwidth, distributed virtual environment (DVE) applications have become more prevalent. In DVE applications, users frequently crowd in a specific place, and a key aspect to consider is how to provide interactive performance for users. However, existing approaches using multicast require users to receive uninteresting messages. Even though recent works have addressed fine‐grained filtering, they still incur other drawbacks in terms of assigning lots of multicast addresses or handling overhead of multicast groups. This makes the system less scalable as the number of users increases. In this paper, we propose a new scalable filtering scheme that reduces not only the number of messages during interaction in a region and among neighboring regions, but also the number of multicast addresses without significant computational overhead. Interest management in a region dynamically creates groups of users with the same interests. While members communicate with each other with high fidelity, a representative sends information to non‐members with low frequency. For interaction among neighboring regions, we propose a sub‐region concept to select only a subset of users from the neighboring regions based on proximity, the distribution of the users' locations, and the viewing direction of a user. Copyright © 2007 John Wiley & Sons, Ltd.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
With the expansion of the internet and its bandwidth, distributed virtual environment (DVE) applications have become more prevalent. In DVE applications, users frequently crowd in a specific place, and a key aspect to consider is how to provide interactive performance for users. However, existing approaches using multicast require users to receive uninteresting messages. Even though recent works have addressed fine‐grained filtering, they still incur other drawbacks in terms of assigning lots of multicast addresses or handling overhead of multicast groups. This makes the system less scalable as the number of users increases. In this paper, we propose a new scalable filtering scheme that reduces not only the number of messages during interaction in a region and among neighboring regions, but also the number of multicast addresses without significant computational overhead. Interest management in a region dynamically creates groups of users with the same interests. While members communicate with each other with high fidelity, a representative sends information to non‐members with low frequency. For interaction among neighboring regions, we propose a sub‐region concept to select only a subset of users from the neighboring regions based on proximity, the distribution of the users' locations, and the viewing direction of a user. Copyright © 2007 John Wiley & Sons, Ltd.
Huerta-Canepa, Gonzalo; Lee, Dongman
A multi-user ad-hoc resource manager for smart spaces Conference
2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks, IEEE 0000.
@conference{huerta2008multi,
title = {A multi-user ad-hoc resource manager for smart spaces},
author = {Gonzalo Huerta-Canepa and Dongman Lee},
url = {https://ieeexplore.ieee.org/iel5/4586176/4594794/04594887.pdf},
urldate = {2008-01-01},
booktitle = {2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks},
pages = {1–6},
organization = {IEEE},
abstract = {Advancement in mobile devices makes possible to add more features to them while reducing the size. If we also consider the fact that they posses advance communications features, we can convert these devices into the central manager of users’ activities. One feature in this line is the ability to control the devices surrounding the user. Problems arise when the devices belong to a shared space. In this case we also need to consider interactions and conflicts between users. In this research we present a multi-user ad-hoc resource manager for smart spaces, which allow us to control devices present in the area, and avoid conflicts between users.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Advancement in mobile devices makes possible to add more features to them while reducing the size. If we also consider the fact that they posses advance communications features, we can convert these devices into the central manager of users’ activities. One feature in this line is the ability to control the devices surrounding the user. Problems arise when the devices belong to a shared space. In this case we also need to consider interactions and conflicts between users. In this research we present a multi-user ad-hoc resource manager for smart spaces, which allow us to control devices present in the area, and avoid conflicts between users.