EFFICIENT TARGET TRACKING THROUGH BINARY-DETECTION IN SPARSELY DEPLOYED WSN

EFFICIENT TARGET TRACKING THROUGH BINARY-DETECTION IN SPARSELY DEPLOYED WSN

ABSTRACT

The problem of tracking moving objects with help of wireless sensor network (WSN) has been studied in past. Most of the solutions rely on the use of specialized and expensive sensors, and on dense deployment of sensors. These techniques are infeasible for applications in low budget domains. In this paper, we propose two novel techniques to track targets using binary sensing that does not need overlapping sensing regions. These techniques can track a target, and estimate the distance it has traversed on the basis of the time that target spends in the vicinity of sensors. In the first technique, the path traced by a moving target is approximated by tangent estimations to three circles, each representing range of a sensor. It allows us to convert the original problem into a semi definite program. The other tracking scheme identifies a band of small width where the target is guaranteed to lie. The band is first approximated using the distance travelled after coming out of vicinity of one sensor and before entering the vicinity of second sensor. This band is then reduced using the distance travelled inside the vicinity of the sensors. We simulated the two methods in NS2 and evaluate both the methods.

OPTIMAL ROUTE SELECTION METHOD WITH SATELLITE SYSTEM FOR COGNITIVE WIRELESS NETWORK IN DISASTER INFORMATION NETWORK

OPTIMAL ROUTE SELECTION METHOD WITH SATELLITE SYSTEM FOR COGNITIVE WIRELESS NETWORK IN DISASTER INFORMATION NETWORK 

ABSTRACT 

Cognitive wireless network consisted of multiple different types of wireless interface is one of efficient wireless transmission methods for Disaster Information Network, because it solves single wireless network problems like characteristics of wireless frequency or congestion form the use of same radio frequency.  However, even if Disaster Information Network consisted of Cognitive Wireless Network, some of wireless node might be broken after severe disaster is happened. Therefore, it is necessary  to consider about additional functions which the system never die. In this paper, we introduce Satellite System for optimal transmission control method in Cognitive Wireless Network in order to consider with severe disaster. 

First, as our previous study, proper wireless link and route selection is held by Extend AHP and Extend AODV with Min-Max AHP value methods for optimal transmission control in Cognitive Wireless Network.  Then, check-alive function, alternate data transmission function, possible alternative route suggestion, and network reconfiguration are introduced to our proposed Disaster Information Network by using Satellite System.  

In the simulation, ns2 are used for the computational results to the effectiveness of the suggested transmission methods in the hybrid system of cognitive wireless and satellite network system. 

QUALITY OF SERVICE-BASED MULTI-DOMAIN ROUTING UNDER MULTIPLE QUALITY OF SERVICE METRICS

QUALITY OF SERVICE-BASED MULTI-DOMAIN ROUTING UNDER MULTIPLE QUALITY OF SERVICE METRICS

ABSTRACT

Applications such as voice and video require network paths that satisfy several different quality of service (QoS) metrics, such as delay, jitter, packet loss rate and availability. The calculation of paths under multiple QoS metrics, such as the above four metrics, is a difficult problem since these metrics are in general incompatible. The authors propose a simple method for combining the above four QoS metrics into a single composite QoS metric which can be used as a link cost in Dijkstra’s algorithm in order to calculate a path. 

The authors evaluated the proposed method in a multi-domain routing environment where domain reachability information is available through a service oriented architecture paradigm, and they show that it outperforms two commonly used methods. The results are also applicable to routing within a single domain.

TRANSIENT ANALYSIS OF IEEE 802.15.4 SENSOR NETWORKS

TRANSIENT ANALYSIS OF IEEE 802.15.4 SENSOR NETWORKS

ABSTRACT

We study the delay performance of a sensor network, whose nodes access the medium by using the unslotted MAC protocol specified by the IEEE 802.15.4 standard. Unlike previous works, which focus on the average throughput and delay analysis, we develop a detailed model that allows us to obtain the delivery delay distribution of messages sent by concurrently contending sensors toward a central controller. 

