Ad hoc wireless networks with mobile backbones

Rubin, I.; Behzad, A.; Ju, Huei-jiun; Zhang, R.; Huang, Xiaolong; Liu, Y.; Khalaf, Rima

doi:10.1109/pimrc.2004.1370934

Cited by 36 publications

(19 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The AODV creates the foundation for a variety of protocols in particular with different forms of explicit clustering techniques. For example, the Adaptive Routing using Clusters (ARC) [4] or Mobile Backbone Network Protocol-AODV (MBNP-AODV) [8] that utilizes the basic AODV with a clear distinction between backbone nodes (similar to cluster heads), regular nodes and nodes that can become backbone nodes.…”

Section: Background and Related Workmentioning

confidence: 99%

“…Reference [2] presents the Extended Hierarchical State Routing (HSR) and Extended HSR (EHSR) protocols with a network which consists of 100 nodes in a 1 kilometer (km) × 1 kilimeter theatre. Reference [3] makes calculations for a small number of nodes (8) and extrapolates the results for 100, 200 and 300 nodes. Most papers do not produce simulation results for more than a few hundreds nodes and sessions.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Scalability Issues in Ad-Hoc Networks: Metrical Routing Versus Table-Driven Routing

Ben-Asher

Feldman

et al. 2008

Wireless Pers Commun

View full text Add to dashboard Cite

When studying scalability in ad-hoc networks, most works present experimental results for a limited number of nodes (100-200). Various "explicit" clustering techniques have been proposed to improve scalability, obtaining successful sessions for 400-800 nodes. However, explicit clustering may damage the performance, e.g., cause session breaks due to fast movements of cluster heads. An alternative to explicit clustering is the use of algorithms that are "naturally clustered", i.e., arrange the nodes in dynamic hierarchical structures. In this work, we study the effect of explicit clustering by comparing an advanced version of the Ad Hoc Distance Vector Algorithm (AODV) with the Metrical Routing Algorithm (MRA) that possesses the natural clustering property. We cover fundamental aspects of scalability and experimentally prove the superiority of implicit clustering over explicit clustering. In particular, we consider heterogeneous theaters with several types of transmitters including personal, car-mounted, helicopters and a Geostationary (GEO) satellite. Natural clustering is more effective in heterogeneous theaters as the more powerful transmitters can serve as cluster heads. A formal bound based on general probabilistic assumptions shows that all existing ad-hoc algorithms cannot scale infinitely, thus rendering scalability as an experimental issue.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

Scalability Issues in Ad-Hoc Networks: Metrical Routing Versus Table-Driven Routing

Ben-Asher

Feldman

et al. 2008

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…We have recently introduced the Mobile Backbone Network (MBN) architecture in [9], [10]. In the MBN architecture, two classes of nodes are identified: Regular Nodes (RNs) and Backbone Capable Nodes (BCNs).…”

Section: Mobile Backbone Network Architecturementioning

confidence: 99%

“…In [9], [10], I. Rubin et al has introduced the Mobile Backbone Network (MBN) architecture to support multimedia applications for ad hoc wireless networks. Under the Mobile Backbone Network (MBN) architecture, a mobile backbone is dynamically constructed to provide a topological covering of the network.…”

Section: Introductionmentioning

confidence: 99%

Bit-Per-Joule Performance of Power Saving Ad Hoc Networks under Mobile Backbone Coverage

Huang

Rubin

2006

2006 IEEE International Conference on Communications

View full text Add to dashboard Cite

Energy efficient MAC protocols have been developed for wireless sensor and ad hoc networks so that inactive nodes can transition to sleep state to conserve energy. It has been recognized that forming and keeping a continuously awake Connected Dominating Set (CDS) serves to significantly reduce the route setup latency (since it minimizes the number of wakeup operations that are undertaken). Recently published studies show that, under certain traffic conditions, the CDS approach can lead to the reduction of the average level of energy consumption while ensuring a high network throughput level. Under the Mobile Backbone Network (MBN) architecture introduced by I. Rubin et al., a mobile backbone is dynamically constructed to provide a topological covering of the network. Nodes that join the mobile backbone are identified as Backbone Nodes (BNs). In this paper, we study a MBN Power Saving (MBN-PS) system. The dynamically elected BNs are kept active and are used to effectively manage the awake and sleep states of their client nodes. We study the throughput (per-watt) efficiency performance of the MBN-PS protocol by analytical calculations, as well as by extensive simulation evaluations. We analytically show that when the number of active network flows is above a minimal level, the underlying throughput efficiency attained by the MBN-PS scheme is better than that achieved by a corresponding network that does not form a backbone structure.

show abstract

“…We have recently introduced the mobile backbone network (MBN) architecture [10][11][12]. Two classes of nodes are identified: regular nodes (RNs) and backbone capable nodes (BCNs).…”

Section: Introductionmentioning

confidence: 99%

Bit-per-joule performance of power saving ad hoc networks with a mobile backbone

Huang

Rubin

2008

Wireless Netw

View full text Add to dashboard Cite

Energy efficient MAC protocols have been developed for wireless sensor and mobile ad hoc networks so that inactive nodes can transition into sleep state to conserve energy. It has been recognized that maintaining a continuously awake connected dominating set (CDS) serves to reduce the route setup latency. Under the mobile backbone network (MBN) architecture introduced by Rubin et al., a mobile backbone (Bnet) is dynamically constructed to provide a topological covering of the network. The MBN employs a hybrid routing algorithm under which flows that travel a distance longer than a threshold are directed along routes across the Bnet. In turn, a limited span network-wide global route discovery process is applied for routing shorter distance flows. In this paper, we introduce and analyze an MBN based power saving protocol (MBN-PS) that employs this hybrid routing scheme. Under the MBN-PS scheme, dynamically elected backbone nodes are kept awake, while inactive non-backbone nodes can reside in sleep state. We analytically show that, when the number of network flows is above a minimal level, the throughput per watt efficiency attained in an ad hoc network under complete backbone coverage is better than that achieved by a corresponding network that does not form a backbone. We present a model for the calculation of the bit-per-joule performance of the network as a function of the distance threshold. We confirm the validity of our analytical approach through simulations. Using our method, a network designer is able to choose the optimal distance threshold to be used by this scheme, based on traffic loading conditions.

show abstract

Ad hoc wireless networks with mobile backbones

Cited by 36 publications

References 12 publications

Scalability Issues in Ad-Hoc Networks: Metrical Routing Versus Table-Driven Routing

Scalability Issues in Ad-Hoc Networks: Metrical Routing Versus Table-Driven Routing

Bit-Per-Joule Performance of Power Saving Ad Hoc Networks under Mobile Backbone Coverage

Bit-per-joule performance of power saving ad hoc networks with a mobile backbone

Contact Info

Product

Resources

About