Pub Date : 2019-01-01DOI: 10.31838/ijccts/01.02.13
{"title":"VEBEK-Working & Functionalities ","authors":"","doi":"10.31838/ijccts/01.02.13","DOIUrl":"https://doi.org/10.31838/ijccts/01.02.13","url":null,"abstract":"","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125008573","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/05.01.03
E.Sowmiya Dr.V.Chandrasekaran, Thindal, Erode
In these days, the application of Wireless Sensor Networks (WSNs) have been increased .Advance in microelectronic fabrication technology also reduces the manufacturing cost. Detecting node failures in Wireless Sensor Networks is very challenging because the network topology can be highly dynamic, the network may not always connected and the resources are limited . It becomes trend to deploy the large number of portable wireless sensors in Wireless Sensor Networks, in order to increase the Quality of Service (QoS). The QoS is mainly affected by the failure of sensor node .The sensor node failure increases with the increase in number of sensors in Wireless Sensor Networks. In order to maintain better QoS in such failure condition, Identifying and Detaching such faults are essential. In the proposed method the faulty sensor node is detected by measuring the Round Trip Delay (RTD) time of Discrete Round Trip paths and comparing them with threshold value. In proposed method, Scalability is verified by simulating the WSNs with large numbers of sensor nodes in NS2. The RTD time results derived in hardware and software implementation are almost equal, justifying the real time applicability of the investigated method.
{"title":"SENSOR NODE FAILURE DETECTION USING ROUND TRIP DELAY IN WIRELESS SENSOR NETWORK ","authors":"E.Sowmiya Dr.V.Chandrasekaran, Thindal, Erode","doi":"10.31838/ijccts/05.01.03","DOIUrl":"https://doi.org/10.31838/ijccts/05.01.03","url":null,"abstract":"In these days, the application of Wireless Sensor Networks (WSNs) have been increased .Advance in microelectronic fabrication technology also reduces the manufacturing cost. Detecting node failures in Wireless Sensor Networks is very challenging because the network topology can be highly dynamic, the network may not always connected and the resources are limited . It becomes trend to deploy the large number of portable wireless sensors in Wireless Sensor Networks, in order to increase the Quality of Service (QoS). The QoS is mainly affected by the failure of sensor node .The sensor node failure increases with the increase in number of sensors in Wireless Sensor Networks. In order to maintain better QoS in such failure condition, Identifying and Detaching such faults are essential. In the proposed method the faulty sensor node is detected by measuring the Round Trip Delay (RTD) time of Discrete Round Trip paths and comparing them with threshold value. In proposed method, Scalability is verified by simulating the WSNs with large numbers of sensor nodes in NS2. The RTD time results derived in hardware and software implementation are almost equal, justifying the real time applicability of the investigated method.","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123413274","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/07.02.03
R. Denicashelus, B.Deebikaa, S.Hariram
Today's technology is improved to a greater extent for the betterment of people, but there are some people with disabilities like blindness. In order to overcome their problem a smart stick is designed with GPS-GSM module, ultrasonic sensor that would help them in their way to identify obstacle. Ultrasonic sensors calculate the distance of the obstacles around the visually impaired person to guide the user towards the necessary path. This paper describes about how each components would help them. This also helps to find the stick if it is lost. The tool says that, the smart walking stick that alerts visually-impaired persons over obstacles, fire, and water and could help them in walking with less accident.
{"title":"EMBEDDED ASSISTIVE STICK FOR VISUALLY IMPAIRED PEOPLE","authors":"R. Denicashelus, B.Deebikaa, S.Hariram","doi":"10.31838/ijccts/07.02.03","DOIUrl":"https://doi.org/10.31838/ijccts/07.02.03","url":null,"abstract":"Today's technology is improved to a greater extent for the betterment of people, but there are some people with \u0000disabilities like blindness. In order to overcome their problem a smart stick is designed with GPS-GSM module, \u0000ultrasonic sensor that would help them in their way to identify obstacle. Ultrasonic sensors calculate the distance \u0000of the obstacles around the visually impaired person to guide the user towards the necessary path. This paper \u0000describes about how each components would help them. This also helps to find the stick if it is lost. The tool says \u0000that, the smart walking stick that alerts visually-impaired persons over obstacles, fire, and water and could help \u0000them in walking with less accident.","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116042033","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/05.02.05
{"title":"Dynamic Smart Alert Service for Women Safety System ","authors":"","doi":"10.31838/ijccts/05.02.05","DOIUrl":"https://doi.org/10.31838/ijccts/05.02.05","url":null,"abstract":"","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115868266","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/01.01.04
{"title":"A Reliable ATM Protocol and Comparative Analysis on Various Parameters with Other ATM Protocols ","authors":"","doi":"10.31838/ijccts/01.01.04","DOIUrl":"https://doi.org/10.31838/ijccts/01.01.04","url":null,"abstract":"","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134475760","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/07.sp01.08
R. Gokila, P. Arunkumar, S. Deepakkumar, Athul Ravi, S. Sakthivel
Intelligent mirrors, which continue the works today and will take its place in the future technology, provide both mirror and computer aided information services to its users.. The user command is recognized by Raspberry PI through the micro phone in the mirror, in-built microphone and speaker is used for communicate with the mirror. That mirror shows time, calendar, reminders and headlines.
{"title":"HOME AUTOMATION USING SMART MIRROR WITH RASPBERRY PI","authors":"R. Gokila, P. Arunkumar, S. Deepakkumar, Athul Ravi, S. Sakthivel","doi":"10.31838/ijccts/07.sp01.08","DOIUrl":"https://doi.org/10.31838/ijccts/07.sp01.08","url":null,"abstract":"Intelligent mirrors, which continue the works today and will take its place in the future technology, provide both \u0000mirror and computer aided information services to its users.. The user command is recognized by Raspberry PI \u0000through the micro phone in the mirror, in-built microphone and speaker is used for communicate with the mirror. \u0000That mirror shows time, calendar, reminders and headlines.","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132247913","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/02.02.11
{"title":"Wireless Data Routing with Security Keys ","authors":"","doi":"10.31838/ijccts/02.02.11","DOIUrl":"https://doi.org/10.31838/ijccts/02.02.11","url":null,"abstract":"","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128202942","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/04.01.01
H. J. Yakubu, T. Aboiyar, P. B. Zirra
The need to have a more secured ways of protecting sensitive images in this modern age of technology has become necessary for ensuring that such images sent via the insecure public network called the Internet are protected from attacks. To this end, various image encryption algorithms have been proposed by many researchers and RSA image encryption algorithm is one of them. Studies on RSA image encryption algorithm reveal that some images when encrypted using the algorithm, gives encrypted images that do expose some features of the plain images on visual inspection no matter the size of primes used. This is due to the fact that digital images have high redundancy and high correlation of image data that make RSA algorithm image dependent. Cryptanalysis has been a major source of concern (in particular the brute-force attack) when designing a cryptosystem since it is assumed that the cryptanalyst knows exactly the design and working of the cryptosystem under study except the secret key. Thus, making the secret key access much more difficult to the cryptanalyst makes the encryption algorithm a more reliable one. In view of these, an improved RSA image encryption algorithm using 1-D logistic map was proposed. The proposed scheme has two stages. In the first stage, the plain-image is shuffled using the chaotic properties of the map and in the second stage; the shuffled image is encryption using the RSA algorithm. The proposed algorithm and the RSA algorithm were tested on two standard test gray scale images: cameraman.tif and clock.tif using four different set of keys. Security analysis such as histogram analysis and correlation coefficient analysis were also carried out on the results obtained from the two methods. The results of the analysis show that the proposed scheme is more secured and stronger against the brute-force attack ( encrypted image which does not reveals any hint about the plain image to the attacker and also its key space has double: the two primes, initial condition and control parameter) than the RSA image encryption scheme.
{"title":"An improved RSA image encryption algorithm using 1-D logistic map","authors":"H. J. Yakubu, T. Aboiyar, P. B. Zirra","doi":"10.31838/ijccts/04.01.01","DOIUrl":"https://doi.org/10.31838/ijccts/04.01.01","url":null,"abstract":"The need to have a more secured ways of protecting sensitive images in this modern age of technology has become necessary \u0000for ensuring that such images sent via the insecure public network called the Internet are protected from attacks. To this end, various \u0000image encryption algorithms have been proposed by many researchers and RSA image encryption algorithm is one of them. Studies on \u0000RSA image encryption algorithm reveal that some images when encrypted using the algorithm, gives encrypted images that do expose \u0000some features of the plain images on visual inspection no matter the size of primes used. This is due to the fact that digital images have \u0000high redundancy and high correlation of image data that make RSA algorithm image dependent. Cryptanalysis has been a major source \u0000of concern (in particular the brute-force attack) when designing a cryptosystem since it is assumed that the cryptanalyst knows exactly \u0000the design and working of the cryptosystem under study except the secret key. Thus, making the secret key access much more difficult to \u0000the cryptanalyst makes the encryption algorithm a more reliable one. In view of these, an improved RSA image encryption algorithm \u0000using 1-D logistic map was proposed. The proposed scheme has two stages. In the first stage, the plain-image is shuffled using the chaotic \u0000properties of the map and in the second stage; the shuffled image is encryption using the RSA algorithm. The proposed algorithm and \u0000the RSA algorithm were tested on two standard test gray scale images: cameraman.tif and clock.tif using four different set of keys. Security \u0000analysis such as histogram analysis and correlation coefficient analysis were also carried out on the results obtained from the two \u0000methods. The results of the analysis show that the proposed scheme is more secured and stronger against the brute-force attack ( encrypted \u0000image which does not reveals any hint about the plain image to the attacker and also its key space has double: the two primes, \u0000initial condition and control parameter) than the RSA image encryption scheme.","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"26 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123657622","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/04.01.07
M. MangayarkarasiRVanitha, K. SakthivelRDr.Bharanitharan
Polygonal approximation detects a set of feature points on the boundary of a shape that constitute the vertices of the shape. In particular, shape representation by polygonal approximation has become a popular technique due to its easiness, locality and compression. This paper presents a survey of methods that detects a set of dominant points that constitute the boundary of a 2D digital planar curve with an iterative procedure and a comparison of the polygonal approximation algorithms on various shapes with varying number of dominant points is made along with the demerits of each of the techniques
{"title":"A Survey of suboptimal polygonal approximation methods ","authors":"M. MangayarkarasiRVanitha, K. SakthivelRDr.Bharanitharan","doi":"10.31838/ijccts/04.01.07","DOIUrl":"https://doi.org/10.31838/ijccts/04.01.07","url":null,"abstract":"Polygonal approximation detects a set of feature points on the boundary of a shape that constitute the vertices of the shape. In particular, shape representation by polygonal approximation has become a popular technique due to its easiness, locality and compression. This paper presents a survey of methods that detects a set of dominant points that constitute the boundary of a 2D digital planar curve with an iterative procedure and a comparison of the polygonal approximation algorithms on various shapes with varying number of dominant points is made along with the demerits of each of the techniques","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124942154","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}
Pub Date : 2019-01-01DOI: 10.31838/ijccts/04.02.07
R. Suba, R. Satheeskumar
A Wireless Mesh Network (WMN) is a communication network made up of radio nodes, organized in a mesh topology. In this mesh network, load balancing can be used to extend the lifetime of a mesh network and thus reducing the traffic congestion and improves the network performance. The clustering techniques are used to solve routing and congestion control problems, because it offers scalability and enhance the availability of network and reduce overhead. Here a Weighted Clustering Algorithm (WCA) method is selected to divide the network into k –cluster to manage the load in small scale and hence to reduce the overhead. The node with maximum weight is more desirable to select as Cluster Head (CH).By using the AODV protocol a node in the cluster sends many small packets compared to other reactive protocols to increase the speed of the transmission packet. When the network size increases, the degree of node also increases causing network congestion. The use of this WCA reduces this overhead by allowing route discovery and maintenance.
{"title":"Efficient Cluster Based Congestion Control in Wireless Mesh Network ","authors":"R. Suba, R. Satheeskumar","doi":"10.31838/ijccts/04.02.07","DOIUrl":"https://doi.org/10.31838/ijccts/04.02.07","url":null,"abstract":"A Wireless Mesh Network (WMN) is a communication network made up of radio nodes, organized in a mesh topology. In this mesh network, load balancing can be used to extend the lifetime of a mesh network and thus reducing the traffic congestion and improves the network performance. The clustering techniques are used to solve routing and congestion control problems, because it offers scalability and enhance the availability of network and reduce overhead. Here a Weighted Clustering Algorithm (WCA) method is selected to divide the network into k –cluster to manage the load in small scale and hence to reduce the overhead. The node with maximum weight is more desirable to select as Cluster Head (CH).By using the AODV protocol a node in the cluster sends many small packets compared to other reactive protocols to increase the speed of the transmission packet. When the network size increases, the degree of node also increases causing network congestion. The use of this WCA reduces this overhead by allowing route discovery and maintenance.","PeriodicalId":415674,"journal":{"name":"International Journal of communication and computer Technologies","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122824831","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：