Distribution of route requests using dominating-set neighbor elimination in an on-demand routing protocol

Mosko, Marc; Garcia-Luna-Aceves, J.J.; Perkins, Charles E.

doi:10.1109/glocom.2003.1258392

Cited by 10 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this small CDS is very vulnerable to incorrect neighborhood information since even the broadcast data packet collisions can induce extra error in a node's neighborhood knowledge, which leads to a poor delivery ratio. To improve the delivery ratio, [17] proposes to add extra nodes into the forward node sets to increase the chance of successful transmission of broadcast data packets. On the other hand, using a proactive approach, such as with the algorithm presented in this paper, incorrect neighborhood information oftentimes results in too many backbone nodes rather than not enough.…”

Section: Time-efficient Algorithms [9]-[12]mentioning

confidence: 99%

See 1 more Smart Citation

Backbone Topology Synthesis for Multi-Radio Meshed Wireless LANs

Rubin

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Wireless local area network (WLAN) systems are widely implemented today to provide hot spot coverage. Operated typically in an infrastructure mode, each WLAN is managed by an access point (AP). Wireless mesh networks are employed for the purpose of extending the wireless coverage scope of the network. In this paper, we present a scalable and fully distributed algorithm that serves to autonomously elect certain Access Points as Backbone nodes to construct a connected mesh backbone network.We assume that multiple communications bands are used and that some nodal platforms are outfitted with multiple radio modules. The new scheme presented here is thus identified as a Multi-radio Topology Synthesis Algorithm (MR-TSA). Higher capability nodes are assumed to employ two radio modules and to engage in a collaborative manner in the construction of a mesh backbone network. Less capable nodes employ only a single radio module. We prove mathematically that the underlying topology synthesis algorithm induces control overhead and exhibits temporal convergence features that are independent of the number of network nodes. We also mathematically characterize the size of the constructed backbone network, deriving probabilistic bounds on the degree of dynamically elected backbone nodes. Extensive performance evaluations confirm the scalability and delaythroughput efficiency of the underlying multi-radio hierarchical operation. We also provide comparisons with other backbone based (and clustering oriented) operations.

show abstract

Section: Time-efficient Algorithms [9]-[12]mentioning

confidence: 99%

“…For efficient broadcast algorithms such as [16][17][18], there is no explicit CDS formed, but upon receiving a broadcast packet, every node selects a subset of its 1-hop neighbors to be "multipoint relays" to cover its 2-hop neighborhood. Similarly, 1-hop neighbor list exchange is required.…”

Section: Time-efficient Algorithms [9]-[12]mentioning

confidence: 99%

Backbone Topology Synthesis for Multi-Radio Meshed Wireless LANs

Rubin

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…For efficient broadcast algorithms such as [12] [17], there is no explicit CDS formed, but upon receiving a broadcast packet, every node selects a subset of its 1-hop neighbors to be "multipoint relays" to cover its 2-hop neighborhood. Similarly, 1-hop neighbor list exchange is required.…”

Section: Time-efficient Algorithms [4] [5] [6] [8] [9]mentioning

confidence: 99%

“…However, this small CDS is very vulnerable to incorrect neighborhood information since even the broadcast data packet collisions can induce extra error in a node's neighborhood knowledge, which leads to a poor delivery ratio. To improve the delivery ratio, [12] proposes to add extra nodes into the forward node sets to increase the chance of successful transmission of broadcast data packets. On the other hand, using a proactive approach, such as with the algorithm presented in this paper, incorrect neighborhood information oftentimes results in too many backbone nodes rather than not enough.…”

Section: Time-efficient Algorithms [4] [5] [6] [8] [9]mentioning

confidence: 99%

Mesh topology construction for interconnected wireless LANs

Rubin

2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 20

View full text Add to dashboard Cite

A wireless mesh network extends wireless local area network systems, which are widely implemented today to provide hot spot coverage, by implementing a reliable meshed network that serves to interconnect the access points managing each wireless local area network. The 802.11s working group has been formed recently to recommend an extended service set (ESS) that enables wider area communications among distributed clients, each of which has access to an IEEE 802.11 wireless LAN (WLAN). Such coverage can be provided by the implementation of a mesh backbone network that serves to interconnect the WLAN access points (APs). In this paper, we present a scalable, fully distributed topology control algorithm for constructing such a mesh backbone network of access points. Multi-hop communications among distant client stations take place in accordance with a routing algorithm that uses the mesh backbone to establish inter-WLAN routes.The presented topology construction algorithm and its employment by the presented routing mechanism are shown to improve the asynchronous, distributed and stable operation of the network. We prove that the topology construction and control algorithm introduced in this paper is highly scalable and efficient. The implementation complexity of the required communications control (and its associated overhead) and its temporal convergence features are independent of the number of network nodes.

show abstract

Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path Pruning

Rieck

Dhar

2010

Distributed Computing and Networking

View full text Add to dashboard Cite

Distribution of route requests using dominating-set neighbor elimination in an on-demand routing protocol

Cited by 10 publications

References 10 publications

Backbone Topology Synthesis for Multi-Radio Meshed Wireless LANs

Backbone Topology Synthesis for Multi-Radio Meshed Wireless LANs

Mesh topology construction for interconnected wireless LANs

Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path Pruning

Contact Info

Product

Resources

About