Reena Dadhich

Secure-SPIN with Cluster for Data Centric Wireless Sensor Networks

Routing Algorithms are driving the growth of the data transmission in wireless sensor network. Contextually, many algorithms proposed for efficient data transferring. This paper uses the scenario and node distribution across the Battle field in India. This Paper uses clustering algorithms to send the data over different geographic region. During the Battle, data gathering and data aggregation to base station is important and critical task. Based on event, clustering algorithm used. This paper assumes that sensor node uniformly distributed and coordinates of the base station and nodes are known. This paper is essential to enable the cluster head based selection scheme used in battle field and the performance of proposed protocol compute intensive and can significantly benefit over the others scheme. Proposed scheme having better data gathering, stability period and lifetime than the LECH scheme. The proposed scheme is implemented and simulated with LEACH in NS2.34. Simulation shows proposed protocol performance gains is better over the LEACH for lifetime of network and guaranteed data transmission.

Optimization of Clustering in SPIN-C and LEACH for Data Centric Wireless Sensor Networks

Routing the data in wireless sensor network (WSN) is a main issue in the guaranteed data transmission. Contextually, many algorithms consider the power and resource limitation, energy efficiency, scalability, attributes and location based with the assumption of homogeneous and heterogeneous distribution of nodes for data transferring. Therefore data dissemination is required to provide the effective data transmission from source node to sink node. This paper introduces the cluster head selection scheme used in SPIN to efficiently disseminate observations gathered by individual sensor nodes in the network. The paper proposes the cluster head selection scheme used in SPIN protocol and evaluated the performance of proposed protocol to prolong the time interval from the start of network operation till the death of the first node which is important reliable issues in wireless sensor networks for many feedback applications. The scheme is implemented and simulated with LEACH in NS2.34. Simulation shows proposed protocol exhibits significant performance gains over the LEACH for lifetime of network and guaranteed data transmission.

SPIN with Cluster for Data Centric Wireless Sensor Networks

Routing Algorithms are driving the growth of the data transmission in wireless sensor networks. Contextually, many algorithms considered the data gathering and data aggregation. This paper uses the scenario of clustering and its impact over the SPIN protocol and also finds out the effect over the energy consumption in SPIN after uses of clustering. The proposed scheme is implemented using TCL/C++ programming language and evaluated using Ns2.34 simulator and compare with LEACH. Simulation shows proposed protocol exhibits significant performance gains over the LEACH for lifetime of network and guaranteed data transmission.

Designing of Vague Logic Based Fair-Share CPU Scheduler: VFS CPU Scheduler

CPU scheduler is the primary component of an operating system which supports multitasking. Fair Share CPU scheduler uses static policy to share the CPU time among different levels of system. Static sharing of CPU time can affect the performance of system. Moreover, Fair share scheduler does not consider the impreciseness and uncertainty related to tasks. The objective is to design a vague based fair share scheduler VFS. VFS scheduler extends the research in the field of fair sharing of CPU time where the functions of VFS scheduler are threefold: firstly, it deals with the impreciseness of task. Secondly, it dynamically shares the CPU time among users as well as among tasks. Thirdly, it supplies the dynamic priority to each task. It improves the performance of system. The VFS scheduler has three modules, VIS-DCS vague inference system for sharing CPU time; VIS-DP vague inference system for assigning dynamic priority to each task and scheduling algorithm to schedule the tasks. The novelty of this approach is to introduce the vague logic based CPU scheduler. Simulation results show that the VFS scheduler has improved performance over the fair share scheduler.

2-Layered architecture of vague logic based multilevel queue scheduler

In operating system the decisions which CPU scheduler makes regarding the sequence and length of time the task may run are not easy ones, as the scheduler has only a limited amount of information about the tasks. A good scheduler should be fair, maximizes throughput, and minimizes response time of system. A scheduler with multilevel queue scheduling partitions the ready queue into multiple queues. While assigning priorities, higher level queues always get more priorities over lower level queues. Unfortunately, sometimes lower priority tasks get starved, as the scheduler assures that the lower priority tasks may be scheduled only after the higher priority tasks. While making decisions scheduler is concerned only with one factor, that is, priority, but ignores other factors which may affect the performance of the system. With this concern, we propose a 2-layered architecture of multilevel queue scheduler based on vague set theory (VMLQ). The VMLQ scheduler handles the impreciseness of data as well as improving the starvation problem of lower priority tasks. This work also optimizes the performance metrics and improves the response time of system. The performance is evaluated through simulation using MatLab. Simulation results prove that the VMLQ scheduler performs better than the classical multilevel queue scheduler and fuzzy based multilevel queue scheduler.

