2013 International Conference on Current Trends in Engineering and Technology (ICCTET)最新文献

筛选
英文 中文
Analysis on data collection using mobile robot in wireless sensor networks 移动机器人在无线传感器网络中的数据采集分析
P. Rajaram, P. Prakasam
{"title":"Analysis on data collection using mobile robot in wireless sensor networks","authors":"P. Rajaram, P. Prakasam","doi":"10.1109/ICCTET.2013.6675963","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675963","url":null,"abstract":"Recently, owing to the improvement of mass construction, the charge of sensor nodes has reduced considerably, and resource-rich sensor nodes can be prepared with high-technology procedures, for instance GPS. Nevertheless, the capability of the battery for all sensor nodes is measured inadequate in terms of energy. When energy diminution of sensor node fallout in a dead mode that is not capable to correspond with other nodes, this generates a bottleneck in a WSN. The data collection algorithm efficiently retrieved the sensed data from the dead node. Collecting sensed data using this approach will consume more time. Various techniques to approach the process of collecting sensed data using mobile robot in wireless sensor networks. In this paper, observed the latest sensed data collection methods and supply a summary in the applying automatic mobile robot with wireless sensor networks and also associated investigation work with that place. In addition side by side evaluations usually are done between various techniques to explain the advantages along with limitations. In this paper, experimental analysis has been conducted along with various factors to demonstrate the development as well as deployment of the sensed information collecting procedure inside wireless sensor networks.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"98 1-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120890022","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}
引用次数: 8
Identifying trusted routing path in WSNs through TARF 通过TARF识别wsn中的可信路由路径
S. Anitha, A. Nithya, A. Vijay
{"title":"Identifying trusted routing path in WSNs through TARF","authors":"S. Anitha, A. Nithya, A. Vijay","doi":"10.1109/ICCCNT.2013.6726535","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726535","url":null,"abstract":"The multi-hop routing in wireless sensor networks (WSNs) will provide little safe against identity deception through replaying routing information. This may be create various dangerous attacks against routing information, attacks such as Sinkhole attacks, Wormhole attacks and Sybil attacks. These types of attacks cannot completely remove from network through our traditional cryptographic technique. In order to secure wireless sensor networks from various attacks through misdirecting multihop routing, I have design and implement TARF, for dynamic WSNs, a robust trust aware routing framework is used. This trust aware routing framework does not depends upon the accurate time synchronization or distribution of nodes within the sensor network. This TARF will provide trust worthy and energy efficient routing path in wireless sensor network. Mostly TARF proves effective against those harmful attacks developed because of identity deception through replaying routing information. Further, I implement a TARF in TinyOS, and verified through Network Simulator.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133086502","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
Localization of optic disc using Fuzzy C Means clustering 基于模糊C均值聚类的视盘定位
K. Padmanaban, R. Kannan
{"title":"Localization of optic disc using Fuzzy C Means clustering","authors":"K. Padmanaban, R. Kannan","doi":"10.1109/ICCTET.2013.6675941","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675941","url":null,"abstract":"In this paper, a data mining technique, Fuzzy C Means clustering (FCM) is used to locate the optic disc in colour fundus image. Green plane from the RGB fundus image is considered in the proposed approach because it provides better contrast than the other red and blue planes. As the intensity of the optic disc is brighter than other region, the initial optic disc is identified by the brightest points which are called Region of Interest (ROI). FCM is a method of clustering which allows one piece of data to belong to two or more clusters. Before applying the FCM technique to cluster the optic disc, the initial ROI is de-noised by using median filtering technique. Results show the efficiency of the FCM to localize the optic disc in order to diagnose glaucoma.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125276966","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
Aggregating secure data in wireless sensor networks 在无线传感器网络中聚合安全数据
K. Parameswari, M. Raseen
{"title":"Aggregating secure data in wireless sensor networks","authors":"K. Parameswari, M. Raseen","doi":"10.1109/ICCTET.2013.6675991","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675991","url":null,"abstract":"In a large sensor network, in-network data aggregation significantly reduces the amount of communication overhead and energy consumption. Due to less amount of data transmission, so that the average sensor lifetime and the overall bandwidth utilization are improved. As wireless sensor networks are usually deployed in remote and hostile environments to transmit sensitive information. Sensor nodes are prone to node compromise attacks and security issues such as data confidentiality and integrity are extremely important. Recently, A robust aggregation framework called synopsis diffusion which combines multipath routing schemes with duplicate-insensitive algorithms to accurately compute aggregates (e.g., predicate Count, Sum) in spite of message losses resulting from node and transmission failures. However, this aggregation framework does not address the problem of false sub aggregate values contributed by compromised nodes resulting in large errors in the aggregate computed at the base station, which is the root node in the aggregation hierarchy. This is an important problem since sensor networks are highly vulnerable to node compromises due to the unattended nature of sensor nodes and the lack of tamper-resistant hardware. The proposed algorithm is a light weight verification algorithm by which the base station can determine if the computed aggregate (predicate Count and Sum) includes any false contribution. Through theoretical analysis and extensive simulation study, it is shown that the proposed algorithm outperforms other existing approaches.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116023075","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
Network reconfiguration and restoration in distribution systems through oppostion based differential evolution algorithm and PGSA 基于对立差分进化算法和PGSA的配电系统重构与恢复
R. M. Kumar, K. Thanushkodi
{"title":"Network reconfiguration and restoration in distribution systems through oppostion based differential evolution algorithm and PGSA","authors":"R. M. Kumar, K. Thanushkodi","doi":"10.1109/ICCTET.2013.6675967","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675967","url":null,"abstract":"Electrical power distribution systems are usually arranged to be radial in operation to simplify over-current protection. Distribution system reconfiguration helps to operate the system at minimum cost and at the same time improves the system reliability and security. Under normal operating conditions, optimization of network configuration is the process of changing the topology of distribution system by altering the open/closed status of switches to find a radial operating structure that minimizes the system real power loss while satisfying operating constraints. In this paper, a combination of Opposition based Differential Evolution Algorithm (ODE) and Plant Growth Simulation Algorithm (PGSA) has been introduced to solve the optimization problem. The optimization approach based on PGSA provides a detailed description on switch states and ODE improves the efficiency of optimization by reducing the number of load flow executions. The effectiveness of the proposed approach is demonstrated by employing the feeder switching operation scheme to IEEE-33 bus and 83-bus Taiwan Power Distribution systems. The proposed algorithm reduces the transmission loss while satisfying the line loading and bus voltage limit constraints and also provides solution under faulted conditions of the system.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129294897","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
Pcloud implementing SaaS in distributed system Pcloud在分布式系统中实现SaaS
M. Kavitha, P. Damodharan
{"title":"Pcloud implementing SaaS in distributed system","authors":"M. Kavitha, P. Damodharan","doi":"10.1109/ICCTET.2013.6676001","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6676001","url":null,"abstract":"Software as a Service (SaaS) is one of the delivery model of cloud computing in which service are provided by the service providers and client make use of it through Internet. Here we present a saas in pcloud. pcloud is a distributed system which contains a number of cooperated nodes. In pcloud, distribute the programming software to a number of nodes so that queries can be executed in parallel manner. In this distributed system, communication overhead between the co-operated nodes is very low. Programming code is send as a user queries to pcloud where it is processed and retrieved through PIR protocol. [1]The concept used by the PIR protocol is the way that accesses of sequential segments are made to different physical storage devices. To minimize the effect of node failures, pCloud includes data replication. The Load Balancing can be achieved by loosely coupled and nearest neighbor property of clouds.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121331034","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
Optimizing the network lifetime using PMAC in wireless sensor networks 在无线传感器网络中使用PMAC优化网络寿命
S. Balaji, S. Preetha
{"title":"Optimizing the network lifetime using PMAC in wireless sensor networks","authors":"S. Balaji, S. Preetha","doi":"10.1109/ICCTET.2013.6675992","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675992","url":null,"abstract":"Whenever a critical event occurs an alarm message should be broadcast to the entire network as soon as possible. In order to prolong the network lifetime, some sleep scheduling methods are used in the wireless sensor networks. while using sleep scheduling methods, the broadcasting delay for transmitting the alarm increases. In order to reduce the broadcasting delay, novel sleep scheduling algorithm is used, which results in energy consumption, because of the increase in time slots. The proposed method uses PMAC to reduce the energy consumption.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122000966","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
Design and analysis of nonlinear AES S-box and mix-column transformation with the pipelined architecture 基于流水线结构的非线性AES S-box及混合柱变换的设计与分析
V. Gopi, E. Logashanmugam
{"title":"Design and analysis of nonlinear AES S-box and mix-column transformation with the pipelined architecture","authors":"V. Gopi, E. Logashanmugam","doi":"10.1109/ICCTET.2013.6675955","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675955","url":null,"abstract":"Cryptography plays an important role in the security of data. It enables us to store sensitive information or transmit it across insecure networks so that unauthorized persons cannot read it[1]. In this paper, we use FPGA chips to realize high data throughput AES pipelined architecture is proposed by partitioning the ten rounds into sub-blocks of repeated AES modules. In this paper we have detailed the alternative design of both direct, inverse Mix Column transforms and high secure nonlinear S-box required in the AES hardware implementation and apply the pipeline architecture for high speed application.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121457623","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}
引用次数: 8
Confide based Path Discovery scheme (CPD) for Mobile Ad-hoc Network to increase the quality of service 为提高移动自组网服务质量,提出了基于信任的路径发现方案(CPD)
S. Omkumar, S. Rajalakshmi
{"title":"Confide based Path Discovery scheme (CPD) for Mobile Ad-hoc Network to increase the quality of service","authors":"S. Omkumar, S. Rajalakshmi","doi":"10.1109/ICCTET.2013.6675947","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675947","url":null,"abstract":"The Quality of Service (QoS) of the MANET is affected by the security, routing scheme and power consumption of the network. The presence of malicious node in the network is also affect the Quality of Service (QoS) of the MANET. This paper aims to route the data packets through only good or normal nodes in the network. The nodes in the network are classified as good or bad node by using the iterative classification algorithm. For each and route discovery to the destination, the source node initiate the execution of the iterative classification algorithm. So, the proposed Confide based Path Discovery (CPD) scheme avoid the degradation in the QoS of MANET due to the presence of malicious node in the route to reach the destination.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132512067","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
Solution of economic load dispatch problems with valve-point effect using Novel TANAN's Algorithm 用新塔南算法求解具有阀点效应的经济负荷调度问题
R. Subramanian, K. Thanushkodi, P. Neelakantan
{"title":"Solution of economic load dispatch problems with valve-point effect using Novel TANAN's Algorithm","authors":"R. Subramanian, K. Thanushkodi, P. Neelakantan","doi":"10.1109/ICCTET.2013.6675930","DOIUrl":"https://doi.org/10.1109/ICCTET.2013.6675930","url":null,"abstract":"The Economic Load Dispatch (ELD) problems in power generation systems is to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Novel TANAN's Algorithm (NTA), for solving ELD Problem. [1] The main objective is to minimize the total fuel cost of the generating units having quadratic cost characteristics subjected to limits on generator true power output and including valve point loading effects. The NTA is a simple numerical random search approach based on a parabolic TANAN function. This paper presents an application of NTA to ELD for different IEEE standard test systems.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130914286","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学术官方微信