{"title":"A Virtual Network Reconfiguration Algorithm to Improve Acceptance Ratio","authors":"Hai Zhu","doi":"10.1109/BWCCA.2015.78","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.78","url":null,"abstract":"Virtual networks (VNs) by sharing infrastructure are considered as an effective way to overcome the ossification of the Internet. However, fragments of network resources become an obstacle to accept more users' requirements with the arrival and leave of VNs. Therefore, we propose a virtual network reconfiguration algorithm to improve the acceptance ration in this paper. When a VN request is rejected, some embedded VNs are migrated and the incoming VNR is embedded. Simulation experiments show that the proposed reconfiguration algorithm is effective in improving acceptance ratio and load balance.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"1 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":"122676814","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 Trust Management Mechanism for Mobile Ad Hoc Networks Based on Grey Theory","authors":"Zhifeng Fang, Zhang Kun","doi":"10.1109/BWCCA.2015.33","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.33","url":null,"abstract":"Trust management mechanism is a hot spot in the research of mobile Ad hoc network security. In view of the many problems of trust management mechanism in mobile hoc Ad networks, combining with the characteristics of mobile Ad hoc network, we present a mobile Ad hoc network trust management mechanism based on grey theory in this paper and apply it to the mobile Ad hoc network management in order to improve the availability and effectiveness of trust management mechanism and safeguard the security of mobile Ad hoc networks.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"478 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":"131517544","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}
Jingling Zhao, Kun-Peng Xia, Yilun Fu, Baojiang Cui
{"title":"An AST-based Code Plagiarism Detection Algorithm","authors":"Jingling Zhao, Kun-Peng Xia, Yilun Fu, Baojiang Cui","doi":"10.1109/BWCCA.2015.52","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.52","url":null,"abstract":"In modern software engineering, software plagiarism is widespread and uncurbed, developing plagiarism detection methods is imperative. Popular technologies of software plagiarism detection are mostly based on text, token and syntax tree. Among these plagiarism detection technologies, tree-based plagiarism detection technology can effectively detect the code which cannot be detected by the other two kinds of technologies. In this paper, we propose a more effective plagiarism detection algorithm based on abstract syntax tree (AST) by computing the hash values of the syntax tree nodes, and comparing them. In order to implement the algorithm more effectively, special measurement is taken to reduce the error rate when calculating the hash values of operations, especially the arithmetic operations like subtraction and division. Results of the test showed that the measurement is reliable and necessary. It performs well in the code comparison field, and is helpful in the area of protecting source code's copyright.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"6 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":"127602524","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":"Fast Scalar Multiplication Algorithm Using Constrained Triple-Base Number System and Its Applications","authors":"Yunqi Dou, Jiang Weng, Chuan-gui Ma, Fushan Wei","doi":"10.1109/BWCCA.2015.24","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.24","url":null,"abstract":"With the rapid development of embedded devices, wireless sensor network and Internet of Things, elliptic curve cryptography as a public key cryptography plays an important role to solve the security challenges. How to improve the efficiency of scalar multiplication is a challenging work for future deployment of these new technologies. Because of its sparsity, triple-base number system is used to accelerate the scalar multiplication in elliptic curve cryptography. Instead of using triple base chain, we introduce the concept of constrained tripe-base number system, which sets maximums for exponents of bases 2, 3 and 5. On this basis, we propose two fast scalar multiplication algorithms for the situations with and without precomputations. Our experiments show that the two algorithms are more efficient than 4-NAF, double-base chain and triple-base chain approaches. The improvement of efficiency makes the two scalar multiplication algorithms more suit for wireless sensor network.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"35 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":"132848484","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}
Alda Xhafa, Evjola Spaho, Donald Elmazi, M. Takizawa
{"title":"A Study on Performance of Hill Climbing for Router Placement in Wireless Mesh Networks","authors":"Alda Xhafa, Evjola Spaho, Donald Elmazi, M. Takizawa","doi":"10.1109/BWCCA.2015.55","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.55","url":null,"abstract":"In this paper, we use Hill Climbing algorithm for mesh router node placement in WMNs. We evaluate the performance of the system considering different distribution of mesh clients and using giant component and number of covered mesh clients metrics. We compare the performance of the system for Normal, Uniform, Exponential and Weibull distribution of mesh clients. The simulation results show that the system has a good behavior and finds good solutions for mesh router node placement.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"1 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":"131093325","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}
Tetsuya Oda, Donald Elmazi, Taro Ishitaki, Keita Matsuo, Makoto Ikeda, L. Barolli
{"title":"Implementation and Experimental Results of a Raspberry Pi and OLSR Based Wireless Content-Centric Network Testbed","authors":"Tetsuya Oda, Donald Elmazi, Taro Ishitaki, Keita Matsuo, Makoto Ikeda, L. Barolli","doi":"10.1109/BWCCA.2015.89","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.89","url":null,"abstract":"The Content Centric Networks (CCN) replaces the IP narrow waist of the Internet architecture by a content layer. When a node wants to access a piece of content, it sends an Interest packet to the network. The network then, using the name of the content for routing, forwards the Interest to one or more copies of the content object. In this paper, we present the implementation of a testbed for CCN. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an indoor scenario. For evaluation we considered throughput, Packet Delivery Ratio (PDR), hop count, delay and jitter metrics. The experimental results show that the nodes in the testbed were communicating smoothly and we got hight values of throughput and PDR and low values of delay and jitter.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"266 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":"133638137","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}
Peixin Chen, Xiaofeng Wang, Bao-kang Zhao, Hao Sun, Jinshu Su, I. You
{"title":"An Escrow-Free Hierarchical Identity-Based Signature Scheme from Composite Order Bilinear Groups","authors":"Peixin Chen, Xiaofeng Wang, Bao-kang Zhao, Hao Sun, Jinshu Su, I. You","doi":"10.1109/BWCCA.2015.9","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.9","url":null,"abstract":"Hierarchical Identity-Based Signature (HIBS) is an efficient digital signature scheme to be applied to the cloud storage. However, the key escrow problem, which is an inherent problem in HIBS scheme, primarily hinders the widespread adoption of this cryptosystem in practice. In this paper we propose an HIBS scheme using composite order bilinear groups, and present the methodology of dual system signature to prove that our scheme is secure against existential forgery on adaptively chosen message and identity attack under standard model. Based on the scheme, we propose an escrow-free method that employs user-selected-secret signing algorithm and obtain an escrow-free HIBS scheme. We illuminate that our scheme can resist the key abusing and user slandering attacks.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"360 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":"133009421","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 Finite Set Network Coding Automatic Repeat Request Scheme for Machine-to-Machine Wireless Broadcasting","authors":"Jian Wang, Youyun Xu, Kui Xu, Wei Xie","doi":"10.1109/BWCCA.2015.18","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.18","url":null,"abstract":"Machine-to-Machine (M2M) communications are quite different from traditional network communications. The main difference lies in the fact that the number of M2M equipments is rather large. To apply broadcasting technique adopted in traditional networks to M2M broadcasting without modifying may bring in disadvantages, two main of which are the rise of the Average Packet Transmission Times (APTT) and the rise of Feedback Messages Number (FMN). In order to improve the efficiency of M2M broadcasting in terms of APTT and FMN, in this paper, we design a Finite set Network coding Automatic Repeat reQuest (FNARQ) scheme for M2M broadcasting. Compared with traditional Broadcasting technique, for example Partial feedback Selective Automatic Repeat reQuest (PSARQ) and traditional network coding Automatic Repeat reQuest (NARQ), FMN could be largely reduced, which make FNARQ more practical for avoiding \"feedback implosion\", and at the same time, APTT is reduced, making FNARQ more efficient. Simulation results verify the potential of our proposed FNARQ scheme.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"115 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":"132545593","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, Keisuke Ebisu, Yuki Sakai, Donald Elmazi, L. Barolli, Elis Kulla
{"title":"Performance Evaluation of a Fuzzy-Based Wireless Sensor and Actuator Network Testbed for Object Tracking","authors":"Makoto Ikeda, Keisuke Ebisu, Yuki Sakai, Donald Elmazi, L. Barolli, Elis Kulla","doi":"10.1109/BWCCA.2015.74","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.74","url":null,"abstract":"Wireless Sensor and Actuator Networks (WSANs) have emerged as a variation of wireless sensor networks. WSANs are capable of monitoring physical phenomenons, processing sensed data, making decisions based on the sensed data and completing appropriate tasks when needed. Many surveillance cameras are used in facilities in order to keep secure environment. Human operators are now physically unable to constantly monitor these cameras. The devices deployed in the environment are sensors able to sense environmental data, actuators able to react by affecting the environment or have both functions integrated. In previous work, we proposed a fuzzy-based testbed that based on data provided by sensors and actuators selects an appropriate actuator node. In this paper, we evaluate its performance testbed system for object tracking. From the evaluation results, we found that the system detects the actuators in order to have low latency and proper task assignment considering multi actuators.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"178 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":"116432562","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":"Study on Deep Learning and Its Application in Visual Tracking","authors":"Dan Hu, Xingshe Zhou, Xiaohao Yu, Z. Hou","doi":"10.1109/BWCCA.2015.63","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.63","url":null,"abstract":"Inspired by recent advances in deep learning, this paper reviews the deep learning methodologies and its applications in object tracking. To overcome the complexity and low-efficiency of existing full-connected deep learning based tracker, we use a novel convolutional deep belief network (CDBN) with convolution, weights sharing and pooling to have much fewer parameters, in addition to gain translation invariance which would benefit the tracker performance. Empirical evaluation demonstrates our CDBN based tracker outperforms several state-of-the-art methods on an open tracker benchmark.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"15 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":"126970385","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}