Solving a minimum-power covering problem with overlap constraint for cellular network design

Chen, Lei; Yuan, Di

doi:10.1016/j.ejor.2009.09.018

Cited by 13 publications

(5 citation statements)

References 22 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sávio S. V. [20] considered the gas diffusion characteristics and detector coverage rules, integrated the gas diffusion data of chemical plants into a 0-1 integer programming model based on the set coverage model, and obtained the minimum number of gas detectors and its optimal placement. The same kind of research can be seen in the study [21]. Baofeng Sun et al [22] developed a novel bi-objective model by modifying the set coverage model to design the URT maintenance network.…”

Section: Multi-facility Location-allocation Model In the Networkmentioning

confidence: 93%

Maintenance Decision-Making of an Urban Rail Transit System in a Regionalized Network-Wide Perspective

et al. 2020

View full text Add to dashboard Cite

The networked operation of Urban Rail Transit (URT) brings the new challenge of network-wide maintenance. This research focuses on the URT Network-Wide Maintenance Decision-Making Problem (URT-NMDP), including regionalized maintenance network design and maintenance resource allocation. In this work, we proposed a bi-objective integer programming model that integrates the characteristics of set coverage and P-median models, resulting in the regionalized maintenance network design model. Some critical factors are considered in the model, such as the importance of node, the maximum failure response time, and maintenance guarantee rules. We designed a NSGA-II based algorithm to solve the model. Moreover, due to the uncertainty of failures in the URT network, we developed the method of allocating maintenance resources based on Monte Carlo simulation to strengthen the reliability of the regionalized maintenance network. With the model and algorithm presented in this work, we obtained Pareto optimal solutions of URT-NMDP, i.e., URT network-wide maintenance planning schemes, which include the number and location of maintenance points, the allocation of demand points, and the amount of maintenance units. Finally, a real-world case is studied to evaluate the operating performance of these schemes for verifying the method in our paper. The results of the case study demonstrate that the reasonable and tested-in-practice maximum failure response time is the precondition for the efficient URT maintenance network. The maintenance scheme considered the weighted importance of node shows the optimal performance, with the shortest overall maintenance path and the minimum average failure response time and investment cost on maintenance resources.

show abstract

Section: Multi-facility Location-allocation Model In the Networkmentioning

confidence: 93%

Maintenance Decision-Making of an Urban Rail Transit System in a Regionalized Network-Wide Perspective

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Articles such as [110, 111, 135] may be an initial starting point for research in this area. The OR community has contributed to several related topics including the location/operation of cell towers [27, 71] and wireless sensor networks [40, 108] where spatially distributed nodes with limited broadcast power establish a communication path to a central location (e.g., a cell tower). See also [39, 116].…”

Section: Access Networkmentioning

confidence: 99%

Telecommunications network design: Technology impacts and future directions

Wong

2020

Networks

View full text Add to dashboard Cite

During the past 50 years telecommunication network technology has raced ahead powered by exponential advances in computer chip and fiber optic technology. The introduction of packet‐switched networks and the Internet has increased network traffic demands exponentially and has nurtured a variety of new telecommunication services (e.g., email, web‐surfing, social media, streaming services, e‐commerce, the Internet of Things, etc.) over the past 30 years. This rapidly changing environment (along with certain technical considerations) has made it very difficult to give accurate forecasts of traffic demands for both the short‐term (intraday) and for the longer term (year‐to‐year). Telecommunications network design has evolved from the voice‐only networks of the 1970s where operations research (OR) methodology was indispensable to current multiservice packet‐switched data networks whose uncertainty and rapid evolution has reduced the utility of classical optimization models that rely on accurate traffic demand forecasts. After summarizing the major developments in telecommunications network design technologies/services, we describe some promising future research directions to address an environment where technology is ever‐changing and traffic forecasting is difficult. In particular, we focus on the public Internet and emphasize possible work where OR/optimization methodology may be useful in understanding and solving telecommunications network routing and design problems.

show abstract

“…This paper studies power-aware solutions to find 2-covered paths given variable-radius antennas. Many applications, such as microcells and cell-splitting [1,7,8,11], have been commonly used by carriers in areas where capacity demands outstrip network capabilities. This situation typically occurs in dense urban areas or in large public venues (airports, stadiums, etc.).…”

Section: Background and Motivationsmentioning

confidence: 99%

Energy-Efficient 2-Covered Path Routing for Distributed Wireless Sensor Networks with Variable Transmission Ranges

Chen

Hsu

Guo

2015

AMM

View full text Add to dashboard Cite

A 2-covered path routing method providing each path with redundant antennas to provide high availability ensures reliable multi-hop communication under practical conditions. In real life, the transmission range of an antenna increases at a rate proportionate to its input power. This paper focuses on the 2-covered path problem in which antennas have discrete transmission power levels. Given a set of n antennas with m available radii, a source point A and a destination B on the plane, we propose three power-aware methods that construct the 2-covered paths between endpoints A and B. These methods are called 2-covered area stretching planning (TASP), and radii shrinking planning (RSP) to reduce power consumption. RSP and TASP are polynomial-time algorithms and save energy up to 96% of that achieved by optimum solutions.

show abstract

Solving a minimum-power covering problem with overlap constraint for cellular network design

Cited by 13 publications

References 22 publications

Maintenance Decision-Making of an Urban Rail Transit System in a Regionalized Network-Wide Perspective

Maintenance Decision-Making of an Urban Rail Transit System in a Regionalized Network-Wide Perspective

Telecommunications network design: Technology impacts and future directions

Energy-Efficient 2-Covered Path Routing for Distributed Wireless Sensor Networks with Variable Transmission Ranges

Contact Info

Product

Resources

About