{"title":"Light weight approach for IP-ARP spoofing detection and prevention","authors":"S. Bhirud, V. Katkar","doi":"10.1109/AHICI.2011.6113951","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113951","url":null,"abstract":"Heavily used intra-domain protocols (like IP, ARP) do not have protection mechanism against malicious activities by network clients. As a result IP and ARP spoofing are used by attackers to launch Man In The Middle (MITM), Denial of Service (DoS) and other attacks. These attacks are severe threats to the organizations. Detecting and preventing IP-ARP spoofing will enhance the security to great extent. This paper presents a simple and light-weight mechanism for detection and prevention of IP-ARP spoofing attacks. Experimental results are also provided to support the proposal.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121220600","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":"Design and implementation of sustainable educational network using knowledge management in Nepal","authors":"Kumar Pudashine, Vishnu Kumar Rana","doi":"10.1109/AHICI.2011.6113944","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113944","url":null,"abstract":"Educational network interconnects various academic and research institutions. It provides a platform for knowledge sharing between different institutions. It can be implemented via National Regional Educational Network. For the sustainability of any educational network, active stakeholders play a vital role. These stakeholders could be considered as the major contributors of a knowledge base. The main aim of this research paper is to provide a model of various knowledge base through the inclusion of active stakeholders for the sustainability of educational network in Nepal. The implementation of knowledge base is done through the three models. The first model provides implementation in an academic institution. The second approach provides implementation in NREN. The third model referred as hybrid provides implementation of Knowledge base in both academic institutions and NREN. It is expected that this research will enhance the performance of existing NREN. Finally this research will help to minimize the digital divide of Nepal.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128966518","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}
Divya Sambasivan, Nikita John, Shruthi Udayakumar, Rajat Gupta
{"title":"Generic framework for mobile application development","authors":"Divya Sambasivan, Nikita John, Shruthi Udayakumar, Rajat Gupta","doi":"10.1109/AHICI.2011.6113938","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113938","url":null,"abstract":"With the paradigm shift of applications from desktop to hand held devices, the number of mobile operating systems or platforms emerging, is enormous. Since each platform has its own architecture and interfaces, developing applications for multiple platforms is a tedious and daunting task for any mobile application developer. A framework for developing cross platform applications has become the need of the hour. This paper presents one such framework that enables the development of applications that can run on Android, BlackBerry and iOS platforms. The framework enables the developer to implement his logic in a single language. It takes care of redirecting the calls to the respective native APIs. The paper describes the features and functionality of the framework. The framework has been developed and is currently being used to build cross platform applications.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115950271","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 advanced segmentation using bit-plane slicing technique in extraction of lungs region","authors":"T. Kiran, G. Kwon","doi":"10.1109/AHICI.2011.6113949","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113949","url":null,"abstract":"This paper presents the new method for the segmentation of pulmonary parenchyma. The proposed method is based on the bit-plane slicing technique. The original image is binarized using the bit-plane technique and among the different images the best binarized image is chosen. After the image is binarized, the labeling is done and the area of each label is calculated from which we obtained the next level of binarized image. Then the boundary tracing algorithm is applied to get the binarized image. The following steps show the automatic extraction of lungs area and experimental results has proved it's significant.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127993898","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":"Provisioning secure on-demand routing protocol in mobile ad hoc network","authors":"B. Vaidya, D. Makrakis, H. Mouftah","doi":"10.1109/AHICI.2011.6113952","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113952","url":null,"abstract":"Mobile ad-hoc network (MANET) has been a leading technology for ubiquitous networking since a decade, in which an ad-hoc routing is one of its fundamental components. Due to a number of inevitable challenges in MANETs, especially a problem of secure routing is long-standing, many researchers have extensively studied and developed various techniques to secure on-demand routing protocols in MANETs. However, many open issues remain in secure on-demand routing for MANETs. In this paper, we propose a lightweight and efficient security mechanism for on-demand source routing protocol including DSR in MANETs. The proposed scheme provides key generation by using a self-certified public keying technique as well as ensures secure route discovery by employing Schnorr digital signature and multi-signatures scheme. We provide security analysis of the proposed scheme. It can be seen that the proposed approach is more secure than the existing schemes. We also evaluated the proposed approach using computer simulation and compared its performance to that of SRP. The results show that the proposed mechanism is better than SRP.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129650441","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 single spatial 2D phase filter for channel demultiplexing in mode diversity multiplexing","authors":"G. Stepniak","doi":"10.1109/AHICI.2011.6113933","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113933","url":null,"abstract":"A single spatial phase filter that discriminates multiple channels at the output of mode division multiplexing system is shown. Excellently low crosstalk performance is reported for 4 × 4 and 8 × 8 systems.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121557067","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":"Optimal and suboptimal relay selection and power allocation in multi-relay cooperative network","authors":"Umesh Phuyal, S. C. Jha, V. Bhargava","doi":"10.1109/AHICI.2011.6113937","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113937","url":null,"abstract":"We study a cooperative communication scenario where multiple amplify-and-forward relays cooperate to transmit data from a source to destination. We discuss an optimal power allocation method to assign transmit powers to the source and relays in order to maximize achievable data rate of the system.We also propose less-complex suboptimal power allocation methods using various relay selection strategies. We provide simulation results to demonstrate performance of the optimal power allocation and suboptimal relay selection and power allocation schemes. We show that these suboptimal schemes perform close to optimal scheme and are more reasonable for practical implementation.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121990166","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":"The ideal search","authors":"Thapa Parmeshwor","doi":"10.1109/AHICI.2011.6113943","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113943","url":null,"abstract":"There are various types of search techniques developed so far for searching the numbers, searching strings and others. Searching in large database containing huge collection of data is done (in most of the cases) using numerical indexes. Though there are many efficient search methods available still they are not ideal. The ideal search is the one that performs search in constant time, i.e. O(1). Till now this case is considered impossible but still we can achieve a performance very close to it using hash table. But this “The Ideal Search” can search any integer number among billions of numbers at constant O(1) time.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126818981","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}
Ankush Agarwal, Geethu Babu, L. Rishi, K. Shruthi, Vinu Agarwal
{"title":"RFID management for tracking and inventory","authors":"Ankush Agarwal, Geethu Babu, L. Rishi, K. Shruthi, Vinu Agarwal","doi":"10.1109/AHICI.2011.6113935","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113935","url":null,"abstract":"RFID (Radio Frequency Identification Technology) is a field of computerizing recognition process that is progressively gaining thrust in recent years and is now being seen as a means of enhancing data handling procedures, complimentary in many ways to other data capture technologies such as bar coding. A variety of devices and associated systems have been developed to satisfy a broad series of applications. Regardless of the diversity of applications, the ideologies upon which they are based are quite understated, even though the technology and technicalities associated with their function can be quite innovative.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126963238","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":"Real - time download prediction based on the k - nearest neighbor method","authors":"Akshata Patil, Sanchita Jha","doi":"10.1109/AHICI.2011.6113929","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113929","url":null,"abstract":"The amount of download prediction or forecast is a statement about the way things will happen in the future, often but not always based on experience or knowledge. While there is much overlap between prediction and forecast, a prediction may be a statement that some outcome is expected, while a forecast may cover a range of possible outcomes. Although guaranteed information about the information is in many cases impossible, prediction is necessary to allow plans to be made about possible developments; Howard H. Stevenson writes that prediction in business “… is at least two things: Important and hard”. In this paper a method is proposed to predict the amount of download in real-time using the k - Nearest neighbor algorithm., the k-nearest neighbor algorithm (k-NN) is a method for classifying objects based on closest training examples in the feature space. k-NN is a type of instance-based learning, or lazy learning where the function is only approximated locally and all computation is deferred until classification.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134451410","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}