Selection of node density with cluster in SPIN for data centric wireless sensor network

Routing Algorithms are driving the growth of the data transmission in wireless sensor networks. Contextually, many algorithms considered the data gathering and data aggregation. Scenario like battle field, it is important and critical task in data transmission. Therefore through this paper handles the event generated by sensor nodes and provide the guaranteed transmission to sink using clustering process and node density with SPIN. Proposed scheme having better data gathering, stability period and lifetime than the LECH scheme. The proposed scheme is implemented using TCL/C++ programming language and evaluated using Ns2.34 simulator with LEACH. Simulation shows proposed protocol exhibits significant performance gains over the LEACH for lifetime of network and guaranteed data transmission.

Performance Investigations of Routing Protocols in Manets

In MANETs each node acts both as a host and a router and therefore forwards packets for other nodes using different routing protocols. The primary objective of this paper is to compare the performance of different routing protocols for wireless ad hoc networks in a simulated environment against varying network parameters and traffic (UDP, different number of connections/streams) to provide a qualitative assessment of applicability of protocols in different scenarios. The performance differentials are analyzed using varying node mobility, network size, maximum speed, traffic load and data rate on NS-2.34[1]. We will also simulate and analyze the wireless ad-hoc network routing protocols considering TCP as transport protocol and FTP as traffic generator against different network parameters.

Predictive packet reception protocol (PPRP) for wireless sensor networks

During the routing, Data is collected from the all sensor nodes, in result, the sensor nodes located closer to sink node have to receive and transmit not only their own data but also data from other sensor nodes, which are further sent to sink. It leads to the fact that the nearest sensor nodes fail much earlier than remote ones, In the long run, traffic from all the sensor nodes is going through one sensor node that is nearest to sink and the former disrupt the work of the rest of WSN. From the point of view of energy saving, big WSNs with only one sink cannot consume resources effectively. To solve this problem it is necessary to divide the WSN into clusters. The new algorithms proposed with the name of Predictive packet reception with energy (PPRE) with the focus of cluster formation and data transfer used in wireless sensor networks by using soft computing techniques. The proposed algorithm would improve the quality of data transfer in a granted way through by increasing the overall packet delivery fraction, throughput, stability of whole networks. The proposed scheme is simulated over NS 2.34 and MATLAB.

Fuzzy Based Multilevel Feedback Queue Scheduler

In multilevel feedback queue scheduling algorithm the major concern is to improve the turnaround time by keeping the system responsive to the user. Presence of vagueness in a system can further affect these performance metrics. With this intent, we attempt to propose a fuzzy based multilevel feedback queue scheduler which deals with the vagueness of parameters associated with tasks as well as to improve the performance of system by reducing the waiting time, response time, turnaround time and normalized turnaround time. Performance analysis shows that our methodology performs better than the multilevel feedback scheduling approach.

Survey of Mobile WiMAX and its threats

4G is based on two core technologies LTE (Long-Term Evaluation) and Mobile WiMAX (Worldwide Interoperability for Microwave Access). LTE and WiMAX system architectures are optimized for packet data to support the increasing amounts of data traffic. Compared with existing wide area cellular systems architectures, WiMAX and LTE provides improved respond time and reliability both are based on IP backbone. But when a technology comes, threats also comes with it like DoS, Man-in-Middle, Jamming as mentioned in the previous section. These threats occur at different layers of WiMAX like Jamming at Physical layer, DoS at MAC layer. This paper reviews about these different attacks and their effect on WiMAX. It has been analyzed that still initial phase is quite insecure because messages transmission is unencrypted. Initial phase can be more secure if an encrypted puzzle is transmitted from Base Station to Subscriber. And Subscriber would be supposed to solve this puzzle before consuming resources of Base Station.