LBMS: LOCATION BASED MOBILITY SCHEME IN WIRELESS SENSOR NETWORKS

A wireless sensor network can work efficiently only if can provide good mobility support. However the existing mobility protocols do not provide the optimal solution due to long handover latency and high packet loss. The term handover or handoff refers to the process of transferring an ongoing call or data session from one channel connected to the core network to another channel this leads to delay. In order to overcome these disadvantages we use location-based mobility support scheme. Mobility support algorithm is used which is based on cluster domain. In this scheme the handover in data link layer (DLL) and network layer are done simultaneously and mobile nodes do not participate in handover process. Hence packet loss due to change in address and node mobility is avoided. Moreover a cluster head's IPV6 address includes location information so there is automatic establishment of routing path to the destination cluster without routing discovery. The main advantage of using location based mobility support is that packet loss and handover cost is reduced. The task of routing data from a source to the sink is a critical issue in wireless sensor networks. To overcome these critical issues we use fuzzy logic to perform role assignment during route establishment and maintenance is proposed. An incremental approach is presented and compared with similar existing routing protocols. Efficient routing approaches provide network load balance to extend network lifetime, efficiency improvements, and data loss avoidance

Performance of AODV Routing Protocol using Group and Entity Mobility Models in Wireless Sensor Networks

Wireless Sensor Network is Multihop Self-configuring Wireless Network consisting of sensor nodes. The patterns of movement of nodes can be classified into different mobility models and each is characterized by their own distinctive features. The significance of this study is that there has been very limited investigations of the effect of mobility models on routing protocol performance such as Packet Delivery Ratio, Throughput and Latency in Wireless Sensor Network. In this paper, we have considered the influence of pursue group and random based entity mobility models on the performance of Ad Hoc On-Demand Distance Vector Routing Protocol (AODV) routing protocol. The simulation results show that Pursue Group Mobility model is better than Random Based Entity model

Routing Protocol using Group and Random Based Mobility Models in Wireless Sensor Networks

Wireless Sensor Network is Multihop Self configuring Wireless Network consisting of sensor nodes. The patterns of movement of nodes can be classified into different mobility models and each is characterized by their own distinctive features. The significance of this study is that there has been a very limited investigation of the effect of mobility models on routing protocol performance such as Packet Delivery Ratio, Throughput and Latency in Wireless Sensor Network. In this paper, we have considered the influence of pursue group and random based entity mobility models on the performance of Ad Hoc On-Demand Distance Vector Routing Protocol (AODV) routing protocol. The simulation results show that Pursue Group Mobility model is better than Random Based Entity model

Optimal connectivity for target coverage using prediction filter in wireless sensor networks

Deployment of sensor networks has traditionally been a significant interest during the most recent period of years. Coverage problem is a vital and primary issue in sensor networks. We propose the r-coverage to implement the target/point coverage problem in this paper. We make use of Reduced Minimum Spanning Tree (R-MST) to construct the topology, so that less packet loss and less delay occur with increase in the lifetime of the network. Experimental results have been performed using simulation on existing FST and R-MST proposed method. The obtained result shows that our approach achieves better throughput and packet delivery ratio over the FST topology with random node deployment in wireless sensor network

Energy Efficient Relaying For Target Coverage In Dense Wireless Sensor Networks

Wireless Sensor Networks (WSN) have been the most widely selected research area for a decade now. Researchers have identified the usability of sensor networks in huge variety of applications. The emergence of cognitive networks has led the sensor networks to adapt to the network conditions and the application dynamics. The work presented in this paper proves a unique cognitive solution for the problem of dynamic target coverage problem in the designated area of military surveillance. The nodes used for the acquisition of target coverage problem in the network remains static and transmits the information to the neighboring nodes using a movement prediction algorithm. The proposed approach shows better improvement in coverage and network lifetime in terms of position estimation and tracking target when compared to non-relaying techniques

Split and Schedule (SS): A Progressive Lifetime for Barrier Coverage using Relay Clusters in Wireless Sensor Network

In wireless sensor networks, barrier coverage is one of the major challenge for high density area. To overcome this challenge, coverage control is the key solution for making more efficient and can program the sensors in active or idle state to maintain network coverage. Also, the random deployment with clustering of detection nodes plays a crucial role in the presence of an obstruction else that can become a viable route for attackers. In this paper, two strategies are proposed to resolve the problem of barrier coverage and to improve lifespan of the network. A Split and Schedule (SS) algorithm is proposed and the formation of clusters overcomes limitations with better solution. By comparing with other efficient algorithms, proposed SS algorithm sustains the better quality of network coverage and enhances the longevity of the sensor network

