Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207366
Eitaro Kohno, T. Ohta, Y. Kakuda
In wireless sensor networks, sensor nodes have limited computational power and memory size. The data is vulnerable to attack due to the nature of the systems, so maintaining confidentiality is an important problem. Most security methods are based on common or public key cryptosystems. However, these methods have problems with encryption of data. When nodes try to encrypt data, they must preestablish keys. When nodes send data to the sink node, all of the exchanged information will concentrate in the sink node. This creates a single point of failure. In this paper, we propose a new distribution method resilient against node capture attacks using the Secret Sharing Scheme. In addition, we will confirm the ability of our method to improve resiliency against node capture attacks, comparing it with TinySec, which is the major security architecture of wireless sensor networks. Also, we compare the resiliency to existing pairwise key establishment methods.
{"title":"Secure decentralized data transfer against node capture attacks for wireless sensor networks","authors":"Eitaro Kohno, T. Ohta, Y. Kakuda","doi":"10.1109/ISADS.2009.5207366","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207366","url":null,"abstract":"In wireless sensor networks, sensor nodes have limited computational power and memory size. The data is vulnerable to attack due to the nature of the systems, so maintaining confidentiality is an important problem. Most security methods are based on common or public key cryptosystems. However, these methods have problems with encryption of data. When nodes try to encrypt data, they must preestablish keys. When nodes send data to the sink node, all of the exchanged information will concentrate in the sink node. This creates a single point of failure. In this paper, we propose a new distribution method resilient against node capture attacks using the Secret Sharing Scheme. In addition, we will confirm the ability of our method to improve resiliency against node capture attacks, comparing it with TinySec, which is the major security architecture of wireless sensor networks. Also, we compare the resiliency to existing pairwise key establishment methods.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117282793","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207365
Fan Wei, Xiaodong Lu, K. Mori, K. Hama, Yohei Kotake
In transportation service system with the advancement of global mobile communication technology, user could utilize resources anywhere and at anytime. In such a system, efficient resource utilization and timely resource provision are required. However, due to centralized management, such requirements can not be satisfied by conventional transportation service system in high congestion and dynamically changing conditions. Autonomous Decentralized Community System (ADCS) in which the members with same preference share information in local majority has been proposed. Based on ADCS, resources can be shared in community by successive transportation. In this paper, to meet heterogeneous requirements, a tradeoff relationship between timely resource provision and efficient resource utilization is analyzed. Each node autonomously constructs a community by its surplus resources. In this community, each node provides resources for user requests. Autonomous collaboration technology is proposed to make collaborations in community and between communities to satisfy these requirements. In this paper, through evaluation of taxi dispatching application, the effectiveness of proposed technology is approved.
{"title":"Autonomous collaboration technology in resource provision and utilization community","authors":"Fan Wei, Xiaodong Lu, K. Mori, K. Hama, Yohei Kotake","doi":"10.1109/ISADS.2009.5207365","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207365","url":null,"abstract":"In transportation service system with the advancement of global mobile communication technology, user could utilize resources anywhere and at anytime. In such a system, efficient resource utilization and timely resource provision are required. However, due to centralized management, such requirements can not be satisfied by conventional transportation service system in high congestion and dynamically changing conditions. Autonomous Decentralized Community System (ADCS) in which the members with same preference share information in local majority has been proposed. Based on ADCS, resources can be shared in community by successive transportation. In this paper, to meet heterogeneous requirements, a tradeoff relationship between timely resource provision and efficient resource utilization is analyzed. Each node autonomously constructs a community by its surplus resources. In this community, each node provides resources for user requests. Autonomous collaboration technology is proposed to make collaborations in community and between communities to satisfy these requirements. In this paper, through evaluation of taxi dispatching application, the effectiveness of proposed technology is approved.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134450726","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207364
Yusuke Hara, K. Kinoshita, N. Yamai, K. Murakami
Multiagent systems for information retrieval over large-scale networks are considered an effective technology and have received much attention. In a typical case, such information retrieval has time constraints, since the network contains too much information. In this paper, we assume that each retrieval result can be scored and propose a method to control agent execution to improve the score of the result that each agent has acquired. This method terminates the agents that are less likely to be able to complete their tasks by a given deadline and/or to acquire the result of a higher score than that they have already obtained. Finally, simulation experiments show the excellent performance of the proposed method.
{"title":"An efficient agent control method for information retrieval with time constraints","authors":"Yusuke Hara, K. Kinoshita, N. Yamai, K. Murakami","doi":"10.1109/ISADS.2009.5207364","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207364","url":null,"abstract":"Multiagent systems for information retrieval over large-scale networks are considered an effective technology and have received much attention. In a typical case, such information retrieval has time constraints, since the network contains too much information. In this paper, we assume that each retrieval result can be scored and propose a method to control agent execution to improve the score of the result that each agent has acquired. This method terminates the agents that are less likely to be able to complete their tasks by a given deadline and/or to acquire the result of a higher score than that they have already obtained. Finally, simulation experiments show the excellent performance of the proposed method.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133540606","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207342
Soochang Park, Euisin Lee, Fucai Yu, Min-Sook Jin, Sang-Ha Kim
In wireless sensor networks, groups of mobile users interested in equivalent information could be classified into two categories according to existence of direct communication channel among the users: 1) loosely coupled user group and 2) tightly coupled user group. The loosely coupled group means that a mobile user should communicate with others via a wireless sensor network for querying, gathering, and sharing of information interested from the group. Several information communication mechanisms have already been proposed to support mobility of the loosely coupled user groups. However, the mechanisms may not suit in case of sensor applications with multiple data sources since those are usually construct a network structure per each source. Namely, according to the mechanisms, too many network structures for the many data sources could be constructed and it may causes excessive computing overhead and energy exhaustion of sensors. Therefore, we propose an information communication mechanism to support mobility of loosely coupled mobile users in sensor applications with multiple sources. First, we examine the problems for mobility support of the loosely coupled groups in wireless sensor networks with multiple source nodes, and then study the dynamic sink communication model for data gathering from multiple sources and data delivery to a mobile user. Finally, we present an energyefficient solution to support mobility of loosely coupled groups based on data gathering tree establishment via distributed manner and tree-based data multicasting.
{"title":"Information communication scheme for loosely coupled mobile users in wireless sensor fields with multiple sources","authors":"Soochang Park, Euisin Lee, Fucai Yu, Min-Sook Jin, Sang-Ha Kim","doi":"10.1109/ISADS.2009.5207342","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207342","url":null,"abstract":"In wireless sensor networks, groups of mobile users interested in equivalent information could be classified into two categories according to existence of direct communication channel among the users: 1) loosely coupled user group and 2) tightly coupled user group. The loosely coupled group means that a mobile user should communicate with others via a wireless sensor network for querying, gathering, and sharing of information interested from the group. Several information communication mechanisms have already been proposed to support mobility of the loosely coupled user groups. However, the mechanisms may not suit in case of sensor applications with multiple data sources since those are usually construct a network structure per each source. Namely, according to the mechanisms, too many network structures for the many data sources could be constructed and it may causes excessive computing overhead and energy exhaustion of sensors. Therefore, we propose an information communication mechanism to support mobility of loosely coupled mobile users in sensor applications with multiple sources. First, we examine the problems for mobility support of the loosely coupled groups in wireless sensor networks with multiple source nodes, and then study the dynamic sink communication model for data gathering from multiple sources and data delivery to a mobile user. Finally, we present an energyefficient solution to support mobility of loosely coupled groups based on data gathering tree establishment via distributed manner and tree-based data multicasting.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132700701","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207339
X. Zhang, Y. Sekiya, Y. Wakahara
Black hole attack is a serious threat in a mobile ad hoc network (MANET). In this attack, a malicious node injects a faked Route Reply message to deceive the source node so that the source node establishes a route to the malicious node and sends all the data packets to the malicious node. Every conventional method to detect such an attack has a defect of rather high rate of misjudgment in the detection. In order to overcome this defect, we propose a new detection method based on checking the sequence number in the Route Reply message by making use of a new message originated by the destination node and also by monitoring the messages relayed by the intermediate nodes in the route. Computer simulation results demonstrate that our method has a feature of much lower false positive and negative rates in detecting any number of malicious nodes than the conventional methods.
{"title":"Proposal of a method to detect black hole attack in MANET","authors":"X. Zhang, Y. Sekiya, Y. Wakahara","doi":"10.1109/ISADS.2009.5207339","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207339","url":null,"abstract":"Black hole attack is a serious threat in a mobile ad hoc network (MANET). In this attack, a malicious node injects a faked Route Reply message to deceive the source node so that the source node establishes a route to the malicious node and sends all the data packets to the malicious node. Every conventional method to detect such an attack has a defect of rather high rate of misjudgment in the detection. In order to overcome this defect, we propose a new detection method based on checking the sequence number in the Route Reply message by making use of a new message originated by the destination node and also by monitoring the messages relayed by the intermediate nodes in the route. Computer simulation results demonstrate that our method has a feature of much lower false positive and negative rates in detecting any number of malicious nodes than the conventional methods.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124376639","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207326
C. Bridges, T. Vladimirova
Space and satellite systems are considered to be the most extreme environment to design for and are fraught with engineering difficulty. Performance metrics such as fault tolerance, reliability, pre-determinism and heritage are still high of the list of requirements for all missions. But with the advent of modern day electronics, greater computing capability and networking technologies have enabled research into distributed satellite systems, where multiple spacecraft work collaboratively to perform a mission. Leveraging from these technologies, a satellite can be considered one of many nodes in an autonomous system. This paper proposes the use of an Agent based computing platform to solve orbit dynamics problems leading to a highly mobile and decentralized system. The latest Agent platforms are compared and possible Agent applications are presented; specifically, distributed image compression and a novel topology reconfiguration scheme.
{"title":"Agent computing applications in distributed satellite systems","authors":"C. Bridges, T. Vladimirova","doi":"10.1109/ISADS.2009.5207326","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207326","url":null,"abstract":"Space and satellite systems are considered to be the most extreme environment to design for and are fraught with engineering difficulty. Performance metrics such as fault tolerance, reliability, pre-determinism and heritage are still high of the list of requirements for all missions. But with the advent of modern day electronics, greater computing capability and networking technologies have enabled research into distributed satellite systems, where multiple spacecraft work collaboratively to perform a mission. Leveraging from these technologies, a satellite can be considered one of many nodes in an autonomous system. This paper proposes the use of an Agent based computing platform to solve orbit dynamics problems leading to a highly mobile and decentralized system. The latest Agent platforms are compared and possible Agent applications are presented; specifically, distributed image compression and a novel topology reconfiguration scheme.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131494347","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207330
Habel Kurian, Abhishek Rakshit, Gurdip Singh
With the increased deployment of pervasive systems, there has been an explosive growth in the number of applications being developed for such systems. Distributed applications typically depend on the underlying middleware infrastructure to provide services to perform their tasks. Many applications rely on a service which can detect the termination of a distributed activity being performed by a set of entities. Existing algorithms for termination detection are based on the layering paradigm wherein the algorithm can monitor application level communication. Pervasive applications, however, may not be structured as strictly layered systems. This paper proposes algorithms for termination detection of distributed applications in pervasive systems. We propose two algorithms for this problem, and show that each performs better than the other under certain conditions. Subsequently, we propose an hybrid algorithm which combines the features of the two algorithms and provides performance comparable to the better of the two algorithms under different conditions.
{"title":"Detecting termination in pervasive sensor networks","authors":"Habel Kurian, Abhishek Rakshit, Gurdip Singh","doi":"10.1109/ISADS.2009.5207330","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207330","url":null,"abstract":"With the increased deployment of pervasive systems, there has been an explosive growth in the number of applications being developed for such systems. Distributed applications typically depend on the underlying middleware infrastructure to provide services to perform their tasks. Many applications rely on a service which can detect the termination of a distributed activity being performed by a set of entities. Existing algorithms for termination detection are based on the layering paradigm wherein the algorithm can monitor application level communication. Pervasive applications, however, may not be structured as strictly layered systems. This paper proposes algorithms for termination detection of distributed applications in pervasive systems. We propose two algorithms for this problem, and show that each performs better than the other under certain conditions. Subsequently, we propose an hybrid algorithm which combines the features of the two algorithms and provides performance comparable to the better of the two algorithms under different conditions.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127664808","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207371
C. Liaskos, S. Petridou, G. Papadimitriou, Petros Nicopolitidis, A. Pomportsis
The Broadcast Disks method is commonly used to schedule the data transmission in wireless push based networks. The performance of a system that utilizes this method depends upon several parameters. This paper presents the Optimization- Based Procedure (OBP), an analytical approach for estimating the optimal values of these parameters. The validity of the analysis is verified through simulation and comparison with other popular and traditional approaches. The new approach was found to be accurate and dominant in the vast majority of a wide set of test cases. It also provided a thorough insight of the system's stability and behavior in general.
{"title":"An analytical approach to the design of wireless broadcast disks systems","authors":"C. Liaskos, S. Petridou, G. Papadimitriou, Petros Nicopolitidis, A. Pomportsis","doi":"10.1109/ISADS.2009.5207371","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207371","url":null,"abstract":"The Broadcast Disks method is commonly used to schedule the data transmission in wireless push based networks. The performance of a system that utilizes this method depends upon several parameters. This paper presents the Optimization- Based Procedure (OBP), an analytical approach for estimating the optimal values of these parameters. The validity of the analysis is verified through simulation and comparison with other popular and traditional approaches. The new approach was found to be accurate and dominant in the vast majority of a wide set of test cases. It also provided a thorough insight of the system's stability and behavior in general.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130498444","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207363
Kostas Kolomvatsos, S. Hadjiefthymiades
Intelligent Agents can help users in finding and retrieving goods from electronic marketplaces. Additionally, agents can represent providers in such places facilitating the automatic negotiation about the purchase of products. In this paper, we describe a finite horizon bargaining model between buyers and sellers and we focus on the seller's side. Seller agents are a good example of an autonomous decentralized system. We present a method for the ‘bargaining’ deadline calculation based on Fuzzy-Logic (FL). Such deadline indicates the time for which it is profitable for a seller to participate in the bargaining procedure. We provide methods for automatic fuzzy rules generation. These rules result the deadline values at each interaction and are based on data provided by experts. We compare results taken from a Fuzzy controller based on such automatic methods with results taken by previous research efforts.
{"title":"Automatic Fuzzy rules generation for the deadline calculation of a seller agent","authors":"Kostas Kolomvatsos, S. Hadjiefthymiades","doi":"10.1109/ISADS.2009.5207363","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207363","url":null,"abstract":"Intelligent Agents can help users in finding and retrieving goods from electronic marketplaces. Additionally, agents can represent providers in such places facilitating the automatic negotiation about the purchase of products. In this paper, we describe a finite horizon bargaining model between buyers and sellers and we focus on the seller's side. Seller agents are a good example of an autonomous decentralized system. We present a method for the ‘bargaining’ deadline calculation based on Fuzzy-Logic (FL). Such deadline indicates the time for which it is profitable for a seller to participate in the bargaining procedure. We provide methods for automatic fuzzy rules generation. These rules result the deadline values at each interaction and are based on data provided by experts. We compare results taken from a Fuzzy controller based on such automatic methods with results taken by previous research efforts.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129730428","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}
Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207391
Ryota Ayaki, Kenya Sato, Kohei Kadowaki, Takahiro Koita
In recent years, there have been developed many kinds of embedded devices, such as information appliances, mobile phones, PDAs, with digital music playing function. To meet a growing demand for music playback on such embedded devices, a number of music download services for embedded devices are available on the Internet. Since most embedded devices are not capable of working in cooperation with other devices, they cannot, however, share resources among themselves. For this reason, some embedded devices may not have a software updating function, for they were made for particular purposes. Therefore, when a new music codec comes out in the future, such devices have no means to play music that is encoded with the newly released codec. To address these problems, we propose a distributed music delivery system using Adaptive Jini that a software platform for a network embedded device does not need to have programs to use functions in advance. In the distributed music delivery system, a music player does not have the music content or the decoder needed to play the music requested from a user. By implementing and evaluating the system, we confirm that the system does function as a distributed system for music resource sharing.
{"title":"A proposal of distributed music delivery system with Adaptive Jini","authors":"Ryota Ayaki, Kenya Sato, Kohei Kadowaki, Takahiro Koita","doi":"10.1109/ISADS.2009.5207391","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207391","url":null,"abstract":"In recent years, there have been developed many kinds of embedded devices, such as information appliances, mobile phones, PDAs, with digital music playing function. To meet a growing demand for music playback on such embedded devices, a number of music download services for embedded devices are available on the Internet. Since most embedded devices are not capable of working in cooperation with other devices, they cannot, however, share resources among themselves. For this reason, some embedded devices may not have a software updating function, for they were made for particular purposes. Therefore, when a new music codec comes out in the future, such devices have no means to play music that is encoded with the newly released codec. To address these problems, we propose a distributed music delivery system using Adaptive Jini that a software platform for a network embedded device does not need to have programs to use functions in advance. In the distributed music delivery system, a music player does not have the music content or the decoder needed to play the music requested from a user. By implementing and evaluating the system, we confirm that the system does function as a distributed system for music resource sharing.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129778981","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
扫码关注我们
求助内容：
应助结果提醒方式：