We carry out a transient analysis that is of particular interest when sensor networks are deployed to provide coverage for real-time applications, and we study both single- and multi-hop network topologies. We validate our analytical results against simulation results obtained through ns2.

DYNAMIC CLUSTERING-BASED ADAPTIVE MOBILE GATEWAY MANAGEMENT IN INTEGRATED VANET – 3G HETEROGENEOUS WIRELESS NETWORKS

DYNAMIC CLUSTERING-BASED ADAPTIVE MOBILE GATEWAY MANAGEMENT IN INTEGRATED VANET – 3G HETEROGENEOUS WIRELESS NETWORKS

ABSTRACT

Coupling the high data rates of IEEE 802.11p-based VANETs and the wide coverage area of 3GPP networks (e.g., UMTS), this paper envisions a VANET-UMTS integrated network architecture. In this architecture, vehicles are dynamically clustered according to different related metrics. From these clusters, a minimum number of vehicles, equipped with IEEE 802.11p and UTRAN interfaces, are selected as vehicular gateways to link VANET to UMTS. 

Issues pertaining to gateway selection, gateway advertisement and discovery, service migration between gateways (i.e., when serving gateways lose their optimality) are all addressed and an adaptive mobile gateway management mechanism is proposed. 

Simulations are carried out using NS2 to evaluate the performance of the envisioned architecture incorporating the proposed mechanisms. Encouraging results are obtained in terms of high data packet delivery ratios and throughput, reduced control packet overhead, and minimized delay and packet drop rates.

DYNAMIC CONflICT-FREE QUERY SCHEDULING FOR WIRELESS SENSOR NETWORKS

DYNAMIC CONflICT-FREE QUERY SCHEDULING FOR WIRELESS SENSOR NETWORKS

ABSTRACT

With the emergence of high data rate sensor network applications, there is an increasing demand for high-performance query services in such networks. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose networks and workloads, DCQS is specifically designed for query services supporting in-network data aggregation. 

DCQS has several important features. First, it optimizes the query performance and energy efficiency by exploiting the temporal properties and precedence constraints introduced by data aggregation. Second, it can efficiently adapt to dynamic workloads and rate changes without explicitly reconstructing the transmission schedule. In addition, we provide an analytical capacity bound for DCQS in terms of query completion rate. 

This bound enables DCQS to handle overload through rate control. NS2 simulation results demonstrate that DCQS significantly outperforms a representative TDMA protocol (DRAND) and the 802.11 protocol in terms of query latency, throughput, and energy efficiency.

ON THE EFFECTIVENESS OF MONITORING FOR INTRUSION DETECTION IN MOBILE AD HOC NETWORKS

ON THE EFFECTIVENESS OF MONITORING FOR INTRUSION DETECTION IN MOBILE AD HOC NETWORKS

ABSTRACT

Several intrusion detection techniques (IDTs) proposed for mobile ad hoc networks rely on each node passively monitoring the data forwarding by its next hop. This paper presents quantitative evaluations of false positives and their impact on monitoring-based intrusion detection for ad hoc networks. 

Experimental results show that, even for a simple three-node configuration, an actual adhoc network suffers from high false positives; these results are validated by Markov and probabilistic models. However, this false positive problem cannot be observed by simulating the same network using popular ad hoc network simulators, such as ns-2, OPNET or Glomosim. To remedy this, a probabilistic noise generator model is implemented in the Glomosim simulator. 

With this revised noise model, the simulated network exhibits the aggregate false positive behavior similar to that of the experimental testbed. Simulations of larger (50-node) ad hoc networks indicate that monitoring-based intrusion detection has very high false positives. These false positives can reduce the network performance or increase the overhead. In a simple monitoring-based system where no secondary and more accurate methods are used, the false positives impact the network performance in two ways: reduced throughput in normal networks without attackers and inability to mitigate the effect of attacks in networks with attackers.