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.
Analyse the performance of mobile peer to Peer network using ant colony optim...IJCI JOURNAL
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.
The document proposes a distributed database system for delay tolerant networks (DTNs). It discusses two key contributions: 1) practical heuristics for query scheduling that optimize for lower delays by moving relevant data to sites with the largest amounts of data or highest likelihood of contact, and 2) a prereplication scheme that reduces latency for on-demand retrieval by actively pre-caching popular data between nodes based on bandwidth availability. The paper evaluates the proposed system through simulations on artificial and real-world DTN traces.
An efficient hybrid peer to-peersystemfordistributeddatasharingambitlick
The document proposes a hybrid peer-to-peer system that combines the advantages of structured and unstructured networks. It consists of two parts: 1) a structured core network that forms the backbone and provides efficient data lookup; 2) multiple unstructured networks attached to each core node, allowing flexible peer joining/leaving. This two-tier design decouples efficiency and flexibility. Simulation results show the hybrid system balances these properties better than single-approach networks.
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
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.
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
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.
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.
Analyse the performance of mobile peer to Peer network using ant colony optim...IJCI JOURNAL
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.
The document proposes a distributed database system for delay tolerant networks (DTNs). It discusses two key contributions: 1) practical heuristics for query scheduling that optimize for lower delays by moving relevant data to sites with the largest amounts of data or highest likelihood of contact, and 2) a prereplication scheme that reduces latency for on-demand retrieval by actively pre-caching popular data between nodes based on bandwidth availability. The paper evaluates the proposed system through simulations on artificial and real-world DTN traces.
An efficient hybrid peer to-peersystemfordistributeddatasharingambitlick
The document proposes a hybrid peer-to-peer system that combines the advantages of structured and unstructured networks. It consists of two parts: 1) a structured core network that forms the backbone and provides efficient data lookup; 2) multiple unstructured networks attached to each core node, allowing flexible peer joining/leaving. This two-tier design decouples efficiency and flexibility. Simulation results show the hybrid system balances these properties better than single-approach networks.
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
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.
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
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.
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.
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
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.
COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED...ijasuc
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
Iaetsd an enhancement for content sharing overIaetsd Iaetsd
This document proposes an efficient content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). It uses a hidden Markov model to predict individual mobility information to improve content discovery and delivery. The existing system results in a 2% CPU overhead and reduces smartphone battery life by 15%. To minimize energy consumption, the document proposes using sensor scheduling schemes in an opportunistic context. It aims to solve problems in content sharing and minimize energy use through sensor scheduling.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a research paper on secure cooperative caching in wireless peer-to-peer (P2P) networks. The paper proposes using encryption and digital signatures to authenticate data and ensure its integrity as it is cached and shared between wireless nodes. It describes greedy cache placement and mutual cache-based data access schemes to efficiently manage caching in wireless P2P networks. Experimental results show that a hybrid caching approach, which dynamically selects between caching data or caching paths to data, has better performance than solely caching data or paths. Future work areas include mechanisms for data owners to control caching scope while maintaining flexibility, and defending against security threats to data consistency.
The document discusses replica allocation techniques in mobile ad hoc networks to improve data accessibility in the presence of selfish nodes. It describes existing static and dynamic replica allocation methods, including Static Access Frequency, Dynamic Connectivity Based Grouping, and Dynamic Access Frequency and Neighborhood. It also proposes a Dynamic Connectivity Based Grouping method with selfish node detection to properly allocate replicas while accounting for selfish nodes. The goal is to maximize data accessibility, communication cost, and minimize query delay.
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
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.
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
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.
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.
Delay Tolerant Networking routing as a Game Theory problem – An OverviewCSCJournals
This document discusses modeling delay tolerant networking (DTN) routing as a game theory problem. It provides background on DTN, which aims to enable communication in disrupted networks, and discusses how routing in DTN can be viewed as a strategic interaction between nodes. The document then gives an overview of game theory and different game forms. It proposes analyzing DTN routing as a game with Nash equilibrium, where nodes make forwarding decisions rationally based on beliefs about other nodes' actions.
International Journal of Computational Science and Information Technology (I...ijcsity
Denial of Service (DoS) or Distributed-Denial of Service (DDoS) is major threat to network security.Network is collection of nodes that interconnect with each other for exchange the Information. This information is required for that node is kept confidentially. Attacker in network computer captures this information that is confidential and misuse the network. Hence security is one of the major issues. There are one or many attacks in network. One of the major threats to internet service is DDoS (Distributed denial of services) attack. DDoS attack is a malicious attempt to suspending or interrupting services to target node. DDoS or DoS is an attempt to make network resource or the machine is unavailable to its intended user. Many ideas are developed for avoiding the DDoS or DoS. DDoS happen in two ways
naturally or it may due to some botnets .Various schemes are developed defense against to this attack.Main idea of this paper is present basis of DDoS attack. DDoS attack types, DDoS attack components,survey on different mechanism to prevent DDoS.
HARDWARE SOFTWARE CO-SIMULATION FOR TRAFFIC LOAD COMPUTATION USING MATLAB SIM...ijcsity
Due to increase in number of vehicles, Traffic is a major problem faced in urban areas throughout the
world. This document presents a newly developed Matlab Simulink model to compute traffic load for real
time traffic signal control. Signal processing, video and image processing and Xilinx Blockset have been
extensively used for traffic load computation. The approach used is Edge detection operation, wherein,
Edges are extracted to identify the number of vehicles. The developed model computes the results with
greater degrees of accuracy and is capable of being used to set the green signal duration so as to release
the traffic dynamically on traffic junctions.
Xilinx System Generator (XSG) provides Simulink Blockset for several hardware operations that could be
implemented on various Xilinx Field programmable gate arrays (FPGAs). The method described in this
paper involves object feature identification and detection. Xilinx System Generator provides some blocks to
transform data provided from the software side of the simulation environment to the hardware side. In our
case it is MATLAB Simulink to System Generator blocks. This is an important concept to understand in the
design process using Xilinx System Generator. The Xilinx System Generator, embedded in MATLAB
Simulink is used to program the model and then test on the FPGA board using the properties of hardware
co-simulation tools.
This document summarizes the history of Wacom from 1986 to 2010. It outlines key product releases and developments for the company over this time period, including the release of their first tablet in 1986, establishing headquarters in Germany in 1988, and introducing various graphics tablet and pen display models throughout the 1990s-2000s to target both professional and consumer markets. The timeline shows Wacom's growth from their early miniature tablets to developing pen input technologies adopted by major laptop manufacturers.
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
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.
COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED...ijasuc
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
Iaetsd an enhancement for content sharing overIaetsd Iaetsd
This document proposes an efficient content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). It uses a hidden Markov model to predict individual mobility information to improve content discovery and delivery. The existing system results in a 2% CPU overhead and reduces smartphone battery life by 15%. To minimize energy consumption, the document proposes using sensor scheduling schemes in an opportunistic context. It aims to solve problems in content sharing and minimize energy use through sensor scheduling.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a research paper on secure cooperative caching in wireless peer-to-peer (P2P) networks. The paper proposes using encryption and digital signatures to authenticate data and ensure its integrity as it is cached and shared between wireless nodes. It describes greedy cache placement and mutual cache-based data access schemes to efficiently manage caching in wireless P2P networks. Experimental results show that a hybrid caching approach, which dynamically selects between caching data or caching paths to data, has better performance than solely caching data or paths. Future work areas include mechanisms for data owners to control caching scope while maintaining flexibility, and defending against security threats to data consistency.
The document discusses replica allocation techniques in mobile ad hoc networks to improve data accessibility in the presence of selfish nodes. It describes existing static and dynamic replica allocation methods, including Static Access Frequency, Dynamic Connectivity Based Grouping, and Dynamic Access Frequency and Neighborhood. It also proposes a Dynamic Connectivity Based Grouping method with selfish node detection to properly allocate replicas while accounting for selfish nodes. The goal is to maximize data accessibility, communication cost, and minimize query delay.
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
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.
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
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.
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.
Delay Tolerant Networking routing as a Game Theory problem – An OverviewCSCJournals
This document discusses modeling delay tolerant networking (DTN) routing as a game theory problem. It provides background on DTN, which aims to enable communication in disrupted networks, and discusses how routing in DTN can be viewed as a strategic interaction between nodes. The document then gives an overview of game theory and different game forms. It proposes analyzing DTN routing as a game with Nash equilibrium, where nodes make forwarding decisions rationally based on beliefs about other nodes' actions.
International Journal of Computational Science and Information Technology (I...ijcsity
Denial of Service (DoS) or Distributed-Denial of Service (DDoS) is major threat to network security.Network is collection of nodes that interconnect with each other for exchange the Information. This information is required for that node is kept confidentially. Attacker in network computer captures this information that is confidential and misuse the network. Hence security is one of the major issues. There are one or many attacks in network. One of the major threats to internet service is DDoS (Distributed denial of services) attack. DDoS attack is a malicious attempt to suspending or interrupting services to target node. DDoS or DoS is an attempt to make network resource or the machine is unavailable to its intended user. Many ideas are developed for avoiding the DDoS or DoS. DDoS happen in two ways
naturally or it may due to some botnets .Various schemes are developed defense against to this attack.Main idea of this paper is present basis of DDoS attack. DDoS attack types, DDoS attack components,survey on different mechanism to prevent DDoS.
HARDWARE SOFTWARE CO-SIMULATION FOR TRAFFIC LOAD COMPUTATION USING MATLAB SIM...ijcsity
Due to increase in number of vehicles, Traffic is a major problem faced in urban areas throughout the
world. This document presents a newly developed Matlab Simulink model to compute traffic load for real
time traffic signal control. Signal processing, video and image processing and Xilinx Blockset have been
extensively used for traffic load computation. The approach used is Edge detection operation, wherein,
Edges are extracted to identify the number of vehicles. The developed model computes the results with
greater degrees of accuracy and is capable of being used to set the green signal duration so as to release
the traffic dynamically on traffic junctions.
Xilinx System Generator (XSG) provides Simulink Blockset for several hardware operations that could be
implemented on various Xilinx Field programmable gate arrays (FPGAs). The method described in this
paper involves object feature identification and detection. Xilinx System Generator provides some blocks to
transform data provided from the software side of the simulation environment to the hardware side. In our
case it is MATLAB Simulink to System Generator blocks. This is an important concept to understand in the
design process using Xilinx System Generator. The Xilinx System Generator, embedded in MATLAB
Simulink is used to program the model and then test on the FPGA board using the properties of hardware
co-simulation tools.
This document summarizes the history of Wacom from 1986 to 2010. It outlines key product releases and developments for the company over this time period, including the release of their first tablet in 1986, establishing headquarters in Germany in 1988, and introducing various graphics tablet and pen display models throughout the 1990s-2000s to target both professional and consumer markets. The timeline shows Wacom's growth from their early miniature tablets to developing pen input technologies adopted by major laptop manufacturers.
OfficeBox allows users to store and share files online. Key features include My Folder for personal files, Shared Folders for collaboration, and Guest Folders that allow others limited access to a user's storage space. File links can be created to share individual files or folders without creating a guest account. The user interface provides access to these folders and tools for uploading, downloading, and managing files.
1. Southwest Airlines has succeeded through difficult times in the airline industry by controlling operating costs. It focuses on high demand routes without connecting flights and turns planes around very quickly to keep costs low.
2. Southwest uses a single aircraft type, the Boeing 737, which standardizes training and lowers maintenance costs. This strengthens Southwest's bargaining power with Boeing and allows renewing the fleet to improve fuel efficiency and reduce maintenance costs.
3. Southwest also benefits from competitive labor costs and efficiency due to its positive employee relations culture. These advantages help Southwest expand easily into new markets and gain market share through its low price strategy.
This project is to retrieve the similar geographic images from the dataset based on the features extracted.
Retrieval is the process of collecting the relevant images from the dataset which contains more number of
images. Initially the preprocessing step is performed in order to remove noise occurred in input image with
the help of Gaussian filter. As the second step, Gray Level Co-occurrence Matrix (GLCM), Scale Invariant
Feature Transform (SIFT), and Moment Invariant Feature algorithms are implemented to extract the
features from the images. After this process, the relevant geographic images are retrieved from the dataset
by using Euclidean distance. In this, the dataset consists of totally 40 images. From that the images which
are all related to the input image are retrieved by using Euclidean distance. The approach of SIFT is to
perform reliable recognition, it is important that the feature extracted from the training image be
detectable even under changes in image scale, noise and illumination. The GLCM calculates how often a
pixel with gray level value occurs. While the focus is on image retrieval, our project is effectively used in
the applications such as detection and classification.
ViewToo is a cloud-based screen sharing and online meeting tool that allows users to easily hold meetings, share screens, files and annotations with multiple attendees via a single meeting link. It has no sign up or registration required, supports file sharing from various cloud services, and works across Android, iOS and other devices. The document provides examples of how a consulting company, university professor and international lawyer have used ViewToo to simplify online meetings and collaboration by letting them invite others and access files from anywhere.
ViewToo is an online meeting application that allows users to share their screens from cloud storage services with multiple attendees via a single link. It offers simple one-click meetings without registration through customizable meeting codes. Files can be shared and annotated during meetings across devices on Android, iOS, and desktop. Common use cases include online consultations, sharing class presentations, and conducting international meetings from anywhere.
This document is a user guide for OfficeBox that provides an overview of its features and how to use it. It describes the main components of the user interface and how to perform basic functions like uploading and downloading files, creating file links, editing or deleting files, and copying or moving files between folders. It also explains the different types of folders like My Folder, Shared Folders, and Guest Folders.
Character recognition is a new research field in the domain of pattern recognition which deals with the
style of writing. Some of the challengeable problems in character identification are changing in the style of
writing, font and turns of words and etc. In this paper, the goal is Persian character identification using
independent orthogonal moment as the feature extraction technique.The proposed feature extraction
method is the combination of Pseudo-Zernike Moment and Fourier-Mellin Moment called Pseudo-Zernike-
Mellin Moment to extract feature vector from Persian characters. The proposed character identification
system is evaluated on the HODA dataset and obtained 97.76% acceptance rate.
An efficient feature extraction method with pseudo zernike moment for facial ...ijcsity
Face recognition is one of the most challenging problems in the domain of image processing and machine
vision. Face recognition system is critical when individuals have very similar biometric signature such as
identical twins. In this paper, new efficient facial-based identical twins recognition is proposed according
to the geometric moment. The utilized geometric moment is Pseudo-Zernike Moment (PZM) as a feature
extractor inside the facial area of identical twins images. Also, the facial area inside an image is detected
using Ada Boost approach. The proposed method is evaluated on two datasets, Twins Days Festival and
Iranian Twin Society which contain scaled, which contain the shifted and rotated facial images of identical
twins in different illuminations. The results prove the ability of proposed method to recognize a pair of
identical twins. Also, results show that the proposed method is robust to rotation, scaling and changing
illumination.
Great model a model for the automatic generation of semantic relations betwee...ijcsity
The
large
a
v
ailable
am
ou
n
t
of
non
-
structured
texts
that
b
e
-
long
to
differe
n
t
domains
su
c
h
as
healthcare
(e.g.
medical
records),
justice
(e.g.
l
a
ws,
declarations),
insurance
(e.g.
declarations),
etc. increases
the
effort
required
for
the
analysis
of
information
in
a
decision making
pro
-
cess.
Differe
n
t
pr
o
jects
and t
o
ols
h
av
e
pro
p
osed
strategies
to
reduce
this
complexi
t
y
b
y
classifying,
summarizing
or
annotating
the
texts.
P
artic
-
ularl
y
,
text
summary
strategies
h
av
e
pr
ov
en
to
b
e
v
ery
useful
to
pr
o
vide
a
compact
view
of
an
original
text.
H
ow
e
v
er,
the
a
v
ailable
strategies
to
generate
these
summaries
do
not
fit
v
ery
w
ell
within
the
domains
that
require
ta
k
e
i
n
to
consideration
the
tem
p
oral
dimension
of
the
text
(e.g.
a
rece
n
t
piece
of
text
in
a
medical
record
is
more
im
p
orta
n
t
than
a
pre
-
vious
one)
and
the
profile
of
the
p
erson
who
requires
the
summary
(e.g
the
medical
s
p
ecialization).
T
o
co
p
e with
these
limitations
this
pa
p
er
prese
n
ts
”GRe
A
T”
a
m
o
del
for
automatic
summary
generation
that
re
-
lies
on
natural
language
pr
o
cessing
and
text
mining
te
c
hniques
to
extract
the
most
rele
v
a
n
t
information
from
narrati
v
e
texts
and
disc
o
v
er
new
in
-
formation
from
the
detection
of
related
information. GRe
A
T
M
o
del
w
as impleme
n
ted
on
sof
tw
are
to
b
e
v
alidated
in
a
health
institution
where
it
has
sh
o
wn
to
b
e
v
ery
useful
to displ
a
y
a
preview
of
the
information
a
b
ou
t
medical
health
records
and
disc
o
v
er
new
facts
and
h
y
p
otheses
within
the
information.
Se
v
eral
tests
w
ere
executed
su
c
h
as
F
unctional
-
i
t
y
,
Usabili
t
y
and
P
erformance
regarding
to
the
impleme
n
ted
sof
t
w
are.
In
addition,
precision
and
recall
measures
w
ere
applied
on
the
results
ob
-
tained
through
the
impleme
n
ted
t
o
ol,
as
w
ell
as
on
the
loss
of
information
obtained
b
y
pr
o
viding
a
text
more
shorter than
the
original
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
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.
This document provides a survey of file replication techniques used in grid systems. It begins with an introduction to grid systems and discusses their use of replication to improve response times and reduce bandwidth consumption. It then categorizes replication techniques as static or dynamic and describes challenges of replication including maintaining consistency and overhead. The document surveys various replication strategies for different grid topologies like peer-to-peer, tree and hybrid. It evaluates strategies based on factors like access latency, bandwidth consumption and fault tolerance. Specific replication techniques are discussed for peer-to-peer architectures aimed at availability, placement strategies and balancing workloads.
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
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
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.
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
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
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
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.
Iaetsd a secured based information sharing scheme viaIaetsd Iaetsd
The document proposes a secured based information sharing scheme for delay tolerant networks using smartphones. It suggests using a discover-predict-deliver (DPD) approach for efficient content sharing. Specifically, DPD employs machine learning to identify meaningful locations from a user's mobility patterns using a hidden Markov model. Simulation results show DPD can discover and deliver 87% of content within two hours when only 30% of nodes initially have the content. The document also aims to reduce energy consumption using asymmetric multicore processors and efficient sensor scheduling with probabilistic optimal multi-parameter duty cycles.
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
Cross Layer- Performance Enhancement Architecture (CL-PEA) for MANETijcncs
This document summarizes a proposed Cross Layer- Performance Enhancement Architecture (CL-PEA) for mobile ad hoc networks (MANETs). The key points are:
1) Existing TCP/IP architecture is not well-suited for the dynamic topology and limited resources of MANETs. A cross-layer design where all layers can exchange information is proposed to better optimize protocol performance.
2) The proposed CL-PEA adds a new hardware layer where parameters from the hardware, operating system, and other layers can be stored. This allows all layers to access information to make more informed decisions.
3) By exchanging parameters across layers, CL-PEA aims to enhance protocol performance in
This document summarizes a paper that presents a novel method for passive resource discovery in cluster grid environments. The method monitors network packet frequency from nodes' network interface cards to identify nodes with available CPU cycles (<70% utilization) by detecting latency signatures from frequent context switching. Experiments on a 50-node testbed showed the method can consistently and accurately discover available resources by analyzing existing network traffic, including traffic passed through a switch. The paper also proposes algorithms for distributed two-level resource discovery, replication and utilization to optimize resource allocation and access costs in distributed computing environments.
CPCRT: Crosslayered and Power Conserved Routing Topology for congestion Cont...IOSR Journals
The document describes a proposed Crosslayered and Power Conserved Routing Topology (CPCRT) for congestion control in mobile ad hoc networks. The CPCRT aims to improve transmission performance by distinguishing between packet loss due to link failure versus other causes, while also conserving power used for packet transmission. It builds upon an earlier Crosslayered Routing Topology (CRT) approach by incorporating power conservation. The CPCRT is intended to identify the root cause of packet loss, avoid unnecessary congestion handling from link failures, allow congestion handling at specific high-traffic nodes rather than all nodes, and optimize resource and power usage for packet routing in mobile ad hoc networks.
ODRS: Optimal Data Replication Scheme for Time Efficiency In MANETsIOSR Journals
This document proposes an Optimal Data Replication Scheme (ODRS) to improve data availability, reduce query delay, and increase hit ratio in mobile ad hoc networks (MANETs). In MANETs, frequent node and link failures can cause network partitions that decrease data access performance. ODRS aims to address this issue through proactive data replication across network partitions. It considers factors like node mobility, power consumption, and resource availability to determine what data to replicate, where to place replicas, and how to access and synchronize replicated data in order to optimize data availability and query efficiency in the dynamic MANET environment. The proposed scheme is evaluated through simulation to validate that it can achieve higher data availability, lower query delay, and increased
In a Mobile Ad hoc Network (MANET), due to mobility, limited battery power and poor features of nodes,
network partitioning and nodes disconnecting occur frequently. To improve data availability, database
systems create multiple copies of each data object and allocate them on different nodes. This paper
proposes Automated Re-allocator of Replicas Over MANET (ARROM), that addresses these issues.
ARROM reduces the average response time of requests between clients and database servers by
reallocating replicas frequently. In addition, ARROM increases the average throughput in the network. Our
performance study indicates that ARROM improves average response time and average network
throughput in MANET as compared to resent existing scheme.
Similar to ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIMIZATION (20)
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications
NETWORK MEDIA ATTENTION AND GREEN TECHNOLOGY INNOVATION ijcsity
This paper will provide a novel empirical study for the relationship between network media attention and green technology innovation and examine how network media attention can ease financing constraints. It collected data from listed companies in China's heavy pollution industry and performed rigorous regression analysis, in order to innovatively explore the environmental governance functions of the media. It found that network media attention significantly promotes green technology innovation. By analyzing the inner mechanism further, it found that network media attention can promote green innovation by easing financing constraints. Besides, network media attention has a significant positive impact on green invention patents while not affecting green utility model patents.
4th International Conference on Artificial Intelligence and Machine Learning ...ijcsity
4th International Conference on Artificial Intelligence and Machine Learning (CAIML 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Artificial Intelligence and Machine Learning. The Conference looks for significant contributions to all major fields of the Artificial Intelligence, Machine Learning in theoretical and practical aspects. The aim of the Conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
5th International Conference on Machine Learning & Applications (CMLA 2023)ijcsity
5th International Conference on Machine Learning & Applications (CMLA 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
The document is a call for papers for the International Journal of Computational Science and Information Technology. The journal focuses on complex systems, information, and computation using mathematics and engineering techniques. Authors are invited to submit unpublished papers on topics related to algorithms, data structures, computational physics, machine learning, and more. The submission deadline is May 20, 2023, with notification of acceptance by June 20, 2023.
8th International Conference on Networks, Communications, Wireless and Mobile...ijcsity
8th International Conference on Networks, Communications, Wireless and Mobile Computing (NCWMC 2023) looks for significant contributions to the Computer Networks, Communications, wireless and mobile computing for wired and wireless networks in theoretical and practical aspects. Original papers are invited on computer Networks, network protocols and wireless networks, Data communication Technologies, network security and mobile computing. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
10th International Conference on Computer Science and Information Technology ...ijcsity
10th International Conference on Computer Science and Information Technology (CoSIT 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Computer Science, Engineering and Information Technology. The Conference looks for significant contributions to all major fields of the Computer Science and Information Technology in theoretical and practical aspects. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
International Journal of Computational Science and Information Technology (IJ...ijcsity
The document is a call for papers for the International Journal of Computational Science and Information Technology (IJCSITY). IJCSITY focuses on complex systems, information, and computation using mathematics and engineering techniques. Authors are invited to submit unpublished papers on topics related to algorithms, data structures, computational physics/biology, cryptography, machine learning, and more. The submission deadline is April 22, 2023, with notification by May 22, 2023 and final manuscripts due by May 25, 2023.
International Conference on Speech and NLP (SPNLP 2023) ijcsity
International Conference on Speech and NLP (SPNLP 2023) will provide an excellent international forums for sharing knowledge and results in theory, methodology and applications of speech and Natural Language Processing (NLP).
International Conference on Speech and NLP (SPNLP 2023) will provide an excellent international forums for sharing knowledge and results in theory, methodology and applications of speech and Natural Language Processing (NLP).
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
The document is a call for papers for the International Journal of Computational Science and Information Technology. The journal focuses on complex systems, information, and computation using mathematics and engineering techniques. Authors are invited to submit unpublished papers on topics related to algorithms, data structures, computational physics/biology, cryptography, machine learning, and more. The submission deadline is January 14, 2023, with notification by February 14 and final manuscripts due by February 22.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discussthelatestissuesandadvancementintheareaofadvancedComputationanditsapplications
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
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.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
“An Outlook of the Ongoing and Future Relationship between Blockchain Technologies and Process-aware Information Systems.” Invited talk at the joint workshop on Blockchain for Information Systems (BC4IS) and Blockchain for Trusted Data Sharing (B4TDS), co-located with with the 36th International Conference on Advanced Information Systems Engineering (CAiSE), 3 June 2024, Limassol, Cyprus.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Full-RAG: A modern architecture for hyper-personalizationZilliz
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
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.
Epistemic Interaction - tuning interfaces to provide information for AI support
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIMIZATION
1. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
DOI : 10.5121/ijcsity.2013.1202 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 of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
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.
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
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
3. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
15
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
throughthe 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
traversalalgorithms. 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.
• Communication overhead is high.
• When increasing the number of nodes in the network, the Consistency maintenance yields
poor efficiency.
2. PROPOSED SYSTEM
4. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
16
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
Fig :1b Simulation of Mobile P2P Network
3.2. Formation of Distributed Spanning Tree
5
2
1
8
6
9
10
7
11
12
14
5. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
17
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 procedure
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,
Ga =
where,
(1)
• ‘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.
6. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
18
• ‘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.
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.
7. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
19
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’.
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 .
8. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
20
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)
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.
9. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
21
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 of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
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
achieve the cluster based replica allocation for mobile peer to peer networks and also achieve the
effective service cache management in the network.
11. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.2, May 2013
23
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.