IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Mitigation of sink hole attack in manet using acoIJARIIT
MANET (Mobile ad hoc network) is the emerging and most demanding technology of wireless network. Because of
self-deliberate property, the network points behave as router or source and the nodes keep moving freely in the network area.
MANET plays a significant role in connection less infrastructure. Securing a network is the fundamental issue in MANET for
securing the susceptible information from hackers. MANET has different attacks that are routing protocol attacks. The sink
hole is known as the severe one from all the attacks in MANET. It generally attracts the neighbour’s nodes towards itself and
transmits the bogus or fake routing path. This attack decreases the network lifetime and increases the network overhead by
boosting energy consumption and later destroys the network. In the proposed work, the routing protocol is being optimized by
utilizing ACO (Ant Colony Optimization) with NN (Neural Network) for achieving enhanced performance as compared to
existing work. Different parameters, namely, Bit error rate, throughput, an end to end delay and energy consumption are used
for calculating the performance of the proposed wok in MANET or to check the effect of Sinkhole attack. The environment
created by simulating the work has 50 to 100 nodes. The width and height of the network is 1000 nodes
We are sending data from source node to destination using wireless sensor networks (WSNs), In wireless sensor networks, it is a typical threat to source privacy that an attacker performs back tracing strategy to locate source nodes by analyzing transmission paths. So there is lot of chances to lose data and information theft by network hackers. Network hackers performs eves dropping, sniffers attack, Denial of service attack. These types of attacks are achieved by negative commands generated by intermediate server maintained by hackers. With the popularity of the Internet of Things (IoTs) in recent years, source privacy protection has attracted a lot of attentions. However, they fail to get the tradeoff between multi-path transmission and transmission cost. In this project, we propose a Constrained Random Routing (CRR) mechanism and Greedy techniques, which can constantly change routing next-hop instead of a relative fixed route so that attackers cannot analyze routing and trace back to source nodes. At first we designed the randomized architecture for each sensor nodes. Then calculate the coordinates and weights of node, Finally, the selected weights help to decide which node will become the next hop. In this way, attackers would be confused by the constantly changing paths. The simulation results prove that our proposal can achieve high routing efficiency in multi-path transmission. A Prasanth | P Sankar Ganesh | S P Raja Gopalan"Data Prevention from Network Hacking" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11035.pdf http://www.ijtsrd.com/engineering/computer-engineering/11035/data-prevention-from-network-hacking/a-prasanth
Ant Colony Optimization for Wireless Sensor Network: A Reviewiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Mitigation of sink hole attack in manet using acoIJARIIT
MANET (Mobile ad hoc network) is the emerging and most demanding technology of wireless network. Because of
self-deliberate property, the network points behave as router or source and the nodes keep moving freely in the network area.
MANET plays a significant role in connection less infrastructure. Securing a network is the fundamental issue in MANET for
securing the susceptible information from hackers. MANET has different attacks that are routing protocol attacks. The sink
hole is known as the severe one from all the attacks in MANET. It generally attracts the neighbour’s nodes towards itself and
transmits the bogus or fake routing path. This attack decreases the network lifetime and increases the network overhead by
boosting energy consumption and later destroys the network. In the proposed work, the routing protocol is being optimized by
utilizing ACO (Ant Colony Optimization) with NN (Neural Network) for achieving enhanced performance as compared to
existing work. Different parameters, namely, Bit error rate, throughput, an end to end delay and energy consumption are used
for calculating the performance of the proposed wok in MANET or to check the effect of Sinkhole attack. The environment
created by simulating the work has 50 to 100 nodes. The width and height of the network is 1000 nodes
We are sending data from source node to destination using wireless sensor networks (WSNs), In wireless sensor networks, it is a typical threat to source privacy that an attacker performs back tracing strategy to locate source nodes by analyzing transmission paths. So there is lot of chances to lose data and information theft by network hackers. Network hackers performs eves dropping, sniffers attack, Denial of service attack. These types of attacks are achieved by negative commands generated by intermediate server maintained by hackers. With the popularity of the Internet of Things (IoTs) in recent years, source privacy protection has attracted a lot of attentions. However, they fail to get the tradeoff between multi-path transmission and transmission cost. In this project, we propose a Constrained Random Routing (CRR) mechanism and Greedy techniques, which can constantly change routing next-hop instead of a relative fixed route so that attackers cannot analyze routing and trace back to source nodes. At first we designed the randomized architecture for each sensor nodes. Then calculate the coordinates and weights of node, Finally, the selected weights help to decide which node will become the next hop. In this way, attackers would be confused by the constantly changing paths. The simulation results prove that our proposal can achieve high routing efficiency in multi-path transmission. A Prasanth | P Sankar Ganesh | S P Raja Gopalan"Data Prevention from Network Hacking" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11035.pdf http://www.ijtsrd.com/engineering/computer-engineering/11035/data-prevention-from-network-hacking/a-prasanth
Ant Colony Optimization for Wireless Sensor Network: A Reviewiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Detecting Misbehaving and Selfish Nodes in the Network using Watchdog MechanismINFOGAIN PUBLICATION
The nodes in a wireless network may misbehave at times. This misbehavior needs to be monitored in order to avoid sudden failure of network. The watch dog mechanism has been sufficiently studied to address the issue of malice node detection, in Mobile Adhoc Networks (MANETs). A Collaborative Contact based Watchdog (CoCoWa) is collaborated with information diffusion in the proposed work. This combination strategy analyses all the nodes in a network and provides the information update regarding the selfishness of the specific nodes to other nodes and routing protocols to enable performance oriented transmission. Once the selfish node is detected by the watch dog, it is marked as selfishness positive node else the node is marked as negative selfish node. For enabling this fool proof approach, true neighbors, fake neighbors, their probability of relationships with each other is analyzed. The evaluation of the viability of the proposed work is made in terms of detection efficiency, detection accuracy of both malicious and selfish nodes. Apart from these, the strategy is proved to be simple yet effective.
Comparative study on Cache Coherence Protocolsiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
In MANETs the cooperation between nodes of the network is more important for data transmission to occur in a efficient manner. But, it is not true that all nodes of the network actively participate in data transmission process without affecting network performance. The nodes with selfish behavior reject to cooperate with other neighbor nodes of the network for data transmission activity. Selfish nodes lower the performance of the network by causing data loss or they induce wrong data in the network. The existing local watchdog mechanism is used to identify such nodes, but it is not a good mechanism because it originates wrong positives and wrong negatives. So, in this paper we are introducing a watchman with cooperative characteristic to mark greedy nodes and distribute the same information to other neighbor nodes. With this the energy consumption is saved and the selfish nodes are identified earlier and accurately
Internet Worm Classification and Detection using Data Mining Techniquesiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Security Measure to Detect and Avoid Flooding Attacks using Multi-Agent Syste...IJECEIAES
Security is considered as one of the major challenge when it comes to infrastructure less and self dependent network without any centralized control. The vulnerability of Adhoc Network makes it susceptible to external attacks like flooding of hello messages or propagating fake routing messages etc. Such attacks generates a variety of problems like disturbing the network by flooding messages that results in waste of battery which is a vital resource to maintain the life span of the network. Most importantly cause agents to die when unable to reach destination due to fake routing messages causing a heavy loss on part of the nodes generating them to maintain the route knowledge. The paper proposes a novel technique to identify the flooding attack and measure to overcome them using Multi-Agent system
Now a day the technology is improving day by day. The wired network has been changed to wireless network. There are many advantages of wireless network over wired network. One of the main advantage is we can walk around freely in a network area and accesses internet. Security is one of the challenging issues. Intrusion Detection System is one of the systematic ways to detect malicious node in a mobile ad hoc network MANET and it is driven by battery power. This paper gives a survey on various intrusion detection systems in MANET. Praveen Mourya | Prof. Avinash Sharma ""Review on Intrusion Detection in MANETs"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-2 , February 2020, URL: https://www.ijtsrd.com/papers/ijtsrd29970.pdf
Paper Url : https://www.ijtsrd.com/engineering/computer-engineering/29970/review-on-intrusion-detection-in-manets/praveen-mourya
Dynamic analysis of agent network in self organisation using service level ag...inventionjournals
ABSTRACT: Self-organisation mechanism synthesizes the three principles: cloning, resource exchange and relation adaptation to achieve the better agent network structure. Self organization is usually defined as “the mechanism or the process enabling the system to change its organization without explicit external command during its execution time”. By the mechanism, an agent selected by task that particular agent having resource to complete it. When task given to the agent is overloaded then generate clone agents using famous method, Hybrid Model of Q-learning and also provide the guarantee of the agent network using SLA(Service Level Agreement) technique. The mechanism is evaluated through a comparison with the three approaches are the benefit of individual agent and the entire agent network, the load balancing among the agents and the time consumption to finish the task execution.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
A novel algorithm to protect and manage memory locationsiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This paper introduces co-operative caching
policies for reducing electronic content provisioning cost in
Social Wireless Networks (SWNET). SWNET are formed by
mobile devices such as laptops, modern cell phones etc. sharing
common electronic contents, data and actually gathering in
public places like college campus, mall etc. Electronic object
caching in such SWNET are shown to be able to minimize the
content provisioning cost which mainly depend on service and
pricing dependencies between various stakeholders including
content provider(CP), network service provider, end
consumer(EC). This paper introduces practical network service
and pricing model which are used for creating two object
caching strategies for minimizing provisioning cost in networks
which are homogeneous and heterogeneous object demand. The
paper develops analytical and simulation design for analyzing
the proposed caching strategies in the presence of selfish user
that deviates from networks-wide cost-optimal policies.
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multi-path routing algorithms for mobile ad hoc networks (MANETs).
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies’ solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.
Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most
important process in communication and parallel computer is broadcast approach.. The approach of this
case of Broadcasting is to send the message from one source to all destinations in the network which
corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in
modern parallel computers which is characterized with low communication latency. We show how to apply
this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control
digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits
will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for
broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient
algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were
compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our
simulation results show the average of our proposed algorithm over the other algorithms that presented.
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multipath routing algorithms for mobile ad hoc networks (MANETs).
Emission analysis of bio diesel blends on variable compression ratio engineeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Two level data security using steganography and 2 d cellular automataeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
It business management parameters framework from indian contexteSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Detecting Misbehaving and Selfish Nodes in the Network using Watchdog MechanismINFOGAIN PUBLICATION
The nodes in a wireless network may misbehave at times. This misbehavior needs to be monitored in order to avoid sudden failure of network. The watch dog mechanism has been sufficiently studied to address the issue of malice node detection, in Mobile Adhoc Networks (MANETs). A Collaborative Contact based Watchdog (CoCoWa) is collaborated with information diffusion in the proposed work. This combination strategy analyses all the nodes in a network and provides the information update regarding the selfishness of the specific nodes to other nodes and routing protocols to enable performance oriented transmission. Once the selfish node is detected by the watch dog, it is marked as selfishness positive node else the node is marked as negative selfish node. For enabling this fool proof approach, true neighbors, fake neighbors, their probability of relationships with each other is analyzed. The evaluation of the viability of the proposed work is made in terms of detection efficiency, detection accuracy of both malicious and selfish nodes. Apart from these, the strategy is proved to be simple yet effective.
Comparative study on Cache Coherence Protocolsiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
In MANETs the cooperation between nodes of the network is more important for data transmission to occur in a efficient manner. But, it is not true that all nodes of the network actively participate in data transmission process without affecting network performance. The nodes with selfish behavior reject to cooperate with other neighbor nodes of the network for data transmission activity. Selfish nodes lower the performance of the network by causing data loss or they induce wrong data in the network. The existing local watchdog mechanism is used to identify such nodes, but it is not a good mechanism because it originates wrong positives and wrong negatives. So, in this paper we are introducing a watchman with cooperative characteristic to mark greedy nodes and distribute the same information to other neighbor nodes. With this the energy consumption is saved and the selfish nodes are identified earlier and accurately
Internet Worm Classification and Detection using Data Mining Techniquesiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Security Measure to Detect and Avoid Flooding Attacks using Multi-Agent Syste...IJECEIAES
Security is considered as one of the major challenge when it comes to infrastructure less and self dependent network without any centralized control. The vulnerability of Adhoc Network makes it susceptible to external attacks like flooding of hello messages or propagating fake routing messages etc. Such attacks generates a variety of problems like disturbing the network by flooding messages that results in waste of battery which is a vital resource to maintain the life span of the network. Most importantly cause agents to die when unable to reach destination due to fake routing messages causing a heavy loss on part of the nodes generating them to maintain the route knowledge. The paper proposes a novel technique to identify the flooding attack and measure to overcome them using Multi-Agent system
Now a day the technology is improving day by day. The wired network has been changed to wireless network. There are many advantages of wireless network over wired network. One of the main advantage is we can walk around freely in a network area and accesses internet. Security is one of the challenging issues. Intrusion Detection System is one of the systematic ways to detect malicious node in a mobile ad hoc network MANET and it is driven by battery power. This paper gives a survey on various intrusion detection systems in MANET. Praveen Mourya | Prof. Avinash Sharma ""Review on Intrusion Detection in MANETs"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-2 , February 2020, URL: https://www.ijtsrd.com/papers/ijtsrd29970.pdf
Paper Url : https://www.ijtsrd.com/engineering/computer-engineering/29970/review-on-intrusion-detection-in-manets/praveen-mourya
Dynamic analysis of agent network in self organisation using service level ag...inventionjournals
ABSTRACT: Self-organisation mechanism synthesizes the three principles: cloning, resource exchange and relation adaptation to achieve the better agent network structure. Self organization is usually defined as “the mechanism or the process enabling the system to change its organization without explicit external command during its execution time”. By the mechanism, an agent selected by task that particular agent having resource to complete it. When task given to the agent is overloaded then generate clone agents using famous method, Hybrid Model of Q-learning and also provide the guarantee of the agent network using SLA(Service Level Agreement) technique. The mechanism is evaluated through a comparison with the three approaches are the benefit of individual agent and the entire agent network, the load balancing among the agents and the time consumption to finish the task execution.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
A novel algorithm to protect and manage memory locationsiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This paper introduces co-operative caching
policies for reducing electronic content provisioning cost in
Social Wireless Networks (SWNET). SWNET are formed by
mobile devices such as laptops, modern cell phones etc. sharing
common electronic contents, data and actually gathering in
public places like college campus, mall etc. Electronic object
caching in such SWNET are shown to be able to minimize the
content provisioning cost which mainly depend on service and
pricing dependencies between various stakeholders including
content provider(CP), network service provider, end
consumer(EC). This paper introduces practical network service
and pricing model which are used for creating two object
caching strategies for minimizing provisioning cost in networks
which are homogeneous and heterogeneous object demand. The
paper develops analytical and simulation design for analyzing
the proposed caching strategies in the presence of selfish user
that deviates from networks-wide cost-optimal policies.
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multi-path routing algorithms for mobile ad hoc networks (MANETs).
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies’ solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.
Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most
important process in communication and parallel computer is broadcast approach.. The approach of this
case of Broadcasting is to send the message from one source to all destinations in the network which
corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in
modern parallel computers which is characterized with low communication latency. We show how to apply
this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control
digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits
will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for
broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient
algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were
compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our
simulation results show the average of our proposed algorithm over the other algorithms that presented.
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multipath routing algorithms for mobile ad hoc networks (MANETs).
Emission analysis of bio diesel blends on variable compression ratio engineeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Two level data security using steganography and 2 d cellular automataeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
It business management parameters framework from indian contexteSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Identification of isomorphism and detection of distinct mechanism of kinemati...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Index and engineering properties of spent wash blended soils a comparative s...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Pi controller based of multi level upqc using dq0 transformation to improve p...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and TechnologyImprov...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Extracting interesting knowledge from versions of dynamic xml documentseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A Review on Resource Discovery Strategies in Grid Computingiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
SECURE CLOUD COMPUTING MECHANISM FOR ENHANCING: MTBACijistjournal
The development of the cloud system,A large number of vendors can visit their users in the same platform directing their focus on the software rather than the underlying framework. This necessary require the distribution, storage analysis of the data on cloud accessing virtualized and scalable web services with broad application of cloud, the data security and access control become a major concern. The access to the cloud requires authorization as well as data accessibility permission. The verification and updation of data accessibility permissions and data must be done with proper knowledge which requires identification of correct updates and block listed users who are intruder to cloud Introducing the false data system. In this paper we approach to builds a mutual trust relationship between users and cloud for accessing control method in cloud computing environment focusing on the system integrity and its security. The proposed approach is executed as a procedure manner and includes many steps to identify the user’s credibility in the cloud network.
Optimal Data Collection from a Network using Probability Collectives (Swarm B...IJRES Journal
This paper contains the implementation of the BeeAdhoc algorithm for data routing in mobile Ad Hoc Network (MANet). The algorithm was inspired by the foraging behaviour of honey bees and its implementation mimics this behaviour. The integration was done on Network Simulator version 2 (NS-2.34) where different scenarios were considered in comparison with other existing state-of-the-art routing algorithms that have been implemented in the chosen simulator. The comparison was carried out between DSR, DSDV, AOMDV which are all multipath routing algorithms as the BeeAdhoc; this gave a better insight to the different behaviour of the algorithms on a common application environment. Throughput, end-to-end delay and routing overhead constitute the indices used for the performance evaluation. Experimental results showed the best performance of BeeAdhoc over, DSDV and AOMDV algorithms.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
STUDY AND PERFORMANCE EVALUATION OF ANTHOCNET AND BEEHOCNET NATURE INSPIRED M...IAEME Publication
There are multiple algorithms and protocols which are present in MANeT but no one is perfect for each situation because of the presence of high topology changes and dynamicity of number of nodes. That’s the reason of opting biological algorithm like Ant based or Bee based algorithms which are swarm intelligence based nature inspired algorithms which finds out the best route as per the real time status of network. In communications network research, there is currently an increasing interest for the paradigm of autonomic computing. The idea is that networks are becoming more and more complex and that it is desirable that they can self-organize and self-configure, adapting to new situations in terms of traffic, services, network connectivity, etc. To support this new paradigm, future network algorithms should be robust, work in a distributed way, be able to observe changes in the network, and adapt to them. Nature’s self-organizing systems like insect societies show precisely these desirable properties
SECURITY PROPERTIES IN AN OPEN PEER-TO-PEER NETWORKIJNSA Journal
This paper proposes to address new requirements of confidentiality, integrity and availability properties fitting to peer-to-peer domains of resources. The enforcement of security properties in an open peer-topeer network remains an open problem as the literature have mainly proposed contribution on availability of resources and anonymity of users. That paper proposes a novel architecture that eases the administration of a peer-to-peer network. It considers a network of safe peer-to-peer clients in the sense that it is a commune client software that is shared by all the participants to cope with the sharing of various resources associated with different security requirements. However, our proposal deals with possible malicious peers that attempt to compromise the requested security properties. Despite the safety of an open peer-to-peer network cannot be formally guaranteed, since a end user has privileges on the target host, our solution provides several advanced security enforcement. First, it enables to formally define the requested security properties of the various shared resources. Second, it evaluates the trust and the reputation of the requesting peer by sending challenges that test the fairness of its peer-to-peer security policy. Moreover, it proposes an advanced Mandatory Access Control that enforces the required peer-to-peer security properties through an automatic projection of the requested properties onto SELinux policies. Thus, the SELinux system of the requesting peer is automatically configured with respect to the required peer-to-peer security properties. That solution prevents from a malicious peer that could use ordinary applications such as a video reader to access confidential files such as a video requesting fee paying. Since the malicious peer could try to abuse the system, SELinux challenges and traces are also used to evaluate the fairness of the requester. That paper ends with different research perspectives such as a dedicated MAC system for the peer-to-peer client and honeypots for testing the security of the proposed peer-to-peer infrastructure.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
P2P DOMAIN CLASSIFICATION USING DECISION TREE ijp2p
The increasing interest in Peer-to-Peer systems (such as Gnutella) has inspired many research activities
in this area. Although many demonstrations have been performed that show that the performance of a
Peer-to-Peer system is highly dependent on the underlying network characteristics, much of the
evaluation of Peer-to-Peer proposals has used simplified models that fail to include a detailed model of
the underlying network. This can be largely attributed to the complexity in experimenting with a scalable
Peer-to-Peer system simulator built on top of a scalable network simulator. A major problem of
unstructured P2P systems is their heavy network traffic. In Peer-to-Peer context, a challenging problem
is how to find the appropriate peer to deal with a given query without overly consuming bandwidth?
Different methods proposed routing strategies of queries taking into account the P2P network at hand.
This paper considers an unstructured P2P system based on an organization of peers around Super-Peers
that are connected to Super-Super-Peer according to their semantic domains; in addition to integrating
Decision Trees in P2P architectures to produce Query-Suitable Super-Peers, representing a community
of peers where one among them is able to answer the given query. By analyzing the queries log file, a
predictive model that avoids flooding queries in the P2P network is constructed after predicting the
appropriate Super-Peer, and hence the peer to answer the query. A challenging problem in a schemabased Peer-to-Peer (P2P) system is how to locate peers that are relevant to a given query. In this paper,
architecture, based on (Super-)Peers is proposed, focusing on query routing. The approach to be
implemented, groups together (Super-)Peers that have similar interests for an efficient query routing
method. In such groups, called Super-Super-Peers (SSP), Super-Peers submit queries that are often
processed by members of this group. A SSP is a specific Super-Peer which contains knowledge about: 1.
its Super-Peers and 2. The other SSP. Knowledge is extracted by using data mining techniques (e.g.
Decision Tree algorithms) starting from queries of peers that transit on the network. The advantage of
this distributed knowledge is that, it avoids making semantic mapping between heterogeneous data
sources owned by (Super-)Peers, each time the system decides to route query to other (Super-) Peers.
The set of SSP improves the robustness in queries routing mechanism, and the scalability in P2P
Network. Compared with a baseline approach,the proposal architecture shows the effect of the data
mining with better performance in respect to response time and precision.
Trust Based Content Distribution for Peer-ToPeer Overlay NetworksIJNSA Journal
In peer-to-peer content distribution the lack of a central authority makes authentication difficult. Without authentication, adversary nodes can spoof identity and falsify messages in the overlay. This enables malicious nodes to launch man-in-the-middle or denial-of-service attacks. In this paper, we present a trust based content distribution for peer-to-peer overlay networks, which is built on the trust management scheme. The main concept is, before sending or accepting the traffic, the trust of the peer must be validated. Based on the success of data delivery and searching time, we calculate the trust index of a node. Then the aggregated trust index of the peers whose value is below the threshold value is considered as distrusted and the corresponding traffic is blocked. By simulation results we show that our proposed scheme achieves increased success ratio with reduced delay and drop.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Mapping of genes using cloud technologieseSAT Journals
Abstract Bioinformatics is a much updated topic for the recent researchers. There are various tasks of bioinformatics, like Alignment and comparison of DNA and RNA, Gene mapping on chromosomes, Protein structure prediction, gene finding from DNA sequences etc. Mapping of gene is the procedure of calculating the distance between the genes in chromosomes. In the real time application the medicine researchers goes for processing huge amount of data that may comes from different clusters or from different location. The mapping results also differ from each other with huge differences. In order to process a huge amount of data we need such a good platform which will serve without fail. Cloud computing is such a good technique that can be applied for various data as well as a huge amount of data to compare, distinguish, or simply for mapping the genes in chromosomes. In the field of cloud computing, Apache hadoop is a platform which provides a good platform for processing huge amount of data. Till now Apache hadoop is having the similar type of application in Face book & Yahoo. It carries the properties like fault tolerance which can be very useful in securing the data. In this paper we have discussed about the application of cloud technologies in Gene Mapping in chromosomes and as a real time application we have discussed about the Apache hadoop that can be applied for this purpose also. Index Terms: Bioinformatics, Cloud computing, Gene mapping, Protein structure prediction, Apache hadoop, Chromosome.
Similar to Study on security and quality of service implementations in p2 p overlay network for efficient content distribution (20)
Water billing management system project report.pdfKamal Acharya
Our project entitled “Water Billing Management System” aims is to generate Water bill with all the charges and penalty. Manual system that is employed is extremely laborious and quite inadequate. It only makes the process more difficult and hard.
The aim of our project is to develop a system that is meant to partially computerize the work performed in the Water Board like generating monthly Water bill, record of consuming unit of water, store record of the customer and previous unpaid record.
We used HTML/PHP as front end and MYSQL as back end for developing our project. HTML is primarily a visual design environment. We can create a android application by designing the form and that make up the user interface. Adding android application code to the form and the objects such as buttons and text boxes on them and adding any required support code in additional modular.
MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software. It is a stable ,reliable and the powerful solution with the advanced features and advantages which are as follows: Data Security.MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
Literature Review Basics and Understanding Reference Management.pptx
Study on security and quality of service implementations in p2 p overlay network for efficient content distribution
1. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 455
STUDY ON SECURITY AND QUALITY OF SERVICE
IMPLEMENTATIONS IN P2P OVERLAY NETWORK FOR EFFICIENT
CONTENT DISTRIBUTION
K.Ramalakshmi1
, P.K.Sasikumar2
1
P.G Scholar Computer Science Eng, Dept. of CSE, Tamilnadu College of Engineering, Coimbatore, India
2
Assistant Professor, Dept. of CSE, Tamilnadu College of Engineering, Coimbatore, India
Abstract
Peer-to-peer (P2P) is a distributed system without any centralized control or hierarchical organization nodes organize itself in a
dynamic way. It allows different applications to achieve efficient and simple file sharing. Without any authentication adversary nodes
can spoof the identity and spoil the integrity by falsifying the messages in the overlay. This enables malicious nodes to launch man-in-
the-middle or denial-of-service attacks and many security related attacks. P2P systems require a sufficient amount of trust from their
nodes which are all participates in the network for AAA (Authentication, Authorization and Availability). From the analysis it aims to
provide the prediction of optimized path in the network for efficient file sharing and the identification of necessary security methods in
the network to provide security to decentralized p2p network.
Keywords: Decentralized, fault tolerance, access latency, double layer security, swarm intelligence, self organized, trust
management, threshold value, secured network, integrity, authentication, authorization.
----------------------------------------------------------------------***--------------------------------------------------------------------
1. INTRODUCTION
Overlay network is a computer network which can be built on
top of another underlying network with the purpose to
implement the services which is not available in the existing
network. The main goal of the overlay network is to
interconnect several LANs together. Because of the nodes of
P2P run on top of the internet it must be an overlay network.
P2P is a distributed system without any hierarchical
organization or centralized control nodes can communicate
with each other and organize itself in a dynamic way. Each
node may act as a client or server or router. A P2P network
provides self organized and fault tolerant mechanisms to
locate nodes anywhere on a network without maintaining a
large amount of routing state even in large node densities.
Peers in the network form a self-organized distributed overlay
networks that are overlayed with the Internet Protocol (IP)
networks which is built on the underlying physical network to
provide the services which is not available in the existing
network and has the features such as robust wide-area routing
architecture, efficient data items search , nearby peers
selection, redundant storage, permanence, hierarchical
naming, trust and authentication, anonymity, massive
scalability, fault tolerance and supports efficient resource
sharing.
P2P overlay network can be viewed as a model of spanning a
large spectrum of the communication nodes framework, which
specifies a cooperative, multiple, autonomous, component
databases, fully-distributed network design. It is built at the
application layer and use the underlying network for the
exchange of messages. A node (peer) may act as a client or a
server or router whenever an object is requested or served or
forwarded. P2P networks feature an enhancement of the use of
information, bandwidth and computing resources. Structured
P2P networks implements DHT (Distributed Hash Tables)
which uses the consistent hashing to assign each file to a
particular peer as ownership to that file that enables search for
a resource on the network by using the hash tables.
Unstructured P2P networks will not impose a particular
topology on the overlay network by design but rather the
nodes form the random connections to each other.
Unstructured P2P networks are highly robust in the presence
of high rates of churn i.e., when large number of peers are
suddenly joining and leaving the network. Replicated content
distribution of P2P network enables the demanded contents to
be get closer to the clients by geographically multiplying the
source of information which in turn reduce both the access
latency and network traffic. QoS is a method to assure a
bandwidth relationship between individual applications or
protocols. It minimizes the cost, access latency and increase
the availability by using the replication technique.
2. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 456
2. SWARM INTELLIGENCE
Swarm Intelligence (SI) depends on the collective behavior of
decentralized, self-organized systems which may be natural or
artificial. This system is developed in the work on artificial
intelligence. SI systems consist of a distributed population of
some simple agents as solutions can interact with one another
locally and also with their environment. The inspiration often
comes from nature, especially biological systems. Those
agents will follow some very simple rules without any
centralized control structure dictating how individual agents
should behave local and to a certain degree random
interactions between such agents lead to the upcoming usage
of "intelligent" global behavior which may be not known by
the individual agents. Examples of SI in nature may include
bee colonies, ant colonies, fish schooling, bird flocking,
animal herding and bacterial growth and used in robots is
called swarm robotics, while 'swarm intelligence' refers to the
more general set of algorithms. 'Swarm prediction' will be
used in the forecasting problems. The swarm intelligence is
implemented and the network security has been improved and
the functions of the swarm intelligence works based on the
degree of replication. The degree of replication defines the
percentage of participating nodes having the same files over
the network Bio-inspired algorithms are increasingly attracting
attention in solving optimization problems. In an overview of
biological facts about social insects, their inspired algorithms
and application areas in computer engineering and science are
presented. Among all social insects, the foraging behavior of
ant and bee colonies, and how it can be used to solve search
problems, is particularly popular.
2.1 Artificial Bee Colony Algorithm
Artificial bee colony algorithm (ABC) is a meta-heuristic
algorithm which simulates the collective behavior of honey
bees. The ABC algorithm has three types of bee phases called
scout bee, employed bee and onlooker bee. The employed bee
phase uses the deterministic selection and the onlooker bee
phase uses the probabilistic selection to finds the sources in
the neighborhood of the solutions by local searches. In the
scout bee phase efficient food sources will be identified by the
flooding of request in the searching process for solutions and
new solutions are inserted instead of them to explore new
regions in the search space. The algorithm has a well-balanced
exploration and exploitation ability.
2.2 Comparison with other Search Methods
Swarm Intelligence based optimization algorithms mimic the
nature to drive a search towards the optimal solution. A key
difference between SI and direct search algorithms such as
random walk and hill climbing is that instead of a single
solution SIOAs use a population of solution for every
iteration. As a population of solution is processed in an
iteration the population of solutions will be the outcome of
each iteration. SIOA population can be used to converge to the
optimum solution if an optimization problem has a single
optimum. However if an optimization problem has multiple
optimal solutions an SIOA can be used to capture them in its
final population. SIOAs include the Ant Colony Optimization
(ACO) algorithm, the Genetic Algorithm (GA) and the
Particle Swarm Optimization (PSO) algorithm. Common to all
population-based search methods SIOA generates variations
of the solution being sought. Some search methods like greedy
criterion can be used for the decision on which generated
solution to retain. Such a criterion can accept the new solution
if it increases the value of the optimized result. Swarm
intelligence has also been applied for data mining.
Swarm based P2P model uses Alliance theory for peering
where high contributing nodes (Power Nodes) have high
ranking based on their share ratios and nodes may be served
by the direct server and in small world networks every node
can also be connected to every other node in the swarm by the
small number of path length. Alliance members have common
trust and treaty as a node receives new content it forwards
among its alliance members. First alliance members are
mutually trusted and all members of an alliance have an active
connection with other members and also applying security
policies in alliance is much easier.
3. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 457
3. RESEARCH ISSUES IN QUALITY OF SERVICE AWARE CONTENT DISTRIBUTION AND DIFFERENT
KINDS OF SECURITY IMPLEMENTATION IN P2P NETWORK
Table-3.1 : Quality of service aware content distribution and different kinds of security implementation in p2p network
Algorithm Remarks Advantages Improved
Parameters
P2PBA(P2P
Bee Algorithm),
AODV reactive
routing protocol
[21].
If the packets size- 1024,size of each packet is 64
bytes then times in seconds will be
8s 70s 100s
Time efficient,
robust sharing
mechanism,
lower control
overhead ,
higher success ratio,
changing mobility and
high node density.
Optimized
search
process,
Efficient file
sharing better
sources to
selective
retrieval.
Intelligent
Replica
placement
algorithm,
robust query
searching
technique [6].
1. Load of the requested content- from 2.0mb to 5.0
Mb.
2. Delay of QIRM is significantly less than the delay
of VIRAT.
3. QIRM has throughput and more efficiency than
VIRAT.
3. Query sending rate -from 250Kb to 1Mb.
4.Bandwidth utilization of QIRM is 80-90% &
VIRAT 60-70%
Less access latency
and
network traffic,
scalability, tolerance,
reduced search
latency.
Throughput, delay,
bandwidth, query
efficiency, network
utilization.
Peer Rank and
Selection
Algorithm,
Rank based peer
to peer
searching
strategy , meta
based search
[31].
1. Estimated page rank is 0.25 probability distri-
bution and initial value is between 0.1 and n-1 and 0.5
to 0.2.is.
2.In naive distribution topic distribution-0.03% and
proceedings distribution-1.3%
but expertise based selection improves the precision
by 0.15% (topic) and 15% (proceedings) distribution.
3. Super peer-more than 40% traffic saved.
Better search
performance and user
interface, reduced
routing overhead,
reduced query cost,
decreased traffic per
query.
Bandwidth,
query efficiency,
average routing latency.
Intelligent
replica
placement and
effective load
balancing
techniques [5].
1. Load of the requested content - from 250bytes to
2000bytes.
2. Query sending rate- from 250Kb to 1Mb.
3. Rate increases and delay remains constant in
without LB but decreases in LB.
4.Delay & packet lose of LB is less than the delay &
packet lose of withoutLB, throughput of LB is more.
5. Simulation time-from 10 to 20 seconds.
Availability of data,
reduced maintenance
cost, strong
connectivity.
Better throughput,
query latency,
bandwidth, load
balancing.
Efficient replica
placement and
clustering
algorithm [3].
1. Packet delivery ratio of the EACNCRC is improved
than QIRMA with less energy usage..
2. Throughput gets increased with less delay and
reduced overhead.
Availability of data,
reduced maintenance
cost, strong
connectivity, less
energy consumption.
Better throughput,
query latency,
bandwidth, load
balancing, cost.
dynamic search
(DS) algorithm
[24].
1 In power-law graphs DS will be better than flooding
by 25 times and better than RW by 58 times and in
bimodal topologies DS is better than flooding by 186
times and better than RW by 120 times
2.If 100 distinct objects
With replication of 100,000 distinct objects and best
20 percent of
peers have 45 percent uptime which achieves the
median session duration time to be 20 minutes.
Search performance,
intelligent search,
success rate , query
hits.
Search time, cost,
query messages, query
efficiency, and search
efficiency.
4. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 458
3.Dynamic querying model has Poisson
distribution with the idle time as 50 minutes
4. MBFS with APS learning, the transmission
probability p is set as 0.2.
5. SE of DS is 24 percent better than that of RW, and
31 times better than that of MBFS.
Dynamic
Adaptation of
Connection
algorithm
dynamic
distributed hash
table (DDHT),
round-trip time
(RTT)[2].
1.DDHTs- dynamic updates, scalable, fault-tolerant,
administration-free and efficiently handle large
volume of data items
2. RTT-very fast, high qualities dynamic tree
adaptation (minimizes the service disruption).
3. It speeds up the connection and re- connection .
Fault-tolerant, adminis
-tration free,
minimizes any service
disruption
Fast access, quality
tree, adaptation.
Adaptive search
algorithm
Process
Query Receive
Query Hit [12].
1. Proposed method decreases the response time
where minimum bandwidth and maximum latency as
2 Mbps and 20 msecs. respectively.
2. Reduced cost for a node is 6.25.
3. A weigh of 65% to the transfer speed and 20% to
latency and the remaining 15% to the past response
(popularity of the peer) is given.
4. If 1000 nodes and 50 different objects then degree
of node varies from 3 to 12 with TTL limit is from 1
to 5.
Improves the
scalability, improved
performance,
Minimized message
overhead.
Latency, bandwidth,
low latency and less
congestion.
First-In-First-
Out algorithm
Tree based
Interactive
MultimEdia
System
(TIMES)[33].
1.It satisfies the large number of non- synchronization
Requests.
2. Achieves the interactive services.
3.Peer will cache the first initial 3 minutes of video
and will never replaces this part until it depart
Interactive operations,
less interruption,
limited buffer space.
Reduce the server
loading, flexibility,
Bandwidth.
ROMEO(Remot
e Collaborative
Real-Time
Multimedia
Experience over
the Future
Internet)
resource over-
reservation
techniques [10].
1. DVB-T2 -3D media‟s live simultaneous delivery.
2. Super-peer- improves scalability.
3. Enhances the service provisioning and has real-time
control over the flow prioritization.
4. Packet delay and jitter control is achieved by traffic
load balancing and control of unnecessary congestion
occurrence.
Low bandwidth, small
delay, low jitter, less
loss, reduction of
signalling overhead
increased resource
utilization, flexible
and cost-effective
control mechanisms.
High quality real-time
collaboration, multiple
enhancement layers of
views without high
complexity and
buffering requirement,
network utilization.
Data pipelines,
asymmetric
approach[15].
1.Asymmetric approach-
reduces the data access latency by 20-23% while
symmetric approach has 12-18% of access latency.
2. Transmission rate is increased as 5Mbps &has no
network congestion.
3. 30-50% less data traffic than the Simple Cache
Approach is achieved by cooperative cache schemes
(ICC, SCC, ACC) .
Removal of processing
overhead and reduced
data processing delay.
End-to-end interaction,
traffic control.
Optimized Bio-
inspired
Algorithm
(OBAME).
ant colony-
inspired
Among 20 nodes 200, 400, 600, 800, 1000 queries can
be answered by OBAME within the particular
response time which outperforms the AVAs and
BCAs by reduced response time with reduced network
traffic.
Maximized search
efficiency in P2P
databases, solving
optimization
problems, eliminate
flooding.
Network traffic, query
response time.
availability, efficiency,
accuracy.
5. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 459
algorithms
(ACAs) and bee
colony- inspired
algorithms
(BCAs)[13]
Bio-inspired
resource
discovery
scheme, Q-
learning and
erasure
codes(Reed-
Solomon)
random
algorithm, a
group partition
algorithm
highest
available first
(HAF)
algorithm[20].
1.If 10000 nodes, average degree of a nodes in the
network is 3.5,
1000 objects distributed
100 queries then one query is propagated every 20
seconds on average. flood of query message
-production is regulated. 80% of the nodes are up and
50% of „Down‟ nodes
2. Hit rate threshold δ- 0.3 thrld H is 0.6.
3. Availability threshold-0.4. The maximum number
of blocks k for an object - 12. TTL value is 6
available storage ≥ 30%
1.Efficient resource
discovery and
availability of desired
objects
2.Erasure codes
replication with less
number of available
blocks to construct
original files with
coded fragments saves
storage space and
bandwidth. 3.Power
peer table-maintains
data about number of
hits in
the node to enhance
the availability of
popular objects.
Query success rate and
availability and reduces
the network traffic.
Probabilistic
Modelling,
structure
learning and
parameter
learning [4].
1. Filtering with routing updating table searching
performance gets improved as 90%.
2.Global optimum is achieved by efficient training
and decoding based on dynamic programming and
parameter estimation.
3.1 million nodes with a query rate of 1000 queries
per second, then network traffic will be less than that
of 0.07%.
4. Communication costs is between 0.03% and 0.07%
with reduced communication bandwidth as 50%
Save peers from their
blindness,
fast resource
discovery, cost-
effective, accuracy of
90%,reduced loss.
Reliability,
bandwidth,
availability,
throughput,
query latency
DABC
(Differential
Artificial Bee
Colony),
stochastic
algorithms[23].
1.For 10D problem- solution is 6.78e-20(f5)
2.For 30D problem- solution is 4.12e-18(f5)
3.For 50D problems- solution is 4.34e-17(f5)
4.While compare to other solution proposed solution
achieves 9.26e-18(f5)
Convergence,quality
of solution,
robustness, better
search strategy.
Solutions to dynamic
optimization problems ,
suitability, convergence
rate.
1.Automated
Red Teaming
(ART)with
multi-objective
evolutionary
algorithms such
as SPEAII and
NSGAII
2.Multi-
objective bee
colony
optimization
(MOBCO)
algorithm with
non-dominated
selection and
crowding
1.70% of the bees- follow a dance selected from the
top 50% (in terms of crowding distance) of the bees in
Bwaggle
2.20% of the bees follow the next 30% of the dance
in Bwaggle,
3. Last 10% of the bees follow the balance 20% of the
dance in B waggle.
4. MOBCO is able to achieve a good convergence
compared to NSGAII. Crossover rate and mutation
rate is N/A
1.33 x 10-4
Robustness ART
controller-efficient
communication
proper loading and
execution between
different modules.
End to end
communication and
execution, improved
performance.
6. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 460
distance ranking
approach [17].
Artificial bee
colony
algorithm
(ABC)[18].
1.In 14 bus system total active and reactive power
loads on the system are 28.7 MW and 16.3 MV Ar
with voltage as 1.0 p.u. then the initial power loss
will be 511.4 kW the power loss after reconfiguring as
464.6kW.
2. Energy saving and cpu time as 8.15 and 4.9
3.For 33 bus system total load conditions are
5058.25 kW and 2547.32 kvar with initial losses are
202.68 kW.
Minimized power loss,
high node density.
Load balancing, voltage
profile improvement,
better sources to
selective retrieval.
Fast mutation
artificial bee
colony
algorithm
or FMABC[29].
1.50% employed bees and 50% onlooker bees
(SN=15), limit=100.
2. Function optimum than ABC.
3.Mean best and std dev (f7)for ABC is 0.1155 0.1201
and FMABC is 8.8818e-16 ,0 respectively dimension
10 in dimension 30 mean best and std dev (f7)for
ABC is 1.6832 1.8912 and FMABC is 8.8818e-16 0
Avoiding the falling
into local optimal,
high node density.
Higher stability of
solutions, load
balancing, improved
convergence rate,
Performance.
Multi-Objective
Artificial Bee
Colony
(MOABC)
algorithm with
Pareto concept
and external
archive strategy
[28].
1. MOABC algorithm is better than MOCLPSO and
NSGA-II optimization algorithms.
2. In convergence metric MOABC, MOCLPSO and
NSGA „s Median 2.8035e-005, 8.1531e-003,
3.9688e+000 and Std 8.9540e-003, 1.9448e-002,
1.4822e+000 will be respectively. In diversity metric
MOABC,
MOCLPSO and NSGA „s Median 4.7318e-001,
7.5949e-001, 1.1187e+000 and Std 2.7989e-001,
4.2953e-001, 8.8914e-002 will be respectively.
Less control
parameters,
Robustness,
performance.
Efficient solutions for
multimodal and
multidimensional
optimization problems.
Modified fast
marriage in
honey bee
optimization
(MFMBO)
[ 25].
1.Success rate and speed of MFMB is better than the
ABC,QB and FMBO with the tolerance of answer is
equal or less than10^-2 and success rate as 100% of
all
2. Improves the fitness of brood by using the selected
worker.
Faster, robustness,
scalability, tolerance.
Success rate, fitness,
speed.
Table-3.2: quality of service aware content distribution and different kinds of security implementation in p2p network
Algorithm/method Remarks Advantages
peer authorization
protocol (PAP),
private key
generator (PKG),
NAT device,
digital rights
management
(DRM) techniques
[30].
1. PAP-to differentiate illegal nodes.
2. Identity-based signatures-IBS (authorization verification),
Gossip Trust System time stamped tokens -to identify pirated
copies through secure file indexes.
3.10 PC-based distribution agents for a swarm size of 2,000
peers.
4. 99.9 percent of illegal prevention rate in Gnutella, KaZaA
and Freenet is achieved and 85-98 percent prevention rate on
eMule, eDonkey, Morpheus.
System performance, minimum
delivery cost, higher content
availability less overhead.
Trusted Computing
Group (TCG),
DAA (direct
anonymous
attestation)- sign&
verify algorithm,
Trusted Platform
Module(TPM)[22].
1. TPM-integrity, privacy.
2. Pseudonymous authentication mechanism-peers can
authenticate other peers.
3. Authenticated key exchanges- integrated with the SSL/TLS
and IPSec protocol.
Access control, accountability,
confidentiality and integrity.
7. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 461
Origin server (OS),
Trust Index Table
(TIT)[7].
1. Trust value calculation-On success of data delivery ratio
&search time for trusted nodes.
2. Query sending rate-from 250Kb to 1Mb increases when trust
evaluation is applied.
3. Delay is decreases at trust evaluation and drop is constant in
the trust based case.
Increased success ratio with reduced
delay and drop.
Signature scheme,
random linear
coding based
content distribution
[11].
1. Random linear coded Scheme-secure distribution with
negligible overhead for large files.
2. For 10MB file the overhead is less than
0.1% of the file size.
Integrity, less overhead for large
files, increased efficiency, improved
robustness and reduced
downloading time.
Poisoning resistant
security framework
[19].
1.Poisoning-resistant security framework- effectively and
efficiently defend against
content poisoning through man-in-the-middle (MITM), Sybil
and DoS attacks.
2. DHT-to content availability& scalability.
3. Scalable probabilistic verification scheme-to reduce
verification overhead.
Integrity, availability
and scalability.
Content authentic-
cation protocol,
rational content
access sub protocol
secure content
distribution
protocol [9].
1. Byzantine agreement -authentication and cryptographic
puzzles.
2. Signature generation sub protocol (SGS)-authenticity and
integrity.
3. Signature verification sub protocol (SVS)-trust is on Trust
Management System(TMS).
Integrity, reliability, secure and
authentication.
Integrated system
solution for secure
P2P content
distribution based
on Network
Coding(ISNC)[14].
1. Network coding- improve resilience to peer churn & shorter
the downloading time.
2. Secure network coding signature scheme- group network
coding authentication.
3. An identity-based malicious peer identification scheme-
Bottom-up & Top–down approach to identify malicious peer.
High throughput, high security, high
reliability, reduced computation
overhead and improved overall
efficiency.
Trust evidence-
identity, public
key, independent
security
assessment, PGP,
swarm intelligence-
ant colony
algorithm [16].
1. Backtracking- high certainty trust paths and the ability to
discover alternate paths.
2. Trust evidence optimized routing allows faster distribution.
3. Swarm intelligence -shortest path through ant based protocol
(Probabilistic ant routing).
Authentication, access-control,
availability.
Identity-based
encryption, Private
Key Generator
(PKG), asymmetric
key algorithms
[26].
1. IBE-Useful where pre-distribution of authenticated keys is
inconvenient and eliminates the need for a public key
distribution infrastructure.
2. PKG- private key to decrypt or sign messages.
3. RSA algorithm for safer data replication.
Secure Authenticity, integrity,
confidentiality, reduces overheads,
prevent Sybil attacks, query
efficiency, high replica hit rate.
Security
certificates, X.509,
ASN, DER,
Certification
Authority (CA),
firewall, PKI,
EJBCA(Enterprise
Java Bean Certifi
cate Authority)
associated with
OpenSSL[32].
1. ASN.1 distinguished encoding rules (DER) [X.690]-data
encoding.
2. Firewall supports FTP file filter-attachments of DOC and
ZIP files in E-mails to find
dangerous information to reduce the DOS
(Denial of Service) attacks.
3. Attribute certificate-specify group membership, role, security
clearance, other authorization information.
Access control, secure
transmissions, fault tolerance,
accuracy, lower cost, improved
security.
8. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 462
Intrusion detection
systems, distributed
security policy,
FIPA specification
learning algorithms
[27].
1. JXTA, WiFi OBEX -P2P communication.
2. Contact list -contains the list of neighbor nodes of P2P
provider.
3.Learning algorithms-optimal configuration, improve
performance.
Scalability, autonomy, monitor
heterogeneous processes and
devices, expandability, fault
tolerant, less overhead for
communication, efficiency,
reliability.
Ownership model,
security policy
definition
language(SPDL),
authentic key
exchange, Diffie-
Hellman key
exchange protocol
[8].
1. Security policy of a device- same as the Resurrecting
Duckling Policy Model.
2. Ownership model relations -redundancy to cope in situations
where devices get lost or delegated and builds p2p security
relations between devices that are trusted.
3. Remote configuration -to support limited user interface &
authentic key exchange to security relations.
Access control, authority,
authentication, exception handling,
limited devices, privacy, self-
configuration in dynamic networks.
Symmetric encrypt
-tion, public key
encryption, tunnel,
signature
verification keys,
digital signature,
Search for
Extraterrestrial
Intelligence (SETI)
[1].
1. Gossip model-initial node discovery and subsequent network
maintenance.
2. SETI - accountability mechanism to replicate all
computation to quality control.
3. Network Address Translator- sends packet to final
destination through internet.
4. Public key encryption.-secure content.
5 Groove‟s decentralization improves robustness.
Fault tolerant, reliable, survivability,
highly scalable, flexibility, expected
latency, robustness, authenticity,
confidentiality and integrity of
messages, high robust anonymity
and document durability.
Digital signature,
security-update
propagation
software
[34].
1. Upgrades-To detect a flaw in the code and to enhance
performance or extend the functionality.
2. Digital signature (encrypted by private key)-verify the
originality.
Enhanced performance, extended
functionality, faster requests
&responses, save time of download
and install, support of multiple
platforms, self immune to malicious
nodes.
4. FUTURE WORK
In order to improve the QoS and security advanced P2PHBA
algorithm can be used with scout bee implementation for the
prediction of optimized path to efficient file sharing, better
sources to selective retrieval , time efficient ,robust sharing
mechanism, lower control overhead , higher success ratio
amidst changing mobility and high node density. The efficient
content distribution with secured network are identified by
trust management techniques to recognize trustworthy peers
on P2P network to collect the peers trust values, authorization
protocol , private key generator. Implementation of key
server/origin server with IDS may improve the security of the
network without affecting the performance of content
distribution over the peers. Implementation of key server is to
provide session keys to all nodes in the network at the
configuration period for the first layer of security. At the time
of routing Intrusion Detection System (IDS) is initiated for
monitoring the nodes which also act as a cluster to achieve
second wall of defence against intruder in the operation. TA
(Trust Authority) is used to make the identification of
malicious nodes in all over the network. For the dynamic
routing purpose nodes outside the network coverage need to
get authenticated by IDS. Here IDS not only monitor the
malicious activities it also remove or prevent those unwanted
activities. So IDS is simply called as intrusion detection and
prevention system (IDPS) which is primarily focused on
identifying possible incidents, logging those information,
reporting those attempts, identifying problems with security
policies, document the existing threats and avoiding the
individuals from violating security policies. While compare to
other security mechanisms the implementation of IDPS will
consume reasonable energy will not affect the battery life
Monitoring allows one to detect, analyze and recover from
detected faults and also provides additional defense against
catastrophic failures. By using these double layer security and
Swarm Intelligence methodologies QoS is achieved with
better security
5. CONCLUSIONS
This paper conducts a theoretical analysis study on secured
and QoS based content distribution in distributed computing
system (peer-to-peer network). Because of the usage of a
population of solutions for every iteration instead of a single
solution SI algorithms can improve the performance of file
9. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 03 Issue: 04 | Apr-2014, Available @ http://www.ijret.org 463
sharing network. A brief discussion of different content
distribution techniques and different security implementations
are summarized. Also the advantages of efficient content
distribution is summarized with suggestions are given for the
efficient content distribution in a secured manner.
REFERENCES
[1]. Allan Friedman; Jean, L.( 2003): ”Peer-to-Peer Security”
Telecommunications Policy Research Conference,
Washington DC, September.
[2]. Anandaraj, M.; Ganeshkumar, P. ;Vijayakumar K.P.(
2013):” An Efficient QOS Based Multimedia Content
Distribution Mechanism in P2P Network “ ISSN: 2277 128X
,International Journal of Advanced Research in Computer
Science and Software Engineering, May.
[3]. Anna Saro Vijendran; Thavamani, S.(2013):“An Efficient
Algorithm For Clustering Nodes Classifying And Replication
Of Content On Demand Basis For Content Distribution In P2P
Overlay Networks” International Journal of Computer &
Communication Technology ISSN (PRINT): 0975 – 7449.
[4]. Anusuya, R.; Kavitha,V,;Mrs Golden Julie, E.
(2010):“Enhancing and Analyzing Search performance in
Unstructured Peer to Peer Networks Using Enhanced Guided
Search Protocol (EGSP)” , ISSN 2151-9617 Journal of
Computing, Volume 2, Issue 6, June.
[5]. Ayyasamy, S.; Sivanandam, S.N.(2010):“A Cluster Based
Replication Architecture for Load Balancing in Peer-to-Peer
Content Distribution” International Journal of Computer
Networks & Communications (IJCNC)September.
[6]. Ayyasamy, S.; Sivanandam, S.N.(2009): ”A QoS Aware
Intelligent Replica Management Architecture for Content
Distribution in P2P Overlay Networks” ISSN : 0975-3397
International Journal on Computer Science and Engineering .
[7]. Ayyasamy, S; Sivanandam, S.N.(2010): “Trust Based
Content Distribution for Peer-To-Peer Overlay Networks”
International Journal of Network Security & Its Applications
(IJNSA), Volume 2, Number 2, April.
[8]. Christian Rohner.(2006):“Security Bootstrapping for
Networked Devices” European Workshop on Security in Ad-
hoc and Sensor Networks - ESAS , pp. 165-178, 2006.
[9]. Esther Palomar Juan, M.; Estevez Tapiador Julio, C.;
Hernandez-Castro; Arturo Ribagorda.(2006): “A Protocol for
Secure Content Distribution in Pure P2P Networks”, DEXA
Workshops 2006: 712-716. Proceeding 06 Proceedings of the
17th International Conference on Database and Expert
Systems Applications ISBN:0-7695-2641-1.
[10]. Evariste Logota, Hugo Marques, Jonathan Rodriguez
Fernando Pascual, Manuel Nuñez, Ignacio Digón (2013)“A
Scalable Approach for QoS Control in P2P Networking” ict-
romeo.eu,Sep 28.
[11]. Fang Zhao; Ton Kalker; Muriel Medard and Keesook, J.;
Han.(2007):“Signatures for Content Distribution with
Network Coding”, In Proc. of International Symposium on
Information Theory (ISIT).
[12]. Haribabu, K.; Dayakar Reddy; Chittaranjan Hota
Antii Ylä-Jääski; Sasu Tarkoma. (2012):“Adaptive Lookup
for Unstructured Peer-to-Peer Overlays” IEEE Arrangement
Graph-Based Overlay with Replica Mechanism File Sharing,
Pervasive Systems, Algorithms and Networks (ISPAN), 12th
International Symposium.
[13]. Heba, A.; Kurida Thanaa, S.; Alnusairib; Hajar S.;
Almujaheda Heba, A.; Kurid.(2013):“OBAME: Optimized
Bio-inspired Algorithm to Maximize Search Efficiency in P2P
Databases” The 4th International Conference on Emerging
Ubiquitous Systems and Pervasive Networks (EUSPN).
[14]. Heng He; Ruixuan Li; Guoqiang Gao; Zhiyong Xu;
Weijun Xiao.(2011): “An Integrated System Solution for
Secure P2P Content Distribution Based on Network Coding”
Proceedings of NAS '11 Proceedings of the 2011 IEEE Sixth
International Conference on Networking, Architecture, and
Storage, 28-30 July 2011, 191-196, ISBN: 978-0-7695-4509-
7.
[15]. Jing Zhao; Ping Zhang and Guohong Cao (2013):“On
Cooperative Caching in Wireless P2P Networks “ National
Science Foundation (NSF) under grant CNS-0721479, Aug
24.
[16]. Laurent Eschenauer; John, S.; Baras Virgil
Gligor.(2003):“Distributed Trust Establishment in MANET‟s:
Swarm Intelligence”.
[17]. Malcolm Yoke Hean Low; Mahinthan Chandramohan;
Chwee Seng Choo.(2009): “Application Of Multi-Objective
Bee Colony Optimization Algorithm To Automated Red
Teaming” 978-1-4244-5771-7/09/2009 IEEE.
[18]. Nguyen Quynh Anh; Nguyen Tung Linh
(2010):“Application artificial bee colony algorithm (ABC) for
reconfiguring distribution network” 2010 Second International
Conference on Computer Modeling and Simulation
(ICCMS)978-0-7695-3941-6/10/2011, IEEE.
[19]. Ruichuan Chen; Eng Keong Lua; Jon Crowcroft; Wenjia
Guo; Liyong Tang; Zhong Chen.(2008): “Securing Peer-to-
Peer Content Sharing Service from Poisoning Attacks” pp. 22-
29, 8th International Conference in p2p computing, IEEE,
2008.
[20]. Sabu, M.; Thampi; Chandra Sekaran, K.(2010
):“Protocols for Bio-Inspired Resource Discovery and
Erasure Coded Replication in P2P Networks“ INFOCOMP
Journal of Computer Science, ISSN 1807-4545, June.
[21]. Sanjay; Dhurandher, K.; Sudip Misra; Shubham Singhal;
Saurabh Aggarwal; Puneet Pruthi; Isaac Woungang.(2009):”
A Swarm Intelligence-Based P2P File Sharing Protocol Using
Bee Algorithm” IEEE.
[22]. Shane Balfe; Amit, D.; Lakhani and Kenneth, G.;
Paterson.(2005):“Trusted Computing: Providing Security for
Peer-to-Peer Networks”, Fifth IEEE International Conference
on Peer-to-Peer Computing (P2P 2005), 31 August - 2
September 2005, Konstanz, Germany. IEEE Computer Society
2005 ISBN 0-7695-2376-5, Stamp Collectors Against Dodgy
Sellers (SCADS) institute, 117-124.
[23]. Syed Raziuddin; Syed Abdul Sattar; Rajya Lakshmi
and Moin Parvez (2011): “Differential Artificial Bee