Assigning codes in wireless networks: bounds and scaling properties
暂无分享,去创建一个
Roberto Battiti | Alan A. Bertossi | Maurizio A. Bonuccelli | R. Battiti | A. Bertossi | M. Bonuccelli
[1] Tarek Makansi,et al. Transmitter-Oriented Code Assignment for Multihop Packet Radio , 1987, IEEE Trans. Commun..
[2] Leonard Kleinrock,et al. Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..
[3] Limin Hu,et al. Distributed code assignments for CDMA packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.
[4] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[5] Michael A. Trick,et al. A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..
[6] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[7] Marek Kubale,et al. A generalized implicit enumeration algorithm for graph coloring , 1985, CACM.
[8] Norman Abramson,et al. The ALOHA System-Another Alternative for Computer Communications , 1899 .
[9] Alan A. Bertossi,et al. Code assignment for hidden terminal interference avoidance in multihop packet radio networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[10] Imrich Chlamtac,et al. Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.
[11] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[12] Israel Cidon,et al. Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.
[13] Imrich Chlamtac,et al. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.