The emerging research to develop new architecture for next generation networks have made us think about the security incorporates "inside" the network architecture during the evolution phase. The aim is to provide better services to the user in a secured fashion. In this paper we describe three different security level approaches namely Micro level security, Medium level security and Macro level security with special reference to Service Oriented Network Architecture (SONATE).
{"title":"Security and Authentication Issues in Emerging Network Architectures with Special Reference to SONATE","authors":"Bhawana Rudra, A. Manu, O. Vyas","doi":"10.1109/CICN.2011.143","DOIUrl":"https://doi.org/10.1109/CICN.2011.143","url":null,"abstract":"The emerging research to develop new architecture for next generation networks have made us think about the security incorporates \"inside\" the network architecture during the evolution phase. The aim is to provide better services to the user in a secured fashion. In this paper we describe three different security level approaches namely Micro level security, Medium level security and Macro level security with special reference to Service Oriented Network Architecture (SONATE).","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130081485","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}
The emergence of Wireless Sensor Networks have become an evolving technology that has a wide range of potential applications to improve the quality of teaching and learning in an ubiquitous environment. WSNs act as the ultimate interface between the learners and the context enhancing the interactivity and improve the acquisition or collection of learner's contextual information in ubiquitous learning. This paper presents a model of ubiquitous learning environment system based on the concepts of ubiquitous computing technology that enables learning to take place anywhere at any time. The u-learning model is a web-based e-learning system that could enable learners to acquire knowledge and skills through interaction between them and the ubiquitous learning environment. The communication between devices and the embedded computers in the environment allows learners to learn in an environment of their interest while they are moving, hence, attaching them to their learning environment.
{"title":"U-Learning Community: An Interactive Social Learning Model Based on Wireless Sensor Networks","authors":"Ronnie D. Caytiles, Seung-Hwan Jeon, Tai-hoon Kim","doi":"10.1109/CICN.2011.165","DOIUrl":"https://doi.org/10.1109/CICN.2011.165","url":null,"abstract":"The emergence of Wireless Sensor Networks have become an evolving technology that has a wide range of potential applications to improve the quality of teaching and learning in an ubiquitous environment. WSNs act as the ultimate interface between the learners and the context enhancing the interactivity and improve the acquisition or collection of learner's contextual information in ubiquitous learning. This paper presents a model of ubiquitous learning environment system based on the concepts of ubiquitous computing technology that enables learning to take place anywhere at any time. The u-learning model is a web-based e-learning system that could enable learners to acquire knowledge and skills through interaction between them and the ubiquitous learning environment. The communication between devices and the embedded computers in the environment allows learners to learn in an environment of their interest while they are moving, hence, attaching them to their learning environment.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114196291","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}
In this paper the junction parameters of a double step discontinuity of dielectric rectangular wave guide have been obtained. The complex power in the direction of propagation due to both propagating and non-propagating modes has been find out using the modal expansion technique. The expressions for admittance and susceptance have been obtained and evaluated numerically. The results have been obtained for the dielectric constant of 9 using only the bound mode analysis and neglecting the continuous spectrum. The susceptance values have been depicted for different step ratios at the frequency of 89 Ghz and also for a frequency range of 80-100 Ghz for a fixed step height. Graphical representations of calculated results using modal expansions technique and the simulated results using FDTD have been provided which depict a good agreement between the two.
{"title":"Double Step Analysis of Dielectric Rectangular Waveguides Using Modal Expansions Technique","authors":"J. Sharma, A. De","doi":"10.1109/CICN.2011.63","DOIUrl":"https://doi.org/10.1109/CICN.2011.63","url":null,"abstract":"In this paper the junction parameters of a double step discontinuity of dielectric rectangular wave guide have been obtained. The complex power in the direction of propagation due to both propagating and non-propagating modes has been find out using the modal expansion technique. The expressions for admittance and susceptance have been obtained and evaluated numerically. The results have been obtained for the dielectric constant of 9 using only the bound mode analysis and neglecting the continuous spectrum. The susceptance values have been depicted for different step ratios at the frequency of 89 Ghz and also for a frequency range of 80-100 Ghz for a fixed step height. Graphical representations of calculated results using modal expansions technique and the simulated results using FDTD have been provided which depict a good agreement between the two.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114544592","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}
Traditional information retrieval systems lack consistent semantic description of information i.e. they fail to meet users' need due to lack of applying semantic identification to extract the information from the available information. Use of semantic equivalent of the user query will improve the efficiency of the search. In this paper, we propose a framework for semantic based information retrieval. Here we find the concepts that user specify in their query by analyzing the semantic equivalencies. The result which is a set of alternate queries to the main search query is then compared with the existing keyword based system's result. Then, according to the alternate queries' search results, the main queries result gets rearranged by assigning new weights. We further personalize the search and then re-rank the results on user preference. The proposed semantic retrieval model is combined with keyword based model to achieve completeness of the knowledge base. The model which we propose is helping to project the most relevant result URLs to the higher ranks.
{"title":"Alternate Query Construction Agent for Improving Web Search Result Using WordNet","authors":"K. Saravanakumar, K. Deepa","doi":"10.1109/CICN.2011.23","DOIUrl":"https://doi.org/10.1109/CICN.2011.23","url":null,"abstract":"Traditional information retrieval systems lack consistent semantic description of information i.e. they fail to meet users' need due to lack of applying semantic identification to extract the information from the available information. Use of semantic equivalent of the user query will improve the efficiency of the search. In this paper, we propose a framework for semantic based information retrieval. Here we find the concepts that user specify in their query by analyzing the semantic equivalencies. The result which is a set of alternate queries to the main search query is then compared with the existing keyword based system's result. Then, according to the alternate queries' search results, the main queries result gets rearranged by assigning new weights. We further personalize the search and then re-rank the results on user preference. The proposed semantic retrieval model is combined with keyword based model to achieve completeness of the knowledge base. The model which we propose is helping to project the most relevant result URLs to the higher ranks.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133030649","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}
today data behind building and hardware equipment are very important investment of enterprise and organization and play main role in it. Different enterprise and organization have different security requirements and in order to their requirement must be apply different control security. In order to data protection from integrity and security aspects, many authors have many tries. Information security management guide lines have extent scope and most of them are common and don't attention to enterprise or organization difference. Because of these reasons we need to information security management standards. In this paper ISOIEC 27000 series and ISOIEC 15408 describes and from scope and application aspect compared with together. The results can be provide better information security management.
{"title":"Information Security Management","authors":"Nasser Modiri, Yosef Masoudi Sobhanzadeh","doi":"10.1109/cicn.2011.100","DOIUrl":"https://doi.org/10.1109/cicn.2011.100","url":null,"abstract":"today data behind building and hardware equipment are very important investment of enterprise and organization and play main role in it. Different enterprise and organization have different security requirements and in order to their requirement must be apply different control security. In order to data protection from integrity and security aspects, many authors have many tries. Information security management guide lines have extent scope and most of them are common and don't attention to enterprise or organization difference. Because of these reasons we need to information security management standards. In this paper ISOIEC 27000 series and ISOIEC 15408 describes and from scope and application aspect compared with together. The results can be provide better information security management.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133144740","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}
This paper describes an analog-to-digital converter which combines multiple delta-sigma modulators in parallel so that time over sampling may be reduced or even eliminated. By doubling the number of Lth-order delta-sigma modulators, the resolution of this architecture is increased by approximately L bits. Thus, the resolution obtained by combining M delta- sigma modulators in parallel with no over sampling is similar to operating the same modulator with an over sampling rate of M. A parallel delta-sigma A/D converter implementation composed of two, four, and eight second-order delta-sigma modulators is described that does not require over sampling.
{"title":"Improved Delta Sigma Analog to Digital Converter","authors":"A. Katara, S. Ramteke, A. Bapat, Swapnil Jain","doi":"10.1109/CICN.2011.93","DOIUrl":"https://doi.org/10.1109/CICN.2011.93","url":null,"abstract":"This paper describes an analog-to-digital converter which combines multiple delta-sigma modulators in parallel so that time over sampling may be reduced or even eliminated. By doubling the number of Lth-order delta-sigma modulators, the resolution of this architecture is increased by approximately L bits. Thus, the resolution obtained by combining M delta- sigma modulators in parallel with no over sampling is similar to operating the same modulator with an over sampling rate of M. A parallel delta-sigma A/D converter implementation composed of two, four, and eight second-order delta-sigma modulators is described that does not require over sampling.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126989896","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}
Lane change is a vital maneuver which disturbs the traffic equilibrium and is a major cause of collision on the road. This process involves decision to change lanes followed by the actual lane change. The lane change trajectory is, thus, influenced by neighborhood traffic conditions and driver's behavior and perception. However, most of the existing lane change models do not consider the uncertainties and human behavior involved in lane change maneuver. In the present paper, neural network is used to predict the lane change trajectory to reflect these uncertainties and perceptions to represent lane changing behavior more realistically. The neural network is employed to perform short term and long range prediction of the Lane change trajectories of a vehicle. The network is first trained using past trajectory of the lane changing vehicles and other vehicles in its neighborhood. The trained network is then used for prediction. The comparison of simulated results with observed data indicates that neural network is able to learn the driver behavior more realistically than other standard modeling and is able to perform short term prediction with sufficient accuracy.
{"title":"Neural network based lane change trajectory predictions for collision prevention","authors":"R. S. Tomar, S. Verma, G. Tomar","doi":"10.1109/CICN.2011.120","DOIUrl":"https://doi.org/10.1109/CICN.2011.120","url":null,"abstract":"Lane change is a vital maneuver which disturbs the traffic equilibrium and is a major cause of collision on the road. This process involves decision to change lanes followed by the actual lane change. The lane change trajectory is, thus, influenced by neighborhood traffic conditions and driver's behavior and perception. However, most of the existing lane change models do not consider the uncertainties and human behavior involved in lane change maneuver. In the present paper, neural network is used to predict the lane change trajectory to reflect these uncertainties and perceptions to represent lane changing behavior more realistically. The neural network is employed to perform short term and long range prediction of the Lane change trajectories of a vehicle. The network is first trained using past trajectory of the lane changing vehicles and other vehicles in its neighborhood. The trained network is then used for prediction. The comparison of simulated results with observed data indicates that neural network is able to learn the driver behavior more realistically than other standard modeling and is able to perform short term prediction with sufficient accuracy.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"441 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116066830","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}
In dense traffic, a lane change maneuver is potentially dangerous and a driver's erroneous estimation of inter vehicle gaps may cause an accident. This signifies the necessity of forewarning the driver of the feasibility of lane change. This requires an early prediction of the trajectory of vehicles. A lane change has three distinct phases, planning phase, lane change phase and the adjustment phase. If the lane change intent of a driver is discovered in the first phase, he can be suitably advised. Else, the prediction of an impending collision through long range trajectory prediction would require a reactive approach. In this paper, we present support vector machine (SVM) based prediction of the trajectory of lane changing vehicle. SVM is used for both short range and long range trajectory prediction of the LC vehicle. A vehicle trajectory is modeled as a discrete time series. Sufficient number of values is taken to include planning, lane change and the adjustment phases of the time series in the prediction. The SVM based prediction is performed using actual Next Generation Simulation (NGSIM) field data. SVMs outperformed earlier algorithms and proved especially effective in early detection of driver lane changes on the road.
{"title":"SVM Based Trajectory Predictions of Lane Changing Vehicles","authors":"R. S. Tomar, S. Verma, G. Tomar","doi":"10.1109/CICN.2011.156","DOIUrl":"https://doi.org/10.1109/CICN.2011.156","url":null,"abstract":"In dense traffic, a lane change maneuver is potentially dangerous and a driver's erroneous estimation of inter vehicle gaps may cause an accident. This signifies the necessity of forewarning the driver of the feasibility of lane change. This requires an early prediction of the trajectory of vehicles. A lane change has three distinct phases, planning phase, lane change phase and the adjustment phase. If the lane change intent of a driver is discovered in the first phase, he can be suitably advised. Else, the prediction of an impending collision through long range trajectory prediction would require a reactive approach. In this paper, we present support vector machine (SVM) based prediction of the trajectory of lane changing vehicle. SVM is used for both short range and long range trajectory prediction of the LC vehicle. A vehicle trajectory is modeled as a discrete time series. Sufficient number of values is taken to include planning, lane change and the adjustment phases of the time series in the prediction. The SVM based prediction is performed using actual Next Generation Simulation (NGSIM) field data. SVMs outperformed earlier algorithms and proved especially effective in early detection of driver lane changes on the road.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122117162","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}
For several years, soft computing tools like Genetic Algorithm(GA), Simulated Annealing and recently Particle Swarm Optimization(PSO) have been the standard procedure for antenna optimization problems because analytical optimization becomes tough and does not provide satisfactory results. In recent times, Bacterial Foraging Optimization (BFO) has been introduced to electromagnetic community for design optimization of patch antennas. In this paper, the novel technique is applied in conjunction with the developed expressions to calculate the resonant frequency of circular microstrip antenna, with and without air gaps, of any dimension and any dielectric substrate. Various parameters of microstrip antenna of different geometry and structure can be calculated using the basic idea of paper as a generalized soft computing tool.
{"title":"Optimization of Resonant Frequency of Circular Microstrip Antenna with and without Air Gaps Using Bacterial Foraging Optimization Technique","authors":"Sandeep Sharma, B. Kanaujia","doi":"10.1109/CICN.2011.123","DOIUrl":"https://doi.org/10.1109/CICN.2011.123","url":null,"abstract":"For several years, soft computing tools like Genetic Algorithm(GA), Simulated Annealing and recently Particle Swarm Optimization(PSO) have been the standard procedure for antenna optimization problems because analytical optimization becomes tough and does not provide satisfactory results. In recent times, Bacterial Foraging Optimization (BFO) has been introduced to electromagnetic community for design optimization of patch antennas. In this paper, the novel technique is applied in conjunction with the developed expressions to calculate the resonant frequency of circular microstrip antenna, with and without air gaps, of any dimension and any dielectric substrate. Various parameters of microstrip antenna of different geometry and structure can be calculated using the basic idea of paper as a generalized soft computing tool.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123824118","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}
AODV is an on demand routing network protocol which is specially design for ad hoc networks. This protocol starts to establish the route, only when a certain node claims to send data and is an efficient adhoc network routing protocol for data transfer. AODV suffers from the limitation of low bandwidth. In the AODV routing protocol, wherever a link breaks an error message is sent to the source indicating the link failure and further communication is stopped temporarily. This paper proposes an improved AODV routing protocol by including route repair scheme to overcome the link failure problem s of its predecessor. In the proposed scheme the data packet is sent through alternate routes instead of dropping it. It is shown through simulation results that the proposed scheme is robust for data delivery.
{"title":"A Modified Approach for Route Maintenance Using Alternate Path in AODV","authors":"Rakesh Kumar, K. Arya","doi":"10.1109/CICN.2011.8","DOIUrl":"https://doi.org/10.1109/CICN.2011.8","url":null,"abstract":"AODV is an on demand routing network protocol which is specially design for ad hoc networks. This protocol starts to establish the route, only when a certain node claims to send data and is an efficient adhoc network routing protocol for data transfer. AODV suffers from the limitation of low bandwidth. In the AODV routing protocol, wherever a link breaks an error message is sent to the source indicating the link failure and further communication is stopped temporarily. This paper proposes an improved AODV routing protocol by including route repair scheme to overcome the link failure problem s of its predecessor. In the proposed scheme the data packet is sent through alternate routes instead of dropping it. It is shown through simulation results that the proposed scheme is robust for data delivery.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121974481","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
扫码关注我们
求助内容：
应助结果提醒方式：