J-H. Ju and V. O. K. Li, "TDMA scheduling design of multihop packet radio networks based on Latin Squares," IEEE Journal on Selected Areas in Communications, Vol.17 no.8, August 1999, pp.1345-1352. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Real-Time Communication and Coordination in Embedded .. - Stankovic, Lu, Sha, .. (2003) (11 citations) (Correct)
....i.e. the number of nodes and the maximum nodal degree. With the use of certain mathematical properties of finite (Galois) fields, the algorithm ensures that for every node and for each of its neighbors, there is at least one slot assigned in each frame. Similar algorithms were proposed in [72, 73], that use different slot assignment functions to maximize the minimum throughput a node can achieve. The major problem associated with the above topology independent algorithms is that as nodes do not exchange their slot allocation functions, a sender node has no idea which slot is collision ....
J. H. Ju and V. O. K. Li, "TDMA Scheduling Design of Multihop Packet Radio Networks Based on Latin Squares," IEEE JSAC. vol. 17, no. 8, pp. 1345-1352, August 1999.
Packets Distribution Algorithms for Sensor Networks - Florens, McEliece (2003) (4 citations) (Correct)
....case that once the target site of their sensing application is reached a semi permanent stationary configuration is adopted for the purpose of gathering information. In the area of general ad hoc networks as well as sensor webs, research has focused on routing [3] medium access control (MAC) 4] [5] and physical layer [6] 7] and [8] are protocol suites specifically designed for sensor webs. Theoretical results regarding capacity of general static ad hoc networks first appeared in [9] Also relevant to our research is the so called packet routing problem which consists in moving packets of ....
J. H. Ju and V. O. K. Li, "TDMA scheduling design of multihop packet radio networks based on latin squares," IEEE journal on selected areas in communications, vol. 17, no. 8, pp. 1345--1352, Aug. 1999.
Collision-Free Topology-Dependent Channel Access Scheduling - Bao, Garcia-Luna-Aceves (2000) (4 citations) (Correct)
....of scheduling protocols is that they can spend a considerable portion of the channel for channel contention, and such contention may result in unused time slots, because of unresolved contentions due to collisions. A number of topology transparent scheduling methods have been proposed [1] 5] [6]. The basic idea of the topologytransparent scheduling is for a node to transmit in a number of time slots in each frame. The times (slots) when node i transmits in a frame corresponds to a unique code such that, for any given neighbor k of i, node i has at least one transmission slot during which ....
Ji-Her Ju and V.O.K. Li. TDMA scheduling design of multihop packet radio networks based on latin squares. IEEE Journal on Selected Areas in Communications, 17(8):1345--52, Aug 1999.
Throughput-delay Analysis of Conflict-free Scheduling in.. - Shrader, Sanchez, Giles (Correct)
No context found.
J-H. Ju and V. O. K. Li, "TDMA scheduling design of multihop packet radio networks based on Latin Squares," IEEE Journal on Selected Areas in Communications, Vol.17 no.8, August 1999, pp.1345-1352.
Throughput-delay Analysis of Conflict-free Scheduling in.. - Shrader, Sanchez, Giles (2003) (Correct)
No context found.
J-H. Ju and V. O. K. Li, "TDMA scheduling design of multihop packet radio networks based on Latin Squares," IEEE Journal on Selected Areas in Communications, Vol.17 no.8, August 1999, pp.1345-1352.
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