The document describes analyzing the performance of a mobile peer-to-peer network using ant colony optimization. It proposes using a distributed spanning tree (DST) structure to improve efficiency by reducing the large number of messages. The DST is optimized using ant colony optimization to give an optimal solution. Simulation results show the approach reduces the number of messages, average delay, and increases packet delivery ratio in the network.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
Replica Placement In Unstable Radio LinksCSCJournals
In this paper, proposed a solution for replica placement onto mobile hosts which are continuously moving and disconnections occur by unstable radio links, which are likely to be disconnected after a short time. Consider an Ad Hoc network in which mobile hosts are entered and communicate with other mobile hosts in the network and get replicas from the neighbors, while accessing the data items disconnections may occur due to unstable radio links. In this way accessing the data items is difficult. In this paper, develop a mechanism to access the data items from the mobile hosts after disconnection occur for short time. The proposed mechanism works efficiently in mosaic networks also. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity by exhibit an adjacent matrix, and communication costs, which are very low by accessing data items from nearest neighbors. The derived mechanism is general, flexible and adaptable to cater for various applications in ad hoc networks. This approach is efficient in both execution time and solution quality.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
Replica Placement In Unstable Radio LinksCSCJournals
In this paper, proposed a solution for replica placement onto mobile hosts which are continuously moving and disconnections occur by unstable radio links, which are likely to be disconnected after a short time. Consider an Ad Hoc network in which mobile hosts are entered and communicate with other mobile hosts in the network and get replicas from the neighbors, while accessing the data items disconnections may occur due to unstable radio links. In this way accessing the data items is difficult. In this paper, develop a mechanism to access the data items from the mobile hosts after disconnection occur for short time. The proposed mechanism works efficiently in mosaic networks also. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity by exhibit an adjacent matrix, and communication costs, which are very low by accessing data items from nearest neighbors. The derived mechanism is general, flexible and adaptable to cater for various applications in ad hoc networks. This approach is efficient in both execution time and solution quality.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
Java Abs Peer To Peer Design & Implementation Of A Tuple Spacencct
Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, microcontroller projects, vlsi projects, dsp projects, free projects, project review, project report, project presentation, free source code, free project report, Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, final year java projects, final year asp.net projects, final year vb.net projects, vb.net projects, c# projects, final year c# projects, electrical projects, power electronics projects, motors and drives projects, robotics projects, ieee electrical projects, ieee power electronics projects, ieee robotics projects, power system projects, power system ieee projects, engineering projects, ieee engineering projects, engineering students projects, be projects, mca projects, mtech projects, btech projects, me projects, mtech projects, college projects, polytechnic projects, real time projects, ieee projects, non ieee projects, project presentation, project ppt, project pdf, project source code, project review, final year project, final year projects
CONTENT BASED DATA TRANSFER MECHANISM FOR EFFICIENT BULK DATA TRANSFER IN GRI...ijgca
A new class of Data Grid infrastructure is needed to support management, transport, distributed access, and analysis of terabyte and peta byte of data collections by thousands of users. Even though some of the existing data management systems (DMS) of Grid computing infrastructures provides methodologies to handle bulk data transfer. These technologies are not usable in addressing some kind of simultaneous data
access requirements. Often, in most of the scientific computing environments, a common data will be needed to access from different locations. Further, most of such computing entities will wait for a common scientific data (such as a data belonging to an astronomical phenomenon) which will be published only
when it is available. These kinds of data access needs were not yet addressed in the design of data component Grid Access to Secondary Storage (GASS) or GridFTP. In this paper, we address an application layer content based data transfer scheme for grid computing environments. By using the
proposed scheme in a grid computing environment, we can simultaneously move bulk data in an efficient way using simple subscribe and publish mechanism.
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Maximizing p2 p file access availability in mobile ad hoc networks though rep...LeMeniz Infotech
Maximizing p2 p file access availability in mobile ad hoc networks though replication for efficient file sharing
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
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.
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTS ijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
Content Distribution for Peer-To-Peer Overlays on Mobile Adhoc Networks to Fu...Editor IJCATR
Peer-to-peer (P2P) networks existing on a MANET are a natural evolution since both are decentralized and have dynamic
topologies. As MANETs grow in use due to the increasing popularity of wireless mesh and 4G networks, it is expected that P2P
applications will remain as a popular means of obtaining files. Network coding has been shown as an efficient means of sharing large
Files in a P2P network. With network coding, all file blocks have the same relative importance. This paper presents an efficient
content distribution scheme that uses network coding to share large files in a P2P overlay running on a MANET. Peers request file
blocks from multiple server nodes and servers multicast blocks to multiple receivers, providing efficient multipoint-to-multipoint
communication.
Simulation results show that compared to other common download techniques, the proposed scheme performs very well, having lower
download time and energy consumption. Also, more peers participate in uploading the file, resulting in greater fairness.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Virtual Backbone Based Content Routing in Wireless Ad-Hoc Networkijwmn
We developed a new content routing based on the virtual backbone structure, which groups wireless nodes and contents into a virtual architecture. Our approach is scalable, works with local information, and does not rely on address information. The naming system uses flat naming to identify nodes and contents, and organizes these identifiers together. Backbone nodes can be selected automatically or predefined to direct their associated normal nodes in a local area. The normal nodes are guided by the backbone nodes to full fill the searching and routing processe
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
Java Abs Peer To Peer Design & Implementation Of A Tuple Spacencct
Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, microcontroller projects, vlsi projects, dsp projects, free projects, project review, project report, project presentation, free source code, free project report, Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, final year java projects, final year asp.net projects, final year vb.net projects, vb.net projects, c# projects, final year c# projects, electrical projects, power electronics projects, motors and drives projects, robotics projects, ieee electrical projects, ieee power electronics projects, ieee robotics projects, power system projects, power system ieee projects, engineering projects, ieee engineering projects, engineering students projects, be projects, mca projects, mtech projects, btech projects, me projects, mtech projects, college projects, polytechnic projects, real time projects, ieee projects, non ieee projects, project presentation, project ppt, project pdf, project source code, project review, final year project, final year projects
CONTENT BASED DATA TRANSFER MECHANISM FOR EFFICIENT BULK DATA TRANSFER IN GRI...ijgca
A new class of Data Grid infrastructure is needed to support management, transport, distributed access, and analysis of terabyte and peta byte of data collections by thousands of users. Even though some of the existing data management systems (DMS) of Grid computing infrastructures provides methodologies to handle bulk data transfer. These technologies are not usable in addressing some kind of simultaneous data
access requirements. Often, in most of the scientific computing environments, a common data will be needed to access from different locations. Further, most of such computing entities will wait for a common scientific data (such as a data belonging to an astronomical phenomenon) which will be published only
when it is available. These kinds of data access needs were not yet addressed in the design of data component Grid Access to Secondary Storage (GASS) or GridFTP. In this paper, we address an application layer content based data transfer scheme for grid computing environments. By using the
proposed scheme in a grid computing environment, we can simultaneously move bulk data in an efficient way using simple subscribe and publish mechanism.
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Maximizing p2 p file access availability in mobile ad hoc networks though rep...LeMeniz Infotech
Maximizing p2 p file access availability in mobile ad hoc networks though replication for efficient file sharing
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
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.
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTS ijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
Content Distribution for Peer-To-Peer Overlays on Mobile Adhoc Networks to Fu...Editor IJCATR
Peer-to-peer (P2P) networks existing on a MANET are a natural evolution since both are decentralized and have dynamic
topologies. As MANETs grow in use due to the increasing popularity of wireless mesh and 4G networks, it is expected that P2P
applications will remain as a popular means of obtaining files. Network coding has been shown as an efficient means of sharing large
Files in a P2P network. With network coding, all file blocks have the same relative importance. This paper presents an efficient
content distribution scheme that uses network coding to share large files in a P2P overlay running on a MANET. Peers request file
blocks from multiple server nodes and servers multicast blocks to multiple receivers, providing efficient multipoint-to-multipoint
communication.
Simulation results show that compared to other common download techniques, the proposed scheme performs very well, having lower
download time and energy consumption. Also, more peers participate in uploading the file, resulting in greater fairness.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Virtual Backbone Based Content Routing in Wireless Ad-Hoc Networkijwmn
We developed a new content routing based on the virtual backbone structure, which groups wireless nodes and contents into a virtual architecture. Our approach is scalable, works with local information, and does not rely on address information. The naming system uses flat naming to identify nodes and contents, and organizes these identifiers together. Backbone nodes can be selected automatically or predefined to direct their associated normal nodes in a local area. The normal nodes are guided by the backbone nodes to full fill the searching and routing processe
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
These are some ways businesses are using CallFire's Cloud Call Center, Voice Broadcast, SMS Text Messaging, Call Tracking, and Hosted IVR. CallFire's IVR and Cloud Call Center service make Automated Calling simple and affordable. Businesses are using a phone number tracker with CallFire to track their ads. Many businesses are using CallFire's SMS and Voice Broadcasting service to get bulk message campaigns out to the masses in seconds.
A New Architecture for Group Replication in Data GridEditor IJCATR
Nowadays, grid systems are vital technology for programs running with high performance and problems solving with largescale
in scientific, engineering and business. In grid systems, heterogeneous computational resources and data should be shared
between independent organizations that are scatter geographically. A data grid is a kind of grid types that make relations computational
and storage resources. Data replication is an efficient way in data grid to obtain high performance and high availability by saving
numerous replicas in different locations e.g. grid sites. In this research, we propose a new architecture for dynamic Group data
replication. In our architecture, we added two components to OptorSim architecture: Group Replication Management component
(GRM) and Management of Popular Files Group component (MPFG). OptorSim developed by European Data Grid projects for
evaluate replication algorithm. By using this architecture, popular files group will be replicated in grid sites at the end of each
predefined time interval.
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIB...ijp2p
Recently there has been significant research focus on distributed computing network massively caching
and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides
dynamically decentralized, self organized, scalable objects in distributed computing system. However such
networks suffer from high latency, network traffic and cache update problems. The existing caching and
replica placement techniques for placing objects across peer-to-peer network have no complete solution to
these problems. This paper presents an overview of the current challenges present in P2P overlay
networks, followed by describes briefly the analysis study of the existing algorithms and their merits and
demerits. And also suggest a new popularity based QoS-aware(Quality of Service) smart replica
placement algorithm for content distribution in peer- to-peer overlay networks which overcomes the access
latency, fault tolerance, network traffic and redundancy problems with low cost. The new algorithm
suggested is based on the outcome of the analysis study.
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIB...ijp2p
Recently there has been significant research focus on distributed computing network massively caching
and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides
dynamically decentralized, self organized, scalable objects in distributed computing system. However such
networks suffer from high latency, network traffic and cache update problems. The existing caching and
replica placement techniques for placing objects across peer-to-peer network have no complete solution to
these problems. This paper presents an overview of the current challenges present in P2P overlay
networks, followed by describes briefly the analysis study of the existing algorithms and their merits and
demerits. And also suggest a new popularity based QoS-aware(Quality of Service) smart replica
placement algorithm for content distribution in peer- to-peer overlay networks which overcomes the access
latency, fault tolerance, network traffic and redundancy problems with low cost. The new algorithm
suggested is based on the outcome of the analysis study
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
A Survey of File Replication Techniques In Grid SystemsEditor IJCATR
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies.
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies
A Survey of File Replication Techniques In Grid SystemsEditor IJCATR
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
In the last decade Peer to Peer technology has been thoroughly explored, becauseit overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner.
We present proofs of our algorithms as well as experimental results and evaluations.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Studies towards heterogeneous Mobile Adhoc Network (MANET) as well as inter-domain routing is still in much infancy stage. After reviewing the existing literaturs, it was found that problems associated with scalability, interoperability, and security is not defined up to the mark as it should be part of pervasive computing in future networks. Moreover, it was found that existing studies do not consider the complexities associated with heterogeneous MANET to a large extent leading to narrowed research scope. Hence, this paper introduces a novel scheme called as Secure, Scalable and Interoperable (SSI )routing, where a joint algorithm is designed, developed, and implemented. The outcome exhibits the correctness of this scheme by simulation assisted by analysis for inter-domain routing.
AN EFFICIENT BANDWIDTH OPTIMIZATION AND MINIMIZING ENERGY CONSUMPTION UTILIZI...IJCNCJournal
The bandwidth utilization plays a vital role in a Wireless Sensor Network (WSN) that transmits data packets from source peer to perspective destination peer without any packet loss and time delay. In a conventional system, two main features cannot be satisfied concurrently such as low delay and high data
reliability and then the peer was transferred fewer data packets and it optimized with regular bandwidth rate. Moreover, the convention of bandwidth in network routers influences the quality of service (QoS). To overcome the above issues, an Efficient Reliability and Interval Discrepant Routing (ERIDR) algorithm is proposed to optimize bandwidth utilization on the router network with the help of bandwidth optimizer. The
bandwidth optimizer allocates required bandwidth for data transmission to each peer simultaneously to ensure the bandwidth efficiency. The proposed design is to optimize bandwidth utilization of every peer and increase data processing via higher bandwidth rate that reduces time delay and minimizes energy consumption. The proposed method establishes a high bandwidth rate router to transmit data concurrently from source peer to destination peer (peer-to-peer) without any packet loss by initializing host IP address for every peer. Based on Experimental evaluations, proposed methodology reduces 3.32 AD (Average Delay), 0.05 ET (Execution Time), 5.44 EC (Energy Consumption) and 0.28 BU (Bandwidth Utilization)
compared than existing methodologies.
Java Abs Peer To Peer Design & Implementation Of A Tuple Sncct
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
A NEW ALGORITHM FOR CONSTRUCTION OF A P2P MULTICAST HYBRID OVERLAY TREE BASED...csandit
In the last decade Peer to Peer technology has been thoroughly explored, because it overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
A NEW ALGORITHM FOR CONSTRUCTION OF A P2P MULTICAST HYBRID OVERLAY TREE BASED...cscpconf
In the last decade Peer to Peer technology has been thoroughly explored, because it overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive. In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner. We present proofs of our algorithms as well as practical results and evaluations.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Analyse the performance of mobile peer to Peer network using ant colony optimization
1. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
DOI: 10.5121/ijci.2013.2302 13
ANALYSE THE PERFORMANCE OF MOBILE PEER TO
PEER NETWORK USING ANT COLONY OPTIMIZATION
S.J.K. Jagadeesh Kumar1
and R.Saraswathi2
1
Professor, Dept. of Computer Science and Engineering, SKCT, Coimbatore.
2
PG Student, Sri Krishna College of Technology, Coimbatore, Tamil Nadu, India
surswathi@gmail.com
ABSTRACT
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
KEYWORDS
Mobile Peer to Peer Network, Distributed Spanning Tree, Global Replica Management, ACO,
LRM,ORCS.
1. INTRODUCTION
1.1. Mobile Peer to Peer Network
In a mobile P2P network, the mobile nodes are connected in mesh network within their
communication range. Files can be shared directly between systems on the network without the
need of a central server. The communication among the mobile nodes is to be carried in multi-
hop fashion due to the design considerations such as radio power limitation and channel
utilization. Any communication with external networks is performed through the AP which
consumes relatively more time. In a mobile P2P network, the "peers" are computer systems which
are connected to each other via the Internet.
A Mobile P2P network is composed of mobile hosts that are free to move around randomly, and
to organize and collaborate together to share information among themselves. Files can be shared
directly between systems on the network without the need of a central server. In other words, the
P2P network is called a distributed structure if the participants share a part of their own resources.
These shared resources are necessary to provide the service offered by the network. The
participants of such a network are both resource providers and resource consumers. The P2P
network has the following characteristics:
2. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
14
• All nodes are both clients and servers
• Provide and consume data
• Any node can initiate a connection
• No centralized data source
• Nodes contribute content, storage, memory, CPU
• Nodes are autonomous (no administrative authority)
• Network is dynamic: nodes enter and leave the network “frequently”
• Nodes collaborate directly with each other
• Nodes have widely varying capabilities
The various benefits of P2P network has the efficient use of resources, scalability, reliability, ease
of administration, Anonymity, Highly dynamic environment and Ad-hoc communication and
collaboration. The various P2P applications are File sharing, Multiplayer games , Collaborative
applications, Distributed computation and Ad-hoc networks. The various Challenges of the P2P
network are Decentralization, Scalability, Performance, Anonymity, Fairness, Dynamism,
Security, Transparency, Fault Resilience and Robustness.
1.2. Distributed Spanning Tree
The distributed spanning tree (DST) is an overlay structure designed to be scalable. It supports the
growth from a small number of nodes to a large one. The DST is a tree without bottlenecks which
automatically balances the load between its nodes. The DST breaks the common assumption that
a tree is build of leaves and intermediate nodes. In a DST every nodes are equal. The nodes are
put together into small cliques. Then, the cliques are put together into small cliques of higher
level recursively. The cliques are represented in each node by a routing table. The memory space
complexity of the routing tables is O(log(n)) for a n nodes DST.
The section 2 describes the related work and section 3 describes the proposed system and section
4 describes the simulation scenario and section 5 describes the conclusion of the work.
1.3. Ant Colony Optimization
In computer science and operations research, the ant colony optimization algorithm (ACO) is a
probabilistic technique for solving computational problems which can be reduced to finding good
paths through graphs. This algorithm is a member of the ant colony algorithms family, in swarm
intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by
Marco Dorigo in 1992 in his PhD thesis, the first algorithm was aiming to search for an optimal
path in a graph, based on the behaviour of ants seeking a path between their colony and a source
of food. The original idea has since diversified to solve a wider class of numerical problems, and
as a result, several problems have emerged, drawing on various aspects of the behaviour of ants.
2. RELATED WORK
In [6], Takahiro Hara proposed new consistency maintenance based on local conditions such as
location and time need to be investigated. It attempts to classify different consistency levels
according to requirements from applications and provides protocols to realize them. In [8], Ren
Xun-yil et al proposed a consistency technique based on a replica clustering coefficient to classify
replica nodes into multi-levels. Replica consistency has been maintained in which the updating of
the data item is performed at first-level replica nodes initially and then it is propagated to the next
3. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
15
level of nodes in sequence. Though efficiency is proved in terms of response time and the number
of message passes required. In [9], Chun-Pin et al propose a Dynamic Maintenance Service to
maintain the data in gird environment. The Bandwidth Hierarchy based Replication algorithm was
proposed to maintain the replica dynamically in grid environment. In [9],Chao-Tung et al
proposed a One-way Replica Consistency Service (ORCS) for grid environment to resolve the
consistency maintenance issues and also balancing the trade off between the improving data
Access performance and replica consistency.
In [11] Sang-Min Park proposed a novel dynamic replication strategy; called BHR (Bandwidth
Hierarchy based Replication). It tries to maximize locality of file to reduce data access time.
However, grid sites may be able to hold only small portion of overall amount of data since very
large quantity of data is produced in data grid and the storage space in a site is limited. Therefore,
effect from this locality is limited to a certain degree. BHR strategy takes benefit from other form
of locality, called network-level locality. In [12], Haiying Shen propose an Integrated file
Replication and consistency Maintenance mechanism (IRM) that integrates the two techniques in
a systematic and harmonized manner. It achieves high efficiency in file replication and
consistency maintenance at a significantly low cost. Instead of passively accepting replicas and
updates, each node determines file replication and update polling by dynamically adapting to
time-varying file query and update rates, which avoids unnecessary file replications and updates.
It dramatically reduces overhead and yields significant improvements on the efficiency of both
file replication and consistency maintenance approaches. In [15], Xin Sun et al proposed a
bidirectional linked list based replica location service to provide a global replica view for
supporting the replica management to realize a replica selection strategy and optimal replication
strategy on tree-based hierarchical unstructured overlay network.
In [16], Jun Zheng et al proposed a dynamic minimum access cost based replication strategy
called MAC replication strategy. It takes into account the access frequency, the status of the
network connection and average response time. It calculates an appropriate site to replicate for
better shortening the response time of the data source. In [17], Wanlei et al propose the Hybrid
Replica Control protocol that attempts to maximize the data availability and communication
overhead. In [18], Feras et al propose a Constrained Fast Spread (CFS) method to alleviate the
main problems encountered in the current replication techniques and mainly concentrating on the
feasibility of replicating the requested replica on each node among the network. In [19] Baskaran
et al proposed a GRM in a tree structured P2P network to preserve the replica consistency through
the network and reduce the traffic in the network. In [20], Sylvain Dahan et al proposed a
Distributed Spanning Tree structure and it is designed to support scalable searches and traversal
algorithms. The DST based searches generates less messages to send the query and avoids tree
bottleneck. In [21], Sylvain Dahan et al proposed a distributed Spanning tree Structure for large
scale environment. This method achieves load balancing and Fault Tolerance in the network. In
[22],Xin sun et al proposed the bidirectional linked list based replica location service (BLL-RLS)
on tree-based hierarchical unstructured overlay networks, including the deployment of replica
location service and the design of the bidirectional linked list based replica catalog. Based on the
bidirectional linked list based replica catalog, replica location and selection algorithm is also
proposed.
Drawbacks:
• The Existing methods suffers from, huge number of messages sent or a higher volume of
computations.
• Space complexity is very high.
4. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
16
• Communication overhead is high.
• When increasing the number of nodes in the network, the Consistency maintenance yields
poor efficiency.
3. PROPOSED SYSTEM
In a mobile peer to peer network, each node has to exchange information and services directly
with each other without any dedicated intermittent. So it develops bottlenecks in the network due
to the huge volume of messages being exchanged. This could be avoided to optimize the number
of messages across the network. In this paper, a distributed spanning tree approach is proposed.
The proposed system consists of the following steps:
• Formation of mobile peer to peer network.
• Formation of Distributed Spanning Tree.
• Optimization of DST with Ant Colony Optimization.
• DST for Global Replica Management.
3.1. Formation of Mobile Peer to Peer Network
There are various steps for creating the P2P network. In fig 1.a shows the sample mobile peer to
peer network and fig 1.b shows the simulation on mobile peer to peer network.
• Define the network options such as communication channel, propagation models, queue
types and the network interface.
• Creating the instance of the simulator and set up the trace file.
• Create a topology object that keeps the movement of the mobile nodes within the topological
boundary and also set the coordinate values of the boundary.
• Configure the nodes and create the number of mobile nodes in the network. Establish the
communication between the nodes.
• Define the initial position of the node when it displayed in the NAM simulator.
• NS-2 uses NAM (network animator) to provide visualization. NAM also allows users to
design and debug the network protocols.
Fig :1a Structure of Mobile P2P Network
5
2
1
8
6
9
10
7
11
12
14
5. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
17
Fig :1b Simulation of Mobile P2P Network
3.2. Formation of Distributed Spanning Tree
The mobile P2P network is converted into the set of spanning trees called the Distributed
Spanning Tree (DST) and the corresponding graph based algorithms are developed to optimize
the number of messages across the network. The DST is an overlay structure designed to be
scalable, which supports the growth of the nodes from fewer nodes to higher volumes [16,17].It
allows the instantaneous creation of spanning trees rooted by any node and maintains the load
balancing between the nodes [16]. This instantaneous creation of spanning trees improves the
overall scalability of the intended network [18]. So, DST structures help to automatically balance
and optimize the load among the nodes.
The P2P network is converted into DST and each tree should have its root node, named as the
Head Node (HN) and the possible Leaf Nodes (LNs). Every HN will hold the complete details
regarding its LNs and vice versa. These HNs are to be generated dynamically and should hold the
replica, which is to be accessed by their corresponding LNs and indeed by other HNs also. Fig 2a
shows the simulation of distributed spanning tree. The DST algorithm consists of three
procedures.
1. Initialize() : This procedure create the set of Head Nodes (HNs) in a peer network based
on criteria such as user approval, traffic in a particular region, etc. This procedure creates
a list on each HN to hold its LNs details. This procedure assign unique id for every HN
and then it calls the procedure probe ().
2. Probe() :This procedure creates probe message and flood this message to all the nodes
connected to it. On receiving a probe messages, every node executes receive () procedure.
• If the probe message is received by an HN, then it will be discarded.
• If the message is received by the LN, which is not under any HN, then the LN
stores the head variable as the HeadID. Then the procedure reply() and the
forward() will be called.
• If the reply message is received by the LN, it will be forwarded to the HN.
• If the reply message is received by the HN, then it reads the ‘HeadId’ from rmsg.
If the ‘Headid’ equals the id of the current node then it concludes that the
respective head node is reached.
3. Reply() : The reply() procedure called by the corresponding LN to reply to its HN.
Definition 1: Let Ta be the graph of the peer network with HNs and LNs. Then Ga can be defined
as,
6. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
18
Ga = (1)
where,
• ‘DSTi’ is the Distributed Spanning Tree and ‘i’ is the total number of DSTs formed in the
network.
• HNi’ is the Head Node (HN) and ‘i’ is the total number of HNs in the peer network equal
to the number of DSTs.
• ‘LN’ refers to the Leaf Node(s). In ‘LNiz ’, refers to the corresponding HNi and 0 < z ≤ ij
− 1, where ‘ij − 1’ is the total number of LNs in the corresponding DST.
Definition 2: The number of messages required to pass the nodes in the MP2P network with the
DST structure can be evaluated as the following equation,
n(msgpass)=((P/LN) × P × R) + ((P/LN) × T) (2)
where,
• ‘T’ refers to the number of message pass between one HN and another HN.
• ‘R’ refers to the number of message pass between HN and LN.
• ‘P’ refers to the number of peers in the network.
• ‘LN’ refers to the number of LN under HN (assume equal number of LN for all HN).
• ‘(P/LN)’ refers to the number of DSTs in the MP2P network (or equals n(HN)).
• It can be interpreted that 1 ≤ M ≤ N ≤ L and 1 ≤ P ≤ L.
In Eq. (2), ‘P/LN’ gives the number of DSTs formed in the network which is also equal to n(HN).
So the Eq. (2) can be rewritten as,
n(msgpass) = (L × R) + (n(HN) × T) (3)
In other words, the total number of message passes required to form a DST in the MP2P network
n(msgpass) is equal to the cumulative sum of the distance of each LN from its HN in terms of edges
between them.
ALGORITHM FOR THE FORMATION OF DST:
Initialize()
1. Test the node v .If the test condition is satisfied then the node v is Head node.
2. Create an array to store all the LNs and call the function probe().
3. Create a variable Head as the LN.
Receive()
1. Check whether the message is the probe message and the node is HN means, discard the
message
2. If the Head variable of the LN is also null means, delete the message.
3. If the Head variable of the LN equals the probe message of the HeadID means, call the
reply() and forward() function.
4. If the node is HN then reply message of the HeadID equals the HeadID means, add the LN to
the array else route the message to all the nodes connected to it.
Probe()
Send the probe message to all the LNs connected to the particular HN.
7. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
19
Forward()
Send the forward message to all nodes connected to it.
Reply()
1. Create a reply message to all the nodes.
2. Set the LeafID and HeadID field of the reply message as v.ID and v.Head.
3. Send the reply message to the Head node HN.
Fig 2.Simulation of Distributed Spanning Tree
3.3. An Ant Colony Optimization of DST
The Ant Colony Optimization technique is a probabilistic optimization technique which could
find the optimal path in a graph, which is based on behaviours of ant seeking a path between their
colonies and source of food. By applying the ACO over the formulated DST, we can obtain the
optimal path in terms of reduced number of message passes among the nodes in the network. The
Ant colony optimization Algorithm for DST optimization is presented in the fig 3.This algorithm
consists of four procedure; optimization (G),propagate (),construction() and daemon action().In
Fig 3 shows the simulation of ant colony optimization of DST. The Procedure for optimization
(G) consists of two operations:
1. Finding the optimal path between every HNs. Let HNi is a HN among {
HN1,HN2,.....HNn}, where n is the number of HNs in the P2P network. HNi use probe
message ‘p’ to find the optimal path between HNi and other HNs.
2. The propagate (G,x,p) ,which propagates messages through different paths is called which
takes graph G, HNi as ‘x’ and probe message ‘p’ as parameters. Probe message ‘p’ is
flooded through the possible path which increase the number of feasible path discovered
between the HNi and other HN.
3. The construction (G,Ʈ,x,z) which calculates the edge value through the destination HN,
is called by HNi which takes the graph G, start HN ‘x’ start HN ‘x’ specific end HN ‘Z’
and ‘Ʈ’ as the parameter. The ‘Ʈ’ is the measure of cumulative edge value between ‘x’
and ‘z’.’ Ʈi’ value is used to decide the optimal path between the nodes. The value of
‘Val’ can be given as
Val= (4)
Where
• ‘val’ is a variable to count the value of Ʈ on each edge from ‘x’ to ‘z’.
• ‘p’ is the number of edges between HNs ‘x’ and ‘z’ in the MP2P network.
• ‘Ʈ’ is the cumulative edge value between the node ‘x’ and ‘z’.
4. DaemonAction(Val) is called by the end HN ‘z’ which takes the ‘Val’ as parameter and
decides the optimal path between the HNs ‘x’ and ‘z’ based on the value of ‘t’ along the
path of each probe ‘p’. Every probe reaches ‘z’ with its ‘val’ then ‘z’ decides the optimal
path based on the ‘val’ and the component type of ‘t’.
8. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
20
ALGORITHM FOR ANT COLONY OPTIMIZATION
Optimize()
1. Consider the graph that consists of vertices v and edges e such that G=(v,e)
2. Consider the HN x and z such that create a probe message p on x .
3. Call the function propagate(),construction() and daemonaction() to all HNs in the DST.
4. Consider the LN y for the particular HN x ,create a probe message p on y.
5. Call the function propagate(),construction() and daemonaction() to all the LNs.
Probe()
Forward the probe message p to all nodes.
1. For each non visited vertices in G, count the value of edge from node x to z and also
calculate the cumulative edge value between the node x and z.
Construction()
1. Initialize val(z) and trial(z).
2. For each non visited vertices in G, count the value of edge from node x to z and also
calculate the cumulative edge value between the node x and z.
DaemonAction()
1. Compare the cumulative edge value between the node x and z.
2. Find the optimal path between the node x and z based on the cumulative edge value ‘Ʈ’.
3. If the value ‘Ʈ’ can be compared with the positive Qos attribute like bandwidth and
transmission speed of the node. If the node has the highest ‘Ʈ’ value, then it chooses the
optimal path between the nodes.
Let ‘τ ’ be a positive QoS attribute like bandwidth, transmission speed, etc., then the path with
highest value of ‘val’ is chosen to be optimal. On the other hand, if ‘τ ’ is one of the negative QoS
attributes like Hop count, congestion delay, propagation delay, etc., then the path with lowest
value of ‘val’ is chosen to be optimal.
Definition 3: Let n(ACOmsgpass) be the number of message passes required for applying ACO
in DST MP2P network and it can be estimated as,
n(ACOmsgpass) = ((L/P) × N) + ((P × M) × (L/P)) (5)
where,
• ‘N’ refers to the number of message pass between one HN and another HN.
• ‘M’ refers to the number of message pass between HN and LN.
• ‘L’ refers to the number of peers in the network.
• ‘P’ refers to the number of LN under HN (assume equal number of LN for all HN).
• ‘(L/P)’ refers to the number of DSTs in the MP2P network (or equals n(HN)).
• It can be interpreted that 1 ≤ M ≤ N ≤ L and 1 ≤ P ≤ L.
Since ‘L/P‘ gives the number of DSTs formed in the network which is also equal to n(HN). So the
Eq. (5) can be rewritten as,
n(ACOmsgpass) = (n(HN) × N) + (M × L). (6)
9. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
21
Thus the total number of message passes required to perform ACO technique in DST P2P
network is directly proportional to total number of peers and HNs in the network.
Fig : 3 Simulation of Ant Colony Optimization Method
4. SIMULATION SCENARIO
This section describes the experimental set-up developed for investigating the proposed method
with different performance criteria. The NS2 simulator is used for comparing the performance of
mobile peer to peer network. A Mobile Peer-to-Peer network is simulated with 50 mobile nodes
(N1, N2,.. .N50) moving at constant speed within a bounded region. Unit propagation delay of the
wireless medium has been assumed as 10 ms. The experimentation and analysis have been carried
out under two different scenarios: MP2P with DST and MP2P with ACO optimized DST
networks. The Table 1 specifies the number of parameters used for the simulation of mobile peer
to peer network.
In this phase, the performance of the Mobile P2P network is evaluated using the Ant colony
optimization method. In fig 4.1a specifies the Number of nodes Vs number of packet request for
that node. It shows when the number of nodes increases, the message sent for the node was also
decreases by using DST method. But in optimized DST (ACO) method, the number of requested
packets from the network was also decreased. In the second graph 4.1b shows the number of node
Vs packet delivery ratio. By using ACO method, the packet delivery ratio for the node was
increased compared to that of using DST method. In the third graph 4.1c shows number of nodes
Vs average delay. By using optimized DST method, the average delay for the node was decreased
when the number of node was increased.
Table 1 : Simulation Parameters
Parameters (unit) Value(default)
Number of Mobile nodes 50
Radius of communication range 1~19
Size of the Network 100X100
Propagation delay 12 ms
Average moving speed 0 ~ 25m/s
Maximum transmission range 250 m
Simulation time 900 sec
Nodes Mobility 1,5,10,15,20 m/s
Maximum velocity of the node 1
10. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
22
Fig:4.1a No. of Node Vs No.of Request Packets
Fig 4.1b : Number of Node Vs Packet Delivery ratio
Fig : 4.1c Number of Node Vs Average Delay
5. CONCLUSION
By employing the DST structures in the P2P network, the consistency and replication efficiency
can be achieved with the few messages compared to the traditional method. The scalability of the
P2P network can be improved with the application of DST structures. The proposed model
increases the data availability, reduces the bandwidth conception and number of messages in the
network and also improves the fault tolerant capacity of the overall system. Further to enhance the
effectiveness of the proposed system, the DST network is optimized with the Ant Colony
Optimization method. It gives the optimal solution of the DST method and reduces the message
sent and average delay and increases the packet delivery ratio in the network. We have to plan to
11. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.3, June2013
23
achieve the cluster based replica allocation for mobile peer to peer networks and also achieve the
effective service cache management in the network.
REFERENCES
[1] Feng Jie, Lisong Xu, Byrav Ramamurthy, “Overlay construction in mobile peer-to-peer networks”, in:
Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing
Conceptual and Algorithmic Applications. IGI Global, 2009. Web. pp. 51–67.
[2] Frank H.P. Fitzek, Hassan Charaf, “Mobile peer-to-peer networks: An Introduction to the Tutorial
Guide”, John Wiley & Sons, Ltd., ISBN: 978-0-470- 69992-8, 2009, pp. 4–18.
[3] Mobile peer-to-peer systems: overview, issues and potential usages. Webpage: http://medialab-
prado.es/mmedia/2328
[4] A.A. Helal, A.A. Heddaya, B.B. Bhargava, Replication Techniques in Distributed Systems, Kluwer
Academic, ISBN: 0-7923-9800-9, 1996.
[5] B. Ciciani, D.M. Dias, P.S. Yu, Analysis of replication in distributed database systems, IEEE Trans.
Knowl Data Eng. 2 (2) (1990) 247–261.
[6] Takahiro Hara, Sanjay Kumar Madria, Consistency management strategies for data replication in
mobile ad hoc networks, IEEE Trans. Mob. Comput. 8 (7) (2009) 950–967.
[7] S.Y. Hwang, K.K.S. Lee, Y.H. Chin, Data replication in a distributed system: a performance study, in:
Proc. Conf. Database and Expert Systems Applications, 1996, pp. 708–717.
[8] Ren Xun-yi, Wang Ru-chuan, Kong Qiang, Efficient model for replica consistency maintenance in
data grids, in: International Symposium on Computer Science and its Applications, IEEE, 2008.
[9] Chao-Tung Yang, Chun-Pin Fu, Ching-Hsien Hsu, File replication, maintenance, and consistency
management services in data grids, J. Supercomput. 53 (3)(2009) 411–439.
[10] R.M. Rahman, K. Barker, R. Alhajj, Replica placement design with static optimality and dynamic
maintainability, in: Proceedings of the Sixth IEEE International Symposium on Cluster Computing
and the Grid, CCGRID’06, pp. 434–437.
[11] S.M. Park, J.H. Kim, Y.B. Ko, S. YoonW-, Dynamic data grid replication strategy based on internet
hierarchy, in: The IInd Intl Workshop on Grid and Cooperative Computing, GCC2003, pp. 838–846.
[12] Haiying Shen “IRM: Integrated File Replication and Consistency Maintenance in P2P Systems”
IEEE transactions on Parallel and Distributed systems,Vol.21 pp.100-113. Top of FoBottom of
Form
[13] J. Luo, J.P. Hubaux, P. Eugster, PAN: providing reliable storage in mobile ad hoc networks with
probabilistic quorum systems, in: Proc. ACM MobiHoc, 2003, pp. 1–12.
[14] A. Datta, M. Hauswirth, K. Aberer, Updates in highly unreliable, replicated peer-to-peer systems,
in:Proceedings OF IEEE ICDCS’03, Providence, RI, USA, May 2003.
[15] Xin Sun, Kan Li,Yushu Liu,” An Efficient Replica Location Method in Hierarchical P2P
Networks”,IEEE ICIS Intl Conf. Pp.769-774.
[16] Xin Sun, Jun Zheng, Qiongxin Liu, Yushu Liu, “Dynamic data replication based on access cost in
distributed systems”, in: 2009 Fourth International Conference on Computer Sciences and
Convergence Information Technology, IEEE 2009.
[17] Wanlei Zhou,Holmes,” The design and simulation of a hybrid replication control protocol” proc
in.IEEE Intl sym. on PAAN, pp.210-215.1999.
[18] Feras Hanandeh and Mutaz,” CFS: A New Dynamic Replication strategy for Data grids”,Intl,Arab JIT
Vol.9 2012.
[19] Baskaran .R and Paul.P.V,”Algorithm and direction for analysis of global Replica Management in
P2P network”,IEEE Intl.Conf. in ICRTIT 2012.
[20] Sylvain Dahan, Laurent Philippe, Jean-Marc Nicod, “The distributed spanning tree structure”, IEEE
Trans. Parallel Distrib. Syst. (2009) 1738–1751.
[21] Sylvain Dahan, Distributed spanning tree algorithms for large scale traversals,in: 11th International
Conference on Parallel and Distributed Systems,ICPADS’05, IEEE, 2005.
[22] Xin Sun and Kan Li “ An Efficient Replica Location Method in Hierarchical P2P Networks” IEEE
/ACIS Intl Conf.pp.769-774.2009.