{"title":"A Comparative Analysis of Packet Scheduling Schemes for Multimedia Services in LTE Networks","authors":"B. Sahoo, Deepak Puthal, S. Swain, S. Mishra","doi":"10.1109/CINE.2015.30","DOIUrl":"https://doi.org/10.1109/CINE.2015.30","url":null,"abstract":"The revolution in high-speed broadband network is the requirement of the current time, in other words here is an unceasing demand for high data rate and mobility. Both provider and customer see, the long time evolution (LTE) could be the promising technology for providing broadband, mobile Internet access. To provide better quality of service (QoS) to customers, the resources must be utilized at its fullest impeccable way. Resource scheduling is one of the important functions for remanufacturing or upgrading system performance. This paper studies the recently proposed packet scheduling schemes for LTE systems. The study has been concentrated in implication to real-time services such as online video streaming and Voice over Internet Protocol (VOIP). For performance study, the LTE-Sim simulator is used. The primary objective of this paper is to provide results that will help researchers to design more efficient scheduling schemes, aiming to get better overall system performance. For the simulation study, two scenarios, one for video traffic and other for VoIP have been created. Various performances metric such as packet loss, fairness, end-to-end (E2E) delay, cell throughput and spectral efficiency has been measured for both the scenarios varying numbers of users. In the light of the simulation result analysis, the frame level scheduler (FLS) algorithms outperform other, by balancing the QoS requirements for multimedia services.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115164022","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 Comparative Study of Adaptive Beamforming Techniques in Smart Antenna Using LMS Algorithm and Its Variants","authors":"A. Senapati, K. Ghatak, J. S. Roy","doi":"10.1109/CINE.2015.21","DOIUrl":"https://doi.org/10.1109/CINE.2015.21","url":null,"abstract":"This paper presents a comparative study of beam forming techniques using least mean square (LMS) algorithm and its variants, like, normalized least mean square (NLMS) algorithm and sign least mean square (SLMS) algorithm. The accuracy of beam generation toward the direction of arrival (DoA) and null generation toward the interferer, depends on the value of step size parameter used in the algorithm. Beam width and side lobe levels (SLL) are also compared for these three algorithms.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114661431","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":"Data Management System to Improve Security and Availability in Cloud Storage","authors":"R. K. Banyal, V. K. Jain, Pragya Jain","doi":"10.1109/CINE.2015.32","DOIUrl":"https://doi.org/10.1109/CINE.2015.32","url":null,"abstract":"One of the primary usage of cloud computing is data storage. Cloud provides enormous capacity of storage for cloud users. Secure data storage and retrieval of the relevant information from the in traditional as well as in cloud computing environment has always been a significant issue. Different techniques have been developed for this purpose, with objective that it is more reliable and flexible to users to store and retrieve their data at anytime and anywhere. In this paper an new data management framework proposed to provides high level of data security, availability, confidentiality and integrity.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124281549","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":"Energy Optimized Path Selection in Cluster Based Routing for Wireless Mesh Network","authors":"S. Prakash, T. N. Nagabhushan, K. Krinkin","doi":"10.1109/CINE.2015.28","DOIUrl":"https://doi.org/10.1109/CINE.2015.28","url":null,"abstract":"An Energy efficient routing protocol is one of the major concerns of Wireless Mesh Networks(WMN). Nodes of WMN works based on the limited battery power routing protocol has to be designed such that it utilize minimum battery power and route the data efficiently and thus maximize the overall life time of the network. Many existing works shows the efficient usage of battery during the selection of Cluster Head(CH) in clusters. To increase the lifetime, provide scalability and energy efficiency during routing we propose energy optimized path selection protocol that uses Draining Rate (DR) as parameter. The proposed Maximum Remaining energy Minimum Draining rate - Cluster Head(MRMD-CH) selection protocol selects CH based on the maximum remaining energy(Max RE) and minimum battery draining rate (Min DR) of energy resource. The protocol predicts nodes draining rate and based on the result obtained it selects the CH with sufficient energy and low energy depletion rate. The Protocol is evaluated under static nature of nodes. Simulation is carried out in NS3 and results shows that the proposed model efficiently uses the limited battery power of WMN and results in increase in the lifetime of network.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127467625","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 Non-heuristic Approach for Minimizing the Energy and Power Consumption in Wireless Multimedia Sensor Networks","authors":"S. Priyadarshini, S. Panigrahi","doi":"10.1109/CINE.2015.29","DOIUrl":"https://doi.org/10.1109/CINE.2015.29","url":null,"abstract":"Several challenges exist in case of wireless multimedia sensor networks. Out of those challenges, data redundancy is a major problem that is encountered in these networks. When any sort of event takes place in an area of interest, it is initially detected by the scalars. Subsequently, the concerned scalars communicate their reading to their respective cameras, within whose depth of fields the scalars lay. Then the cameras collaboratively decide which among them are to be activated. However, the problem is that when event takes place sensing of occurring event occurs within the event region as well as up to some extra area outside the exact event region. As a result, the cameras present outside the exact event area are activated unnecessarily due to the sensing of occurring event outside event region. Since sensing of event occurs up to certain extent outside event region, therefore the scalars which lay outside the exact event region as well as inside the sensing range of event sense the event. This is due to the coverage of sensing area of occurring event by the sensing range of some of the scalars. Due to the sensing of event by these scalars, the concerned camera sensors are activated unnecessarily. Hence, energy consumption as well as power consumption occurs unnecessarily. Our objective is to minimize this unnecessary energy and power consumption, which can be achieved by keeping the concerned cameras those are present outside the exact event region but inside sensing range of event in turned off condition.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134254765","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":"Gabor-Fast ICA Feature Extraction for Thermal Face Recognition Using Linear Kernel Support Vector Machine","authors":"Goutam Majumder, M. Bhowmik","doi":"10.1109/CINE.2015.14","DOIUrl":"https://doi.org/10.1109/CINE.2015.14","url":null,"abstract":"In this paper a framework is presented to deals with various aspects of face recognition like illumination, rotation and scaling. The proposed framework consists of three parts. In the first part Gabor filter is used over the thermal faces at different scales, locations, and orientations. In second part, the fixed point algorithm Fast ICA have been used over the Gabor filtered images to represent the images from higher to lower dimensional space for dimension reduction. Linear kernel support vector machine (LK-SVM), has been used for classifying the facial images. The thermal face images of IRIS Thermal/Visual Face Database have been used for experiment purpose and result shows that the proposed system is responding well over other techniques.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133244985","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":"Analysing Fractal Dimension of Color Images","authors":"S. Nayak, Abadhan Ranganath, J. Mishra","doi":"10.1109/CINE.2015.37","DOIUrl":"https://doi.org/10.1109/CINE.2015.37","url":null,"abstract":"Fractal Dimension (FD) is an important feature of fractal geometry that finds the significant application in different fields including texture segmentation, shape classification and image analysis. Various methods were proposed to estimate the fractal dimension of gray scale images. In this paper we found out a uniform fractal dimension for both Color and Grey Scale images using differential box counting (DBC) method.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"59 230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125957986","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 Novel Physics Inspired Multi-objective Optimization Algorithm: Multiple Objective Gravitational Optimization","authors":"Rajdeep Chatterjee, M. Das","doi":"10.1109/CINE.2015.16","DOIUrl":"https://doi.org/10.1109/CINE.2015.16","url":null,"abstract":"This paper proposes a new multi-objective optimization algorithm inspired by the Newtonian Law of Gravity. The new algorithm is a multiple objective extension of the single objective optimization Gravitational Search Algorithm. Generally, we know various multi-objective algorithms with leader selection schemes. The Leader guides the population towards Pareto fronts. As a result, the algorithm becomes complex in nature. To reduce that part of the cost, we introduce a new algorithm which does not use the leader for guidance but relies on its own population to obtain the non-dominated set of solutions. The algorithm has been tested on several benchmark functions and has produced a good number of solutions. Our purpose of research is to showcase that the memory-less property of the single objective Gravitational Search Algorithm can be used to solve multiple objective problems.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131773701","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":"Intrusion Detection System for Power-Aware OLSR","authors":"Chaitali Biswas Dutta, U. Biswas","doi":"10.1109/CINE.2015.35","DOIUrl":"https://doi.org/10.1109/CINE.2015.35","url":null,"abstract":"Optimized Link State Routing (OLSR) is a standard proactive routing protocol for Wireless Sensor Network (WSN). OLSR uses two kinds of the control messages: Hello and Topology Control (TC). As these messages are un-authenticated, OLSR is prone to several attacks namely, black hole, wormhole, Gray hole etc. This paper is focused at Sleep Deprivation Torture Attack on OLSR. Sleep deprivation attack is one of the most interesting attack in layer 2 where the attacker tries to use a low energy node until all its energy is exhausted and the node goes into permanent sleep. This attack is also possible in routing level. In OLSR low energy node declare their status through willingness property of HELLO message. Using this information an attacker node can choose that low energy node deliberately and forward all traffic through that node. This leads to low energy node in a permanent sleep mode. In this paper we propose a specification based Intrusion Detection System (IDS) for that type of attack. The performance of the propose algorithm is studied by Network Simulator (NS2) and effectiveness of the propose scheme, along with a comparison with existing techniques is demonstrated.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133107811","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 Survey on Cloud Environment Security Risk and Remedy","authors":"Asish Aich, Alo Sen, S. Dash","doi":"10.1109/CINE.2015.45","DOIUrl":"https://doi.org/10.1109/CINE.2015.45","url":null,"abstract":"Recently, Cloud computing is most powerful research area because of its flexibility and cost efficiency. The paper describes different security issues of cloud computing and the possible solution for remediation.","PeriodicalId":403660,"journal":{"name":"2015 International Conference on Computational Intelligence and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133680124","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}