In WirelessSensor Network, the communication generally takes higher energy than other operations like sensing and data processing. So the traffic reduction in communication is one of the most important concern for prolong the life of sensors. This paper presents three traffic reduction techniques based on dominating set. In the first approach base station is dynamically relocate to the sensing area in which heavy packet traffic. The selection of base station depends on various performance metrics such as energy, signal strength and the location of the selected node. The second approach intelligently distributes the burden of broadcasting process by applying the concept of localized domination set based multicast. In the third approach i.e., Dominant Set Pruning (DSP) is used to avoid unnecessary control packet flooding in sensor network. The efficiency of dominant-set-based broadcasting or routing mainly depends on the overhead in constructing the Connected Dominating Set (CDS) and the size of the dominating set. The paper proposes a novel algorithm for determine the CDS with less computation complexity.The performance of the algorithm is evaluated by using simulation. The modified algorithm has a tremendous reduction in traffic than the existing AODV algorithm.

Abstract:Over the course of time many data replication strategy has been used in grid.

The behavior of viruses in a computer network isto attack a single node in the network and starts spreading toother nodes. Once an attack has occurred, then the main defenseagainst the attacks is to immunize the affected nodes and protectthe nodes around the infected nodes. Specific nodes are selectedfor immunization and thereby controlling the dissemination ofviruses to more nodes in the network. This paper concentrates on node selection process in the network. For the survival of thenetwork, immunization should take place at the optimized nodesso that further spreading should be less. There are many methodsin selecting nodes from the network for immunization. Randomselection of nodes, selecting nodes with priority, selecting nodesusing graph reduction strategy etc are some methods in selectinga node from the network for controlling the growth of virusattack. In this paper we propose a novel way for selecting nodesfrom virus affected network, so that the spreading of virus canbe mitigated. Dominating set of a network can be used for nodeselection process.Set of nodes from which any other nodes in the network can be reached is called dominating set of that network. Here we also propose an algorithm for finding dominating set from a given graph. Immunizing those nodes in the dominating setwill decrease the dispersion of virus in the network.