A Paradigm for Quality-of-Service in Wireless Ad Hoc Networks Using Synchronous Signaling and Node States

Stine, John A.; Veciana, Gustavo de

doi:10.1109/jsac.2004.829347

Cited by 54 publications

(43 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Another area is to develop cross-layer designs that integrate several network layers, possibly ranging from the application layer, including the network layer, and reaching down to the medium access and physical layers. Exploiting the specific characteristics of the wireless medium access and physical layers, similar to the approaches in [54][55][56][57], appears especially promising in these cross-layer designs. Throughout, we believe it is vital to pay close attention to and formally understand the scaling behaviors of the MANET protocols.…”

Section: Discussionmentioning

confidence: 99%

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Ritchie

Yang

Richa

et al. 2006

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a 1-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders we formally prove that if there exists a route from a source to a destination node with a minimum hop count of ∆, then COB discovers a route with at most O(∆) hops from the source to the destination node in at most O(∆) time and by sending at most O(∆ 2 ) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing. Index Terms1-hop clustering, algorithm/protocol design and analysis, message complexity, routing protocol, scalability, time complexity, wireless mobile ad hoc network.

show abstract

Section: Discussionmentioning

confidence: 99%

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Ritchie

Yang

Richa

et al. 2006

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…It performs implicit resource reservation and provides QoS guarantees. Entropybased routing (EBR) [31], Channel Capacity-Based Routing (CCBR) [13] and Node State Routing (NSR) [32] are typical dependent protocols.…”

Section: Protocols Based On Interaction Between Network and Mac Layermentioning

confidence: 99%

A Survey of QOS Routing Protocols For Mobile Ad Hoc Network

Santhi

Nachiappan²

2010

IJCSIT

View full text Add to dashboard Cite

show abstract

“…To even begin to approach this ideal, accurate propagation and fading models, as well as node location awareness are required [62]. Accurate propagation and fading prediction models would foresee the impact of each transmission, while location awareness would provide distance estimates for the propagation model and could be used to infer node speeds and travel directions.…”

Section: Future Workmentioning

confidence: 99%

“…Accurate propagation and fading prediction models would foresee the impact of each transmission, while location awareness would provide distance estimates for the propagation model and could be used to infer node speeds and travel directions. The two models combined could be used to predict link failures [62]. Therefore, if mobile devices were equipped with location-determination systems, such as GPS receivers, and could activate an appropriate long-range propagation prediction model from a list of stored ones, more accurate admission decisions would be enabled.…”

Section: Future Workmentioning

confidence: 99%

Admission control schemes for 802.11-based multi-hop mobile ad hoc networks: a survey

Hanzo

Tafazolli

2009

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Abstract-Mobile ad hoc networks (MANETs) promise unique communication opportunities. The IEEE 802.11 standard has allowed affordable MANETs to be realised. However, providing Quality of Service (QoS) assurances to MANET applications is difficult due to the unreliable wireless channel, the lack of centralised control, contention for channel access and node mobility. One of the most crucial components of a system for providing QoS assurances is admission control (AC). It is the job of the AC mechanism to estimate the state of the network's resources and thereby to decide which application data sessions can be admitted without promising more resources than are available and thus violating previously made guarantees. Unfortunately, due to the aforementioned difficulties, estimating the network resources and maintaining QoS guarantees are non-trivial tasks. Accordingly, a large body of work has been published on AC protocols for addressing these issues. However, as far as it is possible to tell, no wide-ranging survey of these approaches exists at the time of writing. This paper thus aims to provide a comprehensive survey of the salient unicast AC schemes designed for IEEE 802.

show abstract

A Paradigm for Quality-of-Service in Wireless Ad Hoc Networks Using Synchronous Signaling and Node States

Cited by 54 publications

References 41 publications

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

A Survey of QOS Routing Protocols For Mobile Ad Hoc Network

Admission control schemes for 802.11-based multi-hop mobile ad hoc networks: a survey

Contact Info

Product

Resources

About