发布求助
文献互助 智能选刊 最新文献

2011 Tenth International Symposium on Autonomous Decentralized Systems最新文献

筛选
英文 中文
A Resource-Efficient Method for Crawling Swarm Information in Multiple BitTorrent Networks 多bt网络中爬行群信息的资源高效方法
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.72
Masahiro Yoshida, A. Nakao
{"title":"A Resource-Efficient Method for Crawling Swarm Information in Multiple BitTorrent Networks","authors":"Masahiro Yoshida, A. Nakao","doi":"10.1109/ISADS.2011.72","DOIUrl":"https://doi.org/10.1109/ISADS.2011.72","url":null,"abstract":"Bit Torrent is one of the most popular P2P file sharing applications in the world. Each Bit Torrent network is called a swarm and millions of peers may join multiple swarms. Due to swarm's large network size and complexity, many resources (PC servers, the Internet connection, etc.) are required for measuring all the swarms in the world. For this reason, the existing work is forced to measure only a part of the entire set of swarms, thus, ends up understanding only a part of it. In this paper, we propose a resource-efficient method for crawling multiple Bit Torrent swarms by only a limited amount of resources such as a single PC server. In the proposed method, our crawler avoids collecting redundant information of swarms without pressing WAN access links nor expending much processing resources. We also use a number of techniques to efficiently crawl all the participating peers of multiple swarms. We crawl over 4.3 million unique .torrent files, small files that store metadata used in Bit Torrent, and 48,000 tracker addresses. We can crawl 4.3 million swarms within an hour. We obtain 24 swarm snapshots and 10 million unique peers in a day.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132789008","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}
引用次数: 16
A Data Transfer Scheme Using Autonomous Clustering in VANETs Environment 一种基于VANETs环境的自主聚类数据传输方案
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.69
S. Teshima, T. Ohta, Eitaro Kohno, Y. Kakuda
{"title":"A Data Transfer Scheme Using Autonomous Clustering in VANETs Environment","authors":"S. Teshima, T. Ohta, Eitaro Kohno, Y. Kakuda","doi":"10.1109/ISADS.2011.69","DOIUrl":"https://doi.org/10.1109/ISADS.2011.69","url":null,"abstract":"An ad hoc network is a decentralized network that consists of mobile nodes with wireless communication devices without the aid of access points. A Vehicular Ad-hoc Networks (VANETs) is one of the representative application of ad hoc networks. Epidemic Routing has been proposed as a routing protocol based on Store-Carry-Forward mechanism for VANETs environment. However, in Epidemic Routing, network resources such as packet buffer of a node are significantly consumed because data packets are spread across the network. Therefore, this paper proposes a new data forwarding scheme that combines Epidemic Routing and autonomous clustering for VANETs environment. The proposed scheme configures multiple clusters in the network and then only the cluster head that manages the cluster stores and forwards data packet to mitigate the consumption of network resources. Finally, this paper presents the simulation results to show the effectiveness of the proposed scheme.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"51 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114092683","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}
引用次数: 16
Safety Support System on School Routes Based on Grouping of Childlen in Mobile Ad Hoc Networks 基于移动Ad Hoc网络中儿童分组的学校路线安全支持系统
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.75
Atsushi Ito, Y. Kakuda, T. Ohta, S. Inoue
{"title":"Safety Support System on School Routes Based on Grouping of Childlen in Mobile Ad Hoc Networks","authors":"Atsushi Ito, Y. Kakuda, T. Ohta, S. Inoue","doi":"10.1109/ISADS.2011.75","DOIUrl":"https://doi.org/10.1109/ISADS.2011.75","url":null,"abstract":"In 2007, the Ministry of Internal Affairs and Communications of Japan tested 16 different models of a safety support system for children on school routes. One of the models was constructed and tested at a school in an area of the city of Hiroshima from September to December of 2007. For the model project, we developed a new safety support system for children on school routes by using a mobile ad hoc network constructed from mobile phones with the Bluetooth function. The support system provided good performance and accuracy in maintaining the safety of students on the way to school [7]. The basic idea of the safety support system is the grouping of children and volunteers using a mobile ad hoc network. In this paper, we present an outline of this system and evaluate the performance of grouping and the effectiveness of our approach.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115955592","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}
引用次数: 5
Socio-familiar Personalized Service and Its Application -- Towards a New Network Software for Next Generation Ubiquitous Service 社会熟悉的个性化服务及其应用——面向下一代泛在服务的新型网络软件
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.65
K. Hashimoto, G. Kitagata, Hideyuki Takahashi, Atsushi Takeda, D. Chakraborty, N. Shiratori
{"title":"Socio-familiar Personalized Service and Its Application -- Towards a New Network Software for Next Generation Ubiquitous Service","authors":"K. Hashimoto, G. Kitagata, Hideyuki Takahashi, Atsushi Takeda, D. Chakraborty, N. Shiratori","doi":"10.1109/ISADS.2011.65","DOIUrl":"https://doi.org/10.1109/ISADS.2011.65","url":null,"abstract":"Japan, along with many developed countries, is facing severe social problems caused by a declining birth rate. Gradual shrinkage of the working population has brought shortages of workers performing various services such as elderly care. Women are potential workers, but social assistance of working women remains insufficient. Social services such as elderly care and support for working women must be developed to address these problems. The infrastructure for future ubiquitous services must be designed as a service platform to provide those services respecting individual personal circumstances and at socially acceptable cost. Ubiquitous services provide enhanced mobility. Future ubiquitous services will evolve toward enhanced pervasiveness, and will be defined as advanced personalized services. This report presents a new concept, Socio-familiar Personalized Service (S-P Service), for future ubiquitous services based on sociality and humanity. Moreover, we propose a scalable distributed authentication method to realize S-P Service.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122863441","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}
引用次数: 0
A Service Registry Meta-model Framework for Interoperability 用于互操作性的服务注册元模型框架
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.58
Zaiwen Feng, Rong Peng, Bing Li, K. He, Chong Wang, Jian Wang, Cheng Zeng
{"title":"A Service Registry Meta-model Framework for Interoperability","authors":"Zaiwen Feng, Rong Peng, Bing Li, K. He, Chong Wang, Jian Wang, Cheng Zeng","doi":"10.1109/ISADS.2011.58","DOIUrl":"https://doi.org/10.1109/ISADS.2011.58","url":null,"abstract":"currently there exist many kinds of semantic Web Service models on the internet. They are heterogeneous so that it is hard to understand and interoperate each other. In this paper, we study several mainstream semantic Web Service models, and extract meta-models for each from the perspective of semantic Web Service discovery. Based on this, we propose the universal meta-model for semantic Web Service registration within the background of meta-model framework for interoperability (MFI, ISO/IEC19763). Some cases are studied and infrastructure supporting our work is demonstrated. The work in the paper may be regarded as an extension to UDDI on service semantics facet, and has been proposed to ISO as ISO/IEC 19763 Part 7.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"366 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132587612","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}
引用次数: 4
Study on Interaction Behaviors of Micro-autonomous Vehicles 微型自动驾驶汽车交互行为研究
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.59
Deyi Li, Xiaodong Wang, Wen He, Mu Guo, Tianlei Zhang
{"title":"Study on Interaction Behaviors of Micro-autonomous Vehicles","authors":"Deyi Li, Xiaodong Wang, Wen He, Mu Guo, Tianlei Zhang","doi":"10.1109/ISADS.2011.59","DOIUrl":"https://doi.org/10.1109/ISADS.2011.59","url":null,"abstract":"Autonomous vehicles are very hot research area which advance artificial intelligent, pattern recognition, computer vision, sensor fusion and control theory. In the paper we demonstrate a kind of micro-autonomous vehicle, describing hardware and software architectures, perception system and control method-cloud control. Our goal is study interaction behaviors between autonomous vehicles and how to take appropriate measure to avoid driving conditions hazardous. We propose a new control alogrithm-cloud control algorithm and experiments show cloud control algorithm has good performance and flexibility.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125344836","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}
引用次数: 1
Online Anomaly Symptom Detection and Process's Resource Usage Control 在线异常现象检测及进程资源使用控制
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.106
Midori Sugaya, Kimio Kuramitsu
{"title":"Online Anomaly Symptom Detection and Process's Resource Usage Control","authors":"Midori Sugaya, Kimio Kuramitsu","doi":"10.1109/ISADS.2011.106","DOIUrl":"https://doi.org/10.1109/ISADS.2011.106","url":null,"abstract":"In this paper we propose an online lightweight anomaly symptom detection and process’s resource usage control mechanism. Our system collects fine-grain resource information that can reflect the subtle changes of the application’sbehavior. Then it creates models with a learning-based algorithm without manual configurations. If an anomaly symptom is detected, the automatic procedure will start. The system will control the suspected application’s resource use by limiting the upper bound resource of the process. The method will make the application yield its CPU to the administrative inspection. In this paper, we described whole architecture of the system and evaluate it with the non deterministic and deterministic failure. Our experimental results indicate that our prototype system is able to detect non deterministic failure with high precision in anomaly training and control it’s resource use with an overhead of about 1%.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126202688","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}
引用次数: 1
The Permanent Challenge: How to Enhance Assurance to Users of Computer and Communication Systems? 永久的挑战:如何加强对电脑及通讯系统用户的保障?
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.82
M. Malek
{"title":"The Permanent Challenge: How to Enhance Assurance to Users of Computer and Communication Systems?","authors":"M. Malek","doi":"10.1109/ISADS.2011.82","DOIUrl":"https://doi.org/10.1109/ISADS.2011.82","url":null,"abstract":"Permanence of the assurance challenge in computer and communication systems is described and justified. Models and methods of meeting the assurance challenge are briefly outlined.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125256728","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}
引用次数: 0
Fast Detection of Path Failures in an Autonomous Decentralized System 自主分散系统中路径故障的快速检测
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.43
Jianli Sun, Yinong Chen
{"title":"Fast Detection of Path Failures in an Autonomous Decentralized System","authors":"Jianli Sun, Yinong Chen","doi":"10.1109/ISADS.2011.43","DOIUrl":"https://doi.org/10.1109/ISADS.2011.43","url":null,"abstract":"An autonomous decentralized system and a series of methods for reducing the detection time of path failures in the system are developed. Computing devices in the proposed system are organized into at least three groups based on their connectivity of system’s graph model. Each computing device is assigned three identification values associated with their group memberships. The identification values are stored in a router connected to the communications network. Heartbeat packets are sent from the computing devices to the router periodically. If the router fails to receive a heartbeat packet from a computing device, a failed communication path from the router to the computing device is determined based on the three identification values.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126622197","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}
引用次数: 1
Autonomous and Adaptive Wireless Networking with Bio-inspired Algorithms 基于仿生算法的自主和自适应无线网络
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.85
N. Wakamiya, M. Murata
{"title":"Autonomous and Adaptive Wireless Networking with Bio-inspired Algorithms","authors":"N. Wakamiya, M. Murata","doi":"10.1109/ISADS.2011.85","DOIUrl":"https://doi.org/10.1109/ISADS.2011.85","url":null,"abstract":"A new generation network is expected to keep operating and providing users and applications with means of communication while being exposed to dynamic and substantial change in the operational environment such as network topology, traffic, and QoS requirement. To establish a highly adaptive and reliable network, we take an approach to be inspired by biological systems, which adapt themselves to dynamically changing and even unexpected environment. In this paper we show examples of application of bio-inspired models, more specifically the attractor selection/composition models built on adaptive behavior of biological systems, to autonomous and adaptive networking in wireless communication systems. The first application is MANET routing, where a path connecting a source-destination pair must be maintained under dynamically changing environment. The second application is resource allocation among nodes and applications competing for wireless networks with heterogeneous characteristics. We further discuss future direction of bio-inspired adaptive networking.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125898690","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}
引用次数: 7
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信