Authentication is the first line of defense against compromising confidentiality and integrity. Though traditional login/password based schemes are easy to implement, they have been subjected to several attacks. As an alternative, token and biometric based authentication systems were introduced. However, they have not improved substantially to justify the investment. Thus, a variation to the login/password scheme, viz. graphical scheme was introduced. But it also suffered due to shoulder-surfing and screen dump attacks. In this paper, we introduce a framework of our proposed (IPAS) Implicit Password Authentication System, which is immune to the common attacks suffered by other authentication schemes.
{"title":"IPAS: Implicit Password Authentication System","authors":"Sadiq Almuairfi, P. Veeraraghavan, N. Chilamkurti","doi":"10.1109/WAINA.2011.36","DOIUrl":"https://doi.org/10.1109/WAINA.2011.36","url":null,"abstract":"Authentication is the first line of defense against compromising confidentiality and integrity. Though traditional login/password based schemes are easy to implement, they have been subjected to several attacks. As an alternative, token and biometric based authentication systems were introduced. However, they have not improved substantially to justify the investment. Thus, a variation to the login/password scheme, viz. graphical scheme was introduced. But it also suffered due to shoulder-surfing and screen dump attacks. In this paper, we introduce a framework of our proposed (IPAS) Implicit Password Authentication System, which is immune to the common attacks suffered by other authentication schemes.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121767329","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 recent years, many accounting scandals have been reported in companies not only in the United States, but also in Japan. The need for internal control is growing steadily. In particular, auditing logs are important for internal control, since internal control without audit evidence is incomplete. Moreover, logs are necessary not only as a defense mechanism, but also since they contain much information that can lead to improvements in the company. Consequently, the correct use of logs can be beneficial to a company. However, the cost of an information system is dependent on the amount of data, which in the case of log data can be very large. There are many different kinds of logs and storing them long term is necessary to realize an internal control system based on logs. Previously, we proposed a low cost system to store logs semi-permanently using a Virtual Large Scale Disk. However, this method has problems with cross-sectional searches of different formats and its overall effectiveness. Therefore, we proposed a log that can cope with changing schema on demand by integrating several kinds of logs into YAML format. We also proposed a log format able to search across several kinds of logs by consolidating the log format and combining the logs into a single file. However, this proposal is not usable in practice, instead an integrated log is needed. Thus, in this paper, we implement a method that ensures consistency when a log is converted into YAML format from a raw log and vice versa and a command to search the integrated log. We also present an evaluation of the proposed method.
{"title":"Improvement and Evaluation of a Method to Manage Multiple Types of Logs","authors":"Akihiro Tomono, M. Uehara, Y. Shimada","doi":"10.1109/WAINA.2011.51","DOIUrl":"https://doi.org/10.1109/WAINA.2011.51","url":null,"abstract":"In recent years, many accounting scandals have been reported in companies not only in the United States, but also in Japan. The need for internal control is growing steadily. In particular, auditing logs are important for internal control, since internal control without audit evidence is incomplete. Moreover, logs are necessary not only as a defense mechanism, but also since they contain much information that can lead to improvements in the company. Consequently, the correct use of logs can be beneficial to a company. However, the cost of an information system is dependent on the amount of data, which in the case of log data can be very large. There are many different kinds of logs and storing them long term is necessary to realize an internal control system based on logs. Previously, we proposed a low cost system to store logs semi-permanently using a Virtual Large Scale Disk. However, this method has problems with cross-sectional searches of different formats and its overall effectiveness. Therefore, we proposed a log that can cope with changing schema on demand by integrating several kinds of logs into YAML format. We also proposed a log format able to search across several kinds of logs by consolidating the log format and combining the logs into a single file. However, this proposal is not usable in practice, instead an integrated log is needed. Thus, in this paper, we implement a method that ensures consistency when a log is converted into YAML format from a raw log and vice versa and a command to search the integrated log. We also present an evaluation of the proposed method.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125569122","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}
Cognitive Radio (CR) is a next-generation wireless communication system that exploits underutilized licensed spectrum to optimize the utilization of the overall radio spectrum. A Distributed Cognitive Radio Network (DCRN) is a distributed wireless network established by a number of CR hosts in the absence of fixed network infrastructure. Context awareness and intelligence are key characteristics of CR networks that enable the CR hosts to be aware of their operating environment in order to make an optimal joint action. This research aims to achieve context awareness and intelligence in DCRN using our novel Locally-Confined Payoff Propagation (LCPP), which is an important feature in Multi-Agent Reinforcement Learning (MARL). The LCPP mechanism is suitable to be applied in most applications in DCRN that require context awareness and intelligence such as scheduling, congestion control, as well as Dynamic Channel Selection (DCS), which is the focus of this paper. Simulation results show that the LCPP mechanism is a promising approach. The LCPP mechanism converges to an optimal joint action including networks with cyclic topology. Fast convergence is possible. The investigation in this paper serve as an important foundation for future work in this research field.
{"title":"Achieving Context Awareness and Intelligence in Distributed Cognitive Radio Networks: A Payoff Propagation Approach","authors":"K. Yau, P. Komisarczuk, Paul D. Teal","doi":"10.1109/WAINA.2011.47","DOIUrl":"https://doi.org/10.1109/WAINA.2011.47","url":null,"abstract":"Cognitive Radio (CR) is a next-generation wireless communication system that exploits underutilized licensed spectrum to optimize the utilization of the overall radio spectrum. A Distributed Cognitive Radio Network (DCRN) is a distributed wireless network established by a number of CR hosts in the absence of fixed network infrastructure. Context awareness and intelligence are key characteristics of CR networks that enable the CR hosts to be aware of their operating environment in order to make an optimal joint action. This research aims to achieve context awareness and intelligence in DCRN using our novel Locally-Confined Payoff Propagation (LCPP), which is an important feature in Multi-Agent Reinforcement Learning (MARL). The LCPP mechanism is suitable to be applied in most applications in DCRN that require context awareness and intelligence such as scheduling, congestion control, as well as Dynamic Channel Selection (DCS), which is the focus of this paper. Simulation results show that the LCPP mechanism is a promising approach. The LCPP mechanism converges to an optimal joint action including networks with cyclic topology. Fast convergence is possible. The investigation in this paper serve as an important foundation for future work in this research field.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131490404","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}
Shin Maruyama, M. Kozuka, Y. Okabe, Motonori Nakamura
SCTP is a reliable transport protocol that supports redundant paths by multiaddressing. Dynamic reconfiguration of IP addresses of an existing association is also supported by an extension called the ADD-IP feature. SCTP tries to use of all available addresses on both end hosts, but among them, there are addresses that should preferably not be used by certain policies or that are known to be unusable beforehand. Trials to use such addresses might cause unexpected degradations of performance or undesired termination of associations by time out. In this study, we propose a new feature by which a user can specify his own address usage policy, per process, according to which a host can determine which address may be used and which should be ignored. If an application program with SCTP is written in the protocol independent programming style, improper addresses are transparently removed so that the application program might use all and only usable addresses.
{"title":"Policy-Based IP Address Selection in SCTP Automatic Address Reconfiguration","authors":"Shin Maruyama, M. Kozuka, Y. Okabe, Motonori Nakamura","doi":"10.1109/WAINA.2011.71","DOIUrl":"https://doi.org/10.1109/WAINA.2011.71","url":null,"abstract":"SCTP is a reliable transport protocol that supports redundant paths by multiaddressing. Dynamic reconfiguration of IP addresses of an existing association is also supported by an extension called the ADD-IP feature. SCTP tries to use of all available addresses on both end hosts, but among them, there are addresses that should preferably not be used by certain policies or that are known to be unusable beforehand. Trials to use such addresses might cause unexpected degradations of performance or undesired termination of associations by time out. In this study, we propose a new feature by which a user can specify his own address usage policy, per process, according to which a host can determine which address may be used and which should be ignored. If an application program with SCTP is written in the protocol independent programming style, improper addresses are transparently removed so that the application program might use all and only usable addresses.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122271687","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}
Miguel A. Wister, Pablo Pancardo, Francisco D. Acosta, Dante Arias Torres
Choosing a routing protocol is an essential part in the success of the communication in mobile Ad-Hoc networks (MANET), since their topology is constantly changing. In many MANET applications (such as rescue tasks applications) it is necessary to assure reliable communication among network nodes. In this paper is showed a performance evaluation of two reactive routing protocols in order to know which is the most appropriate one for rescue tasks operations. Two protocols are evaluated: AODV (Ad hoc On Demand Distance Vector) and DYMO (Dynamic MANET On-demand routing protocol). Various mobility conditions in the environment are presented as well as the respective behavior of the protocols under these variations. The results of this work are organized in metrics which enabled the conclusions about the protocols performance.
由于移动自组织网络(MANET)的拓扑结构是不断变化的，路由协议的选择对通信的成功与否至关重要。在许多MANET应用(如救援任务应用)中，必须保证网络节点之间的可靠通信。本文对两种响应路由协议进行了性能评价，以确定哪一种协议最适合救援任务操作。评估了两种协议:AODV (Ad hoc On Demand Distance Vector)和DYMO (Dynamic MANET On Demand routing protocol)。提出了环境中的各种移动条件以及在这些变化下协议的各自行为。这项工作的结果被组织在指标中，从而得出关于协议性能的结论。
{"title":"Performance Evaluation of AODV and DYMO as a Plattform for Rescue Task Applications in MANETs","authors":"Miguel A. Wister, Pablo Pancardo, Francisco D. Acosta, Dante Arias Torres","doi":"10.1109/WAINA.2011.46","DOIUrl":"https://doi.org/10.1109/WAINA.2011.46","url":null,"abstract":"Choosing a routing protocol is an essential part in the success of the communication in mobile Ad-Hoc networks (MANET), since their topology is constantly changing. In many MANET applications (such as rescue tasks applications) it is necessary to assure reliable communication among network nodes. In this paper is showed a performance evaluation of two reactive routing protocols in order to know which is the most appropriate one for rescue tasks operations. Two protocols are evaluated: AODV (Ad hoc On Demand Distance Vector) and DYMO (Dynamic MANET On-demand routing protocol). Various mobility conditions in the environment are presented as well as the respective behavior of the protocols under these variations. The results of this work are organized in metrics which enabled the conclusions about the protocols performance.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126593384","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}
R. Román, Javier López, Cristina Alcaraz, Hsiao-Hwa Chen
Key Management Schemes (KMS) are a very important security mechanism for Wireless Sensor Networks (WSN), as they are used to manage the credentials (i.e. secret keys) that are needed by the security primitives. There is a large number of available KMS protocols in the literature, but it is not clear what should network designers do to choose the most suitable protocol for the needs of their applications. In this paper, we consider that given a certain set of application requirements, the network designer can check which properties comply with those requirements and select the KMS protocols that contains those particular properties. Therefore, we study the relationship between requirements and properties, and we provide a web tool, the Sense Key tool, that can be used to automatically obtain an optimal set of KMS protocols.
{"title":"SenseKey -- Simplifying the Selection of Key Management Schemes for Sensor Networks","authors":"R. Román, Javier López, Cristina Alcaraz, Hsiao-Hwa Chen","doi":"10.1109/WAINA.2011.78","DOIUrl":"https://doi.org/10.1109/WAINA.2011.78","url":null,"abstract":"Key Management Schemes (KMS) are a very important security mechanism for Wireless Sensor Networks (WSN), as they are used to manage the credentials (i.e. secret keys) that are needed by the security primitives. There is a large number of available KMS protocols in the literature, but it is not clear what should network designers do to choose the most suitable protocol for the needs of their applications. In this paper, we consider that given a certain set of application requirements, the network designer can check which properties comply with those requirements and select the KMS protocols that contains those particular properties. Therefore, we study the relationship between requirements and properties, and we provide a web tool, the Sense Key tool, that can be used to automatically obtain an optimal set of KMS protocols.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126079930","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}
Mobile devices with two network interfaces(WiFi and 3G) are already commercially available. Point-to-point communications such as Infrared and Bluetooth are also readily used. In the near future, mobile phones will have several interfaces including satellite and new technologies such as Ultra wideband. Hence we must assume that such devices will be multi-homed by default. For various reasons, including network congestion, network resilience and increased endpoint bandwidth, there have been several attempts to address multi-homing. Heterogeneous environments with the need to support vertical handover introduce another set of issues which make the need to solve multi-homing problems more urgent. This paper outlines the issues, looks at past efforts and proposes a solution based on the Location Id/Node Id concept but also argues that additional support is needed to make such an approach efficient for heterogeneous environments.
{"title":"Exploring Multi-homing Issues in Heterogeneous Environments","authors":"G. Mapp, Mahdi Aiash, H. Guardia, J. Crowcroft","doi":"10.1109/WAINA.2011.140","DOIUrl":"https://doi.org/10.1109/WAINA.2011.140","url":null,"abstract":"Mobile devices with two network interfaces(WiFi and 3G) are already commercially available. Point-to-point communications such as Infrared and Bluetooth are also readily used. In the near future, mobile phones will have several interfaces including satellite and new technologies such as Ultra wideband. Hence we must assume that such devices will be multi-homed by default. For various reasons, including network congestion, network resilience and increased endpoint bandwidth, there have been several attempts to address multi-homing. Heterogeneous environments with the need to support vertical handover introduce another set of issues which make the need to solve multi-homing problems more urgent. This paper outlines the issues, looks at past efforts and proposes a solution based on the Location Id/Node Id concept but also argues that additional support is needed to make such an approach efficient for heterogeneous environments.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123769071","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 wormhole attack is hard to detect and can be easily implemented. An attacker may receive packets from one location in the network and tunnel them to the other end point in a different location and re-inject them into the network. Attackers can tunnel the packets by one of the following methods: encapsulating the packets, using out-of-bound links or using high power. If there are two or more malicious nodes in the network involved in a wormhole attack, the attack becomes more powerful. There are two types of wormhole attacks: hidden mode, and exposed (participation) mode. In this paper, we present an algorithm for detecting wormhole attacks, whether in hidden or exposed mode in wireless multi-hop net-works without special hardware. Our algorithm is an improvement on another algorithm which is based on transmission time-based mechanism (TTM). Moreover, our algorithm introduces a new mechanism called Packet Travel Time (PTT). This mechanism allows each device to monitor its neighbours’ behaviour. Therefore, this mechanism can detect both hidden and exposed wormhole attacks, and can locate the wormhole in AODV, and DSR protocol.
{"title":"PTT: Packet Travel Time Algorithm in Mobile Ad Hoc Networks","authors":"Adel Alshamrani","doi":"10.1109/WAINA.2011.68","DOIUrl":"https://doi.org/10.1109/WAINA.2011.68","url":null,"abstract":"The wormhole attack is hard to detect and can be easily implemented. An attacker may receive packets from one location in the network and tunnel them to the other end point in a different location and re-inject them into the network. Attackers can tunnel the packets by one of the following methods: encapsulating the packets, using out-of-bound links or using high power. If there are two or more malicious nodes in the network involved in a wormhole attack, the attack becomes more powerful. There are two types of wormhole attacks: hidden mode, and exposed (participation) mode. In this paper, we present an algorithm for detecting wormhole attacks, whether in hidden or exposed mode in wireless multi-hop net-works without special hardware. Our algorithm is an improvement on another algorithm which is based on transmission time-based mechanism (TTM). Moreover, our algorithm introduces a new mechanism called Packet Travel Time (PTT). This mechanism allows each device to monitor its neighbours’ behaviour. Therefore, this mechanism can detect both hidden and exposed wormhole attacks, and can locate the wormhole in AODV, and DSR protocol.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127899510","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 advent of distributed and ad-hoc-connected systems such as in Ambient Intelligence applications confronts developers with the question on how to specify QoS- and security policies beforehand, without knowing the exact capabilities and requirements of the platforms which will be present at run time. Especially when peers need to adhere to an appropriate trade-off between security and performance, on-the-fly negotiation protocols are required to allow peers to autonomously agree on a common policy. In this paper we present a framework for secure multi-party decision protocols based on auctions. Besides the framework design, a prototype implementation will be described and results of practical experiments will be given.
{"title":"Auctions for Secure Multi-party Policy Negotiation in Ambient Intelligence","authors":"J. Schütte, Stephan Heuser","doi":"10.1109/WAINA.2011.98","DOIUrl":"https://doi.org/10.1109/WAINA.2011.98","url":null,"abstract":"The advent of distributed and ad-hoc-connected systems such as in Ambient Intelligence applications confronts developers with the question on how to specify QoS- and security policies beforehand, without knowing the exact capabilities and requirements of the platforms which will be present at run time. Especially when peers need to adhere to an appropriate trade-off between security and performance, on-the-fly negotiation protocols are required to allow peers to autonomously agree on a common policy. In this paper we present a framework for secure multi-party decision protocols based on auctions. Besides the framework design, a prototype implementation will be described and results of practical experiments will be given.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132681693","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}
Communication in Mobile Ad-Hoc Network (MANET) is based on mutual trust between the participating nodes. Due to features of open medium, dynamic changing topology, lack of centralized monitoring and management, MANETs are vulnerable to various security attacks. Hence, finding a secure and trustworthy end-to-end path in MANET is a real challenge. The paper presents a solution for trustworthy path discovery in MANET that comprises of an effective reputation based trust management scheme through cross-correlation of monitored traffic and a trust based routing protocol that dynamically evaluates trustworthy path. Our analysis shows significant improvement in packet delivery ratio of AODV in the presence of attacks, with marginal rise in control traffic overhead.
{"title":"Trustworthy Path Discovery in MANET -- A Message Oriented Cross-Correlation Approach","authors":"G. Patnaik, M. M. Gore","doi":"10.1109/WAINA.2011.69","DOIUrl":"https://doi.org/10.1109/WAINA.2011.69","url":null,"abstract":"Communication in Mobile Ad-Hoc Network (MANET) is based on mutual trust between the participating nodes. Due to features of open medium, dynamic changing topology, lack of centralized monitoring and management, MANETs are vulnerable to various security attacks. Hence, finding a secure and trustworthy end-to-end path in MANET is a real challenge. The paper presents a solution for trustworthy path discovery in MANET that comprises of an effective reputation based trust management scheme through cross-correlation of monitored traffic and a trust based routing protocol that dynamically evaluates trustworthy path. Our analysis shows significant improvement in packet delivery ratio of AODV in the presence of attacks, with marginal rise in control traffic overhead.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"58 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623020","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
扫码关注我们
求助内容：
应助结果提醒方式：