Network planning and design

About: Network planning and design is a research topic. Over the lifetime, 12393 publications have been published within this topic receiving 229776 citations. The topic is also known as: network design.

Assignment of cells to switches in PCS networks

Abstract: Considers a problem of network design of personal communication services (PCS). The problem is to assign cells to the switches of a PCS network in an optimum manner. The authors consider two types of costs. One is the cost of handoffs between cells. The other is the cost of cabling (or trunking) between a cell site and its associated switch. The problem is constrained by the call volume that each switch can handle. The authors formulate the problem exactly as an integer programming problem. They also propose a heuristic solution for this problem and show that it performs extremely well. >

A system and method for the remote monitoring of wireless packet data networks

Abstract: A system and method monitors a wireless network such that degradation of performance, as measured by such performance parameters as data throughput and service availability is estimated accurately on a real time basis. The system (102) and method scan each cell of MDIS (106) in each location (104) of a wireless telecommunications network for cell statistics data. Using the scanned cell statistics data (108), the system and method generate a model of the performance of the telecommunications network by modeling each cell in the network. The model is based on a control system relationship. Using the control system relationship, the system and method forecast the performance of the cells between actual data collection times. Forecasting the state of the cells reduces the amount of data required to monitor the telecommunications network.

A continuous equilibrium network design model and algorithm for transit systems

Abstract: In this paper, a bilevel programming model for transit network design problem is presented, in which the upper model is a normal transit network design model, and the lower model is a transit equilibrium assignment model. A heuristic solution algorithm based on sensitivity analysis is designed for the model proposed. Finally, a simple numerical example is given to illustrate the application of the model and algorithm and some conclusions are drawn.

Random Access Compressed Sensing for Energy-Efficient Underwater Sensor Networks

Abstract: Inspired by the theory of compressed sensing and employing random channel access, we propose a distributed energy-efficient sensor network scheme denoted by Random Access Compressed Sensing (RACS). The proposed scheme is suitable for long-term deployment of large underwater networks, in which saving energy and bandwidth is of crucial importance. During each frame, a randomly chosen subset of nodes participate in the sensing process, then share the channel using random access. Due to the nature of random access, packets may collide at the fusion center. To account for the packet loss that occurs due to collisions, the network design employs the concept of sufficient sensing probability. With this probability, sufficiently many data packets - as required for field reconstruction based on compressed sensing - are to be received. The RACS scheme prolongs network life-time while employing a simple and distributed scheme which eliminates the need for scheduling.