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 78
- Downloads 0
Smart antenna for wi-max radio system
In simple words, smart antenna is such that it can sense its environment and can adjust its gain in different directions accordingly. They provide a smart solution to the problem of communication traffic overload i.e. th...
Comparison between different Compression and Decompression Techniques on MRI Scan Images
The main objective of this paper is to distribute the medical images to different hospitals and among the staff of the same medical centre within short span of time and efficiently. A lot of hospitals handle their...
Computaional Complexity Analysis on Water Quality Index
The computational algorithms are used to determine the features and applications from large data sets in real time environment. The computational applications are also used in environmental computing to evaluate th...
Selective on-demand protocol for finding reliable nodes to form stable paths in ADHOC networks
A wireless adhoc network consists of a group of wireless nodes which can dynamically self-organize themselves into a temporary topology to form a network without using any existing infrastructure. Generally adhoc...
INTERLEAVED FORWARD ERROR CORRECTING (FEC) CODES BASED ON BINAR SHUFFLE ALGORITHM (B.S.A)
Forward Error Correcting (FEC) is one of the technique is used for controlling errors without sending any retransmission to sender. Example of forward error correcting codes are hamming, lower-density parity-ch...