Efficient resource allocation for IEEE 802.15.3(a) ad hoc networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3283, Issue , 2004, Pages 128-142

  Tseng, Yi Hsien ^a   Wu, Hsiao Kuang ^b   Shieh, Kuen Long ^a   Chen, Gen Huey ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; CHANNEL CAPACITY; GRAPH ALGORITHMS; LINEAR PROGRAMMING; MULTIMEDIA SYSTEMS; RESOURCE ALLOCATION; ULTRA-WIDEBAND (UWB);

ALLOCATION MECHANISM; BEST-EFFORT TRAFFIC; CHANNEL UTILIZATION; EFFICIENT RESOURCE ALLOCATION; GRAPH COLORING PROBLEM; LOCATION INFORMATION; MAXIMIZATION PROBLEM; PICONET COORDINATORS;

IEEE STANDARDS;

EID: 34547465563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30179-0_12     Document Type: Article

References (29)

1. IEEE standard 802.15.3: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for High Rate Wireless Personal Area Networks (WPANs), Inst. Elec. Electron. Eng., New York, USA, 2003.
2. FCC Notice of Proposed Rule Making, Revision of Part 15 of the Commission's Regarding Ultra-wideband Transmission Systems, ETDocket 98-153.
3. Ns2, the VINT project, http://www.isi.edu/nsnam/ns/.
4. G. Arfken, "Lagrange multipliers," in Mathematical Methods for Physicists, Academic Press, pp. 945-950, 1985.
5. A. BLUM, "New approximation algorithms for graph coloring," Journal of the ACM, vol. 41, pp. 470-516, 1994.
6. D. Brélaz, "New methods to color the vertices of a graph," Communications of the ACM, vol. 22, pp. 251-256, 1979.
7. P. Bhagwat, P. Bhattacharya, A. Krishma and S. Tripathi, "Enhancing throughput over wireless LANs using channel state dependent packet scheduling," Proceedings of IEEE INFOCOM, vol. 3, pp. 1133-1140, 1996.
8. J. C. R. Bennett and H. Zhang, "WF2Q: worst-case fair weighted fair queueing," Proceedings of IEEE INFOCOM, vol. 1, pp. 120-128, 1996.
9. H. M. Chaskar and U. Madhow, "Fair scheduling with tunable latency: a round-robin approach," IEEE/ACM Transactions on Networking, vol. 11, pp. 592-601, 2003.
10. S. Capkun, M. Hamdi and J. P. Hubaux, "GPS-free positioning in mobile ad-hoc networks," Proceedings of the 34th Annual Hawaii International Conference, pp. 3481-3490, 2001.
11. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," Proceedings of ACM SIGCOMM, vol. 19, pp. 1-12, 1989.
12. G. B. Dantzig, "Programming of interdependent activities: II. mathematical model," Econometrica, vol. 17, pp. 200-211, 1949.
13. M. Demirhan, IEEE 802.15.3 MAC model for ns-2, http://www.winlab.rutgers. edu/demirhan, Intel corporation.
14. J. Foerster, E. Green, S. Somayazulu and D. Leeper, "Ultra-wideband technology for short- or medium-range wireless communications," Journal of Intel Technology, 2nd quarter, 2001.
15. P. Goyal, H. Vin, and H. Cheng, "Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks," IEEE/ACM Transactions on Networking, vol. 5, pp. 690-704, 1997.
16. S. Golestani, "A self-clocked fair queueing scheme for broadband applications," Proceedings of IEEE INFOCOM, vol. 2, pp. 636-646, 1994.
17. M. M. Hallórsson, "A still better performance guarantee for approximate graph coloring," Information Processing Letters, vol. 45, pp. 19-23, 1993.
18. A. B. Kurzhanskiand and I. Vályi, Ellipsoidal Calculus for Estimation and Control, MA: Birkhäuser: Boston, 1996.
19. D. Karger, R. Motwani and M. Sudan, "Approximate graph coloring by semidefinite programming," Journal of the ACM, vol. 45, pp. 246-265, 1998.
20. H. Karloff, Linear Programming, Birkhäuser: Boston, 1991.
21. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol. 4, pp. 373-395, 1984.
22. R. M. Karp, "Reducibility among combinatorial problems," Proceedings of a symposium on the Complexity of Computer Computations, pp. 85-104, 1972.
23. S. Lu, T. Nandagopal and V. Bharghavan, "Fair scheduling in wireless packet networks," Proceedings of ACM MOBICOM, vol. 27, pp. 63-74, 1997.
24. I. Méndez Díaz and P. Zabala, "A Branch-and-Cut Algorithm for Graph Coloring," proceedings of Computational Symposium on Graph Coloring and Generalizations, 2002.
25. T.S. Ng, I. Stoica and H. Zhang, "Packet fair queueing algorithms for wireless networks with location-dependent errors," Proceedings of IEEE INFOCOM, vol 3, pp. 1103-1111, 1998.
26. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: the single node case," IEEE/ACM Transactions on Networking, vol. 1, pp. 344-357, 1993.
27. H. A. Peelle, "Graph coloring in J: an introduction," Proceedings of ACM SIGAPL APL Quote Quad Conference, vol. 31, pp77-82, 2000.
28. P. Ramanathan and P. Agrawal, "Adapting packet fair queueing algorithms to wireless networks," Proceedings of ACM MOBICOM, pp. 1-9, 1998.
29. H. Zhang, "Service Disciplines for Guaranteed Performance Service in Packet-switching Networks," proceedings of the IEEE, vol. 83, pp. 1374-1396, 1995.