The automatic location of base-stations for optimised cellular coverage: a new combinatorial approach

Molina, Aurelia Alañón; Athanasiadou, G.E.; Nix, AR

doi:10.1109/vetec.1999.778212

Cited by 79 publications

(33 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another related problem is to deploy a minimal number of base stations in cellular networks so as to cover the maximal area. The work reported in [19], [23] approach this problem via devising centralized numerical methods.…”

Section: Related Workmentioning

confidence: 99%

Maintaining Sensing Coverage and Connectivity in Large Sensor Networks

Zhang¹,

Hou

2005

Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks

1,012

894

View full text Add to dashboard Cite

Abstract-In this paper, we address the issues of maintaining sensing coverage and connectivity by keeping a minimal number of sensor nodes in the active mode in wireless sensor networks. We investigate the relationship between coverage and connectivity by solving the following two sub-problems. First, we prove that if the radio range is at least twice of the sensing range, a complete coverage of a convex area implies connectivity among the working set of nodes. With such a proof, we can then focus only on the coverage problem. Second, we derive, under the ideal case in which node density is sufficiently high, a set of optimality conditions under which a subset of working sensor nodes can be chosen for full coverage.Based on the optimality conditions, we then devise a decentralized and localized density control algorithm, Optimal Geographical Density Control (OGDC), for density control in large scale sensor networks. Ns-2 simulation show that OGDC outperforms the PEAS algorithm [32], the hexagon-based GAFlike algorithm, and the sponsor area algorithm [28] with respect to the number of working nodes needed (sometimes at a 50% improvement), and achieves almost the same coverage as the algorithm with the best result.

show abstract

Section: Related Workmentioning

confidence: 99%

Maintaining Sensing Coverage and Connectivity in Large Sensor Networks

Zhang¹,

Hou

2005

Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks

1,012

894

View full text Add to dashboard Cite

show abstract

“…For the initial deployment, we assume that the femtocells are already placed through automatic planning [10]. We ignore the required property of workload L thr for simplicity.…”

Section: Discussionmentioning

confidence: 99%

Femtocell Coverage Optimisation Using Statistical Verification

Pietzuch

2011

Networking 2011

View full text Add to dashboard Cite

Abstract. Femtocells are small base stations that provide radio coverage for mobile devices in homes or office areas. In this paper, we consider the optimisation of a number of femtocells that provide joint coverage in enterprise environments. In such an environment, femtocells should minimise coverage overlap and coverage holes and ensure a balanced traffic workload among them. We use statistical verification techniques to monitor the probabilistic correctness of a given femtocell configuration at runtime. If there is any violation of the desired level of service, a self-optimisation procedure is triggered to improve the current configuration. Our evaluation results show that, compared with fixed time, interval-based optimisation, our approach achieves better coverage and can detect goal violations quickly with a given level of confidence when they occur frequently. It can also avoid unnecessary self-optimisation cycles, reducing the cost of self-optimisation.

show abstract

“…Again, coverage support alone may not be enough to address the application requirement. Coverage with connectivity is often expected in the field of sensor network [2,7,14,15]. However, coverage problem can also be explained in terms of exposure [6,10,13,5].…”

Section: Related Workmentioning

confidence: 99%