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 75
- Downloads 0
An Improved Approach in Clustering Algorithm for Load Balancing in Wireless Sensor Networks
Wireless sensor networks represent the next generation of sensing machines and structures. Inherent limited energy resource is the one of the limitations of wireless sensor nodes. In order to distribute the energ...
Fuzzy logic Controller for Flowing Fluids
Flow measurement and control are essential in plant process control. The aim of this paper is to do the comparative study of Fuzzy Logic controller and conventional PID controller for flowing fluids.These two contr...
Optical Character Recognition Using Artificial Neural Network
— In this paper, an Optical Character recognition system based on Artificial Neural Networks (ANNs). The ANN is trained using the Back Propagation algorithm. In the proposed system, each typed English letter is rep...
A Low Power Asynchronous FPGA with Autonomous Fine Grain Power Gating and LEDR Encoding
Field Programmable Gate Arrays (FPGAs) are widely used to implement special purpose processors. FPGAs are economically cheaper for low quantity production because its function can be directly reprogrammed by end users. I...
Application of Genetic Algorithm for Image Enhancement and Segmentation.
Genetic algorithm is the type of Soft Computing method. The Genetic Algorithm (GA) is a model of machine learning which derives its behavior from a metaphor of the processes of evolution in nature. The aim is to en...