Data Aggregation over Geographical Area Coverage in Wireless Adhoc and Sensor Networks

Wireless sensor networks has become envisage for various purpose in all the fields of technology. Random deployments are a fundamental crisis to realize coverage and/or connectivity in sensor networks. Path-Trace-Back protocol is proposed proficiently to preserve the data at specific geographic area coverage in a network with node mobility in nature. This scheme can turn out to be more difficult for isolated places in the area where only low density of sensor nodes exist. To tackle this problem, the path-trace-back scheme, initially permits a mobile node to periodically return the data to fixed location about the trail area coverage whose packets travel from the region of source and utilizes the reported trail to enhance the path revisited. Based on the optimality conditions, we devise the distance based and trail based approach for an explicit area using Path-trace -- back protocol that shows an enhancement of 80 percent against the distance based and Max Propagation protocol. The result obtained achieves higher performance when the region of coverage area is less connected

Efficient network lifetime for barrier coverage in heterogeneous sensor network

Wireless sensor networks has been the focus of a lot of research efforts recently. The barrier coverage problem is the fundamental issue in sensor networks, which minimizes the prob ability of intrusion detection through a barrier of sensor network attempting to cross a region of interest. The barrier coverage for heterogeneous lifetime has been improved with the employment of computational model called Voronoi diagram, for the deployment of sensors in region where intrusion is more and less energy consumption has increased the performance of the network. We have explored with the two protocols Constant state protocol and Variable state protocol deployed in a random deployment to enhance the lifetime and shows that the loss in potential network lifetime achieves higher efficiency when the sensor life-times are heterogeneous. The result describes that random deployment of the nodes with variable state protocol with less energy consumption than the nodes with constant state protocol in the barrier coverage of heterogeneous sensor network with steep increase of 65 percent in the network lifetime. © 2013 IEEE

Not Available

Not AvailableKoftha is a traditional North Indian food consisting of whole cooked potatoes in spicy gravy. Fried crab balls with koftha medium was packed in indigenous polymer-coated easy open-end tin-free steel cans of 307 ×109 size and processed at 121.1oC to three different F0 values of 5, 6 and 7 with cook values of 61, 75 and 78 min respectively. The fried and processed crab balls were evaluated by sensory analysis, instrumental texture and colour analysis. Even though the processed cans for all three F0 values were found to be commercially sterile, the product processed to F0 6 was found to be ideal with regard to all sensory attributes. The one way analysis of variance of all the instrumental textural characteristics viz., hardness 1, hardness 2, cohesiveness, springiness, gumminess and chewiness of different thermal process treatments were found to be significant at 5% level of significance. The treatment means comparisons for instrumental textural characteristics of different thermal process treatments were performed using Tukey’s Test and the values were maximum for fried crab balls and minimum for crab balls processed to F0 6 except for gumminess which was minimum for F0 7. Considering the sensory and instrumental textural characteristics, F0 6 was identified as the optimum process for crab koftha.Not Availabl

Not Available

Not AvailablePolymer-coated tin-free steel cans were evaluated for their suitability for canning and storage of ready-to-eat fish products. The cans were found to withstand the thermal processing conditions and suitable for food contact application. The overlap was 63%, which was well above the prescribed limit of 45%. Blanched shrimps were used for preparing three different styles of shrimp curry from which one was selected based on sensory evaluation. Shrimp curry prepared according to the standard recipe was processed to three different F0values of 6, 7 and 8 at 121C in polymer-coated tin-free steel cans. The thermal history during heating and cooling was collected using a data recorder. Raw, blanched and processed shrimp was subjected to analysis of color, texture and shear force by using instrumental methods. Analysis of the Commission Internationale d' Eclirage L*, a*and b*color values showed that the duration of exposure to heat treatment influenced the color parameters: the lightness (L*) and yellowness (b*) decreased, and the redness (a*) increased with increase in heating time. Upon blanching, the instrumental texture and shear values increased and then reduced on thermal processing with the increase in the duration of exposure. Shrimp curry processed at different F0values was subjected to sensory evaluation and samples processed at F07 were judged superior with regard to various sensory attributes evaluated. Based on the manual and instrumental sensory evaluation, the optimum process parameters for the ready-to-serve shrimp curry were standardized.Not Availabl