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 77
- Downloads 0
A Multimodal Biometric System Using Fingerprint and Face
— Biometric identification system, which uses physical or behavioral features to check a person’s identity, ensures much greater security than passwords and number systems. Biometric features such as face or finger...
A Design of Ultra Low Power and High Speed 64 Bit Error Tolerant Adder for MAC
High speed and Low power design of VLSI circuits has been identified as a critical technological need in recent years due to the high demand for portable consumer electronics products. Error-Tolerance is a novel me...
A Comparative study of Data Gathering algorithms for a Mobile Sink in Wireless Sensor Network
As Wireless Sensor Networks (WSN) has become a rapidly growing field of interest, it is essential to know the various aspects, functionalities and the methodologies involved in this field. Data gathering in WSN i...
STUDY OF NONLINEAR POLEMETRIC MIXTURE BY S.R. METHOD
Lquid crystals are states of condensed matter whose symmetries lie between crystals and isotropic liquids Thermotropic liquid crystalline phases are exhibited by a large number of organic compounds shows molecu...
Auto-assemblage for Suffix Tree Clustering
Due to explosive growth of extracting the information from large repository of data, to get effective results, clustering is used. Clustering makes the searching efficient for better search results. Clustering is t...