Connectivity-aware network maintenance and repair via relays deployment

Authors:
Ahmed S. Ibrahim;Karim G. Seddik;K. J. Ray Liu
Affiliations:
Department of Electrical and Computer Engineering, University of Maryland, College Park, MD;Electrical Engineering Department, Alexandria University, Egypt;Department of Electrical and Computer Engineering, University of Maryland, College Park, MD
Venue:
IEEE Transactions on Wireless Communications
Year:
2009

Citing 11
Cited 1

Data networks (2nd ed.)

Data networks (2nd ed.)
Steiner tree problem with minimum number of Steiner points and bounded edge-length

Information Processing Letters
Approximations for Steiner Trees with Minimum Number of Steiner Points

Journal of Global Optimization
Convex Optimization

Convex Optimization
Improving Connectivity ofWireless Ad Hoc Networks

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Relay Node Placement in Wireless Sensor Networks

IEEE Transactions on Computers
Relay sensor placement in wireless sensor networks

Wireless Networks
Robust connectivity-aware energy-efficient routing for wireless sensor networks

IEEE Transactions on Wireless Communications
A survey on sensor networks

IEEE Communications Magazine
Transmit beamforming and power control for cellular wireless systems

IEEE Journal on Selected Areas in Communications
Lifetime maximization via cooperative nodes and relay deployment in wireless networks

IEEE Journal on Selected Areas in Communications

Network management framework and lifetime evaluation method for wireless sensor networks

Integrated Computer-Aided Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is defined as the time until the network becomes disconnected. The Fiedler value, which is the algebraic connectivity of a graph, is used as an indicator of the network health. The network maintenance problem is formulated as a semidefinite programming (SDP) optimization problem that can be solved efficiently in polynomial time. First, we propose a network maintenance algorithm that obtains the SDP-based locations for a given set of relays. Second we propose a routing algorithm, namely, Weighted Minimum Power Routing (WMPR) algorithm, that significantly increases the network lifetime due to the efficient utilization of the deployed relays. Third, we propose an adaptive network maintenance algorithm that relocates the deployed relays based on the network health indicator. Further, we study the effect of two different transmission scenarios, with and without interference, on the network maintenance algorithm. Finally, we consider the network repair problem, in which we find the minimum number of relays along with their SDP-based locations to reconnect a disconnected network. We propose an iterative network repair algorithm that utilizes the network maintenance algorithm.