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.
TRUST ORIENTED SECURITY FRAMEWORK FOR AD HOC NETWORKcscpconf
An ad hoc network is a group of wireless mobile hosts that are connected momentarily through
wireless connections in the dearth of any centralized control or some supporting services. The
mobile ad hoc network is at risk by its environment because of the vulnerabilities at channel and
node level. The conventional security mechanisms deals with only protecting resources from unauthorized access, but are not capable to safeguard the network from who offer resources. Adding trust to the on hand security infrastructures would improvise the security of these environments. A trust oriented security framework for adhoc network using ontological engineering approach is proposed by modeling ad hoc network, the OLSR (Optimized Link State Routing) protocol and trust model as OWL (Ontology Web language) ontologies, which are integrated using Jena. In this model, a trustor can calculate its trust about trustee and use the calculated trust values to make decisions depending on the context of the application or interaction about granting or rejecting it. A number of experiments with a potential implementation of suggested framework are performed to validate the characteristics of a trust oriented model suggested by the literature by this framework
A DISTRIBUTED TRUST MANAGEMENT FRAMEWORK FOR DETECTING MALICIOUS PACKET DROPP...IJNSA Journal
In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of any clear lines of defense. Most of the currently existingsecurity algorithms designed for these networks are insecure, in efficient, and have low detection accuracy for nodes’ misbehaviour. In this paper, a new approach has been proposed to bring out the complementary relationship between key distribution and misbehaviour detection for developing an integrated security solution for MANETs. The redundancy of routing inform ation in ad hoc networks is utilized to develop a highly reliable protocol that works even in presence of transient network
partitioning and Byzantine failure of nodes. The proposed mechanism is fully co-operative, and thus it is more robust as the vulnerabilities of the election algorithms used for choosing the subset of nodes for cooperation are absent. Simulation results show the effectiveness of the proposed protocol.
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.
PROACTIVE DETECTION OF DDOS ATTACKS IN PUBLISH-SUBSCRIBE NETWORKSIJNSA Journal
Abstract. Information centric networking (ICN) using architectures such as Publish-Subscribe Internet
Routing Paradigm (PSIRP) or Publish-Subscribe Internet Technology (PURSUIT) has been proposed as an
important candidate for the Internet of the future. ICN is an emerging research area that proposes a
transformation of the current host centric Internet architecture into an architecture where information
items are of primary importance. This change allows network functions such as routing and locating to be
optimized based on the information items themselves. The Bloom filter based content delivery is a sourcerouting
scheme that is used in the PSIRP/PURSUIT architectures. Although this mechanism solves many
issues of today’s Internet such as the growth of the routing table and the scalability problems, it is
vulnerable to distributed denial-of-service (DDoS) attacks. In this paper, we present a new content delivery
scheme that has the advantages of Bloom filter based approach while at the same time being able to
prevent DDoS attacks on the forwarding mechanism. Our security analysis suggests that with the proposed
approach, the forwarding plane is able to resist attacks such as DDoS with very high probability.
THE NASH’S BALANCE IN THE THEORY OF GAMES FOR A SECURE MODEL MECHANISM IN ROU...ijcisjournal
The present work is dedicated to study attacks and countermeasure in MANET. After a short introduction to what the Mobile Ad hoc Networks (MANETs) are and network security we present a survey of various attacks in MANETs pertaining to fail routing protocols. We present the different tools used by these attacks and the mechanisms used by the secured routing protocols to counter them. We also study a mechanism of security, named the reputation, proposed for the MANETs and the protocol which implements it. We also propose a secure mechanism which is based on the reputation. Our work ends with a proposal analytical model to the modules of our mechanism and the equilibrium states of our model.
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.
TRUST ORIENTED SECURITY FRAMEWORK FOR AD HOC NETWORKcscpconf
An ad hoc network is a group of wireless mobile hosts that are connected momentarily through
wireless connections in the dearth of any centralized control or some supporting services. The
mobile ad hoc network is at risk by its environment because of the vulnerabilities at channel and
node level. The conventional security mechanisms deals with only protecting resources from unauthorized access, but are not capable to safeguard the network from who offer resources. Adding trust to the on hand security infrastructures would improvise the security of these environments. A trust oriented security framework for adhoc network using ontological engineering approach is proposed by modeling ad hoc network, the OLSR (Optimized Link State Routing) protocol and trust model as OWL (Ontology Web language) ontologies, which are integrated using Jena. In this model, a trustor can calculate its trust about trustee and use the calculated trust values to make decisions depending on the context of the application or interaction about granting or rejecting it. A number of experiments with a potential implementation of suggested framework are performed to validate the characteristics of a trust oriented model suggested by the literature by this framework
A DISTRIBUTED TRUST MANAGEMENT FRAMEWORK FOR DETECTING MALICIOUS PACKET DROPP...IJNSA Journal
In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of any clear lines of defense. Most of the currently existingsecurity algorithms designed for these networks are insecure, in efficient, and have low detection accuracy for nodes’ misbehaviour. In this paper, a new approach has been proposed to bring out the complementary relationship between key distribution and misbehaviour detection for developing an integrated security solution for MANETs. The redundancy of routing inform ation in ad hoc networks is utilized to develop a highly reliable protocol that works even in presence of transient network
partitioning and Byzantine failure of nodes. The proposed mechanism is fully co-operative, and thus it is more robust as the vulnerabilities of the election algorithms used for choosing the subset of nodes for cooperation are absent. Simulation results show the effectiveness of the proposed protocol.
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.
PROACTIVE DETECTION OF DDOS ATTACKS IN PUBLISH-SUBSCRIBE NETWORKSIJNSA Journal
Abstract. Information centric networking (ICN) using architectures such as Publish-Subscribe Internet
Routing Paradigm (PSIRP) or Publish-Subscribe Internet Technology (PURSUIT) has been proposed as an
important candidate for the Internet of the future. ICN is an emerging research area that proposes a
transformation of the current host centric Internet architecture into an architecture where information
items are of primary importance. This change allows network functions such as routing and locating to be
optimized based on the information items themselves. The Bloom filter based content delivery is a sourcerouting
scheme that is used in the PSIRP/PURSUIT architectures. Although this mechanism solves many
issues of today’s Internet such as the growth of the routing table and the scalability problems, it is
vulnerable to distributed denial-of-service (DDoS) attacks. In this paper, we present a new content delivery
scheme that has the advantages of Bloom filter based approach while at the same time being able to
prevent DDoS attacks on the forwarding mechanism. Our security analysis suggests that with the proposed
approach, the forwarding plane is able to resist attacks such as DDoS with very high probability.
THE NASH’S BALANCE IN THE THEORY OF GAMES FOR A SECURE MODEL MECHANISM IN ROU...ijcisjournal
The present work is dedicated to study attacks and countermeasure in MANET. After a short introduction to what the Mobile Ad hoc Networks (MANETs) are and network security we present a survey of various attacks in MANETs pertaining to fail routing protocols. We present the different tools used by these attacks and the mechanisms used by the secured routing protocols to counter them. We also study a mechanism of security, named the reputation, proposed for the MANETs and the protocol which implements it. We also propose a secure mechanism which is based on the reputation. Our work ends with a proposal analytical model to the modules of our mechanism and the equilibrium states of our model.
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.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Anonymous Communication for Providing More Privacy and Securityijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A mobile Ad-hoc network (MANET) is an impulsive network that can be recognized with no predetermined infrastructure. To achieve safe path selection cryptographic key exchange was implemented mostly in turn of huge computational cost. Confidence based coordination in MANET focuses on routing challenges created by selfish nodes, as energy utilization & time factor are key issues in this aspect. The present protocol is focused on fuzzy optimization-based node confidence estimation and path selection with minimum energy utilization. The node with maximum confidence value will give high priority to include in the path for transmission. In the implemented protocol to build a novel confidence-based model multidimensional factors like confidence value, link cost, degree of node and node energy are included as decision-making factors. The proposed protocol CLBNSRM estimates confidence level in four steps to decide a trustworthiness of neighboring node. To estimate the efficiency of the present confidence model various protocols are compared by using attributes like the number of nodes, node speed, malicious node variation, etc. Moreover, different parameters like Packet delivery ratio, Throughput, Residual energy, and Packet dropped are considered with these attribute variations. Experimental results indicate that PDR and Throughput increase although in presence of malicious nodes, along with the utilization of minimal energy. Statistical analysis is carried out for mathematical modeling. This analysis shows that a linear model of an implemented protocol is better than compared protocol with all the aspects.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
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.
Implementation of New Routing Protocol for Node Security in a Mobile Ad Hoc N...CSCJournals
A routing protocol plays important role to handle entire network for communication and determines the paths of packets. A node is a part of the defined network for transferring information in form of packets. If all packets transferred from source to destination successfully, it has been assumed that the routing protocol is good. But, an attacker turns this dealing as a speed breaker and turning point of a highway. So, prevention from attacks and secure packets, a new routing protocol is being introduced in this paper. The proposed routing protocol is called by SNAODV (Secure Node AODV). This paper is also tried to maximize throughput as compared with AODV and SAODV.
Secure Multi-Party Negotiation: An Analysis for Electronic Payments in Mobile...IDES Editor
This paper is an attempt to base on auctions which
presents a frame work for the secure multi-party decision
protocols. In addition to the implementations which are very
light weighted, the main focus is on synchronizing security
features for avoiding agreements manipulations and reducing
the user traffic. Through this paper one can understand that
this different auction protocols on top of the frame work can
be collaborated using mobile devices. This paper present the
negotiation between auctioneer and the proffered and this
negotiation shows that multiparty security is far better than
the existing system.
Analysis of threats and security issues evaluation in mobile P2P networks IJECEIAES
Technically, mobile P2P network system architecture can consider as a distributed architecture system (like a community), where the nodes or users can share all or some of their own software and hardware resources such as (applications store, processing time, storage, network bandwidth) with the other nodes (users) through Internet, and these resources can be accessible directly by the nodes in that system without the need of a central coordination node. The main structure of our proposed network architecture is that all the nodes are symmetric in their functions. In this work, the security issues of mobile P2P network system architecture such as (web threats, attacks and encryption) will be discussed deeply and then we propose different approaches and we analysis and evaluation of these mobile P2P network security issues and submit some proposal solutions to resolve the related problems with threats and other different attacks since these threats and attacks will be serious issue as networks are growing up especially with mobility attribute in current P2P networks.
Trust Management for Secure Routing Forwarding Data Using Delay Tolerant Netw...rahulmonikasharma
Delay Tolerant Networks (DTNs) have established the connection to source and destination. For example this often faces disconnection and unreliable wireless connections. A delay tolerant network (DTNs) provides a network imposes disruption or delay. The delay tolerant networks operate in limited resources such as memory size, central processing unit. Trust management protocol uses a dynamic threshold updating which overcomes the problems .The dynamic threshold update reduces the false detection probability of the malicious nodes. The system proposes a secure routing management schemes to adopt information security principles successfully. It analyzes the basic security principles and operations for trust authentication which is applicable in delay tolerant networks (DTNs).For security the proposed system identifies the store and forward approach in network communications and analyzes the routing in cases like selfish contact and collaboration contact methods. The proposed method identifies ZRP protocol scheme and it enhances the scheme using methods namely distributed operation, mobility, delay analysis, security association and trust modules. This security scheme analyzes the performance analysis and proposed algorithm based on parameter time, authentication, security, and secure routing. From this analysis, this research work identifies the issues in DTNs secure routing and enhances ZRP (Zone Routing Protocol) by suggesting an authentication principle as a noted security principle for extremely information security concepts.
The usage of VPN services not only helps to connect different entities and organizations, it as well forms the critical component upon which various interactive services related to offering internet coverage. As various business localities and settings relating to private network augments so does the various interconnecting prerequisites as well as the network intricacy. The usage of VPN as well forms a decisive aspect for the reason that network management has turned out to be more essential and even more expensive. Undeniably, a good number of the large private networks often surpass the dimension and intricacy of smaller ones, and it is a reason as to why the virtual private network has to be excellently studied to showcase the diverse benefits that permit it to connect, retain and even sustain diverse business models. In this regard, the paper aims to discuss the diverse interconnect functionalities of VPN; it examines various VPN operations along with the various network security concerns.
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONSIJCNC
The trust and reputation models were introduced to restrain the impacts caused by rational but selfish
peers in P2P streaming systems. However, these models face with two major challenges from dishonest
feedback and strategic altering behaviors. To answer these challenges, we present a global trust model
based on network community, evaluation correlations, and punishment mechanism. We also propose a
two-layered overlay to provide the function of peers’ behaviors collection and malicious detection.
Furthermore, we analysis several security threats in P2P streaming systems, and discuss how to defend
with them by our trust mechanism. The simulation results show that our trust framework can successfully
filter out dishonest feedbacks by using correlation coefficients. It can effectively defend against the
security threats with good load balance as well.
Making Trust Relationship For Peer To Peer System With Secure ProtocolIJMER
In the peer-to-peer systems exposes them to malicious activity. Building trust relationships
among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that
enable a peer to reason about trust worthiness of other peers based on past interactions and
recommendations. Peers create their own trust network in their proximity by using local information
available and do not try to learn global trust information. Two contexts of trust, service, and
recommendation contexts are defined to measure trustworthiness in providing services and giving
recommendations. So, neighbouring node will give the recommendation to peer. Based on the
recommendation only Peer decides whether the node is good (or) malicious. Find the node is
malicious node means peer will not interact with malicious node. Isolate the malicious node from the
network. Find the node is good means peer interact with good peer. Peer stores a separate history of
interactions for each Acquaintance. This paper also discuss the malicious threats, privacy concerns,
and security risks of three commonpeer-to-peer network systems that are gaining popularity today.
The malicious threats discussed willinclude how malicious threats can harness existing peer-to-peer
networks, and how peer-to-peernetworking provides an additional (potentially unprotected) vector of
delivery for malicious code.
AUTHENTICATION USING TRUST TO DETECT MISBEHAVING NODES IN MOBILE AD HOC NETWO...IJNSA Journal
Providing security in Mobile Ad Hoc Network is crucial problem due to its open shared wireless medium,
multi-hop and dynamic nature, constrained resources, lack of administration and cooperation.
Traditionally routing protocols are designed to cope with routing operation but in practice they may be
affected by misbehaving nodes so that they try to disturb the normal routing operations by launching
different attacks with the intention to minimize or collapse the overall network performance. Therefore
detecting a trusted node means ensuring authentication and securing routing can be expected. In this
article we have proposed a Trust and Q-learning based Security (TQS) model to detect the misbehaving
nodes over Ad Hoc On Demand Distance-Vector (AODV) routing protocol. Here we avoid the misbehaving
nodes by calculating an aggregated reward, based on the Q-learning mechanism by using their historical
forwarding and responding behaviour by the way misbehaving nodes can be isolated.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Anonymous Communication for Providing More Privacy and Securityijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A mobile Ad-hoc network (MANET) is an impulsive network that can be recognized with no predetermined infrastructure. To achieve safe path selection cryptographic key exchange was implemented mostly in turn of huge computational cost. Confidence based coordination in MANET focuses on routing challenges created by selfish nodes, as energy utilization & time factor are key issues in this aspect. The present protocol is focused on fuzzy optimization-based node confidence estimation and path selection with minimum energy utilization. The node with maximum confidence value will give high priority to include in the path for transmission. In the implemented protocol to build a novel confidence-based model multidimensional factors like confidence value, link cost, degree of node and node energy are included as decision-making factors. The proposed protocol CLBNSRM estimates confidence level in four steps to decide a trustworthiness of neighboring node. To estimate the efficiency of the present confidence model various protocols are compared by using attributes like the number of nodes, node speed, malicious node variation, etc. Moreover, different parameters like Packet delivery ratio, Throughput, Residual energy, and Packet dropped are considered with these attribute variations. Experimental results indicate that PDR and Throughput increase although in presence of malicious nodes, along with the utilization of minimal energy. Statistical analysis is carried out for mathematical modeling. This analysis shows that a linear model of an implemented protocol is better than compared protocol with all the aspects.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
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.
Implementation of New Routing Protocol for Node Security in a Mobile Ad Hoc N...CSCJournals
A routing protocol plays important role to handle entire network for communication and determines the paths of packets. A node is a part of the defined network for transferring information in form of packets. If all packets transferred from source to destination successfully, it has been assumed that the routing protocol is good. But, an attacker turns this dealing as a speed breaker and turning point of a highway. So, prevention from attacks and secure packets, a new routing protocol is being introduced in this paper. The proposed routing protocol is called by SNAODV (Secure Node AODV). This paper is also tried to maximize throughput as compared with AODV and SAODV.
Secure Multi-Party Negotiation: An Analysis for Electronic Payments in Mobile...IDES Editor
This paper is an attempt to base on auctions which
presents a frame work for the secure multi-party decision
protocols. In addition to the implementations which are very
light weighted, the main focus is on synchronizing security
features for avoiding agreements manipulations and reducing
the user traffic. Through this paper one can understand that
this different auction protocols on top of the frame work can
be collaborated using mobile devices. This paper present the
negotiation between auctioneer and the proffered and this
negotiation shows that multiparty security is far better than
the existing system.
Analysis of threats and security issues evaluation in mobile P2P networks IJECEIAES
Technically, mobile P2P network system architecture can consider as a distributed architecture system (like a community), where the nodes or users can share all or some of their own software and hardware resources such as (applications store, processing time, storage, network bandwidth) with the other nodes (users) through Internet, and these resources can be accessible directly by the nodes in that system without the need of a central coordination node. The main structure of our proposed network architecture is that all the nodes are symmetric in their functions. In this work, the security issues of mobile P2P network system architecture such as (web threats, attacks and encryption) will be discussed deeply and then we propose different approaches and we analysis and evaluation of these mobile P2P network security issues and submit some proposal solutions to resolve the related problems with threats and other different attacks since these threats and attacks will be serious issue as networks are growing up especially with mobility attribute in current P2P networks.
Trust Management for Secure Routing Forwarding Data Using Delay Tolerant Netw...rahulmonikasharma
Delay Tolerant Networks (DTNs) have established the connection to source and destination. For example this often faces disconnection and unreliable wireless connections. A delay tolerant network (DTNs) provides a network imposes disruption or delay. The delay tolerant networks operate in limited resources such as memory size, central processing unit. Trust management protocol uses a dynamic threshold updating which overcomes the problems .The dynamic threshold update reduces the false detection probability of the malicious nodes. The system proposes a secure routing management schemes to adopt information security principles successfully. It analyzes the basic security principles and operations for trust authentication which is applicable in delay tolerant networks (DTNs).For security the proposed system identifies the store and forward approach in network communications and analyzes the routing in cases like selfish contact and collaboration contact methods. The proposed method identifies ZRP protocol scheme and it enhances the scheme using methods namely distributed operation, mobility, delay analysis, security association and trust modules. This security scheme analyzes the performance analysis and proposed algorithm based on parameter time, authentication, security, and secure routing. From this analysis, this research work identifies the issues in DTNs secure routing and enhances ZRP (Zone Routing Protocol) by suggesting an authentication principle as a noted security principle for extremely information security concepts.
The usage of VPN services not only helps to connect different entities and organizations, it as well forms the critical component upon which various interactive services related to offering internet coverage. As various business localities and settings relating to private network augments so does the various interconnecting prerequisites as well as the network intricacy. The usage of VPN as well forms a decisive aspect for the reason that network management has turned out to be more essential and even more expensive. Undeniably, a good number of the large private networks often surpass the dimension and intricacy of smaller ones, and it is a reason as to why the virtual private network has to be excellently studied to showcase the diverse benefits that permit it to connect, retain and even sustain diverse business models. In this regard, the paper aims to discuss the diverse interconnect functionalities of VPN; it examines various VPN operations along with the various network security concerns.
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONSIJCNC
The trust and reputation models were introduced to restrain the impacts caused by rational but selfish
peers in P2P streaming systems. However, these models face with two major challenges from dishonest
feedback and strategic altering behaviors. To answer these challenges, we present a global trust model
based on network community, evaluation correlations, and punishment mechanism. We also propose a
two-layered overlay to provide the function of peers’ behaviors collection and malicious detection.
Furthermore, we analysis several security threats in P2P streaming systems, and discuss how to defend
with them by our trust mechanism. The simulation results show that our trust framework can successfully
filter out dishonest feedbacks by using correlation coefficients. It can effectively defend against the
security threats with good load balance as well.
Making Trust Relationship For Peer To Peer System With Secure ProtocolIJMER
In the peer-to-peer systems exposes them to malicious activity. Building trust relationships
among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that
enable a peer to reason about trust worthiness of other peers based on past interactions and
recommendations. Peers create their own trust network in their proximity by using local information
available and do not try to learn global trust information. Two contexts of trust, service, and
recommendation contexts are defined to measure trustworthiness in providing services and giving
recommendations. So, neighbouring node will give the recommendation to peer. Based on the
recommendation only Peer decides whether the node is good (or) malicious. Find the node is
malicious node means peer will not interact with malicious node. Isolate the malicious node from the
network. Find the node is good means peer interact with good peer. Peer stores a separate history of
interactions for each Acquaintance. This paper also discuss the malicious threats, privacy concerns,
and security risks of three commonpeer-to-peer network systems that are gaining popularity today.
The malicious threats discussed willinclude how malicious threats can harness existing peer-to-peer
networks, and how peer-to-peernetworking provides an additional (potentially unprotected) vector of
delivery for malicious code.
AUTHENTICATION USING TRUST TO DETECT MISBEHAVING NODES IN MOBILE AD HOC NETWO...IJNSA Journal
Providing security in Mobile Ad Hoc Network is crucial problem due to its open shared wireless medium,
multi-hop and dynamic nature, constrained resources, lack of administration and cooperation.
Traditionally routing protocols are designed to cope with routing operation but in practice they may be
affected by misbehaving nodes so that they try to disturb the normal routing operations by launching
different attacks with the intention to minimize or collapse the overall network performance. Therefore
detecting a trusted node means ensuring authentication and securing routing can be expected. In this
article we have proposed a Trust and Q-learning based Security (TQS) model to detect the misbehaving
nodes over Ad Hoc On Demand Distance-Vector (AODV) routing protocol. Here we avoid the misbehaving
nodes by calculating an aggregated reward, based on the Q-learning mechanism by using their historical
forwarding and responding behaviour by the way misbehaving nodes can be isolated.
AUTHENTICATION USING TRUST TO DETECT MISBEHAVING NODES IN MOBILE AD HOC NETWO...IJNSA Journal
Providing security in Mobile Ad Hoc Network is crucial problem due to its open shared wireless medium, multi-hop and dynamic nature, constrained resources, lack of administration and cooperation. Traditionally routing protocols are designed to cope with routing operation but in practice they may be affected by misbehaving nodes so that they try to disturb the normal routing operations by launching different attacks with the intention to minimize or collapse the overall network performance. Therefore detecting a trusted node means ensuring authentication and securing routing can be expected. In this article we have proposed a Trust and Q-learning based Security (TQS) model to detect the misbehaving nodes over Ad Hoc On Demand Distance-Vector (AODV) routing protocol. Here we avoid the misbehaving nodes by calculating an aggregated reward, based on the Q-learning mechanism by using their historical forwarding and responding behaviour by the way misbehaving nodes can be isolated.
IMPROVING HYBRID REPUTATION MODEL THROUGH DYNAMIC REGROUPINGijp2p
Peer-to-Peer (P2P) systems have the ability to bond with millions of clients in business and knowledge
scenario. The mechanism that leads users to distribute files without the need of centralized servers has
achieved wide recognition among internet users. This also permits for a range of applications further than
simple file sharing. he main problem lies in the fact that peers have to customarily intermingle with
mysterious peers in the absence of trusted third parties. Usually the lack of incentives often makes these
strange peers to act as freeriders and thus reduce the system performance. The trustworthiness among
peers is portrayed by applying the knowledge obtained as a result of reputation mechanisms. This paper
endows with a new reputation model in association with a detailed survey of diverse reputation models. The
proposed model suggests a hybrid reputation model through dynamic regrouping..
Mitigating Various Attacks in Mobile Ad-hoc Networks Using Trust Based ApproachIJLT EMAS
A Mobile ad hoc network (MANET) is self-organizing,
decentralized and infrastructure-less wireless network. The
successful transmission of the data packet depends on the
complete cooperation of each node in the network. These types of
network don’t have permanent base station, so each node in the
network acts as a router. Due to openness, decentralized, selforganizing
nature of MANET, it is vulnerable to various attacks.
So security is the main concern in MANET.
In this project, we have considered 2 attacks; Vampire
attack and DDoS attacks. Vampire attack drains the energy of
the nodes. DDoS attack exhausts the resources available to a
network, such that the node cannot provide any services. Here,
we discuss methods 2 methods as a solution to our problem; one
is to prevent the attack from happening and other to detect and
recover from the attacks.
An exaustive survey of trust models in p2 p networkijwscjournal
Most of the peers accessing the services are under the assumption that the service accessed in a P2P
network is utmost secured. By means of prevailing hard security mechanisms, security goals like
authentication, authorization, privacy, non repudiation of services and other hard security issues are
resolved. But these mechanisms fail to provide soft security. An exhaustive survey of existing trust and
reputation models in P2P network regarding service provisioning is presented and challenges are listed.
Trust issues like trust bootstrapping, trust evidence procurement, trust assessment, trust interaction
outcome evaluation and other trust based classification of peer’s behavior into trusted,, inconsistent, un
trusted, malicious, betraying, redemptive are discussed,
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.
Weighted Coefficient Firefly Optimization Algorithm and Support Vector Machin...IJCNCJournal
Cloud computing is widely used by organizations and individuals due to its flexibility and reliability. The trust model is important for cloud computing to detect malicious users and protect user privacy. The existing research faces the issues of local optima trap and overfitting problems when a training user node is idle for more time. This research proposed Weighted Coefficient Firefly Optimization Algorithm (WCFOA) with Support Vector Machine (SVM) for the trust model calculation and identifying paths with better Quality of Services (QoS). The weighted coefficient is added to the FOA model to balance the exploration and exploitation in the search of identifying optimal path based on reliability score. The WC-FOA method measures the link reliability in the model and SVM detects the malicious users in the model. The WC-FOA model selects the optimal path for transmission in terms of trust and efficient QoS parameters. The entropy measure and link reliability are provided as input to the SVM model for the detection of attacks in the network. The WCFOA-SVM model has 96% malicious user detection, whereas the Random Forest Hierarchical Ant Colony Optimization (RF-HEACO) has 92 % accuracy.
WEIGHTED COEFFICIENT FIREFLY OPTIMIZATION ALGORITHM AND SUPPORT VECTOR MACHIN...IJCNCJournal
Cloud computing is widely used by organizations and individuals due to its flexibility and reliability. The trust model is important for cloud computing to detect malicious users and protect user privacy. The existing research faces the issues of local optima trap and overfitting problems when a training user node is idle for more time. This research proposed Weighted Coefficient Firefly Optimization Algorithm (WCFOA) with Support Vector Machine (SVM) for the trust model calculation and identifying paths with better Quality of Services (QoS). The weighted coefficient is added to the FOA model to balance the exploration and exploitation in the search of identifying optimal path based on reliability score. The WC-FOA method measures the link reliability in the model and SVM detects the malicious users in the model. The WC-FOA model selects the optimal path for transmission in terms of trust and efficient QoS parameters. The entropy measure and link reliability are provided as input to the SVM model for the detection of attacks in the network. The WCFOA-SVM model has 96% malicious user detection, whereas the Random Forest Hierarchical Ant Colony Optimization (RF-HEACO) has 92 % accuracy.
AN EXAUSTIVE SURVEY OF TRUST MODELS IN P2P NETWORKijwscjournal
Most of the peers accessing the services are under the assumption that the service accessed in a P2P network is utmost secured. By means of prevailing hard security mechanisms, security goals like authentication, authorization, privacy, non repudiation of services and other hard security issues are resolved. But these mechanisms fail to provide soft security. An exhaustive survey of existing trust and reputation models in P2P network regarding service provisioning is presented and challenges are listed. Trust issues like trust bootstrapping, trust evidence procurement, trust assessment, trust interaction outcome evaluation and other trust based classification of peer’s behavior into trusted,, inconsistent, un
trusted, malicious, betraying, redemptive are discussed,
AN EXAUSTIVE SURVEY OF TRUST MODELS IN P2P NETWORKijwscjournal
ABSTRACT
Most of the peers accessing the services are under the assumption that the service accessed in a P2P
network is utmost secured. By means of prevailing hard security mechanisms, security goals like
authentication, authorization, privacy, non repudiation of services and other hard security issues are
resolved. But these mechanisms fail to provide soft security. An exhaustive survey of existing trust and
reputation models in P2P network regarding service provisioning is presented and challenges are listed.
Trust issues like trust bootstrapping, trust evidence procurement, trust assessment, trust interaction
outcome evaluation and other trust based classification of peer’s behavior into trusted,, inconsistent, un
trusted, malicious, betraying, redemptive are discussed,
Routing and Security Issues for Trust Based Framework in Mobile Ad Hoc Networksiosrjce
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.
Abstract Peers are more likely to get exposed to malicious activities in P2P system due to its open nature, building the trust environment in P2P can mitigate these attacks. This paper is about the implementation of SORT model in peer to peer systems. The SORT model deals with the isolation of malicious and trusted peer in the LAN (Local Area Network). The isolation is done on the basis of the file uploaded by a peer, i.e. if he uploads an infected file in the proximity then the SORT model restricts the download of the infected file and thus protect the other peers from getting affected by the virus. File download is treated as an interaction. On each interaction there is calculation of some trust factor and the values are assigned by the downloader according to his satisfaction. Every peer calculates its own trust values regarding to other peers. These values are need to decide the further interactions in the network. Two types of attacks are mitigated by this model are Service based and Recommendation based. This project mainly deals with the security in the P2P system and acknowledges the peer whether the service he wants to use is clean or infected. This Project is implemented in Advanced JAVA and the MySQL database is used. The MVC architecture is used for building of this project. Peer calculate the trust metrics of each peer in its proximity they does this locally and do not tend to be global. Keywords: P2P systems, Trusted Environment, Reputation, Recommendation, Security, Services.
On client’s interactive behaviour to design peer selection policies for bitto...IJCNCJournal
Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet.
This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand
streaming system. The vast majority of these proposals focus on modifying the piece and peer selection
policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been
given to the piece selection policy rather than to the peer selection policy. Within this context, this article
proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols,
considering interactive scenarios. To this end, we analyze the client’s interactive behaviour when accessing
real multimedia systems. This analysis consists of looking into workloads of real content providers and
assessing three important metrics, namely temporal dispersion, spatial dispersion and object position
popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our
knowledge, this is the first time that the client’s interactive behaviour is specially considered to derive an
algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges
and possible future work in this research field.
Secure system based on recombined fingerprints for sharing multimedia files i...eSAT Journals
Abstract In this paper the execution time is less when compared to previous algorithm. And also it provide security between the merchant and buyer The traitor tracing protocol is used to detect the illegal transaction. Here we used fingerprinting solution to avoid illegal redistribution of multimedia contents. Here we convert the multimedia video file into image then encrypting the image after the encrypted image will be transferred from merchant to buyer. The buyer receives the copyright protection from merchant, he decrypts the image then converts it into video. After that, the copyright protection of file is transferred to child buyer. Then tracing traitor protocol is used to checks the fingerprints for merchant to buyer and buyer to child buyer. Traitor tracing protocol is used to detect the illegal transaction of the content. The Blowfish algorithm is used to encrypt and decrypt the multimedia files. Finally we detect the performance of our work based on efficiency, accuracy and we achieve security. Keywords: Fingerprint, Multimedia files, Blowfish algorithm, Merchant, Buyer, Child Buyer, Copyright Protection
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...ssuser7dcef0
Power plants release a large amount of water vapor into the
atmosphere through the stack. The flue gas can be a potential
source for obtaining much needed cooling water for a power
plant. If a power plant could recover and reuse a portion of this
moisture, it could reduce its total cooling water intake
requirement. One of the most practical way to recover water
from flue gas is to use a condensing heat exchanger. The power
plant could also recover latent heat due to condensation as well
as sensible heat due to lowering the flue gas exit temperature.
Additionally, harmful acids released from the stack can be
reduced in a condensing heat exchanger by acid condensation. reduced in a condensing heat exchanger by acid condensation.
Condensation of vapors in flue gas is a complicated
phenomenon since heat and mass transfer of water vapor and
various acids simultaneously occur in the presence of noncondensable
gases such as nitrogen and oxygen. Design of a
condenser depends on the knowledge and understanding of the
heat and mass transfer processes. A computer program for
numerical simulations of water (H2O) and sulfuric acid (H2SO4)
condensation in a flue gas condensing heat exchanger was
developed using MATLAB. Governing equations based on
mass and energy balances for the system were derived to
predict variables such as flue gas exit temperature, cooling
water outlet temperature, mole fraction and condensation rates
of water and sulfuric acid vapors. The equations were solved
using an iterative solution technique with calculations of heat
and mass transfer coefficients and physical properties.
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.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
An Approach to Detecting Writing Styles Based on Clustering Techniquesambekarshweta25
An Approach to Detecting Writing Styles Based on Clustering Techniques
Authors:
-Devkinandan Jagtap
-Shweta Ambekar
-Harshit Singh
-Nakul Sharma (Assistant Professor)
Institution:
VIIT Pune, India
Abstract:
This paper proposes a system to differentiate between human-generated and AI-generated texts using stylometric analysis. The system analyzes text files and classifies writing styles by employing various clustering algorithms, such as k-means, k-means++, hierarchical, and DBSCAN. The effectiveness of these algorithms is measured using silhouette scores. The system successfully identifies distinct writing styles within documents, demonstrating its potential for plagiarism detection.
Introduction:
Stylometry, the study of linguistic and structural features in texts, is used for tasks like plagiarism detection, genre separation, and author verification. This paper leverages stylometric analysis to identify different writing styles and improve plagiarism detection methods.
Methodology:
The system includes data collection, preprocessing, feature extraction, dimensional reduction, machine learning models for clustering, and performance comparison using silhouette scores. Feature extraction focuses on lexical features, vocabulary richness, and readability scores. The study uses a small dataset of texts from various authors and employs algorithms like k-means, k-means++, hierarchical clustering, and DBSCAN for clustering.
Results:
Experiments show that the system effectively identifies writing styles, with silhouette scores indicating reasonable to strong clustering when k=2. As the number of clusters increases, the silhouette scores decrease, indicating a drop in accuracy. K-means and k-means++ perform similarly, while hierarchical clustering is less optimized.
Conclusion and Future Work:
The system works well for distinguishing writing styles with two clusters but becomes less accurate as the number of clusters increases. Future research could focus on adding more parameters and optimizing the methodology to improve accuracy with higher cluster values. This system can enhance existing plagiarism detection tools, especially in academic settings.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Trust Based Content Distribution for Peer-ToPeer Overlay Networks
1. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
10.5121/ijnsa.2010.2211 134
Trust Based Content Distribution for Peer-To-
Peer Overlay Networks
S.Ayyasamy1
and S.N. Sivanandam2
1
Asst. Professor, Department of Information Technology,
Tamilnadu College of Engineering, Coimbatore-641 659, Tamil Nadu, INDIA.
Email: ayyasamyphd@gmail.com
2
Professor and Head, Department of Computer Science and Engineering,
PSG College of Technology, Peelamedu, Coimbatore-641 004, Tamil Nadu, INDIA.
Abstract
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.
Keywords
Replica, Overlay, Clusters, QoS, Content, Routing
1. Introduction
Peer -to-Peer Overlay Network
Peer-to-peer networks follow a different paradigm than client-server based systems. A
key underlying attribute is that each node participates in the network by offering and using
services at the same time. There is no central control and the network organizes itself in a
dynamic way. A peer-to-peer (P2P) system is defined as follows: “Peer-to-peer (P2P) systems are
distributed systems without any centralized control or hierarchical organization, where the
software running at each node is equivalent in functionality”
Because P2P networks are built at the application layer and use the underlying network
for the exchange of messages, P2P systems are also called overlay networks. P2P networks have
evolved in recent years. Early systems (e.g., Gnutella) used flooding for message routing in the
network. Any node receiving a search request would broadcast this message to all its neighbors.
The message has a time-to-live value which is reduced at every hop to prevent messages from
being routed in the network forever. These systems cannot give any formal guarantees that a
message in the network will reach its destination. Furthermore, broadcast messages impose an
unnecessary traffic burden on the network [1].
2. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
135
Emerging peer-to-peer (P2P) applications benefit from the large amount of resources
provided by many individual peers. Using sophisticated techniques for aggregation and
Replication of these resources, P2P-based systems are able to provide a much higher robustness
and performance than traditional client/server-based applications. For example, file-sharing
applications like eMule or Bit Torrent [2] are able to provide access to huge amount of content in
a reliable way. At the same time, an increasing number of applications make use of basic P2P
network infrastructures like Chord [3] or Pastry and benefit from the good scalability properties
of these systems [4].
Peer-to-Peer Content Distribution
Peer-to-Peer (P2P) content sharing service has grown in significance on the Internet, both
in terms of the number of participating users and the traffic volume. However, due to the self-
organization and self-maintenance nature of P2P overlay networks, each participating user has to
manage the potential risks involved in the application transactions without adequate experience
and knowledge about other users [5].
Content distribution via peer-to-peer networks goes a step beyond towards a completely
distributed structure involving the resources of the peers interested in the content. P2P content
distribution allows for more flexibility in the overlay network, which may be structured according
to different content e.g. by trackers for each item in the Bit Torrent network or according to other
criteria. The size of the overlay can automatically adjust to the population of peers and thus user
demand with a replication strategy for the data being set up by the P2P protocol [6].
Security Challenges
Because P2P systems are inherently different from client-server systems, new challenges
for security arise. For instance, the lack of a central authority makes authentication in a pure P2P
network 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. Douceur showed in that without a trusted agency which certifies identities,
adversary nodes can control a large fraction of an overlay network. Castro et al. identify three
requirements for secure structured overlay networks: secure node-ID assignment, secure routing
table maintenance, and secure message forwarding [1].
Threats specific to P2P-SIP include subversion of the identity-mapping scheme attacks
on the overlay network routine scheme, bootstrapping communications in the presence of
malicious first-contact nodes, identity enforcement (Sybil attacks), traffic analysis and privacy
violation by intermediate nodes, and free riding by nodes that refuse to route calls or otherwise
participate in the protocol other than to obtain service for themselves (selfish behavior).
The modern P2P systems need to deal with selfish (a.k.a “leechers” or “free-riders”) or
malicious users1, P2P worms , Byzantine faults and Sybil attacks, Eclipse attacks, flash crowds,
etc. Some of these problems are particularly challenging for large-scale, peer-to-peer systems [7].
Current research efforts have mainly focused on trust management techniques to
recognize trustworthy peers on P2P network. For collecting peers trust values in the P2P network,
majority of approaches presented in this area uses special algorithms. In this paper, we present a
trust based content distribution for peer-to-peer overlay networks, which is built on the trust
management scheme. To evaluate traffic from other peers and dynamically update their trust
values by a peer, this trust scheme is used. This paper is an extension of our previous work [12].
3. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
136
2. Related Works
Ruichuan Chen et al [5] have proposed a unique poisoning-resistant security framework
based on the idea that the only trusted sources to verify the integrity of the requested content
would be the content providers. A content provider publishes the information of his shared
contents to a group of content maintainers self-organized in a security overlay, to present the
mechanisms of availability and scalability. Hence a content requestor can confirm the integrity of
the requested content from the associated content maintainers. They have devised a scalable
probabilistic verification scheme, to further enhance the system performance.
B. Mortazavi et al [7] have first provided a survey of related systems. They then have
focused on content distribution networks that have honest but sensibly selfish users. Their focus
is to expand a novel reputation framework, in which in the absence of misrepresentation of the
reputation values can reveal the tendency to cooperate of the peers. Based on their framework, a
game is designed in which users play to maximize the files received from the system by adjusting
their cooperation level and gaining a better reputation as a result.
Thomas Repantis et al [8] have proposed a decentralized trust management middleware,
based on reputation for unstructured, ad-hoc, peer-to-peer networks. In their middleware to
requests for data or services, the reputation information of each peer is stored in its neighbors and
piggy-backed on its replies. In self-organizing networks the lack of structure and the dynamic
nature of the network are usually regarded as barriers in managing trust information. Their
approach utilizes these characteristics to build a self-organizing, non-intrusive trust management
infrastructure resistant to tampering and collusions.
V. Valli Kumari et al [9] have offered a weighted feedback based reputation computation.
With dynamic correction, this mechanism attempts to solve the reputation computation problem.
The simulation results with highly dynamic peer behaviors, changing malicious feedbacks and the
dynamic corrections are presented. The feasibility of their mechanism with respect to minimum
overheads of storage and retrieval are also discussed.
Mujtaba Khambatti et al [10] have proposed an approach for trust management in P2P
systems. They have established an optimistic role-based model for trust amongst peers and prove
that it is scalable, dynamic, revocable, secure and transitive. Their proposed solution allows
asymmetric trust relationships that can be verified by any peer in the system through a simple,
low-cost algorithm. The authors have introduced a metric known as iComplex which combines a
peer’s trust value for each of its roles into a single, relative, probabilistic guarantee of trust.
Finally, they have also discussed the no repudiation of peer relations and how their trust model
allows peers to revoke relationships with malicious peers.
G.H. Nguyen et al [11] have proposed a probabilistic model to handle trust in a P2P
setting. It supports a local computation and a simple form of propagation of the trust of peers into
classes of other peers. They have claimed that it is well suitable to the dynamics of P2P networks
and to the choice of each peer within the network to have different perspectives towards the peers
with which it interacts.
4. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
137
3. QoS-Aware Content Distribution and Data Retrieval
System Model
Let us consider a collection of N server nodes which form a peer to peer (P2P) overlay
network. In addition to being part of the overlay, each node functions as a server responding to
requests (queries) which come from clients outside of the overlay network. An example could be
that each node is a web server with the overlay linking the servers and clients being web browsers
on remote machines requesting content from the servers.
We assume each node always stores one copy of its own content item which it serves to
clients and that it has additional storage space to store k replicated content items from other nodes
which it can also serve [3]. The object is associated with an authoritative origin server (OS) in the
network where the content provider makes the updates to the object. The object copy located at
the origin server is called the origin copy and an object copy at any remaining server is called a
replica.
Replica Placement
In our QoS aware topology, nodes are grouped into strong and weak clusters based on
their weight vector which comprises the following parameters:
Available capacity
CPU speed
Memory size
Access Latency
In the replica placement algorithm, we classify the content as Class I and Class II, based
on their access patterns. (i.e.) The most frequently accessed contents are ranked as Class I and the
less frequently accessed contents as Class II. Then more copies of Class I content are replicated in
strong clusters (having high weight values). Routing is performed hierarchically by broadcasting
the query only to the strong clusters.
Query Search and Data Retrieval
A route discovery algorithm is needed to determine if and where the requested item is
replicated when the requester does not have knowledge of the destination.
By reducing the communication cost, the speed and efficiency of the information
retrieval mechanism can be improved. So, the number of messages exchanged between the nodes
and the number of cluster nodes that are queried for each query request, are to be minimized. For
this, a robust searching algorithm is proposed.
In this algorithm, each node maintains a profile which contains the details of queries
processed by its neighbors, within the last t seconds.
Node Id (Ni)
Query Id (Qid)
Query Hits, (Qhit)
No.of Results (NoR)
5. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
138
This profile information is used to forward the queries to the neighbors, which are having
more chances of replying to those queries.
In order to forward a query Q, to its neighbors, a node N1 assigns a score to each of its
neighbors based on their profile. To calculate the score of each node Nj, (j=2, 3…) N1 compares
.Q with all queries stored in Nj’s profile. If there is a query hit for Q, then the score of Nj can be
calculated as
m
Score (Nj, Q) = ∑ NoR (Nj, Qk) α
k=0
Where NoR (Nj, Qk) is the number of results returned by Nj for query Qk, which are
similar to Q. So the node which returns more results, get the higher score.
The value α allows us to add more weight to the most similar queries. For example, when
α is large, then the query with the largest similarity NoR (Nj, Qk) dominates the formula. If we
set α = 1, all queries are equally counted, whereas setting α=0 allows us to count only the number
of results returned by each peer.
(i) When a data request is initiated at a client, it first looks for the data item in its own
cache (local hit). If there is a local cache miss, the client sends the request to the set of strong
cluster nodes.
(ii) On receiving the request, each strong cluster node which has the requested content,
will send an ack packet to the query client to acknowledge that it has the data item. The ack
packet will contain the following fields: time stamp Ts and weight W. The time stamp field helps
to choose the latest copy of the searched item and the weight value field helps to choose the best
client node.
(iii) When the query client receive ack packets from the strong cluster, it selects the best
node Sbest with max ),( WTs
(iv) The client then check the reputation of Sbest using the trust evaluation algorithm
described in the next section.
(v) If the node Sbest is a trusted node, then the client sends a confirm packet to it. The
ack packets for the same item received from other nodes are discarded.
(vi) When the node Sbest receives a confirm packet, it responds back with the actual data
value to the requested query node.
(vii) Suppose if the requested data is not available in any strong cluster nodes, the request
is directed to the server from the query client. Then the necessary data is sent to the client from
the server. If the client has the available memory size (MZ) and bandwidth (BW), then it caches
the data in its buffer. Then it is also considered as a strong cluster node and it is propagated to
other nodes as
{Nid, Clid (“S”), d1}
6. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
139
Where Nid is the node id, Clid is the cluster id and d1… is the content database id.
4. Trust Management Scheme
Current research efforts have mainly focused on trust management techniques to
recognize trustworthy peers on P2P network. For collecting peers trust values in the P2P network,
majority of approaches presented in this area use special algorithms. 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. To evaluate
traffic from other peers and dynamically update their trust values by a peer, this trust scheme is
used.
Calculation of Trust Index (TI)
The trust value is calculated based on the factors Success of Data Delivery Ratio and
Search Time. Depending on the outcome, the Trust Index of the target t assigned by the node m
{TImt} can be calculated as follows:
TImt = w1 * Treq (1)
Where Treq is the total number of requests and
w1 = (SDR/ST)*100 (2)
Here w1 represent the trust percentage value of single data, where SDR and ST represent
Success of Data Delivery Ratio and Search Time respectively.
The Trust Index of the node increases when SDR increases and it decreases when ST
increases.
Trust Evaluation
When the data is retrieved from a target node, each node involved in content distribution,
calculates the trust index (TI) value of the target based on the retrieved data using (1) and (2).
These calculated TI values are transmitted to a set of nodes called recommenders, which
maintains a table called Trust Index Table (TIT) to store the TI values of all the targets.
When the source s wants to retrieve data from a target t, it selects the recommender nodes
from the Recommender list. Then it sends a trust request packet for the target to all
recommenders R1, R2…Rn. The recommenders send their corresponding Trust Index of the
target from the TIT to the requester. (Refer fig.1)
The aggregated trust index of t (ATIt) is calculated from all the trust index values of t
assigned by the nodes m1, m2…mn
n
ATIt = Σ TImjt (3)
j=1
7. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
140
Traffic from a peer is accepted or rejected depending on its trust index and trust threshold
scale of the peer calculating its reputation.
Two thresholds Th1 and Th2 represent host thresholds for aggregated trust index (ATI).
where, peers with ATI below Th1 are distrusted and consequently no traffic is accepted from
them. Th2 denotes full trust, peers with trust index above this value are considered trustworthy
and therefore their traffic can be fully accepted. If ATI falls between Th1 and Th2, average trust
is assigned to a peer and only part of its traffic is accepted. This trust scheme allows a peer on the
network to evaluate traffic from other peers and dynamically update their trust values.
Fig. 1. Trusting in Peer to Peer Network
Trust Evaluation Algorithm
1. Source finds the target node for data retrieval using our query search
algorithm.
2. Source selects the recommender nodes from the Recommender list.
3. The source sends a trust request packet for the target to all recommenders.
4. All recommenders send their corresponding Trust Index of the target to
the requester.
5. Requestor now calculates aggregate TI (ATI) from the entire TI received
from the recommenders.
6. It then compares the ATI with the thresholds Th1 and Th2.
7. If ATI < Th1, then
The target is distrusted.
8. Else if ATI > Th2, then
S
R1
R2
R3
Rn
T
Source Target
Recommenders
Treq
TI
8. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
141
The target is fully trusted.
9. Else if ATI >= Th1 and ATI <=Th2, then
The target is partially trusted.
10. End if
5. Experimental Results
Simulation Setup
This section deals with the experimental performance evaluation of our algorithms
through simulations. In order to test our protocol, the NS2 simulator [13] is used. We have used
the Bit Torrent packet-level simulator for P2P networks [14]. Based on the assumption that the
bottleneck of the network is at the access links of the users and not at the routers, we use a
simplified topology in our simulations. We model the network with the help of access and overlay
links. Each peer is connected with an asymmetric link to its access router. All access routers are
connected directly to each other modeling only an overlay link. This enables us to simulate
different upload and download capacities as well as different end-to-end (e2e) delays between
different peers.
Fig. 2: Topology of P2P Overlay Network
Simulation Results
We have conducted simulations for both trust-based and no trust based content
distribution scenarios. We evaluate the following metrics:
Success Ratio: It is measured as the successful downloads made per number of queries.
Delay: It is measured as the total delay occurred in sending a query and obtaining the
results.
Drop: It is the number of packets dropped during the downloading.
9. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
142
A. Varying Rate
Rate Vs Success Ratio
0.8
0.85
0.9
0.95
1
250 500 750 1000
Rate(kb)
Successratio Trust
NoTrust
Figure 3: Rate Vs Success Ratio
Rate Vs Delay
0
0.1
0.2
0.3
0.4
0.5
0.6
250 500 750 1000
Rate(kb)
Delay(s)
Trust
NoTrust
Figure 4: Rate Vs Delay
Rate Vs Drop
0
200
400
600
800
1000
250 500 750 1000
Rate(kb)
Drop(pkts.)
Trust
NoTrust
Figure 5: Rate Vs Packet Drop
In our first experiment, the query sending rate is varied from 250Kb to 1Mb. Figure 3
shows that the success ratio of the client nodes increases when trust evaluation is applied but it
decreases when trust is not applied. From Figure 4, we can see that the delay increases in case of
10. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
143
no trust scenario whereas it decreases in our trust based scenario. Figure 5 presents the packets
dropped when the rate is increased. From the figure we can see that the drop is more and
increased in case of no trust case but it is almost constant in the trust based case.
B. Varying Dishonest Nodes
No. of Dishonest Nodes Vs Success ratio
0.8
0.82
0.84
0.86
0.88
0.9
0.92
0.94
0.96
2 4 6 8 10
Dishonest nodes
Successratio
Trust
NoTrust
Figure 6: Dishonest Nodes Vs Success Ratio
No. Of Dishonest Nodes Vs Delay
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
2 4 6 8 10
Dishonest nodes
Delay(s)
Trust
NoTrust
Figure 7: Dishonest Nodes Vs Delay
No. Of Dishonest Nodes Vs Drop
0
200
400
600
800
1000
1200
2 4 6 8 10
Dishonest nodes
Drop(pkts.)
Trust
NoTrust
Figure 8: Dishonest Nodes Vs Packet Drop
11. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
144
In our second experiment, the number of dishonest nodes is varied as 2,4,6,8 and 10.
Figure 6 shows that the success ratio of the client nodes is more when trust evaluation is applied
but it is less when trust is not applied. From Figure 7, we can see that the delay is more in case of
no trust scenario whereas it is less in our trust based scenario. Figure 8 presents the packets
dropped when the dishonest nodes are increased. From the figure we can see that the drop is more
and increased in case of no trust case but it is almost constant in the trust based case.
6. Conclusion
In this paper, we have presented 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. When the data is retrieved from a
target node, each node involved in content distribution, calculates the trust index (TI) value of the
target based on the factors Success of Data Delivery Ratio and Search Time. These calculated TI
values are transmitted to a set of nodes called recommenders, which maintains a table called Trust
Index Table (TIT) to store the TI values of all the targets. When the source wants to retrieve data
from a target, it selects the recommender nodes from the Recommender list. Then it sends a trust
request packet for the target to all recommenders. The recommenders send their corresponding
Trust Index of the target from the TIT to the requester. 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 have shown that our proposed scheme achieves
increased success ratio with reduced delay and drop.
References
[1] Jan Seedorf, “Security Challenges for Peer-to-Peer SIP”, IEEE Network, September/October
2006.
[2] B. Cohen, “Incentives Build Robustness in BitTorrent”, Workshop on Economics of Peer-to- Peer
Systems, Berkeley, CA, USA, June 2003.
[3] Stoica, R. Morris, D. Karger, M. Kaashoek, H. Balakrishnan: “Chord: A Scalable Peer-to-peer
Lookup Service for Internet Applications”, ACM SIGCOMM 2001, pp. 149-160, San Diego, CA,
USA, August 2001.
[4] David Hausheer, Burkhard Stiller, “PeerMint: Decentralized and Secure Accounting for Peer-to-
Peer Applications”, Networking 2005, pp. 40-52, IFIP 2005.
[5] Ruichuan Chen, Eng Keong Lua, Jon Crowcroft, Wenjia Guo, Liyong Tang, Zhong Chen,
“Securing Peer-to-Peer Content Sharing Service from Poisoning Attacks”, pp. 22-29, 8th
International Conference in p2p computing, IEEE, 2008.
[6] Halldor Matthias Sigurdsson, Ulfur Ron Halldorsson, Gerhard Hasslinger, “Potentials and
challenges of peer-to-peer based content distribution”, Telematics and Informatics 24, pp. 348-
365, 2007 Elsevier Ltd.
[7] B. Mortazavi_ and G. Kesidis, “Cumulative Reputation Systems for Peer-to-Peer Content
Distribution”, pp. 1546-1552, 2006 IEEE.
[8] Thomas Repantis Vana Kalogeraki, “Decentralized Trust Management for Adhoc Peer to Peer
Networks”, ACM, MPAC: Vol.182, Proceedings of the 4th international workshop on Middleware
for Pervasive and Ad-Hoc Computing (MPAC 2006), USA.
[9] V. Valli Kumari, B. Dinesh Reddy, T. Sri Devi, Ramaprasad R. Kalidindi and KVSVN Raju,
“Credibility Based Corrective Mechanism for Reputation Computation in Peer-to-Peer
Communities”, International Journal of Computer Science and Network Security, Vol. 8, No. 5,
May 2008.
12. International Journal of Network Security & Its Applications (IJNSA), Volume 2, Number 2, April 2010
145
[10] Mujtaba Khambatti, Partha Dasgupta, Kyung Dong Ryu, “A Role-Based Trust Model for Peer-to-
Peer Communities and Dynamic Coalitions”, Second IEEE International Information Assurance
Workshop (IWIA'04), pp. 141-154, April 2004.
[11] G.H. Nguyen, P. Chatalic, M.C. Rousset, “A Probabilistic Trust Model for Semantic Peer to Peer
Systems”, pp. 59-65, Proceedings of the 2008 international workshop on Data management in
peer-to-peer systems(DaMaP;Vol.261), 2008.
[12] S.Ayyasamy and Dr.S.N.Sivanandam, “A QoS-Aware Intelligent Replica Management
Architecture For Content Distribution In Peer-to-Peer Overlay Networks”, International Journal on
Computer Science and Engineering, Vol. 1(2), pp. 71-77, 2009.
[13] Network Simulator, http://www.isi.edu/nsnam
[14] Kolja Eger,Tobias Hoßfeld, Andreas Binzenhofer, "Efficient Simulation of Large-
Scale P2P Networks:Packet-level vs. Flow-level Simulations", in proceedings of 2nd Workshop
on the Use of P2P, GRID and Agents for the Development of Content Networks, pp: 9-16, June
2007.
About the Authors
Mr.S.Ayyasamy completed his B.E. (Electronics and
Communication Engineering) in 1999 from Maharaja Engineering
College and M.E. (Computer Science and Engineering) in 2002 from
PSG College of Technology, both under Bharathiar University,
Coimbatore. Currently he is pursuing PhD degree from Anna
University, Coimbatore. He is working as an Assistant Professor in the
Department of Information Technology at Tamilnadu College of
Engineering, Coimbatore. He is a member of various professional bodies like ISTE,
CSI and IAENG. His research areas include P2P networks, Overlay Networks, Load
Balancing and Quality of Services and having 9 years of teaching experience in
Engineering Colleges.
Dr.S.N.Sivanandam completed his B.E. (Electrical
Engineering) in 1964 from Government College of Technology,
Coimbatore, and MSc (Engineering) in Power Systems in the year 1966
from PSG College of Technology, Coimbatore. He acquired PhD in
control systems in 1982 from Madras University. He received best
teacher award in the year 2001 and Dhakshina Murthy Award for
teaching excellence from PSG College of technology. He received the citation for best
teaching and technical contribution in the year 2002, Government College of
Technology, Coimbatore. His research areas include Modeling and Simulation, Neural
Networks, Fuzzy Systems and Genetic Algorithm, Pattern Recognition,
Multidimensional system analysis, Linear and Non linear control system, Signal and
Image processing, Control System, Power System, Numerical methods, Parallel
Computing, Data Mining and Database Security. He is a member of various
professional bodies like IE (India), ISTE, CSI, ACS and SSI. He is a technical advisor
for various reputed industries and engineering institutions.