Fair dissections of spiders, worms, and caterpillars

Simone, Caterina De; Lucertini, M.; Pallottino, Stefano; Simeone, Bruno

doi:10.1002/net.3230200305

Cited by 26 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, we observe that optimization problem (11) can be formulated as a graph partitioning (GP) problem. We also observe that because of the special topology of the problem at hand, this problem is polynomially solvable [19], [20]. We will first discuss how the physical wireless system entities can be represented in a graph setting.…”

Section: (9)mentioning

confidence: 99%

“…Although the problem of optimally partitioning an arbitrary graph with an arbitrary cost function is an NP-hard optimization problem, partitioning a string optimally with a separable cost function can be solved in polynomial time. We use the following optimal graph partitioning result presented in [20].…”

Section: Optimal Partitioning and Shortest Path Algorithmsmentioning

confidence: 99%

“…We provide a sketch of the proof here to present the general idea behind it. A full proof can be found in [20]. The key point is to establish a one-to-one correspondence between the cost of a feasible partition in a string and the cost of a path from the origin to destination in a special acyclic network obtained from the partitioning problem at hand.…”

Section: Optimal Partitioning and Shortest Path Algorithmsmentioning

confidence: 99%

See 2 more Smart Citations

Adaptive cell sectorization for CDMA systems

Saraydar

Yener

2001

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-Given the user distribution in a cell, we investigate the two problems of how to appropriately sectorize the cell such that we minimize the total received power and the total transmit power of all the users, while giving each user acceptable quality of service in both cases. For the received power optimization problem, we show that the optimum arrangement equalizes the number of users in each sector. The transmit power optimization is formulated as a graph partitioning problem that is polynomially solvable. We provide an algorithm that finds the best sectorization assignment as well as the optimal transmit powers for all the users. The computational complexity of the algorithm is polynomial in the number of users and sectors. For both the received power optimization and the transmit power optimization, under nonuniform traffic conditions, we show that the optimum arrangement can be quite different from uniform cell sectorization (equal width sectors). We also formulate and solve the transmit power optimization and cell sectorization problem in a multicell scenario that would improve the capacity of a hot spot in the network. We observe that, with adaptive sectorization, where the sector boundaries are determined in response to users' locations, received and transmit power savings are achieved, and the number of users served by the system (system capacity) is increased compared to uniform sectorization of the cell.

show abstract

Section: (9)mentioning

confidence: 99%

Section: Optimal Partitioning and Shortest Path Algorithmsmentioning

confidence: 99%

Section: Optimal Partitioning and Shortest Path Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive cell sectorization for CDMA systems

Saraydar

Yener

2001

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…Specifically, the optimization problem in (4) can be transformed into a graph partitioning problem following the approach in reference [11] , as described next.…”

Section: ⅲ Optimum Schedulingmentioning

confidence: 99%

Energy Optimized Transmission Strategy in CDMA Reverse Link: Graph Theoretic Approach

Oh¹

2015

Journal of the Institute of Electronics and Information Enginee

View full text Add to dashboard Cite

We investigate rate scheduling and power allocation problem for a delay constrained CDMA systems. Specifically, we determine an energy efficient scheduling policy, while each user maintains the short term (n time slots) average throughput. We consider a multirate CDMA system where multirate is achieved by multiple codes. Each code can be interpreted as a virtual user. The aim is to schedule the virtual users into each time slot, such that the sum of transmit energy in n time slots is minimized. We then show that the total energy minimization problem can be solved by a shortest path algorithm. We compare the performance of the optimum scheduling with that of TDMA-type scheduling. May 22, 2015 also to reduce the environmental effects. Many researches have investigated to achieve green communications [1∼2] . Scheduling plays an important role in enabling efficient transmission for wireless systems with multiple users [3∼4] . Scheduling users in a CDMA system have been investigated to support applications with high bandwidth and strict latency requirements [5∼6] . Energy efficient power and rate allocation for Direct Sequence (DS)-CDMA systems are investigated in [5], whereas reference [6] investigates the optimal and suboptimal solutions to (1069)

show abstract

“…In this case, the problem of graph partitioning of a string can be reduced to a shortest path problem with complexity O(LT 2 ) [13]. In the following, the solution by a shortest path algorithm is described.…”

Section: Optimum Schedulementioning

confidence: 99%

Efficient Scheduling for Delay Constrained Multi-Rate CDMA Systems

Chen

Yener

2006

2006 IEEE Ninth International Symposium on Spread Spectrum Techniques and Applications

View full text Add to dashboard Cite

Abstract-We consider efficient scheduling for a delay constrained multi-rate CDMA system. We first find the optimum schedule for CDMA systems without transmit diversity (TD), that minimizes the average transmission energy per bit while maintaining the short term average throughput for each user in the system. We observe that the specifics of the scheduling problem enables it polynomially solvable. Next, we consider the case when mobile devices are capable of employing two antennas and use Alamouti scheme to achieve TD. We observe that our proposed scheduling protocol can be extended to the system with TD with a modest sacrifice in performance and significant saving in computational complexity, as compared to the optimum scheduler. Simulation results are presented to demonstrate the performance of the proposed scheduling protocols, and the considerable energy savings they provide with respect to the TDMA-type scheduling.

show abstract

Fair dissections of spiders, worms, and caterpillars

Cited by 26 publications

References 6 publications

Adaptive cell sectorization for CDMA systems

Adaptive cell sectorization for CDMA systems

Energy Optimized Transmission Strategy in CDMA Reverse Link: Graph Theoretic Approach

Efficient Scheduling for Delay Constrained Multi-Rate CDMA Systems

Contact Info

Product

Resources

About