Learn More
An admission control algorithm must coordinate between flows to provide guarantees about how the medium is shared. In wired networks, nodes can monitor the medium to see how much bandwidth is being used. However, in ad hoc networks, communication from one node may consume the bandwidth of neighboring nodes. Therefore, the bandwidth consumption of flows and(More)
—Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network for increased probability of message delivery. However, such techniques can cause a large amount of contention in the network, increase overall delays, and drain each mobile node's(More)
— Battery power is an important resource in ad hoc networks. It has been observed that in ad hoc networks, energy consumption does not reflect the communication activities in the network. Many existing energy conservation protocols based on electing a routing backbone for global connectivity are oblivious to traffic characteristics. In this paper, we(More)
In mobile computing, power is a limited resource. Like other devices, communication devices need to be properly managed to conserve energy. In this paper, we present the design and implementation of an innovative transport level protocol capable of significantly reducing the power usage of the communication device. The protocol achieves power savings by(More)
— In this paper, we present MPARC (Multi-Priority Admission and Rate Control), a novel joint admission control and rate policing protocol for multi-priority ad hoc networks. MPARC is based on our novel bandwidth allocation model and guarantees that the throughput of admitted realtime flows will not decrease due to later arriving realtime flows with equal or(More)
This paper presents a theoretical study on distributed contention window control algorithms for achieving arbitrary bandwidth allocation policies and efficient channel utilization. By modeling different bandwidth allocation policies as an optimal contention window assignment problem, we design a general and fully distributed contention window control(More)
— In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad hoc networks. By adapting the contention window sizes of IEEE 802.11, DDA schedules packets of flows according to their individual delay requirements. The novelty of DDA is that it(More)