Stationary and Mobile Target Detection using Mobile Wireless Sensor Networks

In this work, we study the target detection and tracking problem in mobile sensor networks, where the performance metrics of interest are probability of detection and tracking coverage, when the target can be stationary or mobile and its duration is finite. We propose a physical coverage-based mobility model, where the mobile sensor nodes move such that the overlap between the covered areas by different mobile nodes is small. It is shown that for stationary target scenario the proposed mobility model can achieve a desired detection probability with a significantly lower number of mobile nodes especially when the detection requirements are highly stringent. Similarly, when the target is mobile the coverage-based mobility model produces a consistently higher detection probability compared to other models under investigation.Comment: 7 pages, 12 figures, appeared in INFOCOM 201

Probabilistic model for Intrusion Detection in Wireless Sensor Network

Intrusion detection in Wireless Sensor Network (WSN) is important through the view of security in WSN. Sensor Deployment Strategy gives an extent to security in WSNs. This paper compares the probability of intrusion detection in both the Poisson as well as Gaussian deployment strategies. It focuses on maximizing intrusion detection probability by assuming the combination of these two deployment strategies and it gives theoretical proposal with respect to intrusion detection

Evasion Paths in Mobile Sensor Networks

Suppose that ball-shaped sensors wander in a bounded domain. A sensor doesn't know its location but does know when it overlaps a nearby sensor. We say that an evasion path exists in this sensor network if a moving intruder can avoid detection. In "Coordinate-free coverage in sensor networks with controlled boundaries via homology", Vin deSilva and Robert Ghrist give a necessary condition, depending only on the time-varying connectivity data of the sensors, for an evasion path to exist. Using zigzag persistent homology, we provide an equivalent condition that moreover can be computed in a streaming fashion. However, no method with time-varying connectivity data as input can give necessary and sufficient conditions for the existence of an evasion path. Indeed, we show that the existence of an evasion path depends not only on the fibrewise homotopy type of the region covered by sensors but also on its embedding in spacetime. For planar sensors that also measure weak rotation and distance information, we provide necessary and sufficient conditions for the existence of an evasion path

Distributed anti-flocking control for mobile surveillance systems

2014-2015 > Academic research: refereed > Refereed conference paperpreprint_postprin

An Approach to Calculate Exact Coverage Area for Connected Wireless Sensor Network

واحدة من التقنيات المتقدمة المستخدمة في أنظمة الاتصالات للشبكة الذكية هي شبكة الاستشعار اللاسلكية (WSN). WSN لديها مجموعة واسعة من التطبيقات تغطي العديد من المجالات مثل، إدارة الكوارث، اكتشاف حقل المعركة، التأمين على الحدود، مراقبة صحة المرضى، وغيرها. أن مشاكل الربط والتغطية للمستشعرات في الآونة الاخيرة لها أهمية عظيمة.  في البحث، قمنا بعرض الاتصال وتغطية العقد في WSN, تم اعداد خوارزمية لحساب مساحة التغطية المضبوطة لمجموعة عقد شبكة الاستشعار بالتوزيع المتجانس المستوي لنموذج القرص البسيط. هذه الخوارزمية تعتمد ارتباطات العقد ضمن مدى الاتصالات الاقصى للعقدة لذلك لايوجد في المساحات مناطق منفصلة. في حين تم احتساب كل المساحات غير المغطاة بالاستشعار ضمن المنطقة قيد الاهتمام (RoI) ضمن المساحة المغطاة. لذا تم احتساب النسبة المئوية للمساحة المغطاة بالضبط. ان استخدام هذه الطريقة سيكون الحجر الاساس للدراسات التي تتطلب سيطرة أفضل لنشر عقد المتحسسات. One of the advanced technologies used in the communicating systems of the intelligent grid is Wireless Sensor Network (WSN). WSN has a wide range of applications covers many fields like catastrophe management, hostilities field recognition, border insurance, patient health monitoring, and others. The sensor connectivity and coverage problems recently have a great attention. In this paper, we presented the connectivity and coverage of nodes in WSN, a new algorithm is prepared to extract exact coverage area of plain uniform depletion of node samples according to simple disk model. This algorithm considers the connection of nodes within maximum range of transmission communications, therefore no disconnected graph occurs. While uncovered area within region of interest (RoI) inside coverage area is calculated, although many uncovered regions occurred. So the coverage percentage area is calculated in an exact solution. This algorithm will be one of keystone study to better control of sensor depletion.    &nbsp

A survey on mobility management protocols in Wireless Sensor Networks based on 6LoWPAN technology

International audienceMobility has the advantage of enlarging WSN applications. However, proposing a mobility support protocol in Wireless Sensor Networks (WSNs) represents a significant challenge. In this paper, we propose a survey on the mobility management protocols in Wireless Sensor Networks based on 6LoWPAN technology. This technology enables to connect IP sensor devices to other IP networks without any need for gateways. We highlight the advantages and drawbacks with performances issues of each studied solution. Then, in order to select a typical classification of mobility management protocols in WSNs, we provide some classification criteria and approaches on which these protocols are based. Finally, we present a comparative study of the existing protocols in terms of the required performances for this network type

Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks (WSN)

Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a combat zone. The intrusion detection is defined as machinery for a WSN to detect the subsistence of unfortunate, incorrect, or anomalous moving attackers. For this purpose, it is a fundamental issue to differentiate the WSN parameters such as node density and sensing range in terms of a desirable detection probability. In this paper, we consider this issue according to two WSN models: homogeneous and heterogeneous WSN. Furthermore, we derive the detection possibility by considering two sensing models: single-singing detection and multiple-sensing detection. In addition, we converse the network connectivity and broadcast reach ability, which are necessary conditions to make certain the corresponding detection probability in a WSN. Our simulation results validate the analytical values for both homogeneous and heterogeneous WSNs

Position estimation and tracking of an autonomous mobile sensor using received signal strength

In this paper, an algorithm for approximating the path of a moving autonomous mobile sensor with an unknown position location using Received Signal Strength (RSS) measurements is proposed. Using a Least Squares (LS) estimation method as an input, a Maximum-Likelihood (ML) approach is used to determine the location of the unknown mobile sensor. For the mobile sensor case, as the sensor changes position the characteristics of the RSS measurements also change; therefore the proposed method adapts the RSS measurement model by dynamically changing the pass loss value alpha to aid in position estimation. Secondly, a Recursive Least-Squares (RLS) algorithm is used to estimate the path of a moving mobile sensor using the Maximum-Likelihood position estimation as an input. The performance of the proposed algorithm is evaluated via simulation and it is shown that this method can accurately determine the position of the mobile sensor, and can efficiently track the position of the mobile sensor during motion.<br /

Connectivity-guaranteed and obstacle-adaptive deployment schemes for mobile sensor networks

Mobile sensors can relocate and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes largely over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain location information through local communication, or they assume a dense network that remains connected. In addition, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not governed by these assumptions, and thus adapt to a wider range of application scenarios. The schemes are designed to maximize sensing coverage and also guarantee connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance. The schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Our first scheme is an enhanced form of the traditional virtual-force-based method, which we term the Connectivity-Preserved Virtual Force (CPVF) scheme. We show that the localized communication, which is the very reason for its simplicity, results in poor coverage in certain cases. We then describe a Floor-based scheme which overcomes the difficulties of CPVF and, as a result, significantly outperforms it and other state-of-the-art approaches. Throughout the paper our conclusions are corroborated by the results from extensive simulations