### Abstract

The relay node placement problem in the wireless sensor network domain has been studied extensively over the past few years. The objective of most of these problems, is to place the fewest number of relay nodes in the deployment area so that the network, formed by the sensor and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the network connected, may exceed the budget. Although, in this case, one must give up the idea of having of a connected network but one would still like to design a network with a high level of connectedness, or a low level of disconnectedness. In this paper, we introduce the notion of disconnectivity, a measure of the "connectedness" of a disconnected graph. We study a family of problems whose goal is to design a network with "maximal connectedness" or "minimal disconnectedness", subject to a fixed budget constraint. We show that all problems in this family are NP-Complete and present an approximation algorithm with a performance bound of 1/10 for the problem that maximizes the size of the largest connected components, and inapproximability results for the problem that maximizes the size of the smallest connected component and the problem that minimizes the number of connected components. In addition, we present future direction of our research on this topic.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018 |

Publisher | Association for Computing Machinery |

Volume | Part F133180 |

ISBN (Electronic) | 9781450363723 |

DOIs | |

State | Published - Jan 4 2018 |

Event | 19th International Conference on Distributed Computing and Networking, ICDCN 2018 - Varanasi, India Duration: Jan 4 2018 → Jan 7 2018 |

### Other

Other | 19th International Conference on Distributed Computing and Networking, ICDCN 2018 |
---|---|

Country | India |

City | Varanasi |

Period | 1/4/18 → 1/7/18 |

### Fingerprint

### Keywords

- Approximation Algorithms
- Disconnectivity
- Inapproximability
- Maximal Connectedness
- NP-Complete

### ASJC Scopus subject areas

- Human-Computer Interaction
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
- Software

### Cite this

*Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018*(Vol. Part F133180). [3154302] Association for Computing Machinery. https://doi.org/10.1145/3154273.3154302

**Relay node placement under budget constraint.** / Zhou, Chenyang; Mazumder, Anisha; Das, Arun; Basu, Kaustav; Matin-Moghaddam, Navid; Mehrani, Saharnaz; Sen, Arunabha.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018.*vol. Part F133180, 3154302, Association for Computing Machinery, 19th International Conference on Distributed Computing and Networking, ICDCN 2018, Varanasi, India, 1/4/18. https://doi.org/10.1145/3154273.3154302

}

TY - GEN

T1 - Relay node placement under budget constraint

AU - Zhou, Chenyang

AU - Mazumder, Anisha

AU - Das, Arun

AU - Basu, Kaustav

AU - Matin-Moghaddam, Navid

AU - Mehrani, Saharnaz

AU - Sen, Arunabha

PY - 2018/1/4

Y1 - 2018/1/4

N2 - The relay node placement problem in the wireless sensor network domain has been studied extensively over the past few years. The objective of most of these problems, is to place the fewest number of relay nodes in the deployment area so that the network, formed by the sensor and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the network connected, may exceed the budget. Although, in this case, one must give up the idea of having of a connected network but one would still like to design a network with a high level of connectedness, or a low level of disconnectedness. In this paper, we introduce the notion of disconnectivity, a measure of the "connectedness" of a disconnected graph. We study a family of problems whose goal is to design a network with "maximal connectedness" or "minimal disconnectedness", subject to a fixed budget constraint. We show that all problems in this family are NP-Complete and present an approximation algorithm with a performance bound of 1/10 for the problem that maximizes the size of the largest connected components, and inapproximability results for the problem that maximizes the size of the smallest connected component and the problem that minimizes the number of connected components. In addition, we present future direction of our research on this topic.

AB - The relay node placement problem in the wireless sensor network domain has been studied extensively over the past few years. The objective of most of these problems, is to place the fewest number of relay nodes in the deployment area so that the network, formed by the sensor and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the network connected, may exceed the budget. Although, in this case, one must give up the idea of having of a connected network but one would still like to design a network with a high level of connectedness, or a low level of disconnectedness. In this paper, we introduce the notion of disconnectivity, a measure of the "connectedness" of a disconnected graph. We study a family of problems whose goal is to design a network with "maximal connectedness" or "minimal disconnectedness", subject to a fixed budget constraint. We show that all problems in this family are NP-Complete and present an approximation algorithm with a performance bound of 1/10 for the problem that maximizes the size of the largest connected components, and inapproximability results for the problem that maximizes the size of the smallest connected component and the problem that minimizes the number of connected components. In addition, we present future direction of our research on this topic.

KW - Approximation Algorithms

KW - Disconnectivity

KW - Inapproximability

KW - Maximal Connectedness

KW - NP-Complete

UR - http://www.scopus.com/inward/record.url?scp=85041169346&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85041169346&partnerID=8YFLogxK

U2 - 10.1145/3154273.3154302

DO - 10.1145/3154273.3154302

M3 - Conference contribution

AN - SCOPUS:85041169346

VL - Part F133180

BT - Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018

PB - Association for Computing Machinery

ER -