Improving Connectivity via Relays Deployment in Wireless Sensor Networks
- 1 November 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference
- p. 1159-1163
- https://doi.org/10.1109/glocom.2007.223
Abstract
Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivity of a given network by adding a set of relays to it. We characterize the network connectivity by the Fiedler value, which is the second smallest eigenvalue of the Laplacian matrix representing the network graph. We propose a network-maintenance algorithm, which finds the best locations for a given set of relays. The proposed algorithm obtains the best relays' locations through a multi-level approach. In each level, the search problem can be formulated as a standard semi-definite programming (SDP) optimization problem. We show that the proposed algorithm can increase the average Fiedler value by 35% by adding one relay only.Keywords
This publication has 6 references indexed in Scilit:
- Growing Well-connected GraphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Maximum connectivity and maximum lifetime energy-aware routing for wireless sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Improving connectivity of wireless ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A survey on sensor networksIEEE Communications Magazine, 2002
- Some applications of Laplace eigenvalues of graphsPublished by Springer Science and Business Media LLC ,1997
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973