Yiling Wang, Huy Hoang Ngo, P. D. Le, B. Srinivasan, Vishv M. Malhotra
{"title":"Multicasting Key Management in Wireless Networks","authors":"Yiling Wang, Huy Hoang Ngo, P. D. Le, B. Srinivasan, Vishv M. Malhotra","doi":"10.1109/NBiS.2009.52","DOIUrl":"https://doi.org/10.1109/NBiS.2009.52","url":null,"abstract":"Multicasting is an efficient communication mechanism to deliver information to a number of recipients. Due to the broadcast nature of wireless communication, multicasting has great potential for commercial and military applications in wireless networks. In this paper, we propose a secure and efficient key management scheme, hybrid key management (HKM), for the wireless multicasting. Compared to the existing multicasting key management approaches, our proposal can achieve operation efficiency.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126721496","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}
Makoto Ikeda, L. Barolli, M. Hiyama, Tao Yang, G. Marco, A. Durresi
{"title":"Performance Evaluation of a MANET Tested for Different Topologies","authors":"Makoto Ikeda, L. Barolli, M. Hiyama, Tao Yang, G. Marco, A. Durresi","doi":"10.1109/NBiS.2009.32","DOIUrl":"https://doi.org/10.1109/NBiS.2009.32","url":null,"abstract":"In this paper, we present the implementation and analysis of our implemented testbed considering the Optimized Link State Routing (OLSR) protocol. We investigate the effect of mobility and topology changing in the throughput of a Mobile Ad-hoc Network (MANET). The mobile nodes move toward the destination at a regular speed. When the mobile nodes arrive at the corner, they stop for about three seconds. Experimental time is 150 seconds. In our experiments, we consider two cases: only one node is moving (mobile node) and one of OLSR daemon stopped at 50 seconds, after that it start at 100 seconds. We assess the performance of our tested in terms of throughput, Round Trip Time (RTT) and packet loss. From our experiments, we found that the node join and leave operations affect more the TCP throughput and RTT than UDP.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126952114","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":"Angular Mobility Assisted Coverage in Directional Sensor Networks","authors":"C. Kandoth, S. Chellappan","doi":"10.1109/NBIS.2009.69","DOIUrl":"https://doi.org/10.1109/NBIS.2009.69","url":null,"abstract":"In this paper, we consider the issue of angular mobility assisted coverage enhancement in directional camera sensor networks. In our model, each sensor can visually capture (i.e. sense) events within a sector in its field of view, and can also rotate about a fixed axis to enhance its coverage. The problem we particularly address is how to enhance blanket coverage leveraging angular mobility of the sensors in the network starting from an arbitrary initial deployment. The core idea of our algorithm, called the Face Away algorithm, is to use the known directions of neighboring sensors to find the direction with the least density of neighbors for each sensor, in an attempt to minimize the sensing range overlap between neighboring sensors. The algorithm is localized, light-weight and purely distributed. Simulation results are presented to illustrate the performance of our algorithm as a function of various parameters like number of sensor nodes, sensing range, and angle of view.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116472835","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}
F. Xhafa, Zorion Arrizabalaga, Jordi Misse, L. Barolli
{"title":"Parameter Tuning of JXTA-Based P2P Platforms","authors":"F. Xhafa, Zorion Arrizabalaga, Jordi Misse, L. Barolli","doi":"10.1109/NBIS.2009.22","DOIUrl":"https://doi.org/10.1109/NBIS.2009.22","url":null,"abstract":"P2P technologies have appeared as disruptive technologies that have spawned large scale collaborative applications involving thousands or even millions of users world-wide. Undoubtedly, most successful applications of P2P paradigm are information sharing between individuals and groups of users, which enable sharing and searching for digital content information, and exchanging via P2P communication such information. However, P2P applications are still difficult to program and to efficiently deploy in real network infrastructures and usually have network efficiency problems. A part from intrinsic difficulties of P2P algorithmics, there are difficulties in efficiently tuning P2P applications in real environments. Indeed, P2P applications usually involve many parameters, whose values cannot be arbitrarily fixed but require a careful tuning to achieve expected performance. In this work, we show by example of a P2P JXTA-based platform, how to tune the parameters of the platform using existing software tools (JConsole and JHat) and enhance its performance.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122608985","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}
Sandeep Raghuram, Yuni Xia, M. Palakal, Josette F. Jones, Dave Pecenka, E. Tinsley, Jean Bandos, Jerry Geesaman
{"title":"Bridging Text Mining and Bayesian Networks","authors":"Sandeep Raghuram, Yuni Xia, M. Palakal, Josette F. Jones, Dave Pecenka, E. Tinsley, Jean Bandos, Jerry Geesaman","doi":"10.1109/NBiS.2009.102","DOIUrl":"https://doi.org/10.1109/NBiS.2009.102","url":null,"abstract":"Bayesian networks need to be updated as and when new data is observed. Literature mining is a very important source of this new data after the initial network is constructed using the expert’s knowledge. In this work, we specifically interested in the causal associations and experimental results obtained from literature mining. However, these associations and numerical results cannot be directly integrated with the Bayesian network. The source of the literature and the perceived quality of research needs to be factored into the process of integration, just like a human, reading the literature, would. We present a general methodology for deriving a confidence measure for the mined data and provide inputs to the expert for resolving the modeling issues in integrating it with the existing network.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900661","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":"Orthogonal Expansion of Port-scanning Packets","authors":"H. Kikuchi, Tomohiro Kobori, M. Terada","doi":"10.1109/NBiS.2009.82","DOIUrl":"https://doi.org/10.1109/NBiS.2009.82","url":null,"abstract":"Observation of port-scan packets performed over the Internet is involved with so many parameters including time, port numbers, source and destination addresses. There are some common port numbers to which many malicious codes likely use to scan, but a relationship between port numbers and the malicious codes are not clearly identified. In this paper, we propose a new attempt to figure characteristics of port-scans observed from distributed many sensors. Our method allows 1) analysis of sensors with few significant factors extracted from an orthogonal expansion of port-scan packets, rather than taking care of all possible statistics of port numbers, 2) compression of packets data, computed by linear combination of limited number of orthogonal factors, and 3) approximation of number of scanning packets at arbitrarily specified sensor and ports, made from statistical correlation between port numbers. We also evaluate the accuracy of our proposed approximation algorithm based on actually observed packets.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124635791","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":"Toward Ontology-Driven Omics Data Integration in Current Database Management Systems","authors":"John A. Springer, J. Chen","doi":"10.1109/NBiS.2009.80","DOIUrl":"https://doi.org/10.1109/NBiS.2009.80","url":null,"abstract":"To fully realize the benefit of ontology-driven “Omics” data integration, it is essential that database management systems (DBMSs) provide persistent storage and efficient concurrent access in a manner that leverages the emerging Semantic Web technologies. In this paper, we explore the current capabilities of existing DBMSs, such as Oracle’s database server, to meet the needs generated by the Semantic Web technologies. Our primary consideration is the new features provided by existing DBMSs to incorporate RDF, OWL, and SPARQL. We present a framework for this evaluation and lay the groundwork for subsequent benchmarking of the semantic-enabled DBMSs.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126517017","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}
E. Stephan, T. Halter, Tara D. Gibson, N. Beagley, K. Schuchardt
{"title":"A Multi-Tier Provenance Model for Global Climate Research","authors":"E. Stephan, T. Halter, Tara D. Gibson, N. Beagley, K. Schuchardt","doi":"10.1109/NBiS.2009.16","DOIUrl":"https://doi.org/10.1109/NBiS.2009.16","url":null,"abstract":"Global climate researchers rely upon many forms of sensor data and analytical methods to help profile subtle changes in climate conditions. The U.S. Department of Energy Atmospheric Radiation Measurement (ARM) program provides researchers with curated Value Added Products (VAPs) resulting from continuous instrumentation streams, data fusion, and analytical profiling. The ARM operational staff and software development teams (data producers) rely upon a number of techniques to ensure strict quality control (QC) and quality assurance (QA) standards are maintained. Climate researchers (data consumers) are highly interested in obtaining as much provenance evidence as possible to establish data trustworthiness. Currently all the evidence is not easily attainable or identifiable without significant efforts to extract and piece together information from configuration files, log files, codes, or status information on the ARM website. Our objective is to identify a provenance model that serves the needs of both the VAP producers and consumers. This paper shares our initial results – a comprehensive multi-tier provenance model. We describe how both ARM operations staff and the climate research community can greatly benefit from this approach to more effectively assess and quantify the data historical record.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974725","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":"The Concept of Web Service Versioning in Provenance","authors":"D. H. A. Ibrahim","doi":"10.1109/NBiS.2009.65","DOIUrl":"https://doi.org/10.1109/NBiS.2009.65","url":null,"abstract":"Provenance has become important for assisting scientists in reproducing a scientific experiment. Data provenance allows a scientist to track the origin of data and to view all changes made to it. Service provenance is concerned with keeping track of the origin of a service, including any changes that have been made to it, what data has been derived from it, and how other services have made use of it. Thus, provenance provides the scientist with a more complete understanding of the data and the service that are consumed and produced, and also the process of conducting an experiment. In this paper, we present work on the neglected concept of web service versioning in provenance. We address the key issue of versioning in service provenance. The paper therefore presents two versioning approaches that supports service versioning, with an example case study scenario using DynaSOAr the Dynamic Service Oriented Architecture framework.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133912759","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":"Energy Aware Adaptive Clustering for Wireless Sensor Networks","authors":"Fuad Bajaber, I. Awan","doi":"10.1109/NBiS.2009.49","DOIUrl":"https://doi.org/10.1109/NBiS.2009.49","url":null,"abstract":"Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. There is a need to design protocols that adapt much better to the constraints of the sensor network environment. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we propose a clustering protocol called Energy Aware Adaptive Clustering for Wireless Sensor Networks EAAC. In EAAC, the cluster heads and next heads are selected based on residual energy of each node and the distance between a cluster head and member nodes in the cluster. We compare the performance of EAAC with LEACH-C. Our experiment results show that EAAC outperforms LEACH-C in term of communication overhead, network lifetime and more data messages.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123967740","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}