2010 International Conference on Broadband, Wireless Computing, Communication and Applications最新文献

{"title":"Two Types of Trustworthiness of Acquaintances in Peer-to-Peer (P2P) Overlay Networks","authors":"Soichi Sawamura, L. Barolli, A. Aikebaier, Valbona Barolli, M. Takizawa","doi":"10.1109/BWCCA.2010.90","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.90","url":null,"abstract":"Peer-to-peer(P2P) systems are in nature fully distributed with no centralized coordinator. A peer ps has to collect correct object information from trustworthy acquaintances which are considered to hold correct information. We consider two types of trustworthiness. First, the subjective trustworthiness stst on an acquaintance pt shows how much the peer ps trusts the acquaintance pt. The objective trustworthiness otst on an acquaintance pt indicates how much other peers trust the acquaintance pt. In this paper, we discuss three algorithms OT1, OT2, and OT3 for a peer ps to obtain the objective trustworthiness otst on the acquaintance pt. A peer ps collects subjective trustworthiness on an acquaintance pt from peers and obtain the average value as the objective trustworthiness. In the algorithm OT1, a peer ps tries to find every acquaintance of a target acquaintance pt in a type of flooding algorithm. Here, it takes time and more number of messages are transmitted. On the other hand, the peer ps sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT1 and OT2. In OT2, only acquaintances which the peer ps can trust are considered. We evaluate the algorithms in terms of how correct objective trustworthiness can be obtained.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131132647","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":"Behavior Shaver: An Application Based Layer 3 VPN that Conceals Traffic Patterns Using SCTP","authors":"M. Mimura, Hidehiko Tanaka","doi":"10.1109/BWCCA.2010.152","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.152","url":null,"abstract":"In recent years, distributed systems are connected by VPN (Virtual Private Network) through the Internet, and construct complicated information systems. These information systems bring benefit and security risks to many users. Representative security risks, vulnerabilities are closely related to application software installed in information systems. If a malicious adversary identifies the application software, he can seek the vulnerabilities easily. Thus, to ensure security of information systems, it is necessary to conceal application software installed in information systems. On the other hand, some attempts have been proposed to identify application software or protocol without scanning the payload. These proposed methods can analyze encrypted traffic, because the methods scan traffic patterns such as packet sizes and transmission intervals. While there are some legitimate uses for encrypted traffic analysis, these methods also raise problems about the confidentiality of encrypted traffic. Many researchers proposed countermeasures against traffic analysis to ensure anonymity in a public network. They indicated how to alter traffic patterns in the main. However, a few researcher indicated how to implement the method. Indeed, though previous VPN applications protect payloads against an eavesdropper, do not conceal side channel information including traffic patterns. Our work applies these proposed countermeasures and shows how to implement a secure VPN application that conceals traffic patterns. To alter traffic patterns, it is necessary to control packet sizes. Many popular application based VPN encapsulates packets by TCP or UDP. However, TCP cannot control packet sizes strictly. Though UDP can control packet sizes without difficulty, does not ensure reliable data transmission. A secure application based VPN requires a protocol that can control packet sizes strictly and can ensure reliable data transmission in untrusted networks. SCTP (Stream Control Transmission Protocol) is a suitable solution for these requirements. This paper proposes the behavior shaver, an application based layer 3 VPN that conceals traffic patterns using SCTP. The results of experiments show the performance.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121152328","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":"Advanced Relay Nodes for Adaptive Network Services - Concept and Prototype Experiment","authors":"M. Shimamura, T. Ikenaga, M. Tsuru","doi":"10.1109/BWCCA.2010.158","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.158","url":null,"abstract":"Due to explosive growth of Internet usage with diversifying communication technologies and applications, the current Internet is facing serious problems and approaching a turning point. To achieve diversity and harmony with human society, more adaptive and flexible sharing schemes of network resource are required. Especially when a number of large-scale distributed applications share the resource, efficacy on comprehensive usage of network, computation, and storage resources is needed from the viewpoint of information processing as a whole. Therefore, reconsideration of coordination and partitioning of functions between networks (providers) and applications (users) become a recent research topic. In this paper, we discuss the feasibility and issues of flexible and adaptive network services by introducing advanced relay nodes inside the network. Furthermore, we present implementation design of advanced relay nodes, and show experimental results using these nodes.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128169120","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":"Relations among 10-Minute Precipitation, Rainfall Intensity and Ku-Band Rain Attenuation in Kyushu Island, Japan","authors":"K. Fujisaki, Goshi Satoh, M. Tateiba","doi":"10.1109/BWCCA.2010.136","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.136","url":null,"abstract":"Increasing demand for high-speed and reliable satellite communication has led to the use of Ku-band and higher frequency bands. However, higher frequency satellite systems over Ku-band are caused the large signal attenuation by rainfall. To overcome this effect and to keep high performance communication, it is crucial to propose adaptive control systems. As the first step of considering the adaptive control systems based on the information of rainfall, this paper evaluates the relations among 10-minute precipitation, rainfall intensity and rain attenuation by using experimental data of Ku-band satellite communication observed at three different locations in Kyushu Island, Japan.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133113295","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":"Efficient Address Management for Mobile Ad Hoc Networks","authors":"Sudath Indrasinghe, R. Pereira, J. Haggerty","doi":"10.1109/BWCCA.2010.41","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.41","url":null,"abstract":"A Mobile Ad-hoc Network (MANET) can be implemented anywhere where there is little or no communication infrastructure, or the existing infrastructure is inconvenient to use. Dynamic and distributed address management is required due to host mobility and lack of central administration in MANETs. Many address management schemes have been proposed for this type of network but these are not without their problems. In this paper, we present distributed algorithms for new host configuration, address reclamation, MANET partition and MANETs merging. Simulation results demonstrate that the proposed mechanisms are simple, efficient and reliable in comparison to existing mechanisms.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122400081","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":"Design and Implementation of Repository-Based Agent Organization Method on Heterogeneous Agent Platform","authors":"Takahiro Uchiya, Tetsuo Kinoshita","doi":"10.1109/BWCCA.2010.170","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.170","url":null,"abstract":"To achieve cooperative problem solving for use in providing human activity surrogates and supporters, various agents have been designed and developed using many agent platforms. Generally, realizing cooperation and construction remain as difficult problems confronting agent organizations using different agents running on a heterogeneous agent platform, in contrast to similar agents running on a homogeneous platform. To overcome that problem, we propose a systematic method to construct an agent organization with different agents on a heterogeneous agent platform. As described herein, we propose a design and implementation of our proposed method. Moreover, we underscore the effectiveness of our method using experimentation.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121202230","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":"A Road Location Estimating Method by Many Trajectories to Realize Rapid Map Survey for a Car Navigation System","authors":"Hiromitsu Sugawara, Nobuyoshi Sato, T. Takayama, Y. Murata","doi":"10.1109/BWCCA.2010.176","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.176","url":null,"abstract":"Electronic maps on current car navigation system is updated after surveying works, generating and editing map data when a road is newly opened to traffic. Therefore, long time is needed to update the map is completed. Also, online map updating service is now available, however, only expressways and highways are reflected for the map updating since surveying works and editing maps by hand is needed. Therefore, we have proposed a car navigation system that copes with newly constructed roads by estimating locations and shapes of new roads using many trajectories of vehicles as corrective intelligence measured by GPS. In this paper, we describe a method to estimate location of new roads and its experimental results.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116367104","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":"DDoS Detection Technique Using Statistical Analysis to Generate Quick Response Time","authors":"S. Oshima, T. Nakashima, T. Sueyoshi","doi":"10.1109/BWCCA.2010.153","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.153","url":null,"abstract":"DDoS attacks to servers cause the dysfunctional condition and finally bring the server to be stopped. Previous researches to detect and defense for DDoS attacks have shown that the entropy for the source IP address or destination port number is the effective metric to detect these DoS/DDoS attacks. In the organization incoming the small amount of packets, the window width to calculate an entropy value could be reduced in order to detect attacks early. On the other hand, the small window width leads to the difficulty to set the threshold of entropy value over the small available threshold value area. In this research, we propose the calculation method of the dynamic threshold varying the time sequence. This threshold will be effective on the case of the small window width leading the quick response to the attacks. Our proposed method could be able to early detect in the organization with the small amount of packets. In addition, the proposed calculation is effective for the case using the different IP fields.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117093348","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":"Development of Detection System for the Bed Accident Using Ultrasonic Wave Sensor","authors":"H. Agatsuma, Takehiko Abe, Takuya Tajima, Haruhiko Kimura","doi":"10.1109/BWCCA.2010.169","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.169","url":null,"abstract":"This paper proposes a sensing system for detecting the accident at a space between bed fences. The number of accidents of elderly people on the bed has increased rapidly. Especially, there are a lot of fatal accidents that relate to the bed fence. For instance, some elderly people choked to death because their necks were caught in a space between the bed fences. To prevent such accidents, the full care of the elderly person by the caretakers is necessary. However, such care for a long time becomes a big burden for them. Therefore automated monitoring system for elderly person on the bed is required. Now there is no existing research related to the monitoring system for detecting bed fence accidents. Therefore, we develop a detection system which is able to monitor an elderly person on a bed.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115343729","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":"Wireless Distributed Network System for Relief Activities after Disasters - A Field Experiment for Channel Setting and a System for Information Exchange among Shelters","authors":"Misako Urakami, Satoshi Innami, Makoto Kamegawa, Tetsuya Shigeyasu, H. Matsuno","doi":"10.1109/BWCCA.2010.79","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.79","url":null,"abstract":"Safety information of evacuees is the most important information for relief activities in disasters. We have discussed about required conditions for computer systems destined for supporting effective relief activities after disasters. In addition, on the basis of this discussion, we also have proposed a network construction algorithm and have performed preliminary evaluation about the installation locations among wireless stations and wireless link connectivity. In this paper, we report the results of preliminary evaluation of the performance of information sharing algorithm ADES. In addition, this paper introduces an improved system called ADES-Plus. ADES-Plus system employs information management function by an existing database. Furthermore, in accordance with the required speed of information sharing, we add a function that enables flexible processings. These new functions are confirmed to be work well through computational experiments.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"581 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116300476","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}