{"title":"Request-Based Comparable Encryption Scheme with Multiple Users","authors":"Jun Ye, Meixia Miao, Peng Chen, Xiaofeng Chen","doi":"10.1109/BWCCA.2015.30","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.30","url":null,"abstract":"Order Preserving Encryption (OPE) is widely used for data searching. But, when all the numbers in the domain are encrypted by using OPE, an attacker can easily obtain the correspondence between encrypted numbers and original numbers. Furukawa proposed a new encryption scheme, which is called request-based comparable encryption, to solve the problem. However, comparable encryption only applies to single user. In this paper, a novel of request-based comparable encryption with multiple users is proposed. The different ciphertexts which are encrypted with different private keys can be compared by using the token transformation skill.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123761145","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":"Resource Management in 5G Femtocell Networks","authors":"C. Bouras, Georgios Diles","doi":"10.1109/BWCCA.2015.20","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.20","url":null,"abstract":"Small cells are expected to contribute to the targets of next generation mobile networks. Ultra dense networks through the form of heterogeneous structures of multiple RAT technologies and small cells present a flexible, economical way for better coverage and data rates. In this paper, we investigate particularly how femtocells may best utilize their available resources in order to increase their provided capacity when neighbouring femtocells are present. We propose a spectrum policy, according to which femtocell deployments are forming clusters and the femtocells adopt hybrid access policy versus users subscribed to other femtocells members of the same cluster. We also determine the spectrum allocation for non-subscribed users in the range of the femtocell. We evaluate the performance of the set up through simulations showing that the mechanism offers better overall capacity.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133195995","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}
C. Bouras, Georgios Diles, V. Kokkinos, Andreas Papazois
{"title":"Optimizing Hybrid Access Femtocell Clusters in 5G Networks","authors":"C. Bouras, Georgios Diles, V. Kokkinos, Andreas Papazois","doi":"10.1109/BWCCA.2015.21","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.21","url":null,"abstract":"Femtocells are an efficient way of reducing infrastructure costs while providing better data rates and coverage. High penetration is expected in the upcoming ultra dense 5G networks, increasing the probability of femtocells' clusters. Strong resulting interference for nearby non-subscribed users will require interference mitigation techniques. In this paper we present a mechanism where multiple femtocells coordinate their transmission to serve multiple non-subscribed users through hybrid access. First, the spectrum allocation of non-subscribed users by femtocells is determined. Then, we introduce a power control algorithm that is based on two factors. The need for compensation for the subscribed users, due to reduced spectrum, and the effect that any change in power transmission will have on neighbouring femtocells. We evaluate the effectiveness of the algorithm through simulations on individual throughput and overall achieved capacity.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131657596","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}
Muhammad Waqas Khan, A. Mahmood, M. Ayaz, M. Waseem, S. Razzaq, N. Javaid
{"title":"Optimized Energy Management System Using Electric Water Heater","authors":"Muhammad Waqas Khan, A. Mahmood, M. Ayaz, M. Waseem, S. Razzaq, N. Javaid","doi":"10.1109/BWCCA.2015.94","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.94","url":null,"abstract":"Power generation and supply management is becoming an increasingly difficult task with the increase in population. One of the solutions is intelligent control of power consumption in the households where most of power consumption is due to high load appliances like Electric Water Heater (EWH) in winter and fridge in summer. This paper presents an over view of the EWH use for Demand Side Management (DSM). To reduce the consumption of EWH, the US Electrical Power Research Institute (EPRI) model has been focused in context of DSM in smart grid. Moreover, use of Binary Particle Swarm Optimization (BPSO) has been elaborated to implement a direct load control strategy for EWH management.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127781268","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}
Ryozo Yanagida, Keiji Obara, Koki Ogawa, H. Shigeno
{"title":"An Analysis of Road Maps Based on Voronoi Diagram for Vehicular Broadcast","authors":"Ryozo Yanagida, Keiji Obara, Koki Ogawa, H. Shigeno","doi":"10.1109/BWCCA.2015.8","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.8","url":null,"abstract":"In Vehicular Ad-hoc Networks, a method of message dissemination is broadcast. It is a method of message dissemination by relaying messages between vehicles. In broadcast, vehicles cause the broadcast storm problem because of redundant relays. Thus, it is necessary to control redundant relays by broadcast protocols. Many broadcast protocols have been developed and they can disseminate with suppressing redundant relays. However, the packet reception ratio and its overhead depend on not only broadcast protocols, but also structures of road maps. Thus, it is necessary to research some relationships between radio propagation features and structures of road maps. In this paper, we propose a method of analyzing complexities of road maps. It is named Analysis Road map Complexity by Deviation of intersection distribution (ARC-DID). It focus on that there is a relationship between radio propagation features and places of intersections. Hence, we propose an analysis method of complexities of road maps based on intersection distribution. In order to analyze complexities of road maps based on a deviation of intersections, we use a Voronoi diagram. According to this method, we can analyze complexities of road maps quantitatively. In order to show utility of complexities calculated by proposed method, we execute a broadcast simulation with three parameters. According to the simulation, complexities calculated by ARC-DID can set parameters which adapt to road maps.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127789168","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":"Research on the Application of an Improved Shortest Path Algorithmin Public Transport System","authors":"Lan Gao","doi":"10.1109/BWCCA.2015.38","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.38","url":null,"abstract":"This paper proposed the least transfer time (LTT) inquiry algorithm, and used it in the designing of transportation. It can solve transport problems in multi-point at the minimum number of change for the first goal, and the least time at the second. The application of LTT in Changchun public transport system demonstrated the effectiveness and efficiency of the proposed algorithm.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131775900","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":"Provable Data Possession Supporting Secure Data Transfer for Cloud Storage","authors":"Yong Yu, Jianbing Ni, Wei Wu, Yilei Wang","doi":"10.1109/BWCCA.2015.44","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.44","url":null,"abstract":"Due to the appealing advantages of cloud storage, such as on-demand self-service and ubiquitous network access, an increasing number of users prefer to store their data on remote remote servers. However, outsourced data transfer becomes a critical requirement for users to shift their cloud storage providers because of the emergence of various cloud storage services with different qualities of services. Therefore, the users may not only be anxious about the state of their data on the cloud server, but also concern on whether the data are transferred entirely to the new cloud without corruption and whether the data on original cloud are discarded. To address these problems, we propose a provable data possession scheme for cloud storage services characterized by secure data transfer, provable data erasure, high error detection probability, confidential data storage. Our scheme can guarantee the remote data integrity when the data are maintaining on the cloud servers and are transferring between two clouds, and secure deletion of transferred data on the original cloud.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133865790","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":"Mining Approximate Frequent Patterns from Noisy Databases","authors":"Xiaomei Yu, Yongqin Li, Hong Wang","doi":"10.1109/BWCCA.2015.29","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.29","url":null,"abstract":"As an important branch in the field of frequent pattern mining, approximate frequent pattern (AFP) mining attracts much attention recently. Various algorithms have been proposed to discover long true AFPs in presence of random noise. This paper considers the key issues of AFP mining in noisy databases, and categorizes the previous approaches according to the ways they cope with missing items in the transactions. And then a study of different data models on AFP is presented, in which the merits and defects are analyzed. Finally, we draw a conclusion and propose some solutions to deal with the problems in the field of AFP mining.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134512291","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}
Hiroki Kataoka, Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"Energy-Efficient Virtualisation of Threads in a Server Cluster","authors":"Hiroki Kataoka, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/BWCCA.2015.80","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.80","url":null,"abstract":"It is critical to reduce the electric power consumed by servers in a cluster in order to realize eco society. In our previous studies, the multi-level power consumption (MLPC) model of a server with a multi-thread CPU, the power consumption of the server is proposed and the globally energy-aware (GEA) algorithm is discussed to select a server for each process in a cluster. Here, not only the total electric energy consumption of all the servers but also the ratio of the basic electric energy consumed by the servers to the total electric energy consumption can be reduced in a cluster. However, the GEA algorithm is not scalable since every server is checked to find a server for each process in a cluster. In this paper, we newly propose a scalable energy-aware (SEA) algorithm to select a server for a process. Here, some number of servers are first randomly selected in a cluster and one server is then selected in the selected servers by the GEA algorithm. We evaluate the SEA algorithm and show not only the total electric energy consumption of the servers but also the average execution time of processes are reduced in the SEA algorithm compared with other algorithms.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114517348","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":"An Energy Efficient Adaptive Cooperative Routing Protocol for Underwater WSNs","authors":"Taimur Hafeez, N. Javaid, Usman Shakeel, Muhammad, Sheraz Hussain, Hammad Maqsood","doi":"10.1109/BWCCA.2015.91","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.91","url":null,"abstract":"Underwater environment has very unique characteristics. Reliable and efficient communication between sensor nodes is very challenging. Firstly, because radio waves can not work well in such environment, so we use acoustic communication. Secondly, acoustic communication is very slower than radio communication. Moreover environment is very dynamic, which changes topology of network. Due to these reasons data can not reach to destination timely or reliably. This creates need of a technique which can improve performance of network in terms of reliability and throughput. Cooperation between nodes is one of the major techniques which can greatly enhance reliability of a network at cost of more energy consumption. In this technique if data can not reach to destination in any condition then it is retransmitted from another node called cooperative node. This also improves throughput of network. In this paper we propose region based cooperation between sensor nodes. Simulation results show that technique better performs in terms of network lifetime and efficient energy consumption.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117109512","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}