{"title":"Toward a Unified Framework for Mobile Applications","authors":"Sangwhan Cha, Bernd J. Kurz, W. Du","doi":"10.1109/CNSR.2009.40","DOIUrl":"https://doi.org/10.1109/CNSR.2009.40","url":null,"abstract":"Mobile application developers and content providers usually need to develop mobile applications with concerns for mobility for specific wireless networks and device platforms which are used by network carriers. In order to provide standard mobile applications with interoperability and mobility support, in this paper we propose a comprehensive mobile application framework to support interoperability and mobility of mobile application development and operation. Such framework supports developing mobile device applications, mobile server applications, as well as mobile client-server communications and peer-to-peer communications.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132694440","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 Novel Multiuser Diversity Based Scheduler with QoS Support for Cognitive Radio Networks","authors":"Chong Tian, D. Yuan","doi":"10.1109/CNSR.2009.55","DOIUrl":"https://doi.org/10.1109/CNSR.2009.55","url":null,"abstract":"Cognitive Radio Networks (CRN) have been proposed to solve such problem of low utilization in wireless spectrum. In this paper, we propose a novel cross layer scheduling strategy with interference management for multiple cognitive users, which working are working at the same area with a primary user. The design objective for this scheme is to decrease the average interference to the primary user with efficient bandwidth utilization and without significantly dropping the QoS. The proposed scheduler uses a general priority function (PRF) to address these conflicting objectives. An extensive set of simulation results show that the scheme results in significant performance improvement compared with the existing algorithms.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597838","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 New Algorithm for Efficient Optimisation of Base Station Placement in Indoor Wireless Communication Systems","authors":"Liza Pujji, K. Sowerby, M. Neve","doi":"10.1109/CNSR.2009.73","DOIUrl":"https://doi.org/10.1109/CNSR.2009.73","url":null,"abstract":"A new algorithm is proposed to efficiently find an optimal base station configuration for indoor CDMA networks from a set of potential base station sites. It considers both forward link and reverse link signal-to-interference ratio (SIR) constraints. The proposed algorithm is a combination of a heurisitc algorithm and selective brute force search. The heurisitc algorithm estimates the minimum number of base stations required to serve a set of mobiles. Brute force search analyzes forward link and reverse link SIR for the configurations, starting with the estimated minimum required number of base stations, to find the acceptable configurations and one optimal configuration. The proposed algorithm can be applied repeatedly to different sets of mobiles in an indoor system to find an overall optimal configuration. The efficiency of the proposed algorithm is compared with that of the Branch and Bound (B&B) Algorithm and the Genetic Algorithm to find an optimal configuration.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122355787","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":"Adaptive Clustering for Energy Efficient Wireless Sensor Networks Based on Ant Colony Optimization","authors":"Morteza Ziyadi, Keyvan Yasami, B. Abolhassani","doi":"10.1109/CNSR.2009.58","DOIUrl":"https://doi.org/10.1109/CNSR.2009.58","url":null,"abstract":"Energy supply in wireless sensor networks (WSNs) is limited and non-replenishable, and energy efficiency is the most important feature in designing these networks. One way to reduce the energy consumption of WSNs and hence prolong the lifespan of these networks is to use adaptive clustering algorithms. In this paper, we use Ant Colony Optimization for Clustering (ACO-C) to propose a new energy aware clustering protocol for WSNs. By using appropriate cost functions, implemented at the base station, our algorithm minimizes and distributes the cost of long distance transmissions and data aggregating among all sensor nodes evenly. Simulation results show the effectiveness of our protocol over other well known clustering algorithms in terms of both network lifetime and data delivery to the base station.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129942648","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 Broker for Universal Access to Web Services","authors":"Eyhab Al-Masri, Q. Mahmoud","doi":"10.1109/CNSR.2009.27","DOIUrl":"https://doi.org/10.1109/CNSR.2009.27","url":null,"abstract":"Web service interfaces can potentially be discovered through service registries, search engines, service portals, peer-to-peer networks, among others. To discover pertinent Web services, clients have to devote excessive amount of time to browse through accessible service resources and be able to differentiate between services that share similar characteristics. Discovering Web services throughout heterogeneous environments is becoming a challenging task and raises several concerns such as performance, reliability, and robustness. In this paper, we introduce the Web Service Broker (WSB) framework that provides a universal access point for discovering Web services. WSB uses a crawler to collect the plurality of Web services disseminated throughout the Web, continuously monitor the behaviour of Web services in delivering the expected functionality, and enable clients to articulate service queries tailored to their needs. WSB can seamlessly be integrated into the existing service-oriented architecture without any alterations to existing environments.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114433980","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":"Applications of Wireless Sensor Networks and RFID in a Smart Home Environment","authors":"S. Hussain, Scott Schaffner, Dyllon Moseychuck","doi":"10.1109/CNSR.2009.32","DOIUrl":"https://doi.org/10.1109/CNSR.2009.32","url":null,"abstract":"With the aging population and increased need to care for the elderly there are fewer of the younger generation to administer the necessary care and supervision. This condition is one of the reasons many researchers devote their time in evolving smart homes. These homes offer the occupant(s) a level of convenience not seen in traditional homes by using technology to create an environment that is aware of the activities taking place within it. The focus of this paper is on the integration of radio frequency identification (RFID) and wireless sensor network (WSN) in smart homes and applications of this system such as identifying a caregiver who enters the home. In the following work we present an architecture consisting of RFID, a WSN to identify motion within an environment and who is moving as well as several useful applications which take advantage of this information.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114737580","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}
T. Bchini, N. Tabbane, S. Tabbane, E. Chaput, A. Beylot
{"title":"Inter-ASN Handover Using MSCTP Protocol in IEEE 802.16e Networks","authors":"T. Bchini, N. Tabbane, S. Tabbane, E. Chaput, A. Beylot","doi":"10.1109/CNSR.2009.29","DOIUrl":"https://doi.org/10.1109/CNSR.2009.29","url":null,"abstract":"We propose in this paper, to replace the two Layer 3 Handover mechanisms defined for the situation of macro mobility with IP address change in IEEE 802.16e: “Client-MIP and Proxy-MIP”, by the new protocol created specially for the mobility without services interruptions: “MSCTP”, which has the peculiarity to support several IP sessions at the same time.The purpose of this proposal is to reduce the latency and avoid the interruption of services during the IP address change procedure by the mobile station.We compare simulation results, done with NS2 [1], between MSCTP, PMIP and CMIP protocols under the context of simple and full mobility.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116059916","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":"Hybrid Classifier Systems for Intrusion Detection","authors":"T. Chou, Tsung-Nan Chou","doi":"10.1109/CNSR.2009.51","DOIUrl":"https://doi.org/10.1109/CNSR.2009.51","url":null,"abstract":"This paper describes a hybrid design for intrusion detection that combines anomaly detection with misuse detection. The proposed method includes an ensemble feature selecting classifier and a data mining classifier. The former consists of four classifiers using different sets of features and each of them employs a machine learning algorithm named fuzzy belief k-NN classification algorithm. The latter applies data mining technique to automatically extract computer users’ normal behavior from training network traffic data. The outputs of ensemble feature selecting classifier and data mining classifier are then fused together to get the final decision. The experimental results indicate that hybrid approach effectively generates a more accurate intrusion detection model on detecting both normal usages and malicious activities.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121946030","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 Clustering Techniques for Improving Lifetime in Two-Tiered Sensor Networks","authors":"A. Bari, Fangyun Luo, A. Jaekel, S. Bandyopadhyay","doi":"10.1109/CNSR.2009.37","DOIUrl":"https://doi.org/10.1109/CNSR.2009.37","url":null,"abstract":"In hierarchical two-tiered sensor networks, higher-powered relay nodes have recently been proposed to be used as cluster heads for designing scalable sensor networks.The assignment of sensor nodes to clusters in an energy-efficient way is known to improve the lifetime of such networks. In this paper we have proposed two efficient distributed algorithms for assigning sensor nodes to clusters in two-tiered networks. The first heuristic assumes that all relay nodes, acting as cluster heads, send their data directly to the base station. The second heuristic relaxes this assumption and is to be used with any network where each relay node uses a multi-hop route to send its data to the base station. Simulations on networks of different sizes show that our approaches consistently outperform existing heuristics for clustering in two-tier sensor networks and are fast enough to be used for practical networks containing hundreds of sensor nodes. We have compared the results of our distributed approaches with the optimal solutions obtained using an existing approach based on an Integer Linear Program (ILP) formulation and have shown that, on an average, our approaches, with a relatively small overhead, can produce results that are close to the optimal solutions.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115285196","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 Multi-channel QoS Model for Random Access Systems","authors":"Y. Abdel-Hamid, F. Gebali, T. Gulliver","doi":"10.1109/CNSR.2009.14","DOIUrl":"https://doi.org/10.1109/CNSR.2009.14","url":null,"abstract":"In this paper, we present a simple two-class QoS model for random access systems. We provide a practical mechanism for categorizing the available resources into two distinct service classes prior to medium access. We use an a Markov chain model to define the states and transitions, and derive the system access success probability. This provides a mathematical basis for an accurate model that can be efficiently used to determine the resource allocation for each class. This model provides a useful analytical tool for contention systems that utilize random access for network entry, resource acquisition, and/or contention-based data transmission, e.g. the IEEE 802.16 uplink contention channel. We also study the trade-off between resources allocated and the input traffic from each class. For simplicity, we only consider two classes, however the technique can easily be extended to any number of classes.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124741676","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}