See this document in CiteSeerX!

A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks (1997)  (Make Corrections)  (3 citations)
Ram Ramanathan
INFOCOM (2)



  Home/Search   Context   Related

 
View or download:
bbn.com/dawn/unified.ps
bbn.com/~ramanath/unified.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  bbn.com/dawn/dawnindex (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Channel assignment problems in the time, frequency and code domains have hitherto been studied separately. Exploiting the similarity of constraints that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our framework identifies eleven atomic constraints underlying most current and potential assignment problems, and characterizes a problem as a combination of these constraints. Based on this framework, we... (Update)

Similar documents based on text:   More   All
0.4:   Distributed Problem Solving and the Boundaries of.. - Krishnamachari.. (2002)   (Correct)
0.3:   Optimal Routing, Link Scheduling and Power Control in.. - Cruz, Santhanam (2003)   (Correct)
0.3:   Fault-tolerant and 3-Dimensional Distributed.. - Bahramgiri.. (2002)   (Correct)

BibTeX entry:   (Update)

S. Ramanathan, "A Unified Framework and Algorithms for (T/F/C)DMA Channel Assignment in Wireless Networks", Proc. IEEE INFOCOM '97, Kobe, Japan, pp. 900-907, April 1997. http://citeseer.ist.psu.edu/ramanathan97unified.html   More

@inproceedings{ ramanathan97unified,
    author = "S. Ramanathan",
    title = "A Unified Framework and Algorithm for (T/F/C){DMA} Channel Assignment in Wireless Networks",
    booktitle = "{INFOCOM} (2)",
    pages = "900-907",
    year = "1997",
    url = "citeseer.ist.psu.edu/ramanathan97unified.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
577   Highly Dynamic Destination- Sequenced Distance-Vector Routin.. - Perkins, Bhagwat - 1994
474   Graph Theory (context) - Harary - 1972
225   The GSM System for Mobile Communications (context) - Mouly, Pautet - 1992
168   The DARPA packet radio network protocols (context) - Jubin, Tornow - 1987
104   Frequency Assignment: Theory and Applications (context) - Hale - 1980
67   Scheduling Broadcasts in Multihop Radio Networks (context) - Ephremedis, Truong - 1990
60   Making Transmission Schedules Immune to Topology Changes in .. (context) - Chlamtac, Farago - 1994
38   A New Model for Scheduling Packet Radio Networks - Sen, Huson - 1996
37   Future Directions in Packet Radio Architectures and Protocol.. (context) - Shacham, Westcott - 1987
36   Advances in Packet Radio Technology (context) - Kahn, Gronemeyer et al. - 1978
36   Distributed Code Assignments for CDMA Packet Radio Networks (context) - Hu - 1991
36   Scheduling Algorithms for Multihop Radio Networks (context) - Ramanathan - 1992
36   Scheduling Algorithms for Multihop Radio Networks (context) - Ramanathan, LLoyd - 1993
35   The Cellular Concept (context) - MacDonald - 1965

[Article contains additional citations not shown here]

Documents on the same site (http://www.net-tech.bbn.com/dawn/dawn-index.html):   More
Hierarchically-Organized, Multihop Mobile Wireless.. - Ramanathan, Steenstrup (1998)   (Correct)
A Location Management Protocol for Hierarchically Organized .. - Kasera, Ramanathan (1997)   (Correct)
A Survey of Routing Techniques for Mobile Communications.. - Ramanathan, Steenstrup (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC