Research Article
Algorithms on Improving End-to-End Connectivity and Barrier Coverage in Stochastic Network Deployments
@INPROCEEDINGS{10.1007/978-3-642-29096-1_6, author={Zhilbert Tafa}, title={Algorithms on Improving End-to-End Connectivity and Barrier Coverage in Stochastic Network Deployments}, proceedings={Ad Hoc Networks. Third International ICST Conference, ADHOCNETS 2011, Paris, France, September 21-23, 2011, Revised Selected Papers}, proceedings_a={ADHOCNETS}, year={2012}, month={5}, keywords={Algorithms Barrier coverage Connectivity Wireless Sensor Networks}, doi={10.1007/978-3-642-29096-1_6} }- Zhilbert Tafa
Year: 2012
Algorithms on Improving End-to-End Connectivity and Barrier Coverage in Stochastic Network Deployments
ADHOCNETS
Springer
DOI: 10.1007/978-3-642-29096-1_6
Abstract
When a wireless network is randomly deployed on a region, there is only a certain degree of probability that the connectivity and/or barrier coverage between two sites will be provided. Therefore, it is important to develop mechanisms that will assure the high probability for these two QoS parameters to be provided when the gaps appear in the network. This paper involves the mobile nodes in order for the connectivity and/or barrier coverage gaps to be filled. The simulation results aim to evaluate the network deployment parameters (i.e., density of stationary and mobile nodes with respect to the communication or sensing radii, the size of the deployment area, and the deployment manner) in order the end-to-end (EE) connectivity (and, in similar manner, barrier coverage) to be provided with the probability close to one. By finding the most appropriate paths between two sites, two algorithms presented in this paper provide the directions on using mobile nodes for the EE connectivity and the barrier coverage to be improved in stochastically deployed networks.
