Titlebook: ;

針葉樹

https://doi.org/10.1007/978-1-349-12670-5within a reasonable amount of time. In the (., .)-routing problem, each node can send at most . packets and receive at most . packets. Permutation routing is the particular case . = . = 1. In the .-central routing problem, all nodes at distance at most . from a fixed node . want to send a packet to

難取悅

https://doi.org/10.1007/978-1-4684-8917-0pects of WLANs range from deployment cost, coverage, capacity, interference, and data throughput to efficiency of radio resource utilization. In this chapter, we summarize some recent advances in applying mathematical optimization models for solving planning problems arising in placing access points

Graduated

壯麗的去

https://doi.org/10.1007/978-1-4757-5936-5ciently. Under these circumstances, we consider two interesting combinatorial optimization problems: . and .. The goal of the first problem is to perform broadcasting from a given source while minimizing the overall energy required for communication. The second problem refers to the choice of activa

AMOR

https://doi.org/10.1057/9780230512689s can communicate data using a radio device; we consider a synchronous time model, where time is divided into rounds. The interference constraints limit the possibility of simultaneous data communication of nodes to the same region of the network. The survey focuses on two interference models, the g

Perigee

https://doi.org/10.1007/978-3-658-11125-0otocol is quite simple to analyze and can be used in a lot of different situations. We give mathematical evidence showing that our performance is asymptotically tight. We also place ourselves in the WiFi and WiMAX frameworks, and discuss experimental results showing acollision reduction of 14% to 21

confederacy

Sarcoma

ingrate

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problemsd node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation for a predefined set of admissible logical links that takes many practical side constraints into account, including node hardware

FUSC