In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predicts user purpose and destination to present various information based on predicted purpose without user interaction. It requires the correct road where the car drives in real time, and it also need to know the route from the start point to the current point correctly. The proposal map matching method divides the trajectory into equal intervals and calculates the shortest path score for each one. Testing using GPS data for actual car trips showed that its use results in better destination prediction than with conventional methods in most cases. The results were the best for intervals of 5 minutes.
{"title":"A Map Matching Algorithm for Car Navigation Systems that Predict User Destination","authors":"K. Miyashita, T. Terada, S. Nishio","doi":"10.1109/WAINA.2008.242","DOIUrl":"https://doi.org/10.1109/WAINA.2008.242","url":null,"abstract":"In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predicts user purpose and destination to present various information based on predicted purpose without user interaction. It requires the correct road where the car drives in real time, and it also need to know the route from the start point to the current point correctly. The proposal map matching method divides the trajectory into equal intervals and calculates the shortest path score for each one. Testing using GPS data for actual car trips showed that its use results in better destination prediction than with conventional methods in most cases. The results were the best for intervals of 5 minutes.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132724153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Atsushi Takeda, K. Hashimoto, G. Kitagata, S. Zabir, Tetsuo Kinoshita, N. Shiratori
In recent years, P2P networks have been evolving at a rapid pace. Authentication of nodes in P2P networks, however, remains a difficult task to conduct efficiently. In this paper, we therefore propose a new authentication method called hash-based distributed authentication method (HDAM). HDAM realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in the P2P network. It performs a distributed management of public keys by using Web of trust and distributed hash table. Our proposal significantly reduces both the memory size requirement and the overhead of communication data sent by the nodes.
{"title":"A New Authentication Method with Distributed Hash Table for P2P Network","authors":"Atsushi Takeda, K. Hashimoto, G. Kitagata, S. Zabir, Tetsuo Kinoshita, N. Shiratori","doi":"10.1109/WAINA.2008.203","DOIUrl":"https://doi.org/10.1109/WAINA.2008.203","url":null,"abstract":"In recent years, P2P networks have been evolving at a rapid pace. Authentication of nodes in P2P networks, however, remains a difficult task to conduct efficiently. In this paper, we therefore propose a new authentication method called hash-based distributed authentication method (HDAM). HDAM realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in the P2P network. It performs a distributed management of public keys by using Web of trust and distributed hash table. Our proposal significantly reduces both the memory size requirement and the overhead of communication data sent by the nodes.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133714577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shunji Uchino, N. Abe, Hiroshi Takada, T. Yagi, H. Taki, Shoujie He
In this research, a dialog environment between human and virtual agent has been constructed. With the commercial off-the-shelf VR technologies, special devices such as data glove have to be used for the interaction. But this is difficult to manipulate objects. If there is a helper who has direct access to objects in a virtual space, we may ask him. The question, however, is how to communicate with the helper. This paper presents a solution to the question. The basic idea is to utilize speech recognition and gesture recognition systems. Experimental results have proved the effectiveness of the approach in terms of facilitating man-machine interaction and communication. The environment constructed in this research allows a user to communicate by talking and showing gestures to a personified agent in virtual environment. A user can use his/her finger to point at a virtual object and ask the agent to manipulate the virtual object.
{"title":"Virtual Reality Interaction System between User and Avatar with Distributed Processing","authors":"Shunji Uchino, N. Abe, Hiroshi Takada, T. Yagi, H. Taki, Shoujie He","doi":"10.1109/WAINA.2008.124","DOIUrl":"https://doi.org/10.1109/WAINA.2008.124","url":null,"abstract":"In this research, a dialog environment between human and virtual agent has been constructed. With the commercial off-the-shelf VR technologies, special devices such as data glove have to be used for the interaction. But this is difficult to manipulate objects. If there is a helper who has direct access to objects in a virtual space, we may ask him. The question, however, is how to communicate with the helper. This paper presents a solution to the question. The basic idea is to utilize speech recognition and gesture recognition systems. Experimental results have proved the effectiveness of the approach in terms of facilitating man-machine interaction and communication. The environment constructed in this research allows a user to communicate by talking and showing gestures to a personified agent in virtual environment. A user can use his/her finger to point at a virtual object and ask the agent to manipulate the virtual object.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131863993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes a novel design and implementation of distributed RBAC (dRBAC) and single sign-on (SSO) system that spans over multiple administrative domains with high availability. The core idea is based on multi-agent systems (MAS) technique owing to its modularity, autonomy, distributedness, flexibility, and scalability. All agents serve their specific purposes. Leveraging agents simplifies high availability. PKI is used for trust enablement between intra- and inter-domain agent communications. The security assertion markup language (SAML) is adopted for supporting the exchange of authentication and authorization information in the architecture. The approach supports strong two-factor authentication with X.509 digital certificate. The authorization scheme is based on the privilege management infrastructure (PMI). Finally, we reported our extended implementation status and demonstrated that our proposed model is efficient and flexible to implement in the multiple SSO and PKI domains.
{"title":"An SSO-Capable Distributed RBAC Model with High Availability across Administrative Domain","authors":"S. Juntapremjitt, S. Fugkeaw, P. Manpanpanich","doi":"10.1109/WAINA.2008.175","DOIUrl":"https://doi.org/10.1109/WAINA.2008.175","url":null,"abstract":"This paper proposes a novel design and implementation of distributed RBAC (dRBAC) and single sign-on (SSO) system that spans over multiple administrative domains with high availability. The core idea is based on multi-agent systems (MAS) technique owing to its modularity, autonomy, distributedness, flexibility, and scalability. All agents serve their specific purposes. Leveraging agents simplifies high availability. PKI is used for trust enablement between intra- and inter-domain agent communications. The security assertion markup language (SAML) is adopted for supporting the exchange of authentication and authorization information in the architecture. The approach supports strong two-factor authentication with X.509 digital certificate. The authorization scheme is based on the privilege management infrastructure (PMI). Finally, we reported our extended implementation status and demonstrated that our proposed model is efficient and flexible to implement in the multiple SSO and PKI domains.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134322855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hung-Yi Chang, Pi-Chung Wang, Chia-Tai Chan, Chun-Liang Lee
In this paper, we propose a new SLA model for best effort IP traffic over WDM networks. This model jointly considers two QoS metrics, workable traffic volume and availability, as SLA parameters. We devise an algorithm of integer programming to minimize operation cost for the incremental traffic.
{"title":"A New Service Level Agreement Model for Best-Effort Traffics in IP over WDM","authors":"Hung-Yi Chang, Pi-Chung Wang, Chia-Tai Chan, Chun-Liang Lee","doi":"10.1109/WAINA.2008.104","DOIUrl":"https://doi.org/10.1109/WAINA.2008.104","url":null,"abstract":"In this paper, we propose a new SLA model for best effort IP traffic over WDM networks. This model jointly considers two QoS metrics, workable traffic volume and availability, as SLA parameters. We devise an algorithm of integer programming to minimize operation cost for the incremental traffic.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133382386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The success of next generation wireless networks will rely much on advanced mechanisms for seamless mobility support among emerging heterogeneous technologies. Currently, mobile IP is the most promising solution for mobility management in the Internet. Several IP micro mobility approaches have been proposed to enhance the performance of Mobile IP which supports quality of service, minimum packet loss, limited handoff delay and scalability. Recent efforts are focusing on providing seamless handover, fault tolerance, reliability and continuous end-to-end service connectivity on the move minimizing the delay and disruption period for real time applications and hence, failures that inhibit communications or result in loss of critical data will not be tolerated. The goal of this paper is to develop a Fault Tolerant HA WAII (FT- HA WAII) protocol and investigate the performance in Tree and partial Mesh routing topologies. Simulation results show that FT- HA WAII can effectively resolve the fault tolerant problem in domain based wireless access networks.
下一代无线网络的成功将在很大程度上依赖于新兴异构技术之间无缝移动支持的先进机制。目前，移动IP是互联网中最有前途的移动管理解决方案。为了提高移动IP的性能，人们提出了几种IP微移动方法，以支持服务质量、最小的数据包丢失、有限的切换延迟和可扩展性。最近的工作重点是提供无缝切换、容错、可靠性和持续的端到端移动服务连接，最大限度地减少实时应用程序的延迟和中断时间，因此，禁止通信或导致关键数据丢失的故障将是不可容忍的。本文的目标是开发一种容错HA WAII (FT- HA WAII)协议，并研究其在Tree和partial Mesh路由拓扑结构中的性能。仿真结果表明，该算法能有效地解决基于域的无线接入网中的容错问题。
{"title":"Fault Tolerant HAWAII Protocol for IP services in Wireless Networks","authors":"R. Gunasundari, S. Shanmugavel, K. Bakyalakshmi","doi":"10.1109/WAINA.2008.200","DOIUrl":"https://doi.org/10.1109/WAINA.2008.200","url":null,"abstract":"The success of next generation wireless networks will rely much on advanced mechanisms for seamless mobility support among emerging heterogeneous technologies. Currently, mobile IP is the most promising solution for mobility management in the Internet. Several IP micro mobility approaches have been proposed to enhance the performance of Mobile IP which supports quality of service, minimum packet loss, limited handoff delay and scalability. Recent efforts are focusing on providing seamless handover, fault tolerance, reliability and continuous end-to-end service connectivity on the move minimizing the delay and disruption period for real time applications and hence, failures that inhibit communications or result in loss of critical data will not be tolerated. The goal of this paper is to develop a Fault Tolerant HA WAII (FT- HA WAII) protocol and investigate the performance in Tree and partial Mesh routing topologies. Simulation results show that FT- HA WAII can effectively resolve the fault tolerant problem in domain based wireless access networks.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133800114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The scheduling strategy of subtask decomposed (sub- DC) is presented in this article, which includes two parts. The first part is layered transaction of DAG (directed acyclic graph), which all subtasks are divided into different layers according to precedence relation; The second part is task assignation, in the first, min-min scheduling strategy is used to assign subtasks of one layer to each computer of system; after subtasks of one layer are assigned, load balancing strategy is used to dynamically adjusted system load, which makes use of character of subtasks decomposed and makes one layer subtasks are assigned better reason; then layer-by-layer subtasks are assigned using the same method. The Sub-DC not only makes subtasks of each layer be executed as quickly as possible, but also makes the application be executed in shorter time. The implement result shows that the Sub-DC is better than the level-by-level scheduling strategy (sub-Lev).
{"title":"Scheduling Strategy of Subtask Decomposed","authors":"Benting Wan","doi":"10.1109/WAINA.2008.77","DOIUrl":"https://doi.org/10.1109/WAINA.2008.77","url":null,"abstract":"The scheduling strategy of subtask decomposed (sub- DC) is presented in this article, which includes two parts. The first part is layered transaction of DAG (directed acyclic graph), which all subtasks are divided into different layers according to precedence relation; The second part is task assignation, in the first, min-min scheduling strategy is used to assign subtasks of one layer to each computer of system; after subtasks of one layer are assigned, load balancing strategy is used to dynamically adjusted system load, which makes use of character of subtasks decomposed and makes one layer subtasks are assigned better reason; then layer-by-layer subtasks are assigned using the same method. The Sub-DC not only makes subtasks of each layer be executed as quickly as possible, but also makes the application be executed in shorter time. The implement result shows that the Sub-DC is better than the level-by-level scheduling strategy (sub-Lev).","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130369851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the principles governing the design and development of a mobile application, as well as various aspects regarding its integration into a more complex RFID_B2B (radio frequency identification - business to business) system. Extending the applicability of RFID_B2B systems represents the main goal of such applications, which are generally expected to handle large amount of data, to operate in stand-alone mode and to allow their easy integration into complex RFID_B2B systems. The paper proposes new solutions and ideas regarding the design and development of a secure and very fast method for the communication and synchronization between the B2B servers and a mobile application running on various mobile devices.
{"title":"Integrating Mobile Applications into RFID Based B2B Systems","authors":"T. Cerlinca, C. Turcu, M. Cerlinca","doi":"10.1109/WAINA.2008.233","DOIUrl":"https://doi.org/10.1109/WAINA.2008.233","url":null,"abstract":"This paper presents the principles governing the design and development of a mobile application, as well as various aspects regarding its integration into a more complex RFID_B2B (radio frequency identification - business to business) system. Extending the applicability of RFID_B2B systems represents the main goal of such applications, which are generally expected to handle large amount of data, to operate in stand-alone mode and to allow their easy integration into complex RFID_B2B systems. The paper proposes new solutions and ideas regarding the design and development of a secure and very fast method for the communication and synchronization between the B2B servers and a mobile application running on various mobile devices.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124876061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed to detect stepping-stone since 1995. One of those approaches proposed by A. Blum detects stepping-stone by checking if the difference between the number of the send packets of an incoming connection and the one of an outgoing connection is bounded. One weakness of this method is in resisting intruders' evasion, such as chaff perturbation. In this paper, we propose a method based on random walk theory to detect stepping-stone intrusion. Our theoretical analysis shows that the proposed method is more effective than Blum's approach in terms of resisting intruders' chaff perturbation.
{"title":"Monitoring Network Traffic to Detect Stepping-Stone Intrusion","authors":"Jianhua Yang, Byong Lee, Stephen S. H. Huang","doi":"10.1109/WAINA.2008.30","DOIUrl":"https://doi.org/10.1109/WAINA.2008.30","url":null,"abstract":"Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed to detect stepping-stone since 1995. One of those approaches proposed by A. Blum detects stepping-stone by checking if the difference between the number of the send packets of an incoming connection and the one of an outgoing connection is bounded. One weakness of this method is in resisting intruders' evasion, such as chaff perturbation. In this paper, we propose a method based on random walk theory to detect stepping-stone intrusion. Our theoretical analysis shows that the proposed method is more effective than Blum's approach in terms of resisting intruders' chaff perturbation.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134110744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a flooding algorithm with retransmission node selection (FARNS) for wireless sensor networks. It is an efficient cross-layer based flooding technique to solve a broadcast storm problem that is produced by simple flooding of nodes in wireless sensor networks. FARNS can decrease waste of unnecessary energy by controlling retransmission action of whole network nodes by deciding retransmission candidate nodes that are selected by identifier information of neighbor nodes in MAC and distance with neighborhood nodes through received signal strength information in PHY. In simulation results show that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, and the number of redundancy packets and overhead.
{"title":"An Efficient Cross-Layer Based Flooding Algorithm with Retransmission Node Selection for Wireless Sensor Networks","authors":"Seung-Joon Choi, Ki-Hyuk Kwon, S. Yoo","doi":"10.1109/WAINA.2008.32","DOIUrl":"https://doi.org/10.1109/WAINA.2008.32","url":null,"abstract":"In this paper, we propose a flooding algorithm with retransmission node selection (FARNS) for wireless sensor networks. It is an efficient cross-layer based flooding technique to solve a broadcast storm problem that is produced by simple flooding of nodes in wireless sensor networks. FARNS can decrease waste of unnecessary energy by controlling retransmission action of whole network nodes by deciding retransmission candidate nodes that are selected by identifier information of neighbor nodes in MAC and distance with neighborhood nodes through received signal strength information in PHY. In simulation results show that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, and the number of redundancy packets and overhead.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115870362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：