{"title":"Security and Architectural Issues for National Security Cloud Computing","authors":"Anya Kim, J. McDermott, Myong H. Kang","doi":"10.1109/ICDCSW.2010.32","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.32","url":null,"abstract":"Security concerns with respect to cloud computing haveimpelled the private sector to suggest a hybrid cloudarchitecture consisting of private and public clouds.For national security purposes, we advocate a hybridcloud model that consists of private, public andcommunity clouds. The community clouds in thisarchitecture are as defined by NIST, and will be usedfor inter-agency and community-of-interest (COI)information sharing and collaboration needs. Thesecurity requirements and characteristics of private andpublic clouds will not differ greatly from the privatesector. However, while the architecturalcharacteristics remain the same, we believe thatnational security community clouds will have differentsecurity features than the typical community cloud inorder to support COI requirements. In this paper, wefocus on the requirements and characteristics ofnational security community clouds that can meet theneeds of COIs.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115203883","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}
Akihiro Yamanouchi, Takeshi Hashimoto, T. Ohta, Hideharu Kojima, Y. Kakuda
{"title":"Resource Management Middleware Using Mobile Agents for Mobile Ad Hoc Networks","authors":"Akihiro Yamanouchi, Takeshi Hashimoto, T. Ohta, Hideharu Kojima, Y. Kakuda","doi":"10.1109/ICDCSW.2010.29","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.29","url":null,"abstract":"The ad hoc network is a kind of autonomous decentralized networks that consist of mobile nodes and wireless links. Therefore, there are no nodes called administrator to manage the network. Many routing protocols and application for mobile ad hoc networks have been proposed so far, and then some test-bed systems have been constructed to evaluate the ad hoc network system in the real environment. However, in the real environment, it is not easy to evaluate the ad hoc network system because we have to disseminate the software resources for routing protocols or application to each node and keep a consistency of them among all nodes. Therefore, this paper proposes the resource management middleware to autonomously manage resources among all nodes in the network using mobile agents for mobile ad hoc networks. In order to assess the need of the proposed resource management middleware, we show the effect of using mobile agents in mobile ad hoc network environment through simulation environment. In addition to the simulation experiments, we implement the proposed resource management middleware on laptop PC's and demonstrate the field experiments.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"56 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114021048","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":"Carrier-Based Coverage Augmentation in Wireless Sensor and Robot Networks","authors":"R. Falcon, Xu Li, A. Nayak","doi":"10.1109/ICDCSW.2010.60","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.60","url":null,"abstract":"Carrier-based sensor placement involves mobile robots carrying and dropping (static) sensors for optimal coverage formation. Existing solutions target at traditional area coverage problem and unrealistically assume that robots carry sensors all together (ignoring the physical dimension of sensors and the limit of robot capacity). In this paper, we consider realistic scenarios that robots have to repeatedly reload sensors and address the FOCUSED coverage (F-coverage) problem [10]in an unknown two-dimensional environment. In F-coverage, sensors are required to surround a point of interest (POI), maximizing coverage radius. We propose a Carrier-Based Coverage Augmentation protocol (CBCA). Robots enter the environment from fixed locations, called base points, and move toward the POI. As soon as they get in touch with already deployed sensors, they search (by communication) along the network border for best sensor placement points with respect to F-coverage optimization, and move to drop sensors at the discovered locations. Border nodes store locations of failed sensors (if any exists) inside the network as well as adjacent available deployment spots outside the network, and recommend them to robots during the search process. Robots return to base points for reloading, after finishing with currently loaded sensors, and re-enter the environment to augment existing F-coverage. At the end o the paper, we propose an optimization technique to reduce augmentation delay and save robot energy.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123980178","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":"Reliable Routing in Vehicular Ad Hoc Networks","authors":"Gongjun Yan, N. Mitton, Xu Li","doi":"10.1109/ICDCSW.2010.62","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.62","url":null,"abstract":"One of the notoriously difficult problems in vehicular ad-hoc networks (VANET) is to ensure that established routing paths do not break before the end of data transmission. This is a difficult problem because the network topology is constantly changing and the wireless communication links are inherently unstable, due to high node mobility. In this paper we classify existing VANET routing protocols into five categories: connectivity-based, mobility-based, infrastructure-based, geographic-location-based, and probability-model-based, according to their employed routing metrics. For each category, we present the general design ideas and state of the art. Our objective is to attract more attention to the VANET routing problem and encourage more research efforts on developing reliable solutions.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116346215","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":"Simulative Evaluation of Adaptive Jamming Detection in Wireless Multi-hop Networks","authors":"N. Aschenbruck, E. Gerhards-Padilla, P. Martini","doi":"10.1109/ICDCSW.2010.57","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.57","url":null,"abstract":"One threat in wireless multi-hop networks is jamming the wireless channel. Jamming is easy to implement but nevertheless can have severe impact on the performance of the network. To study the impact of different jamming attacks as well as different detection approaches simulative evaluation is performed for scalability and reproducibility reasons. However, realistic propagation modeling in the simulator is often neglected. In this paper, we describe our integration of jamming attacks into the new realistic IEEE802.11 MAC and physical layer ofns-2. Based on this we evaluate different detection metrics: RSSI standard deviation, carrier sensing time, and expected packet delivery rate. In contrast to the related work thresholds for the metrics are dynamically and adaptively parametrized. In contrast to other studies that do not consider realistic MAC and physical models in our evaluation the carrier sensing time with dynamic thresholds shows best results.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"2009 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125630644","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":"Field Deployment of Low Power High Performance Nodes","authors":"K. Martinez, P. Basford, J. Ellul, Richard Clarke","doi":"10.1109/ICDCSW.2010.55","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.55","url":null,"abstract":"When deploying a sensor network into a harsh environment the need for high levels of fault tolerance and maximising the usage of available resources become extremely important. This has been achieved by implementing a highly fault tolerant system based on our Gumsense boards. These combine an ARM-based Linux system with an MSP430 for sensing and power-control. It also allows for dynamic schedule modifications based on the available power and can be synchronised with other systems without relying on direct communication, autonomous behaviour in case of total communications failure is also supported. A deployment on Vatnajökull, the largest ice-cap in Europe, has provided a long-term test for the systems and revealed strengths and weaknesses in the design decisions.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134367003","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}
Noriki Uchida, Goshi Sato, Kazuo Takahata, Y. Shibata
{"title":"Selective Routing Protocol for Cognitive Wireless Networks Based on User's Policy","authors":"Noriki Uchida, Goshi Sato, Kazuo Takahata, Y. Shibata","doi":"10.1109/ICDCSW.2010.44","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.44","url":null,"abstract":"Cognitive Wireless Network (CWN) is expected as one of the most efficient transmission methods to solve today’s wireless problems like the lack of wireless bands or the efficient usage of limited wireless resources. However, CWN have not established effective transmission methods considered with QoS or upper layers protocols yet. In this paper, selective transmission control method in cognitive wireless network considering with cross layers including user policies is proposed. First, at the observation stage, the physical data such as user policy, electric field strength, bit error rate, jitter, latency, packet error rate, and throughput are observed. Then, at the decision stage, AHP (Analytic hierarchy process) is applied for decision making process with those parameters. Finally, the action stage, one of the suitable link is chosen and changed links and networks. Also, the route selecting method is proposed based on AODV protocols. When route changes come to need, considerable wireless routes are listed by AODV protocol including network conditions. Then, the following three methods are used for route selection; 1)Route selection so that Maximizing End-to-End throughput among all of the routes for CBR. 2) Route selection so that Minimizing End-to-End delay time among all of the routes for VoIP. 3) Route selection so that Optimize the policy based AHP for Web service. In our simulation, ns2 is used for the computational results to the effectiveness of the suggested transmission methods in cognitive wireless networks. The results showed the effectiveness of the proposed methods.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116023562","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 Counting of Network Motifs","authors":"Dror Marcus, Y. Shavitt","doi":"10.1109/ICDCSW.2010.41","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.41","url":null,"abstract":"Counting network motifs has an important role in studying a wide range of complex networks. However, when the network size is large, as in the case of Internet Topology and WWW graphs counting the number of motifs becomes prohibitive. Devising efficient motif counting algorithms thus becomes an important goal. In this paper, we present efficient counting algorithms for 4-nodemotifs. We show how to efficiently count the total number of each type of motif, and the number of motifs adjacent to a node. We further present a new algorithm for node position-aware motif counting, namely partitioning the motif count by the node position in the motif. Since our algorithm is based on motifs, which are non-induced we also show how to calculate the count of induced motifs given the non-induced motif count. Finally, we report on initial implementation performance result using evaluation on a large-scale graph.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114962529","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":"Structural Graph Indexing for Mining Complex Networks","authors":"Hakan Kardes, M. H. Gunes","doi":"10.1109/ICDCSW.2010.42","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.42","url":null,"abstract":"Systems such as proteins, chemical compounds, and the Internet are being modeled as complex networks to identify local and global characteristics of the system. In many instances, these graphs are very large in size presenting challenges in their analysis. Hence, graph indexing techniques are developed to enhance various graph mining algorithms. In this paper, we propose a new Structural Graph Indexing (SGI) technique that does not limit the number of nodes in indexing to provide an alternative tool for graph mining algorithms. As indexing feature, we use common graph structures, namely, star, complete bipartite, triangle and clique, that frequently appear in protein, chemical compound, and Internet graphs. Note that, SGI lists all substructures matching structure formulations and other graph structures can be identified and added to the SGI.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130545769","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":"Architecture and Protocol for User-Controlled Access Management in Web 2.0 Applications","authors":"Maciej P. Machulak, A. Moorsel","doi":"10.1109/ICDCSW.2010.37","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.37","url":null,"abstract":"The rapidly developing Web environment provides users with a wide set of rich services as varied and complex as desktop applications. Those services are collectively referred to as ``Web 2.0'', with examples such as Google Docs, Flickr, or Wordpress, that allow users to create, manage and share their content online. By switching from desktop applications to their cloud-based Web equivalents users release even more data online. It is the user who creates this data, who disseminates it and who shares it with other users and services. Storing and sharing resources on the Web poses new security challenges. Access control, in particular, is currently poorly addressed in such an environment and is not well suited to the increasing number of resources that are available online. We propose a new approach to access control for the Web. Our approach puts a user in full control of assigning access rights to their resources which may be spread across multiple cloud-based Web applications. Unlike existing authorization systems, it relies on a user's centrally located security requirements for these resources.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131620","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}