کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
451110 | 694242 | 2013 | 12 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks](/preview/png/451110.png)
We investigate the problem of joint routing and link scheduling in Time-Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs) carrying real-time traffic. We propose a framework that always computes a feasible solution (i.e. a set of paths and link activations) if there exists one, by optimally solving a mixed integer-nonlinear problem. Such solution can be computed in minutes or tens thereof for e.g. grids of up to 4 × 4 nodes. We also propose heuristics based on Lagrangian decomposition to compute suboptimal solutions considerably faster and/or for larger WMNs, up to about 50 nodes. We show that the heuristic solutions are near-optimal, and we exploit them to gain insight on the schedulability in WMN, i.e. to investigate the optimal placement of one or more gateways from a delay bound perspective, and to investigate how the schedulability is affected by the transmission range.
Journal: Computer Networks - Volume 57, Issue 11, 5 August 2013, Pages 2301–2312