Share This Author
MACAW: a media access protocol for wireless LAN's
This paper studies media access protocols for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center and develops a new protocol, MACAW, which uses an RTS-CTS-DS-DATA-ACK message exchange and includes a significantly different backoff algorithm.
Robust rate adaptation for 802.11 wireless networks
This paper designs and implements a new Robust Rate Adaptation Algorithm (RRAA), which uses short-term loss ratio to opportunistically guide its rate change decisions, and an adaptive RTS filter to prevent collision losses from triggering rate decrease.
A power controlled multiple access protocol for wireless packet networks
- J. Monks, V. Bharghavan, W. Hwu
- Computer ScienceProceedings IEEE INFOCOM . Conference on Computer…
- 22 April 2001
The initial simulation results show that the PCMA can improve the throughput performance of the non-power controlled IEEE 802.11 by a factor of 2 with potential for additional scalability as source-destination pairs become more localized, thus providing a compelling reason for migrating to a new power controlled multiple access wireless MAC protocol standard.
CEDAR: a core-extraction distributed ad hoc routing algorithm
- R. Sivakumar, P. Sinha, V. Bharghavan
- Computer ScienceIEEE INFOCOM '99. Conference on Computer…
- 21 March 1999
Preliminary performance evaluation shows that CEDAR is a robust and adaptive QoS routing algorithm that reacts effectively to the dynamics of the network while still approximating link-state performance for stable networks.
Routing in ad-hoc networks using minimum connected dominating sets
This paper uses an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone, and maintains local copies of the global topology of the network, along with shortest paths between all pairs of nodes.
Achieving MAC layer fairness in wireless packet networks
A general analytical framework is proposed that captures the unique characteristics of shared wireless channels and allows the modeling of a large class of system-wide fairness models via the specification of per-flow utility functions and generates local contention resolution mechanisms in response to a given utility function.
Fair scheduling in wireless packet networks
An ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current channel conditions is described, and the worst-case throughput and delay bounds are derived.
MCEDAR: multicast core-extraction distributed ad hoc routing
- P. Sinha, R. Sivakumar, V. Bharghavan
- Computer ScienceWCNC. IEEE Wireless Communications and…
- 21 September 1999
MCEDAR is an extension to the CEDAR architecture and provides the robustness of mesh based routing protocols and the efficiency of tree based forwarding protocols and it decouples the control infrastructure from the actual data forwarding infrastructure.
WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks
- P. Sinha, T. Nandagopal, N. Venkitaraman, R. Sivakumar, V. Bharghavan
- Computer ScienceWirel. Networks
- 1 August 1999
WTCP is rate-based, uses only end-to-end mechanisms, performs rate control at the receiver, and uses inter-packet delays as the primary metric for rate control, and can improve on the performance of comparable algorithms such as TCP-NewReno, TCP-Vegas, and Snoop-TCP by up to 200% for typical operating conditions.
Routing in ad hoc networks using a spine
- B. Das, R. Sivakumar, V. Bharghavan
- Computer ScienceProceedings of Sixth International Conference on…
- 22 September 1997
This work describes a self-organizing, dynamic spine structure within each lower level cluster to propagate topology changes, compute updated routes in the background, and provide backup routes in case of transient failures of the primary routes.