Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mario Joa-Ng

dblp:85/4538 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Wireless networking · 43% Routing and switching · 40% Physical-layer communications · 13%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
mobile ad hoc networks
0.021999
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks · IEEE J. Sel. Areas Commun. 1999
Spread Spectrum Medium Access Protocol with Collision Avoidance in Mobile Ad-hoc Wireless Networks · INFOCOM 1999
Wireless networking › medium access control
collision avoidance
0.011999
Spread Spectrum Medium Access Protocol with Collision Avoidance in Mobile Ad-hoc Wireless Networks · INFOCOM 1999
Routing and switching › routing protocol
link-state routing
0.011999
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks · IEEE J. Sel. Areas Commun. 1999
Wireless networking
medium access control
0.011999
Spread Spectrum Medium Access Protocol with Collision Avoidance in Mobile Ad-hoc Wireless Networks · INFOCOM 1999
Routing and switching
routing protocol
0.011999
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks · IEEE J. Sel. Areas Commun. 1999
Physical-layer communications
spread spectrum
0.011999
Spread Spectrum Medium Access Protocol with Collision Avoidance in Mobile Ad-hoc Wireless Networks · INFOCOM 1999
Routing and switching › ad hoc network routing
zone routing
0.011999
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks · IEEE J. Sel. Areas Commun. 1999
Network performance modeling › queueing and scheduling
generalized processor sharing
0.011999
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks · IEEE J. Sel. Areas Commun. 1999

Methods — techniques the papers use, named apart from their topics

simulation · 0.0
YearPublicationVenuePosition
2000 Spread Spectrum Medium Access Protocoll with Collision Avoidance Using Controlled Time of Arrival
abstract
The spread spectrum technique, the collision avoidance multiple access protocols and the controlled time of arrival scheme are combined to form a new set of medium access protocols for wireless networks. The request-to-send and clear-to-send message dialogue helps a transmitter detect whether an intended receiver is busy and whether any collision has occurred; thus speeding up the retransmission. The spreading code assignment avoids the disruption of any ongoing transmission by an intruder. Finally, the packets are sent under controlled time of arrival to further increase the channel throughput. Simulation results confirm that a higher channel throughput is achieved by the new protocols even in a dense network.
Mario Joa-Ng
ICC (1)1
2000 Quantifying TCP Performance Improvements in Noisy Environments Using Protocol Boosters
abstract
This paper describes a robust method of improving TCP performance for terrestrial and satellite wireless networks without modification to TCP or change in its semantics. Tools to transparently improve performance have been around for many years and many work even when the TCP header information is encrypted (e.g., IPSEC) or TCP acknowledgments do not go through the reverse path. Little work has been done; however, to quantiy how beneficial these techniques are. Using protocol boosters we show that reducing the packet size is critical as bit error rates get worse than 10/sup -5/. We also show that over two orders of magnitude improvement in throughput can be achieved by adding redundant FEC packets, with well-chosen parameters for the number of data (k) and parity (h) packets in a block, and a small maximum encode time (t). It is important to note that we are looking strictly at enhancement techniques that do not require modifications at the end hosts as this can be a difficult task for the typical end user.
Deborah S. Bakin, Mario Joa-Ng, Tony McAuley
ISCC2
1999 Spread Spectrum Medium Access Protocol with Collision Avoidance in Mobile Ad-hoc Wireless Networks
abstract
Spread spectrum techniques and collision avoidance multiple access protocols are combined to form a new set of medium access protocols for mobile wireless ad hoc networks. The request-to-send and clear-to-send message dialogue solves the "hidden terminal" and the "exposed terminal" problems and speeds up the retransmission. The spreading code assignment avoids disruption of any ongoing transmission by an intruder. Simulation results confirm that a higher channel throughput is achieved by the new protocols even in a dense network.
Mario Joa-Ng, I-Tai Lu
INFOCOM1
1999 A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
abstract
A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: focal node and global zone levels. Unlike other hierarchical protocols, there is no cluster head in this protocol. The zone level topological information is distributed to all nodes. This "peer-to-peer" manner mitigates traffic bottleneck, avoids single point of failure, and simplifies mobility management. Since only zone ID and node ID of a destination are needed for routing, the route from a source to a destination is adaptable to changing topology. The zone ID of the destination is found by sending one location request to every zone. Simulation results show that our location search scheme generates less overhead than the schemes based on flooding. The results also confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol. This new routing protocol provides a flexible, efficient, and effective approach to accommodate the changing topology in a wireless network environment.
Mario Joa-Ng, I-Tai Lu
IEEE J. Sel. Areas Commun.1