Egoistic superimpose Network Formation and Preservation
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2012, Vol 1, Issue 6
Abstract
t—A introductory issue essential many superimpose network applications ranging from routing to peer-to-peer file distribution is that of the network configuration, i.e., flop new arrivals into an presented overlie, and re-wiring to survive with varying network environments. Earlier effort has measured the crisis from two perspectives: devising levelheaded heuristics for the crate of supportive peers, and performing game theoretic analysis for the crate of egotistic peers. As a solution, we amalgamate the above mentioned thrusts by important and studying the Selfish Neighbor Selection (SNS) game and its purpose to superimpose routing. At the spirit of SNS stands the constraint that peers are permissible up to a convinced number of neighbors. This makes SNS considerably unusual from obtainable network structure games that force no boundaries on peer degrees. Having surrounded degrees has imperative realistic penalty as it permits the formation of superimpose structures that entail O(n) in its place of O(n2 ) link monitoring transparency. We demonstrate that a node’s finest reaction cabling policy amounts to solving a k-means dilemma on asymmetric distance. Finest reaction wirings have extensive realistic value as they allow egotistic nodes to collect sizeable presentation profit when linking to overlays of non-selfish nodes. A extra difficult upshot is that smooth non-selfish nodes can profit from the survival of a few egotistic nodes while the final, by way of their local optimizations, generate a extremely optimized spine, winning which even easy heuristic wirings defer high-quality recital. To take advantage of on the above properties we intend, erect and position, EGOIST, and SNS-inspired model superimpose routing system. We demonstrate that EGOIST outperforms obtainable heuristic superimpose on a diversity of performance metrics, with setback, accessible bandwidth, and node consumption, whilst it residue spirited with an finest, but unscalable full-mesh superimpose.
Authors and Affiliations
D. J. Anusha , B. Purushotham , D. J. Prathyusha
Keywords
Related Articles
- EP ID EP151758
- DOI -
- Views 79
- Downloads 0
Criminals and crime hotspot detection using data mining algorithms: clustering and classification
Criminal activities have been increased tremendously. So security has become a major issue to the people. The control actions should be taken by the police department. The police department has to take corrective...
An ACO Approach to Solve a Variant of TSP
This study is an investigation on the application of Ant Colony Optimization to a variant of TSP. This paper presents an Ant Colony Optimization (ACO) approach to solve a randomly generated TSP problem known as RTS...
A Survey on Anonymous Publication of Data
Data publication is one of major issue for organizations such as hospitals that publish detailed data about individual’s e. g. medical records for research or analysis purpose. However, sensitive personal informati...
Calculation of Transients at Different Distances in a Single Phase 220KV Gas insulated Substation
This paper describes the VFTO are usually Transient vervoltages in a gas insulated substation. A few Gas Insulated Substation (GIS) units have been in operation and large number of units are under various stages of...
A COMPARATIVE BEAMFORMING ANALYSIS OF LMS & NLMS ALGORITHMS FOR SMART ANTENNA
Beamforming is a technique of directional signal transmission and recitation. Now a days, because of an increasing demand on wireless communication (like RADAR, satellite communication, mobile communication, broadcast...