{"title":"Providing Interoperability for Resource Access Using Web Services","authors":"Norman Lim, S. Majumdar, B. Nandy","doi":"10.1109/CNSR.2010.23","DOIUrl":"https://doi.org/10.1109/CNSR.2010.23","url":null,"abstract":"This paper focuses on resource virtualization and interoperability required in the context of large distributed environments such as clouds and grids in which shared resources located on multiple sites are accessed by multiple users. A resource is exposed as a Web service. Techniques for handling two types of resources, a computing resource and a database resource are described. Two different Web service technologies, one based on SOAP and the other on REST are experimented with. A comparison of the two technologies including a performance comparison of two implementations (one using SOAP-based Web services and the other using RESTful Web services) of a computing system exposed as a Web service is presented.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123969459","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}
Wiem Tounsi, Joaquín García, N. Cuppens-Boulahia, F. Cuppens
{"title":"Securing the Communications of Home Health Care Systems Based on RFID Sensor Networks","authors":"Wiem Tounsi, Joaquín García, N. Cuppens-Boulahia, F. Cuppens","doi":"10.1109/CNSR.2010.38","DOIUrl":"https://doi.org/10.1109/CNSR.2010.38","url":null,"abstract":"We address security solutions to protect the communication of the wireless components of a home health care system. We analyze especially the problem of exchanging secrets to satisfy authentication of entities. We outline some important aspects that must be guaranteed given the existence of low-cost and resource-constrained RFID components. Appropriate solutions must, therefore, enable several nodes, with different computing and communicating capabilities, to securely interact and communicate.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123625189","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":"Network Coding in Two-Relay OFDMA Networks Using Re-initialized Transmission Scheme","authors":"Hanhua Zhao, J. Ilow","doi":"10.1109/CNSR.2010.57","DOIUrl":"https://doi.org/10.1109/CNSR.2010.57","url":null,"abstract":"This paper introduces a collaborative coding algorithm and re-initialized transmission scheme to improve spectral efficiency of two-relay OFDMA networks. By broadcasting the network coded frames through the shared sub-carriers, with specific network coding and frame recovery at each relay node (RN), the proposed algorithm provides 1/3 higher spectral efficiency than the conventional, store-and-forward, relaying scheme. The proposed algorithm suffers from the error propagations in the data recovery at the destinations. To control this effect, re-initialization into the transmission scheme is proposed.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129651238","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":"RS-Coded M-QAM Schemes Using Error-and-Erasure Decoding over Wireless Fading Channels","authors":"J. Jin, T. Le-Ngoc","doi":"10.1109/CNSR.2010.70","DOIUrl":"https://doi.org/10.1109/CNSR.2010.70","url":null,"abstract":"In this paper, the optimal threshold for the erasure-marking technique suitable for RS-coded quadrature amplitude modulation (QAM) schemes using error-and-erasure decoding (EED) over i.i.d. fading channels is determined for the system. The performance and capacity of the RS-coded QAM system using EED with the obtained optimal erasure thresholds, and error-only decoding (ED) over i.i.d. Rayleigh and Nakagami-m fading channels are derived and compared. It is shown that EED outperforms ED, and this performance improvement increases significantly when the fading in the channel is more severe. Furthermore, the use of RS codes is investigated over correlated fading channels through a RS-coded QAM-OFDM system over multipath fading channels. The results indicate that, while the increase in number of resolvable taps introduces more frequency selectivity in fading, it reduces the fading correlation between sub-carriers. As a result, for the same RS-coded QAM-OFDM system, its performance is better with shorter interleaving (and hence shorter delay) in multipath fading channels with more resolvable taps.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129662292","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 Threshold Key Management Scheme for Mobile Ad Hoc Networks Using Elliptic Curve Dlog-Based Cryptosystem","authors":"H. Dahshan, J. Irvine","doi":"10.1109/CNSR.2010.48","DOIUrl":"https://doi.org/10.1109/CNSR.2010.48","url":null,"abstract":"Abstract—In mobile ad-hoc networks (MANETs), traditionalsecurity solutions are not adequate due to the lack of infrastructureand the absence of centralized administration. In thispaper, a threshold key management scheme for MANETs ispresented. The proposed scheme is implemented using ellipticcurve dlog-based cryptosystem. In this scheme, an off-line centralauthority is required in the initialization phase before networkdeployment. The central authority creates and preloads theshares matrix for each mobile node in the network initializationphase. Each session member generates its private/public keypair, and the session public key by collaborating with its trustedneighbors. The generation of the node private/public key pair,and the session public key is performed without any priorcommunication between session members. The advantages ofthe proposed scheme are justified through extensive timing andnetwork simulations.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129142468","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}
M. H. Khodashahi, A. Norouzi, Fatemeh Amiri, M. Dabbaghian
{"title":"A Novel Optimal Routing Algorithm by Creating Concentrically Sectors in Wireless Sensor Networks","authors":"M. H. Khodashahi, A. Norouzi, Fatemeh Amiri, M. Dabbaghian","doi":"10.1109/CNSR.2010.55","DOIUrl":"https://doi.org/10.1109/CNSR.2010.55","url":null,"abstract":"Sensor networks are composed of many sensorsusually far from the region is available. Routing method inwireless sensor networks to transfer information from sensornodes to base station is especially important. Optimumconsumption of energy is important requirements in wirelesssensor networks because sensor systems typically use batterypower. In this paper, we have presented a routing algorithm todetermine the optimal path of energy consumption viewpointto transfer information from sensor nodes to base station withthe data transmission by multi skip. In this algorithm,performance region is divided to some sectors and there areseveral relay nodes in the each sector. Relay nodes gather datafrom sensor nodes around them and data transfer to the basestation based on the shortest path and minimum skip possiblein two-dimensional coordinates (x, y) to the base station. Atthe end, we have compared the presented algorithm withEESR (Energy Efficient Sensor Routing) algorithm.Simulation results show the optimal performance of presentedalgorithm in energy consumption, delay and number of livenodes.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122406447","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":"End-to-End Acknowledgement for Data Collection in Wireless Sensor Networks","authors":"J. Arp, B. Nickerson","doi":"10.1109/CNSR.2010.58","DOIUrl":"https://doi.org/10.1109/CNSR.2010.58","url":null,"abstract":"A novel method to improve the reliability of data collection in wireless sensor networks is presented. The Disseminated ACKnowledgment protocol (DACK) builds on collection and dissemination protocolsto provide end-to-end acknowledgement of data samples. A DACK protocol implementation was tested using simulations and experiments on TelosB motes running TinyOS 2.1. Experiments were carried outon three floors of a building, with 14 motes transmittting data samples continuously until battery exhaustion. Results show that the DACK protocol recovers all data samples that would have been lostusing a collection protocol only. The benefit of increased data collection reliability comes at the costof increased communication. In one experiment with 14 motes, 719 data samples were dropped from a total of 749,904 data samples sent over six days; all these dropped sampleswere recovered using the DACK protocol. This experiment required an additional 720 collectionpackets to resend the dropped samples (in addition to the original 467,778 collection packets) plus 18,733 DACK packets. The extra energy required tosend these DACK packets was determined experimentally to be negligible. The DACK packet to original collection packet ratio of 0.04 in the experiment was observed to increase to 0.078 in a simulation of 16 motes in a much noisier 4 by 4 grid network.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126900387","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}
D. Prangchumpol, S. Sanguansintukul, P. Tantasanawong
{"title":"Improving Heterogeneous Workload Performance in Server Virtualization through User Behavior Schedules","authors":"D. Prangchumpol, S. Sanguansintukul, P. Tantasanawong","doi":"10.1109/CNSR.2010.47","DOIUrl":"https://doi.org/10.1109/CNSR.2010.47","url":null,"abstract":"One of the most attractive topics today is servervirtualization. Virtualization is a method of running multipleindependent virtual operating systems on a single physicalcomputer. It is a way of maximizing physical resources tomaximize the investment in hardware. This concept can help toconsolidate servers, improve hardware utilization and reducethe consumption of power and physical space in the datacenter. However, in an environment where workloads sharethe underlying platforms, the problem of configurationcontrols on sharing dynamic resource allocation becomes achallenge. In this paper, we present the improved performanceon heterogeneous workload in server virtualization using userbehavior schedules. We show a new concept for managingworkloads by involving user behavior in each type of serviceworkload. The result shows that user behaviors are different ineach type of service workload and time. This preliminary studymay be an approach to improve management of data centersrunning heterogeneous workloads using server virtualization.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132230556","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":"Scalable Semantic Overlay Routing in MANETs","authors":"A. Gaddah, T. Kunz, Ross Kouhi","doi":"10.1109/CNSR.2010.31","DOIUrl":"https://doi.org/10.1109/CNSR.2010.31","url":null,"abstract":"MANETs are an interesting domain for P2P technologies, in particular in the form of content-based routing and semantic overlays. In such an overlay, XML routers match XPATH queries against data in the form of XML documents. Due to the matching complexity, the scalability of such overlays becomes a key concern. Typically, researchers propose to aggregate the queries to reduce the filtering burden on the XML routers. As new XPath queries are added, existing queries deleted, or the topology between routers changes, these aggregate data structures need to be updated in some or all intermediate XML routers. Such updates can be fairly complex, to ensure that previously aggregated queries are now properly matching the new set of queries. We review a number of aggregation approaches and evaluate their scalability in light of a dynamically changing set of queries. Our survey shows that very few aggregation schemes support efficient dynamic updates of the subscription set, in particular in the case of deleting queries. We then show, through a small implementation, how one particular aggregation approach allows updating the aggregate data structure efficiently, while maintaining a high routing performance.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133346260","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 Multidisciplinary Approach for Online Detection of X86 Malicious Executables","authors":"Zhiyu Wang, M. Nascimento, M. MacGregor","doi":"10.1109/CNSR.2010.16","DOIUrl":"https://doi.org/10.1109/CNSR.2010.16","url":null,"abstract":"The detection of malicious executables (malware) is a well known problem. Anti-malware software are typically signature based, and only malicious attacks containing those known signatures can be detected. This is problematic because new malware is appearing extremely rapidly. This threatens to overwhelm signature-based approaches. In this paper, we propose a novel approach to detect malicious executables by using a combination of techniques from bioinformatics, data mining and information retrieval. This method is able to identify new malware related to threats already in its database. Using relatively small training sets our technique is able to achieve over 90% accuracy of detection with a false positive rate smaller than 5%.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131113853","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}