Localized algorithm for connected set cover partitioning in wireless sensor networks

Pervin, Nargis; Layek, Dipankar; Das, Nabanita

doi:10.1109/pdgc.2010.5679902

Cited by 10 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, finding just a single connected cover keeps a large number of sensors unutilized. Hence, the authors in [16], propose a localized algorithm for finding maximum number of connected set covers that is to be executed once during network initialization only. In some papers [13,15,16], it has been assumed that the query area is a dense grid [17], [18] composed of unit cells.…”

Section: Related Workmentioning

confidence: 99%

“…4 shows the desired topology where the partition covers all blocks as well as it is connected. Assuming this grid structure of the query region P , this paper addresses the connected set cover partitioning problem introduced in [16]. For completeness, the problem is defined below.…”

Section: Proposed Model and Problem Formulationmentioning

confidence: 99%

“…Partitioning Problem is to partition the sensors into connected 1-covers such that the number of covers is maximized [16].…”

Section: Connected Set Cover Partitioning Problem the Connected Set Cmentioning

confidence: 99%

“…Hence, the authors in [16], propose a localized algorithm for finding maximum number of connected set covers that is to be executed once during network initialization only. In some papers [13,15,16], it has been assumed that the query area is a dense grid [17], [18] composed of unit cells. The knowledge of exact location of each node is needed here.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

A Fast Fault Tolerant Partitioning Algorithm for Wireless Sensor Networks

Saha¹,

Das

2013

Computer Science &Amp; Information Technology ( CS &Amp; IT )

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Proposed Model and Problem Formulationmentioning

confidence: 99%

“…Partitioning Problem is to partition the sensors into connected 1-covers such that the number of covers is maximized [16].…”

Section: Connected Set Cover Partitioning Problem the Connected Set Cmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A Fast Fault Tolerant Partitioning Algorithm for Wireless Sensor Networks

Saha¹,

Das

2013

Computer Science &Amp; Information Technology ( CS &Amp; IT )

Self Cite

View full text Add to dashboard Cite

show abstract

“…Minimizing the interference is another application of the SCP in both wireless sensor networks (WSNs) [35] and cellular networks [36]. Yet the most common application of the SCP in wireless networks is to solve the coverage problem in WSNs [37][38][39][40][41][42][43][44][45][46]. According to the survey papers [34,47], the coverage problem in WSNs is classified into two categories: area coverage and discrete point coverage.…”

Section: Applications In Wireless Networkmentioning

confidence: 99%

The Cell Switch-Off Approach for Energy Efficient Cellular Networks

Beitelmal¹

View full text Add to dashboard Cite

Network densification is a key enabler for providing high data rates and ubiquitous coverage. Although it enables the ambitious target of 1,000-fold gains in capacity, installing more base stations (BSs) challenges the energy efficiency targets of future networks. Cell switch-off (CSO) approaches are proposed to reduce energy consumption in off-peak periods by switching off some BSs. In this thesis, we define an energy-efficient cellular network as one in which as few BSs as possible are switched on while still satisfying all the users demand and quality of service. This thesis contributes to the current state of knowledge by directing the CSO research towards a more realistic, feasible, and practical implementation. We do this by arguing for employing offline (static) CSO and for considering spatially irregular BS deployments. First, we propose a dynamic CSO algorithm based on the well-known set cover problem. Our algorithm outperforms a benchmark algorithm in terms of the total number of switched-off BSs. While dynamic CSO algorithms are designed to adapt to fast changes in demand distribution, proper interference modelling is very challenging. To overcome this challenge, we next study regular static CSO patterns and describe them systematically. We propose sector-based patterns, where not only entire BSs could be switched off (site-based), but their individual sectors too. We compare the performance of different CSO patterns in terms of their energy efficiency and the number of supported users. CSO patterns are advantageous for modelling interference properly, reducing coverage holes, and making the uplink transmissions more energy-efficient for users. Nevertheless, the underlying assumption is that the BSs are deployed according to a regular grid. Finally, we consider spatially irregular BS deployments as a more realistic network model; therefore, we study applying CSO to irregular network layouts with the objective of making the active BS locations as regular as possible. We test the suitability of several algorithms from the p-dispersion problem literature for networks with BSs deployed with variable amounts of regularity. We also demonstrate some of these algorithms on real BS locations.

show abstract