{"title":"EER-AL: AN ENERGY EFFICIENT ROUTING PROTOCOL BASED ON AUTOMATED LEARNING METHOD","authors":"Farzad Kiani","doi":"10.21917/ijct.2018.0263","DOIUrl":"https://doi.org/10.21917/ijct.2018.0263","url":null,"abstract":"The issue of energy in a wireless sensor network is one of the most important challenges for these networks. This issue is also being considered today in the new IoT topic. This paper studies the ability of the learning automata model to solve the problem in the sensor networks. Because they have capabilities such as low computational load, ability to use in distributed environments, and inaccurate information, require the least feedback from the environment, etc. One of the solutions to energy optimization is to provide routing protocols. In the routing area, a routing protocol based on learning automata has been proposed in which the network lifetime criterion is considered. The simulation results and the comparison of the proposed protocol with other protocols indicate that this protocol has better performance in the energy conversation and network lifetime.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42341618","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 MULTI AWARE MULTI-LEVELS HETEROGENOUS ROUTING (MAMHR) PROTOCOL FOR WIRELESS SENSOR NETWORKS","authors":"K. Indulekha, G. Jayasree, B. Malarkodi","doi":"10.21917/ijct.2018.0254","DOIUrl":"https://doi.org/10.21917/ijct.2018.0254","url":null,"abstract":"Wireless Sensor Networks (WSNs) are generally set out in a remote workplace, since the sensor nodes are tiny in size, cost-proficient, low-power gadgets, and have restricted battery supply. Due to the constrained availability of power sources, energy utilization has been considered as the most crucial factor for proposing network routing protocols. The fundamental concern is to improve the lifetime of the network based on the energy constraints. Several homogenous cluster-based routing protocols have been proposed in literature for lifetime improvement of the sensor network but many of them fail to function effectively in heterogeneous environment and moreover, these protocols have not considered any other awareness parameters than lifetime and energy consumption. In this work, a Multi Aware Multi-Levels Heterogeneous Routing (MAMHR) protocol, focusing on the principle of multi-level heterogeneity by considering multiple awareness parameters of the network such as Quality of Service (QoS), shortest path estimation and suitable localization technique, is proposed. Scoped Bellman Ford Routing (SBFR) algorithm is used for shortest path estimation, Reliability, Availability, and Serviceability (RAS) factors are considered for QoS awareness and Time Difference of Arrival (TDOA) technique is used for location estimation. Lifetime awareness parameters of the proposed scheme were compared with already existing prominent protocols LEACH, SEP and ZSEP and a significant improvement in lifetime of entire network was obtained. Simulation results corresponding to the respective multiple awareness parameters also shows that these parameters can be incorporated into the selected heterogeneous environment without affecting the energy consumption constraints of the proposed scheme.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49034562","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":"ANNA: A UNIFIED FRAMEWORK FOR DATA SECURITY IN HEALTHCARE INTERNET OF THINGS","authors":"Shantha Mary Joshitta, L. Arockiam","doi":"10.21917/ijct.2018.0255","DOIUrl":"https://doi.org/10.21917/ijct.2018.0255","url":null,"abstract":"Today, the cyber-physical interactions are made possible with the development of internet and smart technologies. Smart objects such as sensors, RFID tags and actuators are the building blocks of such pervasive network, called as Internet of Things (IoT). IoT has a good number of real time applications in all domains including medical industry. It has great impact on modern healthcare with promising economic, technological and social benefits. Researchers across the globe already have started to explore a variety of technological solutions to enhance healthcare system by incorporating the potential of the IoT. This paper presents a unified framework ANNA, for integrating IoT in healthcare system. It presents three lightweight algorithms to enhance data security in the smart healthcare environment. In addition, this paper provides a detailed working scenario which would be helpful in implementing smart healthcare units in rural India. The working scenario of the ANNA smart healthcare system and the workflow of the framework are also elaborated in this paper. The proposed framework is proved against possible attacks in the healthcare environment. The salient features of the framework are outlined and this research creates a hope that the smart healthcare units based on ANNA framework will offer on time medical care to the needy and the downtrodden.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46946931","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 REVIEW ON OVERVIEW OF WORLDWIDE INTEROPERABILITY FOR MICROWAVE ACCESS (WIMAX) INNOVATION AND ITS FUTURE UTILIZATIONS","authors":"Savita Yadav, Kapil Kumar, Rashmi","doi":"10.21917/ijct.2018.0256","DOIUrl":"https://doi.org/10.21917/ijct.2018.0256","url":null,"abstract":"This paper introduces the elements of the Worldwide Interoperability for Microwave Access (WiMAX) innovation and future utilizations of WiMAX. It is a connection oriented wireless network that assures Quality of Service (QoS) for all users in the network. By comparing WiMAX with the popular Wi-Fi, 3G and LTE in the market, it analyzes the current situation and future development trend of WiMAX in terms of the difference in technology and applications. WiMAX will become the most prominent technology for Broadband Wireless Access (BWA). The next generation WMAN networks, using the WiMAX as the core technology is evolving as a 4G technology for providing ubiquitous computing solutions. In not a similar way like wireless LANs, WiMAX networks integrate various QoS mechanism at the Media Access Control (MAC) level for secured service for voice, data and video. The unique architecture of the WiMAX MAC and PHY layer that uses OFDMA to allocate multiple channels with different modulation schemes. A few references have been incorporated towards the completion of this paper for those eager to know in brief about certain","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42091204","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":"PSEUDO RANDOM NUMBER GENERATION USING EYE BRIGHTNESS RESPONSE","authors":"T. Sivakumar, T. Anusha","doi":"10.21917/ijct.2018.0259","DOIUrl":"https://doi.org/10.21917/ijct.2018.0259","url":null,"abstract":": Random numbers play an important and primary role in the use of Cryptography techniques in real time applications. The cryptographic techniques can be easily compromised if the key can be easily guessed. Therefore it is important that the keys are in random and unpredictable in nature. The operating system uses the random numbers to mask passwords and to offer salt and session identifiers. This paper introduces a new software based pseudo random number generation method based on the eye brightness response formula. This function provides a significant change in sensation for minimum required change in signal intensity. The randomness tests are performed to confirm the randomness of the generated random numbers.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48963494","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":"TARGET TRACKING BASED ON BASE STATION NODE USING PREDICTION METHOD AND CLUSTER STRUCTURE IN WIRELESS SENSOR NETWORKS","authors":"Farzad Kiani, Hamidreza Tahmasebirad","doi":"10.21917/ijct.2018.0260","DOIUrl":"https://doi.org/10.21917/ijct.2018.0260","url":null,"abstract":"One of the most important and major challenging issues of wireless sensor networks is the tracking of mobile targets. The network continuously reports the spatial information of moving objects during specified periods to the base station. In this paper, by introducing new a protocol with two versions, of which, one of them is based on dynamic clustering with a focus on the base station, and the other is based on a predictive system for increasing the tracking accuracy of the objects movement and decreasing the energy consumption as well. In this paper, the task of clustering involves in determining the cluster heads, the number of cluster members, the selection of cluster members, and managing the activation of the nodes that is done by the base station. On the other hand, given that the base station is outside the field of wireless sensor networks and is connected to an unlimited power source. The second version of the proposed protocol is based on a predictive algorithm that it was inspired from the first proposed version in the role of the base station node by a prediction method. In this paper, three heuristic models are introduced to select the speed and direction in prediction models. They are instant, average and exponential-average models. These models can track the relevant targets more accurately and reduce the number of missing targets. The simulations are done in different scenarios in a custom developed tool. The results of simulation show a good performance of them in the network lifetime and target tracking applications.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48695783","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":"CSO BASED ENERGY EFFICIENT CLUSTER PROTOCOL FOR WIRELESS SENSOR NETWORKS","authors":"D. Chandirasekaran, T. Jayabarathi","doi":"10.21917/ijct.2018.0257","DOIUrl":"https://doi.org/10.21917/ijct.2018.0257","url":null,"abstract":"In wireless sensor networks (WSNs) energy saving has become one of the prime optimization problem and clustering technique has been considered as most efficient techniques to achieve the same. The selection of cluster heads (CHs) plays a vital role in hierarchical based WSNs as it consume more energy owing to its additional duty of receiving, aggregating the data from the cluster member nodes and transmitting the same to the base station (BS). Improper selection of CHs causes impact on network life time. In order to have an energy efficient network a suitable optimization algorithm is to be adopted to select the CHs. We propose a cluster protocol based on Cat Swarm Optimization (CSO) algorithm to reduce the energy consumption during cluster setup phase and transmission phase. The CSO cluster protocol is developed by considering intra-cluster distance of nodes to CH and residual energy of cluster member nodes. The algorithm is tested extensively on various scenarios of WSNs, varying number of sensor nodes and the CHs. The energy efficient scheme of proposed CSO performance is compared with other well-known protocols such as Low Energy Adaptive Clustering Hierarchy -Centralized (LEACH-C) and Particle Swarm Optimization (PSO) based protocol to prove the superiority of it.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45309384","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":"IMPROVED PACKET DELIVERY RATIO IN MOBILE ADHOC NETWORKS USING BTSNA-DS ALGORITHM","authors":"R. Saraswathi, A. Subramani","doi":"10.21917/ijct.2018.0261","DOIUrl":"https://doi.org/10.21917/ijct.2018.0261","url":null,"abstract":"Mobile Ad-hoc Networks (MANETs) in which moving nodes act as mobile-terminals as well as routing stations. These movements cause the change in the network topology. In this connection, route establishment is the primary task to initiate the communication between resources is very difficult due to their random movements. MANET flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. The conventional routing protocol designed for MANET fail to handle dynamic movement and self-starting behavior of the node effectively. Most broadcast protocols are however only ever evaluated using simulations, which have repeatedly been shown to be unreliable, and potentially misleading. In this paper, a new routing algorithm named Binary Tree Structured based Network Approach using Depth Search (BTSNA-DS) for energy efficient path from sender to receiver is proposed. Finally, the performance Analysis of the proposed BTSNA-DS algorithm provide better performance compare to the existing Energy Efficient Neighbor Coverage Protocol (EENCP) and also improved the Packet Delivery Ratio (PDR) with mobility, transmission range, and number of node is increased.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41353670","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":"GPRKEY - A NOVEL GROUP KEY REKEYING TECHNIQUE FOR MANET","authors":"Chanthirika Shanmuganathan, P. Raviraj","doi":"10.21917/ijct.2018.0250","DOIUrl":"https://doi.org/10.21917/ijct.2018.0250","url":null,"abstract":"A Mobile Ad hoc Network (MANET) is a collection of autonomous nodes or mobile devices that can arrange themselves in various ways and work without strict network administration. Ensuring security in mobile ad hoc networks is a challenging issue and most of the applications in mobile ad hoc networks involve group oriented communication. Mostly cryptographic techniques are used to provide the security to MANETs. Cryptographic techniques will not be efficient security mechanism if the key management is weak. The issue of packet loss in MANET that is caused due to multi casting and backward and forward secrecy results in mobility. Hence, we investigate on this issue and propose a method to overcome this scenario. On analysing the situation we find that frequent rekeying leads to huge message overhead and hence increases energy utilization. With the existing key management techniques it causes frequent disconnections and mobility issues. Therefore, an efficient multi casting group key management will help to overcome the above problems. In this paper we propose a novel group key rekeying technique named GPRKEY (Group key with Periodic ReKEYing) deal with scalability issue of rekeying and also analyze the performance of the newly proposed key management method using key trees. In this approach we use the periodic rekeying to enhance the scalability and avoid out of sync problems. We use sub trees and combine them using the merging algorithm and periodic rekeying algorithm. The GPRKEY is evaluated through NS-2 simulation and compared with existing key management techniques OFT (Oneway Function Tree) and LKH (Logical Key Hierarchy). The security and performance of rekeying protocols are analyzed through detailed study and simulation.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":"9 1","pages":"1706-1711"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49177010","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":"AN INVESTIGATION OF SECURITY TECHNIQUES FOR CONCEALED DDOS EXPOSURE ATTACKS","authors":"K. Praghash, M. Masthan, R. Ravi","doi":"10.21917/ijct.2018.0246","DOIUrl":"https://doi.org/10.21917/ijct.2018.0246","url":null,"abstract":"Due to the influence of the multi-level system, the DDoS became a significant investigation in modern days. This encourages us to reduce the data loss and service overheads. In order to investigate these issues, an investigation of the DDoS attack and their related security techniques were analyzed in this paper. So, in this investigation, various data about the intruders will be collected by employing a secured multi-layered design with nomadic honeypots. Our proposed Subterranean Optimization procedure is utilized to distinguish the gatecrashers in view of the pheromone store on that considered zone. A multi-degree IP log table is utilized to distinguish the gatecrashers at diverse ranges of the device. Once the prompted range is found, the information is sent to multi-degree engineering to restrain the spreading of the stimulated region within the honeypot. This statistics will be dispatched to the honeypot to make a guard framework towards the attackers. The advantage of this proposed strategy is that it gives a complete barrier against DDoS at multilevel without making any overhead.","PeriodicalId":30618,"journal":{"name":"ICTACT Journal on Communication Technology","volume":"9 1","pages":"1681-1685"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41808625","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}