2014 Fourth International Conference on Advanced Computing & Communication Technologies最新文献

筛选
英文 中文
Op-LEACH: An Optimized LEACH Method for Busty Traffic in WSNs 基于Op-LEACH的WSNs繁忙流量优化LEACH方法
S. Gambhir, N. Fatima
{"title":"Op-LEACH: An Optimized LEACH Method for Busty Traffic in WSNs","authors":"S. Gambhir, N. Fatima","doi":"10.1109/acct.2014.94","DOIUrl":"https://doi.org/10.1109/acct.2014.94","url":null,"abstract":"A Wireless Sensor Network (WSN) is a collection of small, self-contained electro-mechanical devices that monitor the environment conditions. There are many design issues for WSNs such as deployment, mobility, infrastructure, network topology, network size and density, connectivity, lifetime, node addressability, data aggregation etc. The hierarchical routing protocols are LEACH (Low-Energy Adaptive Clustering Hierarchy) is one of the routing protocols designed for communication in WSNs. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transferred to the base station. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios. LEACH uses a TDMA based MAC protocol, in order to maintain balanced energy consumption. A number of these TDMA slots are wasted when the nodes have random data distribution. A modification to existing LEACH protocol is needed in order to use the slots corresponding to nodes that do not have data to send at its scheduled slot. This paper presents a new version of LEACH protocol called OP-LEACH which aims to reduce energy consumption within the wireless sensor network. Both existing LEACH and proposed OP-LEACH are evaluated through extensive simulations using OMNET++ simulator which shows that Op-LEACH performs better than LEACH protocol.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123895439","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}
引用次数: 38
A Solution to Inverse Kinematics Problem Using the Concept of Sampling Importance Resampling 用采样重要性重采样的概念求解逆运动学问题
Rachit Sapra, Michael J. Mathew, S. Majumder
{"title":"A Solution to Inverse Kinematics Problem Using the Concept of Sampling Importance Resampling","authors":"Rachit Sapra, Michael J. Mathew, S. Majumder","doi":"10.1109/ACCT.2014.21","DOIUrl":"https://doi.org/10.1109/ACCT.2014.21","url":null,"abstract":"The Inverse Kinematics (IK) problem requires solving the non-linear transcendental equations. It is not always possible to obtain a closed form solution. Besides, the existence of a unique solution or multiple solutions is an important issue. This paper therefore tries to solve the IK problem using the Sampling Importance Resampling (SIR) particle filter. Since the particle filter can represent multimodal belief, the proposed approach has the ability to find multiple solutions to the problem. Simulations were performed on a 6 degree of freedom PUMA-like manipulator. Results show that the method exhibits convergence within 3 iterations of filtering. Also, the present approach succeeds in finding multiple solutions, performs well near singularities and requires no initial estimate. The method is computationally efficient and can be applied to many other serial manipulators with multiple degrees of freedom.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407310","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
Sparse Signal Reconstruction via Orthogonal Least Squares 基于正交最小二乘法的稀疏信号重构
Arvinder Kaur, S. Budhiraja
{"title":"Sparse Signal Reconstruction via Orthogonal Least Squares","authors":"Arvinder Kaur, S. Budhiraja","doi":"10.1109/ACCT.2014.49","DOIUrl":"https://doi.org/10.1109/ACCT.2014.49","url":null,"abstract":"In the field of compressed sensing, Orthogonal least Square is a well known greedy algorithm for sparse signal reconstruction. It has been proved that this algorithm gives stable and speedy recovery as compared to L-norm minimization but at the cost of computation complexity. This paper demonstrates that by dividing orthogonal least square algorithm in sub stages, its complexity can be reduced up to some extent even for the large number of measurements. Compared with the basis pursuit method, the simulation results show that exact and faster reconstruction can be obtained from the implemented greedy algorithm by sampling the k in R measurements where k is Sparsity level and R is the signal dimension. The main goal of this paper is to provide an easy way for implementation of this greedy algorithm.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116413681","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
Robust Digital Image Watermarking in High Frequency Band Using Median Filter Function Based on DWT-SVD 基于DWT-SVD中值滤波的高频鲁棒数字图像水印
R. Kaur, Sonika Jindal
{"title":"Robust Digital Image Watermarking in High Frequency Band Using Median Filter Function Based on DWT-SVD","authors":"R. Kaur, Sonika Jindal","doi":"10.1109/ACCT.2014.93","DOIUrl":"https://doi.org/10.1109/ACCT.2014.93","url":null,"abstract":"This paper proposed a new robust digital image watermarking technique to protect the data. In this paper digital watermarking technique is proposed using median filter function based on discrete wavelet transform and singular value decomposition. Original image is passed through median filter function to make the image smooth, then first level wavelet transform is applied. Embedding is done in high frequency band by modifying the singular value of watermark and original image. Various techniques are proposed to hide the data but current technique shows robustness against various attacks.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123022828","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}
引用次数: 16
Key Management for Cloud Data Storage: Methods and Comparisons 云数据存储的密钥管理:方法和比较
A. Buchade, Rajesh Ingle
{"title":"Key Management for Cloud Data Storage: Methods and Comparisons","authors":"A. Buchade, Rajesh Ingle","doi":"10.1109/ACCT.2014.78","DOIUrl":"https://doi.org/10.1109/ACCT.2014.78","url":null,"abstract":"Cloud computing paradigm is being used because of its low up-front cost. In recent years, even mobile phone users store their data at Cloud. Customer information stored at Cloud needs to be protected against potential intruders as well as cloud service provider. There is threat to the data in transit and data at cloud due to different possible attacks. Organizations are transferring important information to the Cloud that increases concern over security of data. Cryptography is common approach to protect the sensitive information in Cloud. Cryptography involves managing encryption and decryption keys. In this paper, we compare key management methods, apply key management methods to various cloud environments and analyze symmetric key cryptography algorithms.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"35 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114031935","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}
引用次数: 27
Modeling ETL Process for Data Warehouse: An Exploratory Study 数据仓库ETL过程建模:探索性研究
Sonal Sharma, Rajni Jain
{"title":"Modeling ETL Process for Data Warehouse: An Exploratory Study","authors":"Sonal Sharma, Rajni Jain","doi":"10.1109/ACCT.2014.100","DOIUrl":"https://doi.org/10.1109/ACCT.2014.100","url":null,"abstract":"The data warehouse facilitates knowledge workers in decision making process. A good DW design can actually reduce the report processing time but, it requires substantial efforts in ETL design and implementation. In this paper, the authors have focused on the working of Extraction, Transformation and Loading. The focus has also been laid on the data quality problem which in result leads to falsification of analysis based on that data. The authors have also analyzed and compared various ETL modeling processes. So this study would be substantially fruitful for understanding various approaches of ETL modeling in data warehousing.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130929566","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}
引用次数: 9
Performance Analysis of Region of Interest Based Compression Method for Medical Images 基于兴趣区域的医学图像压缩方法性能分析
Rushabh Shah, Priyanka Sharma, Rutvi Shah
{"title":"Performance Analysis of Region of Interest Based Compression Method for Medical Images","authors":"Rushabh Shah, Priyanka Sharma, Rutvi Shah","doi":"10.1109/ACCT.2014.64","DOIUrl":"https://doi.org/10.1109/ACCT.2014.64","url":null,"abstract":"In medical domain the high quality image data is maintained with the help of highly efficient servers across the network. There are some areas of medicine where it is sufficient to maintain high image quality only for diagnostically important regions, for example, tumor region of the brain MRI. Thus, the regions of interest are compressed with almost zero data loss while transmitting and storing the images, while the rest of image may possess less quality. This paper represents a compression method based on ROI, its performance analysis focusing on Haar Wavelet transform technique.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133048460","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}
引用次数: 16
Comparison of Characteristics of Transmission Lines Using Different EM Simulators 不同电磁模拟器对传输线特性的比较
P. Majumdar, A. K. Verma
{"title":"Comparison of Characteristics of Transmission Lines Using Different EM Simulators","authors":"P. Majumdar, A. K. Verma","doi":"10.1109/ACCT.2014.10","DOIUrl":"https://doi.org/10.1109/ACCT.2014.10","url":null,"abstract":"We present application of EM-simulators for studying characteristics of line parameters of different planar transmission lines. The main objective is to realize different planar transmission lines in EM-simulators and compare their line parameters ( de-embedded and non de-embedded) against results from experiments and analytical models for wide range of data, which further proves the validity of the analysis. The study has been done for microstrip, CPW, CPS and slotline on six different substrates with permittivity ranges from 2.5-37 in the frequency range 0.1 GHz - 200 GHz and conductor thickness ranges from 0.25 μm - 9 μm. It is a general approach, applicable to any line.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116038216","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}
引用次数: 3
Action-Based Trust Computation Algorithm for Online Social Network 基于动作的在线社交网络信任计算算法
M. Gambhir, M. Doja, Moinuddin
{"title":"Action-Based Trust Computation Algorithm for Online Social Network","authors":"M. Gambhir, M. Doja, Moinuddin","doi":"10.1109/ACCT.2014.89","DOIUrl":"https://doi.org/10.1109/ACCT.2014.89","url":null,"abstract":"Online Social Network (OSN) is a growing platform that enables people to get hold of news, communicate with family and old friends with whom they have lost contact, to promote a business, to invite friends to an event and to get people to collaborate. Researchers have been finding out ways to stop the negative activities over the social media by imposing the privacy settings in the leading OSNs. The privacy settings let the user to control who can access what information in his/her profile. None of these have given the entity of trust enough thought. In this research, An algorithm is proposed to evaluate and compute the Trust Factor for a user which measures the credibility of a user in the OSN world. The Trust factor considers the actions performed by the user in the OSN and the type of content being posted on the OSN, thereby, the user is responsible for his/her reputation in the OSN world. This will enable the users to decide which content is reliable and which user is credible.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123678251","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}
引用次数: 12
Simplified Approach Towards Securing Privacy and Confidentiality of Mobile Short Messages 保护移动短信息隐私和机密性的简化方法
Hasan Al Bashar Abul Ulayee, Md Mesbah-Ul-Awal, S. Newaj
{"title":"Simplified Approach Towards Securing Privacy and Confidentiality of Mobile Short Messages","authors":"Hasan Al Bashar Abul Ulayee, Md Mesbah-Ul-Awal, S. Newaj","doi":"10.1109/ACCT.2014.23","DOIUrl":"https://doi.org/10.1109/ACCT.2014.23","url":null,"abstract":"Almost every Telecom provides so many value added services (VAS) based on SMS. Over SMS value added services like voucher-less electronic recharge system, Balance transfer or SMS banking is very common one and has to take active part in financial transaction. As there is financial transaction, there should be privacy and security. During development of VAS applications like voucher-less electronic recharge or short message based fund transfer systems, many VAS teams faced the challenge of SMS security and privacy. To ensure the privacy and security, encryption of the message body is necessary. Though SMS encryption is done in network layer and there is extended work on that issue but we should not avoid the necessity of encryption of SMS in application layer. This is very much important for the privacy of the subscriber as well as for security of VAS applications those deal with financial transaction. This paper proposes an approach that handles apprehensive risks based on advanced block mode operation which secures privacy and avoids internal fraud, thus describes the justification of such proposal. The privacy and security issues that have been faced during the development of voucher less electronic recharge system are also shared here.","PeriodicalId":249074,"journal":{"name":"2014 Fourth International Conference on Advanced Computing & Communication Technologies","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117130639","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
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学术官方微信
小红书