{"title":"A novel method for authenticating mobile agents with one-way signature chaining","authors":"A. Saxena, B. Soh","doi":"10.1109/ISADS.2005.1452050","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452050","url":null,"abstract":"Mobile agents are mobile programs capable of maintaining their execution states as they migrate between different execution platforms. A key security problem in such systems is how to trust the code coming from a remote platform before it can be executed. In this paper, we set a formal model for mobile agent security based on cryptographic primitives and describe a protocol that enables trust relationships to be formed between agent platforms in an ad-hoc manner. This protocol can be used to authenticate agents before granting execution privileges. The main idea behind our approach is the concept of 'additive' zero-know ledge which we demonstrate using non-commutative associative one-way functions.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121113718","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}
Yosuke Sugiyama, Y. Horikoshi, H. Kuriyama, K. Moriyama
{"title":"Service search technology in autonomous decentralized community system for timeliness","authors":"Yosuke Sugiyama, Y. Horikoshi, H. Kuriyama, K. Moriyama","doi":"10.1109/ISADS.2005.1452079","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452079","url":null,"abstract":"Information services in accordance with users' preference, utilization place and time are required more and more. Autonomous Decentralized Community System (ADCS) has been proposed to provide such services. ADCS consists of many autonomous stationary nodes and its network covers lands. In ADCS various services are provided on the network and their locations are unpredictable. To utilize these services, distributive service discovery technology is available. However, it has problem on response time. This paper proposes the Autonomous Service Search Technology which consists of two techniques. One is search area restriction technique that does not limit request propagation area, but broadcast reply message. The reply follows and catches up with request message propagation, and consequently request forwarding area is restricted. The other is termination detection technique that enables each node to detect termination autonomously by recursive judgment. The effectiveness of proposal on response time is shown by simulation.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124553555","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}
{"title":"Multisensor multitarget tracking methods based on particle filter","authors":"Xiong Wei, Zhang Jing-wei, He You","doi":"10.1109/ISADS.2005.1452073","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452073","url":null,"abstract":"In order to solve the multisensor multitarget tracking problem of the non-Gaussian nonlinear systems, the paper presents a multisensor joint probabilistic data association particle (MJPDAP) algorithm. At first, the algorithm permutes and combines the measurement from each sensor using the rule of generalized S-D assignment algorithm. Then, all of measurements in each assignment are combined into one equivalent measurement and the joint likelihood function of the equivalent measurement is calculated. Finally, the particle weight is updated and the state estimation of the fusion center is obtained, using joint probability data association (JPDA) method. In this paper, some Monte Carlo simulations are used to analyze the performance of the new method. The simulation results show the MJPDAP can effectively track multitarget in the nonlinear systems, and be of much better performance than the single-sensor joint probabilistic data association particle (SJPDAP) algorithm.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117174242","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}
K. Ragab, K. Moriyama, H. Kuriyama, Y. Horikoshi, Yosuke Sugiyama
{"title":"An autonomous decentralized community overly network division and integration technology for achieving timeliness","authors":"K. Ragab, K. Moriyama, H. Kuriyama, Y. Horikoshi, Yosuke Sugiyama","doi":"10.1109/ISADS.2005.1452077","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452077","url":null,"abstract":"Autonomous community overlay network (CON) is a decentralized architecture that forms a community of individual end-users (community members) having the same interests and demands in somewhere, at specified time. It enables them to mutually cooperate and share information without loading up any single node excessively. For flexible and efficient communication among community members, an autonomous multilayer community overlay network (multilayer-CON) is proposed. This paper illustrates an approach to reconstruct the multilayer-CON on a top of a dynamic, unpredictable, and heterogeneous Internet environment by divide and integrate sub-communities. Furthermore, it evaluates the performance of the community communication over the multilayer-CON and gives evidence of the existence of the tradeoff relationship between the communication delay and construction overhead.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053178","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}
{"title":"Autonomous decentralized high-speed processing technology and the application in an integrated IC card fixed-line and wireless system","authors":"A. Shiibashi","doi":"10.1093/ietisy/e88-d.12.2699","DOIUrl":"https://doi.org/10.1093/ietisy/e88-d.12.2699","url":null,"abstract":"The IC card fare collection system (marketed as 'Suica'), introduced by East Japan Railway Company (JR East) in November 2001, is an integrated combination of fixed-line and wireless systems, where a contact-less IC card communicates by wireless with automatic fare collection devices (terminals) such as automatic fare collection gate machines (AFC gate machines), and the terminals communicate by fixed-line with center servers. In addition, the terminals and center servers are configured in autonomous decentralized architecture, so if trouble happens, the trouble does not expand into the whole system. It is necessary for terminal AFC devices to provide high-speed processing and high-reliability because of the nature of railway transportation service. For these reasons, technologies and applications that can meet these requirements have been introduced to our system. In the following, we describe the autonomous decentralized high-speed processing technology and the applications that make it possible in the IC card system (Suica) that is an integration of fixed-line and wireless technologies.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439336","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}
Y. Horikoshi, N. Kaji, H. Kuriyama, Yosuke Sugiyama
{"title":"Autonomous cooperation technology for real-time marketing with high accuracy in autonomous decentralized community system","authors":"Y. Horikoshi, N. Kaji, H. Kuriyama, Yosuke Sugiyama","doi":"10.1109/ISADS.2005.1452078","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452078","url":null,"abstract":"A group of users having a common preference and situation is called community where a service according to their preference and situation is provided. Real-time marketing for this service requires real-time property and accuracy of these preferences obtained by a service provider. Autonomous decentralized community system that consists of autonomous nodes and autonomous synchronization technology have been proposed to achieve timeliness by reducing the number of preferences data towards a service provider. Although this technology achieves high accuracy, many varieties of preference cannot be aggregated within a deadline. In this paper, heterogeneous processes about timeliness and accuracy are introduced. An autonomous cooperation technology is proposed to achieve both real-time property and accuracy. In this technology, each node autonomously switches from high-accuracy and low-response process to low-accuracy and high-response process. Consequently, high accuracy result in real-time is procured. Simulation results show effectiveness of the proposed technology.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"32 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121513474","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}
{"title":"Autonomous decentralized resource allocation for tracking dynamic load change","authors":"T. Masuishi, H. Kuriyama, Yasuyuki Oki, K. Mori","doi":"10.1109/ISADS.2005.1452067","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452067","url":null,"abstract":"System architecture is proposed to adapt computing resource to load changes of the service requests from the Internet. The architecture employs an autonomous decentralized computing scheme for resource allocation. A subsystem has a production server to process service requests and a coordination server to adapt computing resource to load changes. Coordination is executed among subsystems to calculate how many resources are needed. Three system architectures, centralized resource allocation, autonomous decentralized resource allocation with independent adaptation and autonomous decentralized resource allocation with coordinated adaptation, are compared for tracking ability through simulation. Autonomous decentralized resource allocation with coordinated adaptation shows a good tracking ability comparable to the centralized resource allocation that should be nearly optimal. Since autonomous decentralized architecture shows better performance for availability than centralized architecture, autonomous decentralized allocation achieves the best performance for overall criteria.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114961352","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}
K. Kera, Masayuki Shoji, T. Igarashi, Akio Ando, K. Mori
{"title":"Assurance technology for large transport operation control system","authors":"K. Kera, Masayuki Shoji, T. Igarashi, Akio Ando, K. Mori","doi":"10.1109/ISADS.2005.1452062","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452062","url":null,"abstract":"The recent large transport operation control system with a long construction period has the needs of step-by-step system construction. Therefore, an assurance point of view is necessary for the system construction. We mention assurance evaluation based step-by-step construction technology, data filtering for online protection, and operation mode management. In addition, we show the effectiveness of the assurance technology through simulation and actual application for transport operation control systems.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123493029","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}
{"title":"Replication scheme for traffic load balancing and its parameter tuning in pure P2P communication","authors":"S. Nogami, M. Uchida, T. Abe","doi":"10.1109/ISADS.2005.1452173","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452173","url":null,"abstract":"A replication scheme is an effective method for maintaining a high hit rate for target files. This paper proposes a new replication scheme that scatters 'replicas' of files to other servants on a P2P network for the purpose of dispersing query and download traffic. First, the details of this proposed scheme are described and its parameter tuning is discussed by introducing rating functions. Second, the effectiveness of this scheme is evaluated by simulation. The simulation results demonstrate that the proposed scheme has superior performance for some characteristic values, such as the hit rate and the number of mean hops to the target servant, compared with other schemes. Finally, the influence of departure rate is discussed.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"14 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123663235","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}
{"title":"Situation-aware access control for service-oriented autonomous decentralized systems","authors":"S. Yau, Yisheng Yao, Vageesh Banga","doi":"10.1109/ISADS.2005.1452011","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452011","url":null,"abstract":"Service-oriented autonomous decentralized systems (S-ADS) have been presented to address the extreme dynamism in large-scale information systems. In S-ADS, various capabilities are independently constructed and managed by different providers as autonomous services that are distributed over various types of networks, including wireless and wired networks. One of the key challenges in S-ADS is to have an effective access control mechanism that can meet the dynamic and diverse security requirements of various users and providers of an S-ADS system. Current access control mechanisms can hardly meet this challenge due to lack of situation-awareness. In this paper, a situation-aware access control approach is presented, which is middleware-based and integrates situation-awareness capability and role based access control (RBAC) models to provide a practical solution for access control in S-ADS. The situation-aware RBAC model is designed for specifying dynamic access policies in an S-ADS system. Due to the situation-awareness capability of our approach, flexible and high-grained access policies can be specified and enforced for various providers and users.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127396953","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}