Biometrics recognition tool has great emphasis in both research and practical applications. With an increasing requirement on security, automated personal identification and verification based biometrics has been receiving extensive attention over the past decade. In this paper Performance Evaluation of Face Recognition based on DWT and DT-CWT using Multi-matching Classifiers (FRMC) is proposed. The face images captured from the persons differ in size and hence image dimensions are converted into 2n * 2n dimension, for DT-CWT. The two level DWT is applied on face images to generate four sub bands. The DT-CWT is applied on only LL sub band to generate DT-CWT coefficients, which forms features for face images. The features of database and test face are compared using Euclidian Distance, Random Forest and Support Vector Machine matching algorithms. It is observed that correct recognition rate, false acceptance rate and false reject rate are better in the case of proposed method as compared to existing techniques.
{"title":"Performance Evaluation of Face Recognition Based on DWT and DT-CWT Using Multi-matching Classifiers","authors":"R. K, K. Raja","doi":"10.1109/CICN.2011.130","DOIUrl":"https://doi.org/10.1109/CICN.2011.130","url":null,"abstract":"Biometrics recognition tool has great emphasis in both research and practical applications. With an increasing requirement on security, automated personal identification and verification based biometrics has been receiving extensive attention over the past decade. In this paper Performance Evaluation of Face Recognition based on DWT and DT-CWT using Multi-matching Classifiers (FRMC) is proposed. The face images captured from the persons differ in size and hence image dimensions are converted into 2n * 2n dimension, for DT-CWT. The two level DWT is applied on face images to generate four sub bands. The DT-CWT is applied on only LL sub band to generate DT-CWT coefficients, which forms features for face images. The features of database and test face are compared using Euclidian Distance, Random Forest and Support Vector Machine matching algorithms. It is observed that correct recognition rate, false acceptance rate and false reject rate are better in the case of proposed method as compared to existing techniques.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"7 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":"124609317","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 secure ad hoc network authorized nodes access the network based on network initialization, authentication and secure communication. Authentication forms the core in security, where nodes exchange data based on key management. Trusted Third Party (TPP) or Certificate Authority (CA) function as trust infrastructure and enable the nodes to access or leave the network. The main feature of security protocols is key management, which includes key distribution and key update. This article gives analysis of various key management and symmetric key distribution techniques in wireless ad hoc network. Master key, pair wise key and random key pre-distribution techniques are used in key management. Analytical methods confirm that for a less dense network master key is used and for a large dense network random key is used. In order to minimize the key management complexity in security protocols, symmetric key distribution is used. Key distribution techniques are classified based node attributes as local area, wide area and threshold area conditions. Analysis of various key distribution method concludes that (i) if keys are compromised in a local area, self-healing key management technique is used (ii) if keys are compromised in wide area, distributed Diffie Hellman is used and (iii) if keys are compromised in threshold area conditions, then subset of m keys are distributed in m different locations.
{"title":"Symmetric key management and distribution techniques in wireless ad hoc networks","authors":"M. Krishna, M. Doja","doi":"10.1109/CICN.2011.158","DOIUrl":"https://doi.org/10.1109/CICN.2011.158","url":null,"abstract":"In secure ad hoc network authorized nodes access the network based on network initialization, authentication and secure communication. Authentication forms the core in security, where nodes exchange data based on key management. Trusted Third Party (TPP) or Certificate Authority (CA) function as trust infrastructure and enable the nodes to access or leave the network. The main feature of security protocols is key management, which includes key distribution and key update. This article gives analysis of various key management and symmetric key distribution techniques in wireless ad hoc network. Master key, pair wise key and random key pre-distribution techniques are used in key management. Analytical methods confirm that for a less dense network master key is used and for a large dense network random key is used. In order to minimize the key management complexity in security protocols, symmetric key distribution is used. Key distribution techniques are classified based node attributes as local area, wide area and threshold area conditions. Analysis of various key distribution method concludes that (i) if keys are compromised in a local area, self-healing key management technique is used (ii) if keys are compromised in wide area, distributed Diffie Hellman is used and (iii) if keys are compromised in threshold area conditions, then subset of m keys are distributed in m different locations.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"4 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":"122008223","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}
As we know in Mobile Ad hoc network our Nodes are highly mobile. They move around the Network. Due to this network topology and number of neighboring nodes in each node frequently change. Movement of nodes from one to another network also affect to the communication between them. To connect the wired and wireless networks particularly the Mobile ad hoc Network is very interesting in real world situations due to its popularity and usefulness. As in our paper we given and explained a approach in which cluster head and gateway will be same and that node is known as cluster head gateway (CHG), in which all the responsibilities of cluster head and gateway will be perform by the CHG and we introduces the prediction table concepts and discusses a mechanism for selecting an alternate route in case if the CHG is unable to forward the packets to the destination, This approach providing Bi-directional connectivity between MANET and wired Nodes. In this paper we are extending the network coverage and the performance measured with other large N/w's. Finally, this paper conducts simulation experiments in the conditions where we connecting MANET nodes to the wired nodes using different networks.
{"title":"Enhancing the MANET Nodes of Hierarchical Architecture for Communication between Mobile Ad Hoc Network and Internet Using Cluster Head Gateway","authors":"A. Bagwari, R. Jee","doi":"10.1109/CICN.2011.71","DOIUrl":"https://doi.org/10.1109/CICN.2011.71","url":null,"abstract":"As we know in Mobile Ad hoc network our Nodes are highly mobile. They move around the Network. Due to this network topology and number of neighboring nodes in each node frequently change. Movement of nodes from one to another network also affect to the communication between them. To connect the wired and wireless networks particularly the Mobile ad hoc Network is very interesting in real world situations due to its popularity and usefulness. As in our paper we given and explained a approach in which cluster head and gateway will be same and that node is known as cluster head gateway (CHG), in which all the responsibilities of cluster head and gateway will be perform by the CHG and we introduces the prediction table concepts and discusses a mechanism for selecting an alternate route in case if the CHG is unable to forward the packets to the destination, This approach providing Bi-directional connectivity between MANET and wired Nodes. In this paper we are extending the network coverage and the performance measured with other large N/w's. Finally, this paper conducts simulation experiments in the conditions where we connecting MANET nodes to the wired nodes using different networks.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"19 15-16 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":"123568461","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 distributed systems it is often necessary to provide coordination among the multiple concurrent processes to tolerate the contention, periods of asynchrony and a number of failures. Quorum systems provide a decentralized approach for such coordination. In this paper, we propose a replica control protocol by using a Generalized-grid quorum consensus, which is the generalization of a Read-one-write-all (ROWA), Grid quorum consensus, D-Space quorum consensus and Multi-dimensional-grid quorum consensus protocols. This protocol provides a very high read availability and read capacity while maintaining the reconfigurable levels of write availability and fault tolerance.
{"title":"Generalized Grid Quorum Consensus for Replica Control Protocol","authors":"Vinit Kumar, A. Agarwal","doi":"10.1109/CICN.2011.83","DOIUrl":"https://doi.org/10.1109/CICN.2011.83","url":null,"abstract":"In distributed systems it is often necessary to provide coordination among the multiple concurrent processes to tolerate the contention, periods of asynchrony and a number of failures. Quorum systems provide a decentralized approach for such coordination. In this paper, we propose a replica control protocol by using a Generalized-grid quorum consensus, which is the generalization of a Read-one-write-all (ROWA), Grid quorum consensus, D-Space quorum consensus and Multi-dimensional-grid quorum consensus protocols. This protocol provides a very high read availability and read capacity while maintaining the reconfigurable levels of write availability and fault tolerance.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"19 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":"126819161","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 dual wideband microstrip antenna which is designed using stacking configuration to give a better bandwidth as compared to single layer substrate design. The designed slotted stacked patch antenna can operate in the Wimax, (2.2-3.4 GHz) WLAN (2.40--2.48GHz), and UMTS II (2.50--2.69GHz) frequency band giving a maximum bandwidth of 37.95%. The air is used as a dielectric between the two stacks and a height of 10 mm is kept between the two stacks. The feeding technique used in the design is the coaxial probe feed and the impedance matching and radiation characteristics of the structure are investigated using MOM based IE3D. The simulation result shows that the proposed antenna can offer excellent performance for Wi Max and WLAN application.
本文提出了一种双宽带微带天线，该天线采用叠加结构设计，与单层衬底设计相比，具有更好的带宽。所设计的开槽堆叠贴片天线可以在Wimax (2.2-3.4 GHz)、WLAN (2.40- 2.48GHz)和UMTS II (2.50- 2.69GHz)频段工作，最大带宽为37.95%。空气用作两层之间的电介质，两层之间保持10mm的高度。设计中采用的馈电技术为同轴探头馈电，并利用基于MOM的IE3D对结构的阻抗匹配和辐射特性进行了研究。仿真结果表明，该天线在Wi - Max和WLAN应用中具有良好的性能。
{"title":"Dual Wideband Stacked Patch Antenna for WiMax and WLAN Applications","authors":"V. Singh, Z. Ali, Ashutosh Kumar Singh","doi":"10.1109/CICN.2011.66","DOIUrl":"https://doi.org/10.1109/CICN.2011.66","url":null,"abstract":"This paper presents dual wideband microstrip antenna which is designed using stacking configuration to give a better bandwidth as compared to single layer substrate design. The designed slotted stacked patch antenna can operate in the Wimax, (2.2-3.4 GHz) WLAN (2.40--2.48GHz), and UMTS II (2.50--2.69GHz) frequency band giving a maximum bandwidth of 37.95%. The air is used as a dielectric between the two stacks and a height of 10 mm is kept between the two stacks. The feeding technique used in the design is the coaxial probe feed and the impedance matching and radiation characteristics of the structure are investigated using MOM based IE3D. The simulation result shows that the proposed antenna can offer excellent performance for Wi Max and WLAN application.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"91 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":"126843400","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 an algorithm to generate a long pseudorandom binary key using a binary file downloaded from the Internet as seed or input. This file can be of any type i.e. video, audio, text, image etc. The output is a long pseudorandom binary key. The generated key can be used to encrypt any type of data file using a stream cipher encryption algorithm. The key files obtained from the algorithm implementation are successfully tested by the well known NIST and ENT test suites for statistical validation.
{"title":"Pseudorandom Binary Key Generation from Binary Files","authors":"R. Nallanthighal, V. Rani","doi":"10.1109/CICN.2011.137","DOIUrl":"https://doi.org/10.1109/CICN.2011.137","url":null,"abstract":"This paper presents an algorithm to generate a long pseudorandom binary key using a binary file downloaded from the Internet as seed or input. This file can be of any type i.e. video, audio, text, image etc. The output is a long pseudorandom binary key. The generated key can be used to encrypt any type of data file using a stream cipher encryption algorithm. The key files obtained from the algorithm implementation are successfully tested by the well known NIST and ENT test suites for statistical validation.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"66 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":"127312565","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}
Nowadays, health care is one of the most important subjects in our life. Increasing level of patients demand across the world obliges health care services in a more flexible and uniform manner. So that patients can get useful health services in the home environment without going to the health center personally. The e-healthcare is new kinds of health care system and it is very popular at this time. Where patients can exchange their confidential information via internet to the organization and from the organization get the services via internet also. So lots of time will be saved and patient can get services efficiently without unnecessary harassments of travel to the organization. In this system all the transaction of data are processed by Patient Agents (PA), Doctor Agents (DA) and Controller Agent (CA). The user uses the Patient Agent (PA) to connect with the controlling server of the e-health care system. The Controller Agent (CA) is control the demand of the patients as well as activity of the doctors. When the doctor wants to check-up the patient then he/she connects with the Doctor Agent (DA). Using the Doctor Agent (DA), every doctor prescribed some medicine to the patient about the query and if required then refer the patient to another doctor. The Agent computing in a network of workstations is powerful paradigm for building distributed applications. The agent technology is used to enhance the patient's needs which include availability, speedy response time, and efficiency. Agent for e-Health care creates connectivity on an anytime-anywhere-any-device-basis to provide the specific service from the doctor required by the patients.
{"title":"A Small e-Health Care Information System with Agent Technology","authors":"R. Subalakshmi, Arijit Das, N. Iyengar","doi":"10.1109/CICN.2011.14","DOIUrl":"https://doi.org/10.1109/CICN.2011.14","url":null,"abstract":"Nowadays, health care is one of the most important subjects in our life. Increasing level of patients demand across the world obliges health care services in a more flexible and uniform manner. So that patients can get useful health services in the home environment without going to the health center personally. The e-healthcare is new kinds of health care system and it is very popular at this time. Where patients can exchange their confidential information via internet to the organization and from the organization get the services via internet also. So lots of time will be saved and patient can get services efficiently without unnecessary harassments of travel to the organization. In this system all the transaction of data are processed by Patient Agents (PA), Doctor Agents (DA) and Controller Agent (CA). The user uses the Patient Agent (PA) to connect with the controlling server of the e-health care system. The Controller Agent (CA) is control the demand of the patients as well as activity of the doctors. When the doctor wants to check-up the patient then he/she connects with the Doctor Agent (DA). Using the Doctor Agent (DA), every doctor prescribed some medicine to the patient about the query and if required then refer the patient to another doctor. The Agent computing in a network of workstations is powerful paradigm for building distributed applications. The agent technology is used to enhance the patient's needs which include availability, speedy response time, and efficiency. Agent for e-Health care creates connectivity on an anytime-anywhere-any-device-basis to provide the specific service from the doctor required by the patients.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"60 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":"133389037","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}
Wireless medium is more prone to security breaches than wired medium. The issue of security becomes critical in Mobile ad-hoc networks (MANets), due to the mobility of nodes. Node mobility causes frequent change in the radio transmission range thus changing the group membership. Members in a group communicate using the group key. Each time the group change, a new group key is to be computed in a secured manner providing backward and forward secrecy. This paper presents a secured and trusted routing algorithm MPG-STAR. The new group key is computed securely for trustworthy nodes of MPG routing protocol based on the ring based co-operation in Group Diffie-Hellman key exchange to avoid malicious or selfish nodes.
{"title":"MPG-STAR: Mobile Process Groups Based Secured and Trusted Routing for MANets","authors":"A. Aakanksha, Punam Bedi","doi":"10.1109/CICN.2011.118","DOIUrl":"https://doi.org/10.1109/CICN.2011.118","url":null,"abstract":"Wireless medium is more prone to security breaches than wired medium. The issue of security becomes critical in Mobile ad-hoc networks (MANets), due to the mobility of nodes. Node mobility causes frequent change in the radio transmission range thus changing the group membership. Members in a group communicate using the group key. Each time the group change, a new group key is to be computed in a secured manner providing backward and forward secrecy. This paper presents a secured and trusted routing algorithm MPG-STAR. The new group key is computed securely for trustworthy nodes of MPG routing protocol based on the ring based co-operation in Group Diffie-Hellman key exchange to avoid malicious or selfish nodes.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"69 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":"123943068","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}
S. Binzaid, I. Chowdhury, Md. Shoaibur Rahman, S. M. S. Islam
Semiconductor integration has improved over the years by increasing device switching speed and device density, causing increased power consumption and dissipation, therefore, the issues has been considered and improved here. Previously designed VLSI mirror-amplifier had power dissipation of 8.41 mill watts in CMOS 0.5µm process. Latter the technique was re-applied in this work to completed characterization of each pin signal functions with biasing steps to determine accuracy at the low power response of the IC in order to improve the total power consumption. Signal pin orientation in the simulation and choosing the correct biasing point in two steps proved to be correct procedure to improve. Supply voltage was considered as 3V for the MOSIS process technology. Latest MAGIC layout CAD tools were used for design, and PSPICE was used for simulation and electrical characterization with the help of MAGIC layout extraction tool. Keeping the process and scaling unchanged at 0.5µm as the previous design, the new VLSI design yielded the power dissipation of 4.39 nanowatts in 2nd step by reducing the dynamic loss. The electrical characterizations also confirmed that the chip precisely senses ultra-high-Z signals at inputs for this application. Multi-die chip placement is done for fabrication and also made the final product less expensive by the in-house custom designed pad-frame. This paper presents details of the key research works, results, completed chip layout and applications of the chip.
{"title":"Nano-Power Sensor Applications in VLSI Multi-die Tiny Chip","authors":"S. Binzaid, I. Chowdhury, Md. Shoaibur Rahman, S. M. S. Islam","doi":"10.1109/CICN.2011.119","DOIUrl":"https://doi.org/10.1109/CICN.2011.119","url":null,"abstract":"Semiconductor integration has improved over the years by increasing device switching speed and device density, causing increased power consumption and dissipation, therefore, the issues has been considered and improved here. Previously designed VLSI mirror-amplifier had power dissipation of 8.41 mill watts in CMOS 0.5µm process. Latter the technique was re-applied in this work to completed characterization of each pin signal functions with biasing steps to determine accuracy at the low power response of the IC in order to improve the total power consumption. Signal pin orientation in the simulation and choosing the correct biasing point in two steps proved to be correct procedure to improve. Supply voltage was considered as 3V for the MOSIS process technology. Latest MAGIC layout CAD tools were used for design, and PSPICE was used for simulation and electrical characterization with the help of MAGIC layout extraction tool. Keeping the process and scaling unchanged at 0.5µm as the previous design, the new VLSI design yielded the power dissipation of 4.39 nanowatts in 2nd step by reducing the dynamic loss. The electrical characterizations also confirmed that the chip precisely senses ultra-high-Z signals at inputs for this application. Multi-die chip placement is done for fabrication and also made the final product less expensive by the in-house custom designed pad-frame. This paper presents details of the key research works, results, completed chip layout and applications of the chip.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"199 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":"124470526","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 mobile ad-hoc network (MANET) can be described as a mobile wireless network, consisting of a collection of communication nodes, which have to interact among themselves without the use of any centralized authority or fixed infrastructure. There are several technical challenges regarding deployment of a MANET, such as network scalability, communication stability, energy consumption, security and quality of services (QoS). Due to vulnerability of wireless links, nodes unstable infrastructure support and highly dynamic network states, MANET security becomes an essential design dimension. initially while designing MANET routing protocols security aspects were not considered, so routing protocols are vulnerable to various types of security attacks such as rushing attack, black hole attack, replay attack, jellyfish attack, wormhole attack, spoofing attack etc. In this paper we have discussed wormhole attack. In this paper, through simulation the effects of wormhole attack on Ad-hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) protocols have been analyzed and compared.
{"title":"Performance Evaluation and Comparison of AODV and DSR Under Adversarial Environment","authors":"Richa Agrawal, R. Tripathi, S. Tiwari","doi":"10.1109/CICN.2011.129","DOIUrl":"https://doi.org/10.1109/CICN.2011.129","url":null,"abstract":"A mobile ad-hoc network (MANET) can be described as a mobile wireless network, consisting of a collection of communication nodes, which have to interact among themselves without the use of any centralized authority or fixed infrastructure. There are several technical challenges regarding deployment of a MANET, such as network scalability, communication stability, energy consumption, security and quality of services (QoS). Due to vulnerability of wireless links, nodes unstable infrastructure support and highly dynamic network states, MANET security becomes an essential design dimension. initially while designing MANET routing protocols security aspects were not considered, so routing protocols are vulnerable to various types of security attacks such as rushing attack, black hole attack, replay attack, jellyfish attack, wormhole attack, spoofing attack etc. In this paper we have discussed wormhole attack. In this paper, through simulation the effects of wormhole attack on Ad-hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) protocols have been analyzed and compared.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"46 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":"116885790","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
扫码关注我们
求助内容：
应助结果提醒方式：