### TABLE VI CONTROL TRAFFIC OVERHEAD IN AD-HOC NETWORK PROTOCOLS.

2002

Cited by 2

### Table 1: Observed throughput for a network of four nodes using L-CSMA/CA and CSMA/CA for different offered loads with a Poisson arrival distribution.

2003

"... In PAGE 9: ... Here, we validate that argument through simulation, showing that, for small networks, the throughput of L-CSMA/CA remains extremely close to that of CSMA/CA even when the total aggregate traffic approaches the channel capacity. Table1 presents the throughput of a four-node network using both CSMA/CA and L-CSMA/CA for varying levels of offered load. The values were calculated by simulating the algo- rithms on the same set of Poisson arrivals.... ..."

Cited by 8

### Table 1: Observed throughput for a network of four nodes using L-CSMA/CA and CSMA/CA for different offered loads with a Poisson arrival distribution.

"... In PAGE 9: ... Here, we validate that argument through simulation, showing that, for small networks, the throughput of L-CSMA/CA remains extremely close to that of CSMA/CA even when the total aggregate traffic approaches the channel capacity. Table1 presents the throughput of a four-node network using both CSMA/CA and L-CSMA/CA for varying levels of offered load. The values were calculated by simulating the algo- rithms on the same set of Poisson arrivals.... ..."

### Table 1: Observed throughput for a network of four nodes using L-CSMA/CA and CSMA/CA for different offered loads with a Poisson arrival distribution.

"... In PAGE 9: ... Here, we validate that argument through simulation, showing that, for small networks, the throughput of L-CSMA/CA remains extremely close to that of CSMA/CA even when the total aggregate traffic approaches the channel capacity. Table1 presents the throughput of a four-node network using both CSMA/CA and L-CSMA/CA for varying levels of offered load. The values were calculated by simulating the algo- rithms on the same set of Poisson arrivals.... ..."

"... In PAGE 10: ... Here, we validate that argument through simulation, showing that, for small networks, the throughput of L-CSMA/CA remains extremely close to that of CSMA/CA even when the total aggregate traffic approaches the channel capacity. Table1 presents the throughput of a four-node network using both CSMA/CA and L-CSMA/CA for varying levels 0 5e+07 1e+08 1.5e+08 2e+08 2.... ..."

"... In PAGE 10: ... Here, we validate that argument through simulation, showing that, for small networks, the throughput of L-CSMA/CA remains extremely close to that of CSMA/CA even when the total aggregate traffic approaches the channel capacity. Table1 presents the throughput of a four-node network using both CSMA/CA and L-CSMA/CA for varying levels 0 5e+07 1e+08 1.5e+08 2e+08 2.... ..."

in Categories and Subject Descriptors: C.2.1 [Computer Communication Networks]: Wireless Commu-nication

"... In PAGE 10: ... Here, we validate that argument through simulation, showing that, for small networks, the throughput of L-CSMA/CA remains extremely close to that of CSMA/CA even when the total aggregate traffic approaches the channel capacity. Table1 presents the throughput of a four-node network using both CSMA/CA and L-CSMA/CA for varying levels 0 5e+07 1e+08 1.5e+08 2e+08 2.... ..."

### Table 1 Sample Trace Data for Ad-Hoc Routing Distance Velocity PCR PCH ...

"... In PAGE 9: ...f mobile networks (i.e., the number of nodes/routes is not xed). Table1 shows some ctional trace data for a node. During the \training quot; process, where a diversity of normal situations are simulated, the trace data is gath- ered for each node.... ..."

### Table 1: Ad-Hoc Results

1995

"... In PAGE 3: ... 3.2 Results A summary comparison of our approaches to ad-hoc retrieval averaged over the 50 queries in Q4 is tabulated in Table1 below. Compared with our standard approach pircs0, both of our enhancements in pircs1 and pircs2 are successful.... ..."

Cited by 20