Embedding and reconfiguration of spanning trees in faulty hypercubes

Avresky, Dimiter R.

doi:10.1109/71.755820

Cited by 15 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Fig. 2 illustrates the Hamiltonian path between u and v in the PM 0 f [2]. Suppose that the lemma follows for n = k P 2.…”

Section: Hamiltonian-connectedness Of Pm F [N]mentioning

confidence: 94%

“…Fig. 1 shows the structure of PM [2]. Furthermore, PM[n] can be considered as a 4-ary rooted tree, in which every node in the same layer is connected as a mesh [1].…”

Section: Background and Notationsmentioning

confidence: 99%

“…Topological properties of the faulty networks were investigated in the literature [2,5,10,12,13,15,17,27,30]. These studies related to the faulty networks include computing diameter, fault diameter, and wide diameter, providing routing, multicasting, broadcasting and embedding rules.…”

Section: Introductionmentioning

confidence: 99%

“…Certain special mapping functions enable networks to be embedded within other networks [2,7,[10][11][12][13]15,17,18,24,30]. All algorithms developed in a network can be also used in the network that encloses it.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Proof that pyramid networks are 1-Hamiltonian-connected with high probability

Duh

Chen²,

2007

Information Sciences

View full text Add to dashboard Cite

“…Fig. 2 illustrates the Hamiltonian path between u and v in the PM 0 f [2]. Suppose that the lemma follows for n = k P 2.…”

Section: Hamiltonian-connectedness Of Pm F [N]mentioning

confidence: 94%

“…Fig. 1 shows the structure of PM [2]. Furthermore, PM[n] can be considered as a 4-ary rooted tree, in which every node in the same layer is connected as a mesh [1].…”

Section: Background and Notationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Proof that pyramid networks are 1-Hamiltonian-connected with high probability

Duh

Chen²,

2007

Information Sciences

View full text Add to dashboard Cite

“…Spanning tree routing protocol [5] is originated from the communication switches. And it exploits the data aggregated maneuverability into WSN.…”

Section: A Spanning Treementioning

confidence: 99%

Research of Directed Spanning Tree Routing Protocol for Wireless Sensor Networks

Zhang

et al. 2007

2007 International Conference on Mechatronics and Automation

View full text Add to dashboard Cite

In Wireless Sensor Networks (WSN), two major challenges are to maximize network lifetime and to enhance the tolerance of networks. Both of them are related to routing protocol. Therefore, a routing protocol that is called Directed Spanning Tree (DST) is proposed. In this paper, the construction of directed tree-based communication path and the data aggregation mechanism based on DST are discussed. For overcoming the frangibility of traditional routing protocols during nodes failure, a directed tree reconstruction scenario is also explored. Furthermore, the proposed protocol is evaluated in comparison with the existing protocols from the effect of energy saving to the failXUH-tolerance. With the simulation, the performance of DST is verified to be efficient and available.

show abstract