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 85
- Downloads 0
Egoistic superimpose Network Formation and Preservation
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,...
STUDY ON IMAGE BROADCAST USING WATERMARK AND SECURITY TECHNIQUES
Image broadcast is existing in this paper by experimental outcomes. In this method, an unauthorized person is easily determine through piracy of an image. Watermark is appended into image at the time of sending an image....
Survey on Effective Software Effort Estimation Techniques
Software effort estimation is a very important task in the software engineering field. In this paper gives the overview about the software effort estimation techniques. The techniques are expert estimation, paramet...
REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
A Mobile Ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming a dynamic network. An Ad hoc network doesn’t have any centralized arbitrator or server. In ad hoc networ...
“A Survey on Different Fingerprint Recognition Systems”
In this paper we are comparing various fingerprint recognition system which are based on minutiae and ridge feature extraction. Here we are comparing various methods using minutiae features only or ridge features o...