Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Brigham Young University

Series

Ad hoc networks

Publication Year

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

Hop-By-Hop Multicast Transport For Mobile Ad Hoc Wireless Networks, Manoj Pandey, Daniel Zappala Oct 2008

Hop-By-Hop Multicast Transport For Mobile Ad Hoc Wireless Networks, Manoj Pandey, Daniel Zappala

Faculty Publications

Multicast transport is a challenging problem because the source must provide congestion control and reliability for a tree, rather than a single path. This problem is made even more difficult in mobile ad hoc networks due to problems caused by contention, spatial reuse, and mobility. In this paper, we design a hop-by-hop multicast transport protocol, which pushes transport functionality into the core of the network. Although this requires per-flow state, a hop-by-hop approach simplifies congestion control, enables local recovery of lost packets, and provides low delay and efficient use of wireless capacity. We use a simulation study to demonstrate the …


Scalable Multicast Routing For Ad Hoc Networks, Manoj Pandey, Daniel Zappala Oct 2008

Scalable Multicast Routing For Ad Hoc Networks, Manoj Pandey, Daniel Zappala

Faculty Publications

Routing in a mobile ad hoc network is challenging because nodes can move at any time, invalidating a previously-discovered route. Multicast routing is even more challenging, because a source needs to maintain a route to potentially many group members simultaneously. Providing scalable solutions to this problem typically requires building a hierarchy or an overlay network to reduce the cost of route discovery and maintenance. In this paper, we show that a much simpler alternative is possible, by using source specific semantics and relying on the unicast routing protocol to find all routes. This separation of concerns enables the multicast routing …


To Repair Or Not To Repair: Helping Ad Hoc Routing Protocols To Distinguish Mobility From Congestion, Qiuyi Duan, Roger Pack, Manoj Pandey, Lei Wang, Daniel Zappala May 2007

To Repair Or Not To Repair: Helping Ad Hoc Routing Protocols To Distinguish Mobility From Congestion, Qiuyi Duan, Roger Pack, Manoj Pandey, Lei Wang, Daniel Zappala

Faculty Publications

In this paper we consider the problem of distinguishing whether frame loss at the MAC layer has occurred due to mobility or congestion. Most ad hoc routing protocols make the faulty assumption that all frame loss means the destination node has moved, resulting in significant overhead as they initiate the repair of routes that have not been broken. We design a mobility detection algorithm, MDA, that properly detects the cause of a lost frame, then coordinates with the routing protocol so that it reacts properly. This approach dramatically reduces routing protocol overhead and significantly increases application throughput. We use a …