S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, March 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Neighbor-Aware Control In Ad Hoc Networks - Bao (Correct)
....on nodes or edges) 31] 34] 69] Polynomial algorithms are known to achieve suboptimal solutions using heuristics based on such graph attributes as the degree of the nodes. A unified framework for TDMA FDMA CDMA channel assignments, called UxDMA algorithm, was described by Ramanathan [65]. UxDMA summarizes the patterns of many other channel access scheduling algorithms into a single framework. These algorithms are represented by UxDMA with di#erent parameters. The parameters in UxDMA are the constraints put on the graph entities (nodes or links) such that entities related by the ....
....of CSMA and collision avoidance, it is almost irrelevant in that of scheduled approaches, except for shifting the points of reaching the network capacity. 3. 3 Simulations The delay and throughput attributes of NAMA, LAMA, PAMA and HAMA are studied by comparing their performance with UxDMA [65] in two simulation scenarios: fully connected networks with di#erent numbers of nodes, and multihop networks with di#erent radio transmission ranges. In the simulations, we use the normalized packets per time slot for both arrival rates and throughput. This metric can be translated into concrete ....
[Article contains additional citation context not shown here]
R. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Distributed Transmission Scheduling Using Code-Division.. - Bao, Garcia-Luna-Aceves (2002) (Correct)
....No. F49620 00 1 0330. 4, 13] Polynomial algorithms are known to achieve suboptimal solutions using randomized approaches or heuristics based on such graph attributes as the degree of the nodes. A unified framework for TDMA FDMA CDMA channel assignments, called UxDMA, was described by Ramanathan [12], which combines the general approaches of many other channel access scheduling algorithms in that these algorithms are now represented by UxDMA with di#erent parameters. The parameters to UxDMA indicate the constraints put on the graph entities (nodes or links) such that entities related by the ....
....The behaviors of HAMA is simulated in two scenarios: fully connected networks with di#erent numbers of nodes, and multihop networks with di#erent radio transmission ranges. The delay and throughput attributes of HAMA are gathered in each simulation, and compared with those of NAMA [1] and UxDMA [12] in the same simulation scenarios. In the simulations, we do not model the bandwidth of the radio channel with specific numbers, but use more abstract terms, such as packets per time slot for both arrival rate and throughput, which can be later translated into common bandwidth metrics, such as ....
[Article contains additional citation context not shown here]
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Hybrid Channel Access Scheduling in Ad Hoc Networks - Bao, Garcia-Luna-Aceves (2002) (8 citations) (Correct)
....edges) 6] 7] 15] Polynomial algorithms are known to achieve suboptimal solutions using randomized approaches or heuristics based on such graph attributes as the degree of the nodes. A unified framework for TDMA FDMA CDMA channel assignments, called UxDMA algorithm, was described by Ramanathan [14]. UxDMA summarizes the patterns of many other channel access scheduling algorithms in a single framework. These algorithms are represented by UxDMA with different parameters. The parameters in UxDMA are the constraints put on the graph entities (nodes or links) such that entities related by the ....
....two possible states, transmission or reception. The color for activations is used to the maximal extent in each contention situation. The delay and throughput attributes of HAMA are studied by comparing it through simulations with scheduling based solely on node activation, called NAMA, and UxDMA [14] in multihop networks with different radio transmission ranges. In the simulations, we use the normalized packets per time slot for both arrival rates and throughput. This metric can be translated into concrete throughput metrics, such as Mbps (megabits per second) if the time slot sizes and the ....
R. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Transmission Scheduling in Ad Hoc Networks with.. - Bao, Garcia-Luna-Aceves (2002) (13 citations) (Correct)
....feature of the antennas, if they are applied in ad hoc networks with directional antennas. Given the complete topology information of the ad hoc network, the computation of an optimal channel access schedule has long been known to be an NPhard problem in graph theory [5] 6] 13] Ramanathan [11] provided a unified framework, called UxDMA, for time, frequency or code division multiple access channel assignment using polynomial steps. Obviously, collecting the complete topology of the network and distributing the corresponding schedule pose a major challenge for applying UxDMA in ad hoc ....
....topology remains unchanged. Inherently, topology information needs to be collected and frequent schedule broadcasts have to be carried out in mobile networks. We compare ROMA with the best known static schedule approximation algorithms that are summarized in a unified framework by Ramanathan [11]. Assuming the global topology of the network, Ramanathan [11] provided a unified algorithm for coloring the nodes or links of the graph in polynomial time. The constraints on nodes or edges of the graph are represented by eleven atomic relations between nodes or edges. A constraint set ....
[Article contains additional citation context not shown here]
R. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Analytical Modeling Of Medium Access Control Protocols In.. - De Carvalho (2006) (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, March 1999.
Node Activation with Polling Channel Access - Yang, Garcia-Luna-Aceves (2004) (Correct)
No context found.
R. Ramanathan. A unified framework and algorithm for channel assignment in wireless network. Wireless Networks, 5(2):81 --94, 1999.
A New Approach to Channel Access Scheduling - For Ad Hoc (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Channel Access Scheduling in Ad Hoc Networks - With Unidirectional Links (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
On The Effectiveness Of Cooperative Diversity In Ad Hoc.. - Mac Layer Study (Correct)
No context found.
S. Ramanathan, "A unified framework and algorithm for channel assignment in wireless networks," Wireless Networks, vol. 5, no. 2, pp. 81--94, March 1999.
Utilization and Fairness in Spectrum Assignment - For Opportunistic Spectrum (Correct)
No context found.
RAMANATHAN, S. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5, 2 (March 1999), 81--94.
Collaboration and Fairness in Opportunistic - Spectrum Access Haitao (2005) (Correct)
No context found.
S. Ramanathan,"A unified framework and algorithm for channel assignment in wireless networks," Wireless Networks,vol.5,no.2, pp.81-94, March 1999.
Scheduling Communication in Real-Time Sensor Applications - Li, Shenoy, Ramamritham (2004) (Correct)
No context found.
S.Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, March 1999.
Channel Access Scheduling in Ad Hoc Networks with.. - Bao, Garcia-Luna-Aceves (2001) (3 citations) (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
A New Approach to Channel Access Scheduling - For Ad Hoc (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Scheduling Communication in Real-Time Sensor Applications - Huan Li Prashant (2004) (Correct)
No context found.
S.Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, March 1999.
Energy-Efficient, Collision-Free Medium Access.. - Rajendran.. (2004) (9 citations) (Correct)
No context found.
Ramanathan, S.: 1999, `A Unified Framework and Algorithm for Channel Assignment in Wireless Networks'. Wireless Networks 5(2), 81--94.
Asynchronous TDMA ad hoc networks: Scheduling and Performance - Salonidis, Tassiulas (2002) (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. In Proc. IEEE INFOCOM, Kobe, Japan, September 1997.
Fast Distributed Well Connected Dominating Sets for Ad Hoc.. - Parthasarathy, Gandhi (2004) (3 citations) (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Unknown - (Correct)
No context found.
R. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Distributed Channel Access Scheduling - For Ad Hoc (Correct)
No context found.
R. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Analysis of Bandwidth Allocation Algorithms for Bluetooth .. - Bhatia, Segall, Zussman (2004) (Correct)
No context found.
S. Ramanathan, "A Unified Framework and Algorithm for Channel Assignment in Wireless Networks", ACM/Kluwer Wireless Networks, Vol. 5, No. 2, pp. 81-94 Mar. 1999.
A History-based Scheduling Protocol for - Ad Hoc Networks (Correct)
No context found.
R. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
Energy-Efficient, Collision-Free Medium Access.. - Rajendran.. (2003) (9 citations) (Correct)
No context found.
RAMANATHAN, S. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5, 2 (1999), 81--94.
Analysis of Bandwidth Allocation Algorithms for Bluetooth .. - Bhatia, Segall, Zussman (2003) (Correct)
No context found.
S. Ramanathan, "A Unified Framework and Algorithm for Channel Assignment in Wireless Networks", ACM/Kluwer Wireless Networks, Vol. 5, No. 2, Mar. 1999.
Energy-Efficient, Collision-Free Medium Access.. - Rajendran.. (2003) (9 citations) (Correct)
No context found.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81--94, 1999.
First 50 documents
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