A. Vijayaraj

Design and Implementation of Census Data Collection System using PDA

paper mainly concentrates on improving the efficiency of census data collection. The usual census data collection system involves an authorized enumerator, who collects the census data manually with paper and pen. This method has been a lot of time consuming and painstaking one. So in todays world of data communication a client tool for a portable system becomes important to access and update a database Innovative thinking helps us to improve the existing system .So we thought the finest solution for this handicap would be using a PDA. But such a client tool is yet to be developed. We have designed and developed such a client tool with PDA .Our idea is to implement this by providing a PDA containing the census application to every enumerator authorized by government through which they can collect census data and update the collected data to the census database thus saving time and money.

Increasing quality of service in video traffic using zone routing protocol in wireless networks

Wireless Mesh Network is fetching progressively prevalent mostly due to their flexibility. Wireless Mesh Network consists of consistent wireless routers arranged in a mesh topology, which send the data stream in a multi-trip fashion. ViLBaS concept is an existing concept, which checks all nodes and finds which node, is mostly affected by the congestion. In this concept, OLSR protocol is used to send the packet from sender to receiver. Instead of OLSR protocol, in this proposed system ZRP is used. The same concept can be implementing by using zone routing protocol. Zone routing protocol consists of two protocols: proactive protocol and reactive protocol. If the sender and receiver within the area, “Pro-active” protocol will send the packet directly to the receiver. If it is beyond the zone, a reactive protocol will send the packet to the receiver. The final quality of service parameters checked.

Construction of routing tree and node discovery in wireless networks

The primary goal is to have an assured data delivery between the source and destination. Previously data delivery failures constantly occur in wireless applications due to node movements. The conventional route reconstruction method is designed to mitigate the effects of topology change, but it utilizes a large amount of resources. In this prototype we construct the regularity in node mobility patterns and ensure that transmission of data between the nodes is efficient. The positions of the routers are designed and tree topology is constructed so that all nodes movements are directed towards the root of the tree. First deploy the nodes in a network then calculate the maximum in degree node to find out coordinator node and finally construct the tree in order to send the data to the destination. Implement the capacity calculation if in- degree node numbers are the same in any two nodes. Further the best node is calculated if the capacity of both the nodes is same and node trustworthiness is calculated using the recommendation system.

Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash table

In Peer to Peer systems (P2P); an only companion is connected to another associate in a different stockpiling framework. A different gathering of resolutions depicts disseminated hash tables outlines resources onto hubs in P2P system. It offers a “find – obtain” development where getting the advantages in the framework is available, and like this it can get back. DHT offers a liberal position of hubs and administrations yet don’t protect adjacent to vindictive hub moving lookups (the movement used to arrange the benefits in the system). Malicious hubs on a look-up pathway can precisely undermine question. Frameworks like Halo (in light of the harmony) reduction such ambushes by utilizing pointless lookup inquiries. To supply better affirmation; Reputation for Directory administrations is an establishment for training so as to boost lookups in abundance DHT how well new hubs administration lookup wishes. ReDS technique can be executed too for all intents and purposes any abundance DHT containing corona. Additionally, it perceives shared acknowledgment and dispenses with of difficult lookup paths. This acknowledgment does not wager on the partitioning of notoriety numbers and isolating is helpless to assaults that make larger part use of ReDS unfit. Corona is a plan that deeds the deterministic arranging of access to hubs in the harmony to introduce a “high-affirmation situate” through pointless investigates. Radiance was proposed to contain dynamic lookups and can browse different ways. Partitioned notoriety technique for Halo, has deterministic finger gathering. In deciding notoriety organize; the holes of attackers are diminished by utilizing unique Reciprocal Channel Variation based Identification (RCVI) technique. Load imbalance issue emerges through this lookup activity. Each Peer handles the heap by contrasting its ability. ReDS creates accomplishment lookup rates for Halo, yet next to think assailant was trying to brandish their notoriety achieves and in the presence of hub twirl.

Node discovery with development of routing tree in wireless networks

The primary goal in a remote system is to have a beyond any doubt information conveyance from the begin to end. One reason for information conveyance disappointments as often as possible happening in remote applications is hub developments. One answer for this issue is to recreate the course so that the impacts of topology change are decreasing. Then again, a few assets are required to finish this errand. In this paper, we make the consistency in hub versatility designs and guarantee that correspondence of information between the hubs is adequate. The positions of the switches are planned, and tree topology grew so that all hubs activities coordinate with the foundation of the tree. Initially send the hubs in a system then ascertain the most extreme in degree every hub. The facilitator hub is unified with most extreme in-degree lastly develop the tree to send the information to the destination. On the off chance that in-degree hub numbers are the same in any two hubs the best hub is picked in light of a background marked by the two hubs. On the off chance that the limit of both the hubs is same and hub reliability is ascertained utilizing the proposal framework and a most dependable hub is picked as the facilitator hub. This procedure diminishes the clog in the system furthermore the loss of information parcels in the system.

Detection of malicious nodes to avoid data loss in wireless networks using elastic routing table

Everyone comes under the problem, Security. Comparative to Wired network, wireless faces more problem and also it is inevitable. This paper deals how to reduce security issue and also to avoid traffic conjunction. Here, we explain how the misbehavior node is detected by the auditor in dynamic network. Auditing node is used to collect the information of each node and also used to select the trustworthy path to avoid the traffic conjunction and make the data more securable. To increase the security and speed we implement the clustering method. In that various types are used to increase the security, among those types fuzzy is one of them. In fuzzy we used binary method, which make more security in the wireless network.

Route Selection in AODV Protocol based on Link Quality Measurement using Cross Layer Interaction

In this system, at first, a cross-layer is inherent WLANs to extend the information exchange limit and execution of WLANs. We use hinged joint to solidify each one of the layers. By utilizing crosslayer, co-appointment among all layer is expanded while contrasting with the conventional layer design. A steering table is developed taking into account Ad-hoc On interest Distance Vector convention where to join quality is measured with information transmission rate in the MAC layer. Utilizing gadget drive system layer gets the connection quality estimation from MAC layer. The directing table is built where different way are made for exchanging bundle. Course from source to destination is picked given nature of the connection. A clog in that specific relationship is recognized utilizing certain blockage notice system and moderate re-transmit process. Execution is assessed using NS2 test system.

Packet classification using elliptical priority scheduling in wireless local area networks for congestion avoidance

In wireless local area networks (WLANs) packet classification is done to report matched packet to its destination node. Although several schemes are proposed, they suffer from execution corruption. In this paper initially a choleric layer is being constructed in WLANs to increase the bandwidth and performance of WLANs. We use Joint-Interface to combine all the layers. By using cross layer co-ordination among all layer is increased while comparing to the traditional layer architecture. When the packet arrives they are moved to routing table where all possible path to the nearest neighbor are found out and moved to, forwarding table which contains only the route chosen by the routing algorithm. Routing table is constructed using Ad-hoc on demand distance vector protocol. While forwarding packet, it is being double encrypted and decrypted. In order to avoid congestion occurrence near destination elliptical priority scheduling is used where time slot is given for each packet to be processed out and to send packet based on a priority algorithm are being used. Hence we can increase the classification speed and performance.

Load balancing algorithm using reputation-ReDS in the magnified distributed hash table

In Peer to Peer networks (P2P), single peer is linked to further peer in a scattered storage system. Solitary group of resolutions describes distributed hash tables charts assets onto nodes in P2P network and offers a “locate - acquire” construction where assets can be amassed in the network and consequently get back. In DHT offer expandable position of nodes and services, but do not guard beside malevolent node maneuvering lookups (the activity used to situate the assets in the system). Malevolent nodes on a lookup pathway can simply undermine query. Systems like Halo (based on chord) decrease such assaults by using superfluous lookup queries. To supply better declaration; Reputation for Directory services is a foundation for boosting lookups in superfluous DHT by trailing how well further nodes service lookup desires. ReDS procedure can be implemented to practically any superfluous DHT containing halo. And also recognize joint recognition and elimination of bad lookup lanes in a way that does not bet on the dividing of reputation counts and dividing is susceptible to attacks that create it unfit for the majority utilization of ReDS. Halo is a scheme that deeds the deterministic planning of routing-table access to nodes in chord to present a “high-assurance locate” through superfluous explores. Halo was intended to contain forceful lookups and path miscellany. Divided reputation method for halo, has deterministic finger collection. In determining reputation stage, the sums of assailants are decreased by using original RCVI method. Load inequity issue is raised through this lookup action. Every Peer handles the load in comparative to its capacity. ReDS develops lookup achievement rates for halo, yet beside deliberate aggressor endeavoring to sport their reputation attains and in the existence of node swirl.

Trinity tree construction for unattended web extraction

An innovative framework to automatically extract the data from the cyber world predicated web applications to process the data in linear tree fashion. Most of the terminus users were probing for an efficacious system which can provide an optimized comparative solution without any astronomically immense expenditure. We have proposed a technique that works on one or more web documents engendered by the same server-side template and learns a customary expression that models it and can later be habituated to extract data from kindred documents. In our project, we are trying to use an intelligent “Dominant Super String Algorithm” to extract the effective data from the web pages without any major computational impacts on the system. We have evaluated and compared our technique with others in the literature on an astronomically immense accumulation of collection of web documents; our proposed system results demonstrate that our proposal performs better than the others and that input errors do not have a negative impact on its efficacy and it provides a cost comparison analysis.