Condition for the Coverage and Connectivity of Wireless Sensor Network

2011 ◽  
Vol 403-408 ◽  
pp. 2589-2592
Author(s):  
Man Tian Xiang ◽  
Li Hong Li ◽  
Li Hua Sun

The topology attributes of both connectivity and coverage in a wireless sensor network depend on the spatial distribution and transmission range of the nodes. This paper proposes an analytical expression of the required critical transmission range of a node, for a given node density, to create an almost surely connected network. Equivalently, if the maximum range of the nodes is given, it can estimate effectively the number of nodes needed to cover a certain connected network. With experimental tests, the method is proved to achieve guaranteed degrees of coverage and connectivity, valuable for researchers in this area.

Author(s):  
Basma M. Mohammad El-Basioni ◽  
Abdellatif I. Moustafa ◽  
Sherine M. Abd El-Kader ◽  
Hussein A. Konber

This paper aims at designing a Timing Structure Mechanism (TSM) for Wireless Sensor Network (WSN) MAC, with specifying its respective logical topology, especially suitable to the monitoring applications, differentiated and characterized from the existing time bounding strategies, paving for a good performance channel access mechanism. The work proposed in this paper is based on classifying the monitoring applications so as to designing efficient setup and benefiting from the node's capabilities in dividing the network into sub-networks. By evaluating TSM against a cluster-tree IEEE802.15.4 in the two cases of one channel and multi-channel clusters, the simulation results showed that with varying the area, the TSM performs better than the two cases of IEEE802.15.4 in terms of lifetime, end-to-end delay, loss percentage by on average 103.44% and 61.84%, 96.59% and 95.37%, and 88.59% and 87.52%, respectively. Also, in case of increasing the node density, TSM is better in terms of the same parameters by on average 446.58% and 356.05%, 98.04% and 95.62%, and 77.62% and 75.2%, respectively.


2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Noureddine Assad ◽  
Brahim Elbhiri ◽  
Moulay Ahmed Faqihi ◽  
Mohamed Ouadou ◽  
Driss Aboutajdine

The intrusion detection application in a homogeneous wireless sensor network is defined as a mechanism to detect unauthorized intrusions or anomalous moving attackers in a field of interest. The quality of deterministic sensor nodes deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. An area may require that multiple nodes monitor each point from the sensing area; this constraint is known ask-coverage wherekis the number of nodes. The deployment quality of sensor nodes depends directly on node density and sensing range; mainly a random sensor nodes deployment is required. The major question is centred around the problem of network coverage, how can we guarantee that each point of the sensing area is covered by the required number of sensor nodes and what a sufficient condition to guarantee the network coverage? To deal with this, probabilistic intrusion detection models are adopted, called single/multi-sensing detection, and the deployment quality issue is surveyed and analysed in terms of coverage. We evaluate the capability of our probabilistic model in homogeneous wireless sensor network, in terms of sensing range, node density, and intrusion distance.


Sign in / Sign up

Export Citation Format

Share Document