Mobile Ad hoc Networks (MANETs) are open to a wide range of attacks due to their unique characteristics such as dynamic topology, open medium, absence of infrastructure, multi hop scenario and resource constraint. An ad hoc node in mobile ad hoc networks operates as not only end terminal but also as an intermediate router. In this way, multi-hop scenario occurs in MANETs. This multi hop scenario demands security against malicious behavior, because there may be one or more attackers in the route from source to destination. A routing protocol in MANETs is said to be securing that detects the detrimental effects of malicious node. Many security solutions for ad hoc routing have been proposed. But still many attacks are not addressable by these protocols. In this paper, we have proposed a protocol to secure the source routing in MANETs that allows both communicating parties as well as intermediate nodes to authenticate other nodes.
{"title":"Securing On-Demand Source Routing in MANETs","authors":"K. K. Chauhan, A. K. S. Sanger, V. S. Kushwah","doi":"10.1109/ICCNT.2010.29","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.29","url":null,"abstract":"Mobile Ad hoc Networks (MANETs) are open to a wide range of attacks due to their unique characteristics such as dynamic topology, open medium, absence of infrastructure, multi hop scenario and resource constraint. An ad hoc node in mobile ad hoc networks operates as not only end terminal but also as an intermediate router. In this way, multi-hop scenario occurs in MANETs. This multi hop scenario demands security against malicious behavior, because there may be one or more attackers in the route from source to destination. A routing protocol in MANETs is said to be securing that detects the detrimental effects of malicious node. Many security solutions for ad hoc routing have been proposed. But still many attacks are not addressable by these protocols. In this paper, we have proposed a protocol to secure the source routing in MANETs that allows both communicating parties as well as intermediate nodes to authenticate other nodes.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130241473","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}
Association rule mining has been an area of active research in the field of knowledge discovery and numerous algorithms have been developed to this end. Of late, data mining researchers have improved upon the quality of association rule mining for business development by incorporating the influential factors like value (utility), quantity of items sold (weight) and more, for the mining of association patterns. In this paper, we propose an efficient approach based on weight factor and utility for effectual mining of significant association rules. Initially, the proposed approach makes use of the traditional Apriori algorithm to generate a set of association rules from a database. The proposed approach exploits the anti-monotone property of the Apriori algorithm, which states that for a k-itemset to be frequent all (k-1) subsets of this itemset also have to be frequent. Subsequently, the set of association rules mined are subjected to weight age (W-gain) and utility (U-gain) constraints, and for every association rule mined, a combined Utility Weighted Score (UW-Score) is computed. Ultimately, we determine a subset of valuable association rules based on the UW-Score computed. The experimental results demonstrate the effectiveness of the proposed approach in generating high utility association rules that can be lucratively applied for business development.
{"title":"An Improvement in Apriori Algorithm Using Profit and Quantity","authors":"P. Sandhu, D. Dhaliwal, S. Panda, A. Bisht","doi":"10.1109/ICCNT.2010.46","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.46","url":null,"abstract":"Association rule mining has been an area of active research in the field of knowledge discovery and numerous algorithms have been developed to this end. Of late, data mining researchers have improved upon the quality of association rule mining for business development by incorporating the influential factors like value (utility), quantity of items sold (weight) and more, for the mining of association patterns. In this paper, we propose an efficient approach based on weight factor and utility for effectual mining of significant association rules. Initially, the proposed approach makes use of the traditional Apriori algorithm to generate a set of association rules from a database. The proposed approach exploits the anti-monotone property of the Apriori algorithm, which states that for a k-itemset to be frequent all (k-1) subsets of this itemset also have to be frequent. Subsequently, the set of association rules mined are subjected to weight age (W-gain) and utility (U-gain) constraints, and for every association rule mined, a combined Utility Weighted Score (UW-Score) is computed. Ultimately, we determine a subset of valuable association rules based on the UW-Score computed. The experimental results demonstrate the effectiveness of the proposed approach in generating high utility association rules that can be lucratively applied for business development.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134636672","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}
Book reviews are comments written by readers regarding their experiences about a particular book. Some reviews contain useful information and may help prospective buyers in making a purchase decision, while some are viewed as less helpful, such as, complaints about shipping delay. The review’s content is the key to differentiating them. Presenting a methodology for evaluating the helpfulness of a book view, this research employed the part-of-speech (POS) approach. A review’s content initially underwent a POS tagging process. Various features were then extracted and used as attributes for classification algorithms. The relation between adjectives and review’s helpfulness was also analyzed. The system’s effectiveness was assessed using textbook reviews obtained from an on-line bookstore.
{"title":"Part-of-Speech Approach to Evaluation of Textbook Reviews","authors":"P. Tanawongsuwan","doi":"10.1109/ICCNT.2010.31","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.31","url":null,"abstract":"Book reviews are comments written by readers regarding their experiences about a particular book. Some reviews contain useful information and may help prospective buyers in making a purchase decision, while some are viewed as less helpful, such as, complaints about shipping delay. The review’s content is the key to differentiating them. Presenting a methodology for evaluating the helpfulness of a book view, this research employed the part-of-speech (POS) approach. A review’s content initially underwent a POS tagging process. Various features were then extracted and used as attributes for classification algorithms. The relation between adjectives and review’s helpfulness was also analyzed. The system’s effectiveness was assessed using textbook reviews obtained from an on-line bookstore.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708209","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 presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.
{"title":"Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background Using OPNET Modeler","authors":"Sheela Ganesh Thorenoor","doi":"10.1109/ICCNT.2010.66","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.66","url":null,"abstract":"This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126680267","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}
A crucial aspect in the development of a fault management system is the selection of backup paths. The main issue in this selection is a tradeoff between the resource consumption and the minimization of failure recovery time, link failure, and packet loss. In this paper, a general QoS backup protection optimization policy applicable to a wide range of network situations and traffic types is proposed. A comparison between the proposed policy and the conventional protection backup methods is performed. The numerical results show a significant improvement of the QoS protection over conventional protection backup methods at variable protection parameters, network constraints and traffic types.
{"title":"Protection Optimization for MPLS Networks","authors":"R. Rizk, A. Elmaghraby, Mahmoud Mariee","doi":"10.1109/ICCNT.2010.94","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.94","url":null,"abstract":"A crucial aspect in the development of a fault management system is the selection of backup paths. The main issue in this selection is a tradeoff between the resource consumption and the minimization of failure recovery time, link failure, and packet loss. In this paper, a general QoS backup protection optimization policy applicable to a wide range of network situations and traffic types is proposed. A comparison between the proposed policy and the conventional protection backup methods is performed. The numerical results show a significant improvement of the QoS protection over conventional protection backup methods at variable protection parameters, network constraints and traffic types.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126824673","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}
Breast carcinoma is considered as the second major cause of death in females. Malignant tumor affects some tissues of breast and may spread over neighboring tissues. Early detection of this malignant mass is very important to save the precious lives. Although the death rate is reduced by application of modern tools yet research for optimal solutions is still in progress to bring more comprehensive mechanisms. In this paper, we are proposing an interspersed approach for breast tumor pigeonholing and vatic nation. We trained our neural network over datasets obtained from the University of Wisconsin Hospitals, Madison and tested over many other datasets with diverse network architectures. The proposed approach was sectioned in applications of data filters. Our network architecture showed 96% of malignant and 99.45% of benign diagnosis for training confusion matrix and 100% for malignant and 97% benign for cross validation matrix. We have given detailed experimentations in light of training and cross validation mean square errors and demonstrated results even for minute curve fluctuations.
{"title":"Breast Carcinoma Pigeonholing and Vaticination Using an Interspersed and Malleable Approach","authors":"H. Mathkour, Muneer Ahmad","doi":"10.1109/ICCNT.2010.96","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.96","url":null,"abstract":"Breast carcinoma is considered as the second major cause of death in females. Malignant tumor affects some tissues of breast and may spread over neighboring tissues. Early detection of this malignant mass is very important to save the precious lives. Although the death rate is reduced by application of modern tools yet research for optimal solutions is still in progress to bring more comprehensive mechanisms. In this paper, we are proposing an interspersed approach for breast tumor pigeonholing and vatic nation. We trained our neural network over datasets obtained from the University of Wisconsin Hospitals, Madison and tested over many other datasets with diverse network architectures. The proposed approach was sectioned in applications of data filters. Our network architecture showed 96% of malignant and 99.45% of benign diagnosis for training confusion matrix and 100% for malignant and 97% benign for cross validation matrix. We have given detailed experimentations in light of training and cross validation mean square errors and demonstrated results even for minute curve fluctuations.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116733422","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 growth in the number of mobile users is motivating the new technology of mobile computing to offer many new types of services like location-based services that pose many challenging problems for location-dependent query processing and data management. In this paper, we discuss the various challenges in distributed processing of location-dependent continuous queries in a mobile environment by studying the different scenarios in which both the querying unit and the object being queried are in motion. Then we proceed to classify different types of location dependent queries. We discuss the different solutions to solve these complex location dependent queries using caching techniques that facilitate fast access to data and at the same time minimize the massive network traffic generated due to location dependent query processing in a wireless environment. To further reduce the data transfer the query results are cached so that these results are reusable. The conventional query processing method like join processing of data from mobile units and server is directly applied in the mobile environment. Additionally this paper also focuses on the methods of location-dependent query processing and applications. The main goal of this paper is to study the various location dependent query processing methods along with data management problems involved in evaluation of Location-dependent queries and classify them.
{"title":"Location Dependent Query Processing – Issues, Challenges and Applications","authors":"Kahkashan Tabassum, Maniza Hijab, A. Damodaram","doi":"10.1109/ICCNT.2010.39","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.39","url":null,"abstract":"The growth in the number of mobile users is motivating the new technology of mobile computing to offer many new types of services like location-based services that pose many challenging problems for location-dependent query processing and data management. In this paper, we discuss the various challenges in distributed processing of location-dependent continuous queries in a mobile environment by studying the different scenarios in which both the querying unit and the object being queried are in motion. Then we proceed to classify different types of location dependent queries. We discuss the different solutions to solve these complex location dependent queries using caching techniques that facilitate fast access to data and at the same time minimize the massive network traffic generated due to location dependent query processing in a wireless environment. To further reduce the data transfer the query results are cached so that these results are reusable. The conventional query processing method like join processing of data from mobile units and server is directly applied in the mobile environment. Additionally this paper also focuses on the methods of location-dependent query processing and applications. The main goal of this paper is to study the various location dependent query processing methods along with data management problems involved in evaluation of Location-dependent queries and classify them.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114692562","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 multi-hop wireless mobile ad hoc network each node is capable of sending, receiving and forwarding data packets. Since it is an infrastructure-less networks, it makes it feasible to set up at anyplace and at any time. Supporting Quality of Service (QoS) in such network is a challenge due to limited available resources like bandwidth etc. This paper describes a new approach of Medium Access Control (MAC) which supports QoS for real time applications. Each node is assigned priorities dynamically based on their roles (as sender, receiver or forwarding node) and type of traffics (Real Time Packet – RTP or Non Real Time Packet - NRTP) in the networks. This approach enhances QoS for Real Time data in terms of bandwidth utilization and delay. This ensures higher network throughput with lower delay for packet delivery. New queue has been designed to fit in to the proposed MAC protocol. Simulation shows that our proposed MAC performs much better than the standard IEEE 802.11 DCF in terms of average throughput, delay, MAC overheads in support of RTP and fairness within a class of traffic also increases.
{"title":"Prioritized Quality of Service Support Medium Access Control for Real Time Flows","authors":"Jims Marchang, Sukumar Nandi, N. Sarma","doi":"10.1109/ICCNT.2010.69","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.69","url":null,"abstract":"In multi-hop wireless mobile ad hoc network each node is capable of sending, receiving and forwarding data packets. Since it is an infrastructure-less networks, it makes it feasible to set up at anyplace and at any time. Supporting Quality of Service (QoS) in such network is a challenge due to limited available resources like bandwidth etc. This paper describes a new approach of Medium Access Control (MAC) which supports QoS for real time applications. Each node is assigned priorities dynamically based on their roles (as sender, receiver or forwarding node) and type of traffics (Real Time Packet – RTP or Non Real Time Packet - NRTP) in the networks. This approach enhances QoS for Real Time data in terms of bandwidth utilization and delay. This ensures higher network throughput with lower delay for packet delivery. New queue has been designed to fit in to the proposed MAC protocol. Simulation shows that our proposed MAC performs much better than the standard IEEE 802.11 DCF in terms of average throughput, delay, MAC overheads in support of RTP and fairness within a class of traffic also increases.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114696030","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, a distributed fusion filtering problem for a linear discrete-time dynamic system with uncertainty is considered. All fusion filtering algorithms are based on fusion formulas which represent a weighted sum of the local Kalman estimates with matrix or scalar weights. The fusion weights are calculated by using four algorithms: convex combination, optimal fusion, covariance intersection, and median fusion. The comparison results of the fusion algorithms are discussed in terms of estimation accuracy and computation cost.
{"title":"Comparison of Distributed Fusion Filters for Linear Dynamic System with Uncertainty","authors":"J. Yoon, S. Bae, V. Shin","doi":"10.1109/ICCNT.2010.71","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.71","url":null,"abstract":"In this paper, a distributed fusion filtering problem for a linear discrete-time dynamic system with uncertainty is considered. All fusion filtering algorithms are based on fusion formulas which represent a weighted sum of the local Kalman estimates with matrix or scalar weights. The fusion weights are calculated by using four algorithms: convex combination, optimal fusion, covariance intersection, and median fusion. The comparison results of the fusion algorithms are discussed in terms of estimation accuracy and computation cost.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114890450","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}
With the technology of sensor, RFID, and GPS, many researches are recently being carried out on monitoring animal behavior and interactions with the environment. Plus, the technology is applicable to develop new zoological systems for animal trace ability, identification, and anti-theft. Yet, there is a lack of studies of providing zoos with intelligent animal tracking and management services based on RFID, GPS, and sensors. Accordingly, in this paper, we propose an intelligent animal situation tracking service for zoological gardens, based on GPS, RFID, and sensors. Firstly, we present a service scenario of animal situation tracking and introduce the tracking system configuration. The proposed system can provide real-time animal situation information such as the current location, bodily temperature, and pictures. Plus, it can track the animals based on the information even when they escape their cages. Next, we design and implement a prototype of the proposed animal situation tracking system.
{"title":"Animal Situation Tracking Service Using RFID, GPS, and Sensors","authors":"So-Hyeon Kim, Do-Hyeun Kim, Hee-Dong Park","doi":"10.1109/ICCNT.2010.40","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.40","url":null,"abstract":"With the technology of sensor, RFID, and GPS, many researches are recently being carried out on monitoring animal behavior and interactions with the environment. Plus, the technology is applicable to develop new zoological systems for animal trace ability, identification, and anti-theft. Yet, there is a lack of studies of providing zoos with intelligent animal tracking and management services based on RFID, GPS, and sensors. Accordingly, in this paper, we propose an intelligent animal situation tracking service for zoological gardens, based on GPS, RFID, and sensors. Firstly, we present a service scenario of animal situation tracking and introduce the tracking system configuration. The proposed system can provide real-time animal situation information such as the current location, bodily temperature, and pictures. Plus, it can track the animals based on the information even when they escape their cages. Next, we design and implement a prototype of the proposed animal situation tracking system.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128309959","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
扫码关注我们
求助内容：
应助结果提醒方式：