发布求助
文献互助 智能选刊 最新文献

2011 International Conference on Broadband and Wireless Computing, Communication and Applications最新文献

筛选
英文 中文
Context-Aware Security model for Social Network Service 面向社交网络服务的上下文感知安全模型
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.26
Hyun-Dong Lee, Mokdong Chung
{"title":"Context-Aware Security model for Social Network Service","authors":"Hyun-Dong Lee, Mokdong Chung","doi":"10.1109/BWCCA.2011.26","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.26","url":null,"abstract":"The number of smart phone-users is rapidly growing due to the recent increase in wireless Internet usage, the development of a variety of applications, the activation of social networks, and so on. The smart phone has the benefits of mobility and convenience, but has the serious security problems. To utilize social network services in the smart phone, a flexible integrated authentication and access control facility is strongly needed. To solve these problems, we suggest a context-aware single sign-on and access control system using context-awareness, integrated authentication, access control, and OSGi service platform in the smart phone environment. In addition, to handle diverse contexts properly and to determine the appropriate security level, we use Fuzzy Logic and MAUT (Multi-Attribute Utility Theory). And also we try to verify a security system whose properties are flexible and convenient through a typical scenario in the smart phone environment. We could provide flexible and secure seamless security service by user context in the smart phone environment using the proposed system.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121805281","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}
引用次数: 4
An Integrated Two-Tier Multicast-Agent Architecture for All-IP Multicast Transport Services 面向全ip多播传输服务的集成两层多播代理体系结构
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.85
Chih-Chao Wen, Chi-Ju Chiu, Cheng-Shong Wu, Hui-Kai Su, Y. Chu
{"title":"An Integrated Two-Tier Multicast-Agent Architecture for All-IP Multicast Transport Services","authors":"Chih-Chao Wen, Chi-Ju Chiu, Cheng-Shong Wu, Hui-Kai Su, Y. Chu","doi":"10.1109/BWCCA.2011.85","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.85","url":null,"abstract":"Current group communication applications need to overcome inter-domain and heterogeneous multicast transport challenges. All-IP multicast over Internet is proposed to achieve the efficiency and transparency on IP multicast packet delivery not only for native IP multicast domains, but also for non-IP multicast supported domains. To guarantee the efficient IP multicast packet delivery over heterogeneous networks, therefore application level multicast (ALM) and overlay multicast (OM) were introduced for the connectivity of inter-domain coordination and local hetero-geneous access. In this paper, we propose two-tier multicast agent (MA) mechanism to integrate ALM with overlay tunnel connections to inter-domain multicast and network level connections to local heterogeneous multicast access. In our experimental results, the proposed MA mechanism can achieve all-IP multicast transport services with multicast packet transmission over inter-domain and heterogeneous local wired/wireless access networks.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116875146","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}
引用次数: 4
Hash-Algorithms Output for Digital Evidence in Computer Forensics 计算机取证中数字证据的哈希算法输出
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.65
Hung-Jui Ke, Jonathan C. L. Liu, Shiuh-Jeng Wang, Dushyant Goyal
{"title":"Hash-Algorithms Output for Digital Evidence in Computer Forensics","authors":"Hung-Jui Ke, Jonathan C. L. Liu, Shiuh-Jeng Wang, Dushyant Goyal","doi":"10.1109/BWCCA.2011.65","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.65","url":null,"abstract":"With the fast developments in computer and internet connections going through the world, the high-tech crime problem is also companying with it on the way. Hash-algorithm is, basically, a crypto-function that enables to output a short-string for any possible input digital strings. One of its applications is able to be used in the field of computer forensics to authenticate the completeness of digital evidence. According to the collision-free nature of hash, any one minor change of strings in function input, the output-strings will be totally diverse. In this paper, we review the hash property and discuss the related applications in computer forensics to enhance the reliability of digital evidence in the investigation of computer crime-events.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128228979","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}
引用次数: 2
Steganography and Secure Communication on Online Social Networks and Online Photo Sharing 在线社交网络和在线照片共享中的隐写和安全通信
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.60
Aniello Castiglione, Bonaventura D'Alessio, A. D. Santis
{"title":"Steganography and Secure Communication on Online Social Networks and Online Photo Sharing","authors":"Aniello Castiglione, Bonaventura D'Alessio, A. D. Santis","doi":"10.1109/BWCCA.2011.60","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.60","url":null,"abstract":"On the in Internet today, there are numerous web-sites offering places to store and share images (photos, drawings, cliparts, etc.). Online Social Networks (OSN) and Online Photo Services (OPS) usually offer this type of service making it possible to upload and manage the images they publish. Users can publish their own images as well as add descriptions and tags. By adjusting the personal privacy settings, the images become visible only to authorized users, with it then being possible to add any comments. Generally, OSN/OPS manipulate the published images by resizing, upgrading metadata, compressing, embedding watermarking, and making it difficult to use well-known steganographic methodologies on them. In this paper two new steganographic schemes that mainly take advantage of the published images and survive the OSN/OPS processing before their publication, are proposed and analyzed. Finally, a notification system which uses tags to manage the sent/received information on the secret channel is proposed. This allows for the deletion of the received information as well as a bandwidth increase of the secret channel.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129339244","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}
引用次数: 47
Mint: Booting Multiple Linux Kernels on a Multicore Processor Mint:在多核处理器上启动多个Linux内核
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.90
Y. Nomura, Ryota Senzaki, Daiki Nakahara, Hiroshi Ushio, Tetsuya Kataoka, H. Taniguchi
{"title":"Mint: Booting Multiple Linux Kernels on a Multicore Processor","authors":"Y. Nomura, Ryota Senzaki, Daiki Nakahara, Hiroshi Ushio, Tetsuya Kataoka, H. Taniguchi","doi":"10.1109/BWCCA.2011.90","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.90","url":null,"abstract":"In this paper, we describe the implementation and evaluation of the Mint operating system, which runs multiple Linux instances by partitioning cores, memory blocks, and I/O devices. The proposed method is not a type of virtualization, hence, it makes the most efficient use of available cores. By performing some evaluations, we confirmed that all OS instances in Mint have performances equal to those in the original Vanilla Linux. In addition, because all the instances are completely independent of one another, Mint will not be affected by performance issues, even under the forthcoming many-core environments. In addition, each instance is fully armored Linux. This means that users can still use existing software assets.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130611489","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}
引用次数: 13
Finite Field Multiplication Using Reordered Normal Basis Multiplier 使用重排序法基乘法器的有限域乘法
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.51
F. Gebali, T. Al-Somani
{"title":"Finite Field Multiplication Using Reordered Normal Basis Multiplier","authors":"F. Gebali, T. Al-Somani","doi":"10.1109/BWCCA.2011.51","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.51","url":null,"abstract":"We present in this paper affine linear and nonlinear techniques for design space exploration of the finite-field multiplication using reordered normal basis. Fifteen basic designs are possible using these linear techniques that are in close agreement with the results previously published using ad-hoc techniques. However, the major contribution of this paper is the introduction of nonlinear techniques to allow the designer to control the workload per processor and also control the communication requirements between processors. We present also models for the performance of processor arrays implementing the finite field multiplier. Performance includes system area, delay and power consumption. The main parameters affecting performance include the number of bits processed in parallel per processor and the hardware details such as how much each performance parameters depend on the number of bits being processed in parallel.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129980781","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}
引用次数: 0
Performance Analysis of Underwater Swarm Sensor Networks 水下群传感器网络性能分析
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.53
Marco Tabacchiera, S. Persia, C. Lodovisi, S. Betti
{"title":"Performance Analysis of Underwater Swarm Sensor Networks","authors":"Marco Tabacchiera, S. Persia, C. Lodovisi, S. Betti","doi":"10.1109/BWCCA.2011.53","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.53","url":null,"abstract":"Fundamental key aspects of underwater acoustic communications have been taken into account to define an underwater swarm network for monitoring and exploration applications. We discuss the communication architecture of underwater sensor networks as well as the factors that influence underwater network design. Specifically, the main requirements needed to design a suitable sensors underwater system has been provided by considering a Cross-Layer solution among the lower layers of the node to maintain the power consumption as low as possible without complexity addition in the architecture design. Results show that the average power can be preserved thanks to power control implementation used to optimize the overall across the physical, Medium Access Control (MAC) and Network (NWK) layers. This study wants to provide the performance analysis of a swarm network model to provide guideline for hardware developing of swarm nodes for a real underwater application.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134053935","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}
引用次数: 7
Hardware Implementation of Prearranged Tables Based Modular Inversion 基于模块化反演的预排表硬件实现
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.34
Tsutomu Ishida, Y. Yoshioka, T. Nagase
{"title":"Hardware Implementation of Prearranged Tables Based Modular Inversion","authors":"Tsutomu Ishida, Y. Yoshioka, T. Nagase","doi":"10.1109/BWCCA.2011.34","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.34","url":null,"abstract":"The computational complexity of modular multiplication and division, which are the most important operations of some recent public-key cryptographic algorithms, has been a touchy issue for years. This complexity can be efficiently reduced by using prearranged table based on the binary extended GCD algorithm. However, the reduction can be fulfilled if we take into consideration of the hardware design of the modular inversion algorithm. This paper presents a hardware implementation of prearranged tables based modular inversion algorithm on FPGA technology. This algorithm is fast, less computational cost and less number of operations needed in hardware implementations. The multiple-precision arithmetic is replaced by single-precision to reduce the size of the hardware design. The numerical results show that the operation times of a single-precision is performed efficiently.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134435128","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}
引用次数: 0
Degree Distribution of Unit Disk Graphs with Uniformly Deployed Nodes on a Rectangular Surface 矩形平面上节点均匀部署的单位磁盘图的度分布
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.38
R. Ferrero, F. Gandino
{"title":"Degree Distribution of Unit Disk Graphs with Uniformly Deployed Nodes on a Rectangular Surface","authors":"R. Ferrero, F. Gandino","doi":"10.1109/BWCCA.2011.38","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.38","url":null,"abstract":"Unit disk graphs are a simple model for wireless networks. This paper studies the degree distribution of unit disk graphs for uniformly randomly deployed nodes on rectangular surfaces. Several papers have proposed degree distributions approximating border effects. This paper presents a careful geometric analysis which is used to derive the probability mass function of the degree distribution and its mean. The analysis is validated through simulations which show the accuracy of the proposed distribution.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133928158","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}
引用次数: 13
Energy Efficient Distributed Systems for Storage-Based Applications 基于存储应用的节能分布式系统
2011 International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2011-10-26 DOI: 10.1109/BWCCA.2011.39
Takuro Inoue, A. Aikebaier, T. Enokido, M. Takizawa
{"title":"Energy Efficient Distributed Systems for Storage-Based Applications","authors":"Takuro Inoue, A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/BWCCA.2011.39","DOIUrl":"https://doi.org/10.1109/BWCCA.2011.39","url":null,"abstract":"In order to realize digital ecosystems, the total electric power consumption of servers to perform application processes has to be reduced in information systems. Applications are classified into three types, computation, communication, and storage types of applications. In the computation and communication types of applications, CPU and communication resources of computers are mainly consumed, respectively. In this paper, we consider storage-type applications which access to storage drives like hard disk (HDD) and propose a power consumption model of a computer to performed the storage type applications. First, we measure how much electric power of a whole computer is consumed to perform application processes which access to storage drive. Then, we discuss a power consumption model of a computer to perform storage application processes by abstracting most factors dominating the power consumption of a computer from the experimental results. Here, the power consumption of a computer is maximum if at least one process is performed. The maximum power consumption depends on types concurrent processes. Otherwise, the power consumption is minimum.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133361471","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}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信