2010 8th Annual Communication Networks and Services Research Conference最新文献

{"title":"Distributed On-Demand Serving Mechanisms for Location-Based Information Sharing","authors":"Xiangxu Meng, Xiaodong Wang, Yanqiang Sun, Y. Ding, Xingming Zhou","doi":"10.1109/CNSR.2010.68","DOIUrl":"https://doi.org/10.1109/CNSR.2010.68","url":null,"abstract":"Abstract – Frequent location updates from mobile clients make the server a bottleneck for severe communication and processing overhead in large scale location-based information sharing system. From our observation, implanted information is not distributed uniformly in geography, which leads to some blank zones. In existing systems, the client needs to update its location on the server periodically no matter whether any information needs to be shared, which brings extra communication overhead. We present an information indexing scheme, providing on-demand information request for mobile clients. In this scheme, an information matrix is built on the server and synchronized to clients, in which each element indicates whether the information is implanted in the associated zone. Clients decide when to request for downloading related information as distributed mode instead of server central mode. Experimental results show that the scheme can greatly eliminate communication overhead and work well especially for applications with unevenly distributed information.Abstract – Frequent location updates from mobile clients make the server a bottleneck for severe communication and processing overhead in large scale location-based information sharing system. From our observation, implanted information is not distributed uniformly in geography, which leads to some blank zones. In existing systems, the client needs to update its location on the server periodically no matter whether any information needs to be shared, which brings extra communication overhead. We present an information indexing scheme, providing on-demand information request for mobile clients. In this scheme, an information matrix is built on the server and synchronized to clients, in which each element indicates whether the information is implanted in the associated zone. Clients decide when to request for downloading related information as distributed mode instead of server central mode. Experimental results show that the scheme can greatly eliminate communication overhead and work well especially for applications with unevenly distributed information.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"1 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":"129698116","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 Mobile Agent-Based Architecture for Fault Tolerance in Wireless Sensor Networks","authors":"Sarah Salim, M. Javed, A. Akbar","doi":"10.1109/CNSR.2010.26","DOIUrl":"https://doi.org/10.1109/CNSR.2010.26","url":null,"abstract":"Wireless Sensor Networks (WSNs) are prone to failures as they are usually deployed in remote and unattended environments. To mitigate the effect of these failures, fault tolerance becomes imperative. Nonetheless, it remains to be a second tier activity—it should not undermine the execution of the mission oriented tasks of WSNs through overly taxing their resources. We define architecture for fault tolerance in WSNs that is based on a federation of mobile agents that is used both for diagnostic intelligence and repair regimen, focusing on being lightweight in energy, communication and resources. Mobile agents are classified here as local, metropolitan, and global, providing fault tolerance at node, network and functional levels. Interactions between mobile agents are inspired by honey bee dance language that builds on semantics of errors classification and their demographic distribution. Our quantitative modeling substantiates that the proposed fault tolerance framework mandates minimalist communication through contextualized bee-inspired interactions, achieving adaptive sensitivity, and hysteresis-based stability","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"28 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":"128755658","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":"Convergence of IMS and Web Services: A Review and a Novel Thin Client Based Architecture","authors":"S. Islam, Jean-Charles Grégoire","doi":"10.1109/CNSR.2010.10","DOIUrl":"https://doi.org/10.1109/CNSR.2010.10","url":null,"abstract":"Although the IP Multimedia Subsystem (IMS) and Web Serviceshave been developed on the basis of different Service Delivery Platforms (SDP), opportunities for new services have emerged from converged access to IMS and Web Services. Researchers are focusing on finding means to develop converged access architectures for IMS and Web Services while preserving the benefits they provide and not overburdening the end users' terminals. In this paper, we classify the existing converged access methods for IMSand Web Services into four categories, compare them and identify their drawbacks. To address these drawbacks, we have designed a hybrid thin client-based novel architecture for converged access to multimedia services provided by a combination of IMS and Web Services. The proposed solution limits the impact of platform heterogeneity and resources by relinquishing the complexity of signalling and session management to an intermediate virtualization server, which in turn acts as a client for network-based services.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"6 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":"130994094","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 Non-cooperative Game Approach for Intrusion Detection in Smartphone Systems","authors":"Feng Yang, Xuehai Zhou, Gangyong Jia, Qiyuan Zhang","doi":"10.1109/CNSR.2010.24","DOIUrl":"https://doi.org/10.1109/CNSR.2010.24","url":null,"abstract":"In this paper, we propose an intrusion detection framework for smartphone systems. We formulate the intrusion detection problem into a two-player, non-cooperative, complete-information, constant-sum game. The attacker and the security server are the players of the game. The security server wants to maximize the value of the system but the attacker wants to minimize it. We present the Nash equilibrium and the Nash equilibrium leads to a defense strategy for the security server. We implement the framework and the results show that the proposed defense strategy is better than traditional ones.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"1 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":"125724622","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":"Distributed Beamforming Using a Scattering Network","authors":"V. Surendra, M. Zawodniok","doi":"10.1109/CNSR.2010.61","DOIUrl":"https://doi.org/10.1109/CNSR.2010.61","url":null,"abstract":"Novel beam-forming methodology is proposedthat employs passive RF devices in order to enhance thereceived signal. This paper demonstrates the feasibility of suchbeamforming and the realization methodology for a randomlyplaced set of passive devices. Typically, a beamforming isrealized by employing an antenna array at a receiver ortransmitter. The signals from antenna elements are processedin order to eliminate negative effects of multipath fading. Incontrast, the proposed methodology employs spatiallydistributed, passive scattering devices located betweentransmitter and receiver in order to realize the beamforming.The proposed scheme assumes that these RF devices maychange their impedance to increase or reduce scattering effect.The paper demonstrates that signal strength at the receiver canbe increased by carefully selecting the devices that shouldscatter the RF signal. The theoretical limits of such scheme areanalyzed mathematically and in simulations. The paperpresents two approaches that learn the best set of scatteringnodes and utilizes it to realize the beamforming.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"200 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":"133880986","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":"Outage Probability of Cooperative Diversity System with Relay Selection over Shadowed Nakagami-m Fading Channels","authors":"Weiguang Li, Ming Chen","doi":"10.1109/CNSR.2010.66","DOIUrl":"https://doi.org/10.1109/CNSR.2010.66","url":null,"abstract":"Cooperative diversity system have been receiving a lot of attention recently which can significantly improve the system performance. This paper studies a cooperative diversity system with relay selection over shadowed Nakagami-m fading channels. With the help of Hermite integration, we derive a close-form analytical expression for the outage probability. Some numerical results are presented for different Nakagami parameter m, standard deviation of shadowed fading σ, path loss exponent β and cooperative branches number K. The numerical results show that the derived analytical expression can provide very well approximations to the simulation results.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"117 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":"125437610","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":"Performance Analysis of Dual Hop Transmission with Selection Combining Fixed Relay","authors":"A. Gharanjik, S. Andargoli, S. Marzban","doi":"10.1109/CNSR.2010.44","DOIUrl":"https://doi.org/10.1109/CNSR.2010.44","url":null,"abstract":"We study a dual-hop transmission in Rayleighfading channels where the relay uses Amplify and Forward(AF) protocol and Selection Combining (SC) technique. Aclosed-form expression for probability density function ofthe overall received SNR at the destination is derived andMonte Carlo simulation is used to verify the result. Theperformance analysis also is presented in terms of the AverageBit Error Rate(ABER) and the outage probability. Numericalresults show that the proposed relay system outperform theconventional relays which use a single antenna in receiver andtransmitter.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"22 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":"125696301","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":"Enforcing Fairness for Data Collection in Wireless Sensor Networks","authors":"Md. Abdul Hamid, M. Alam, Md. Shariful Islam, C. Hong","doi":"10.1109/CNSR.2010.36","DOIUrl":"https://doi.org/10.1109/CNSR.2010.36","url":null,"abstract":"The well known many–to–one data routingparadigm [1] in wireless sensor networks (WSNs) demands non–uniform medium access and forwarding strategy to achieve theultimate node level fairness. Since nodes closer to the sink havemore traffic than that of far–away nodes, close–by nodes needto employ different frequency of media access and forwardingprobability such that sink receives almost equal number ofpackets from all the nodes in the network. In this paper, wedesign a distributed fair data collection protocol where the nodescan decide their media access and packet forwarding strategieswithin the WSN such that a fair throughput can be enjoyed byeach node irrespective of the node’s distance from the sink. Wedemonstrate the effectiveness of our solution through simulationsand results show that the proposed protocol ensures the fairdelivery of packets, improves throughput and reduces end–to–end delay for the different WSN scenarios under study.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"21 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":"116568229","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":"Fiber Ring Encoder for PON Fault Monitoring","authors":"M. Esmail, Nafel N. Alotaibi, H. Fathallah","doi":"10.1109/CNSR.2010.67","DOIUrl":"https://doi.org/10.1109/CNSR.2010.67","url":null,"abstract":"This paper proposes a novel periodic optical encoder forcentralized fault monitoring of fiber-to-the home (FTTH)passive optical networks (PONs). The encoder exploits afiber ring to produce a periodic code. This reduces thecost of monitoring system while maintains goodperformance and high capacity. We evaluate theperformance of this encoding system in terms of signal tonoise ratio (SNR). We obtain an SNR of 12.5 dB for a 32customers network in one shot measurement. We alsoshow that capacity of 64, 128 and 256 could beaccommodated in expense of larger but acceptablemeasurement time.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"89 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":"128007922","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":"Ontology-Based Context Representation and Reasoning Using OWL and SWRL","authors":"Chih-Hao Liu, K.-L. Chang, Jason Jen-Yen Chen, Shang-Chih Hung","doi":"10.1109/CNSR.2010.22","DOIUrl":"https://doi.org/10.1109/CNSR.2010.22","url":null,"abstract":"Recently, quite a few researches upon context-awareness, ubiquitous computing and automatic surveillance have emerged. Their objectives are to appropriately react to current context situation over the web, rather than in a single machine. This requires exchanging the context of extremely dynamic web environment, as well as reasoning about the context to achieve goal. Thus, context representation and context reasoning play significant roles. This paper presents an ontology-based approach to: 1) employing web ontology language (OWL) to describe context knowledge, and 2) using semantic web rule language (SWRL) to represent rule-based inference rules for context reasoning. OWL describes context knowledge in details by defining relationships among knowledge. As an XML-based language, OWL enjoys good interoperability for knowledge sharing and reuse over the web. Further, SWRL represents rule-based first-order logic (FOL) inference rules, which are expressed in terms of predefined OWL taxonomic context knowledge. By doing so, SWRL rules perfectly integrate with OWL, making it easy to develop and maintain application systems. Besides, as SWRL is also XML-based, it is not so dependent upon inference engine. That is, inference engine can be changed without rewriting the rules for engine-specific syntax. This enhances system maintainability.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"44 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":"128567064","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}