[PDF] Top 20 Node-disjoint paths in incomplete WK-recursive networks
Has 10000 "Node-disjoint paths in incomplete WK-recursive networks" found on our website. Below are the top 20 most common "Node-disjoint paths in incomplete WK-recursive networks".
Node-disjoint paths in incomplete WK-recursive networks
... received in revised form 11 May 1998; accepted 19 April 2000 Abstract The incomplete WK-recursive networks have been recently proposed to relieve the re- striction on the sizes of the ... See full document
20
Broadcasting on incomplete WK-recursive networks
... Figure 8 shows the average percentages of nodes that receive the message from the source node via the shortest paths.. Chen and Duh's broadcasting algorithm [2] for K(d, t) was adop[r] ... See full document
7
Node-disjoint paths in hierarchical hypercube networks
... subclass in which prioritization is key to optimizing the overall per- formance of the ...network. In this paper, we have proposed a pragmatic polling with nonpreemptive priority-based access control scheme ... See full document
13
The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks 劉驥雷、洪春男
... Theoretical Computer Science, pp. 257-271, 2005. [20] S. Madhavapeddy, I. H. Sudborough, “A topological property of hypercubes: node disjoint paths,” Proc. of the 2th IEEE Symposium on Parallel and ... See full document
2
Routing Functions-an Effective Approach to Deriving One-to-Many Disjoint Paths
... elements in which multiple occurrences of the same element are allowed [15]. In this paper, we introduce a new concept of routing functions, which can be used to construct one-to-many disjoint ... See full document
51
A Reconfigurable Formation and Disjoint Hierarchical Routing for Rechargeable Bluetooth Networks
... Abstract: In this paper, a reconfigurable mesh-tree with a disjoint hierarchical routing protocol for the Bluetooth sensor network is ...c in its downstream direction to determine new ...topology ... See full document
18
Topological properties of incomplete WK-recursive networks
... By its aid, we ( I ) compute the connectivities of the incomplete WK-recursive networks, ( 2 ) show that they are hamiltohian if their connectivities are greater t[r] ... See full document
8
A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks
... In this way, the diameter problem on the incomplete WK- recurisve networks is reduced to the diameter problem on the multistage graphs.. In the next section, the incomplete WK-re[r] ... See full document
8
Pancyclic Properties of the WK-Recursive Networks
... the WK-Recursive networks. We show that a WK-Recursive network with amplitude W and level L is vertex-pancyclic for W ≥ ...resides in cycles of all lengths ranging from 3 to N, ... See full document
11
Fault-tolerant hamiltonian connectivity of the WK-recursive networks
... In this paper, a network is represented as a loopless undirected graph. For graph definitions and notations we follow [1]. G ¼ ðV; EÞ is a graph if V is a finite set and E is a subset of {ðu; v Þjðu; v Þ is an ... See full document
10
One-to-Many Disjoint Paths in Hypercubes
... one-to-many disjoint paths in ...m disjoint paths whose maximal length is minimized in the worst case can be obtained in a k-dimensional hypercube, where ... See full document
7
Two Spanning Disjoint Paths with Required Length in Augmented Cubes
... cubes. In Section 3, we introduce the 2RP-property for the augmented cube AQ n and prove that AQ n satisfies the 2RP-property if n ≥ ...some in- teresting properties of augmented cubes are consequences of ... See full document
14
Hop Count Distribution of Multihop Paths in Wireless Networks With Arbitrary Node Density: Modeling and Its Applications
... transmissions in multihop wire- less networks with an arbitrary node ...each node, the neighbor node with the shortest distance to the destination is selected as the relaying ... See full document
11
Long paths in hypercubes with conditional node-faults
... every node should have at least two fault-free neighbors while a long path is constructed between every pair of fault-free ...fault-free node with only one fault-free neighbor, namely ...every node ... See full document
15
Designing a disjoint paths interconnection network with fault tolerance and collision solving
... another disjoint path to tolerate the faulty ...links in a switch are changed to bi-direction and the rerouting hop count is ...routing paths increases no matter whether packets encounter a faulty or ... See full document
18
3-disjoint gamma interconnection networks
... ample, in the present case when S ¼ 6 and D ¼ 6, and the routing path may be 6 ! 6 ! 6 ! 6, however, as the straight link from stage 1 to stage 2 is faulty, the path can be 6 ! 6 ! 4 ! ... See full document
6
Clock Skew Based Node Identification in Wireless Sensor Networks
... 1) In-network: For a node in WSNs to identify all its neigh- bor nodes, an approach with little calculation and memory is ...neighbor node, as shown in Table ...shown in Fig. 3, ... See full document
5
Novel Broadcasting Algorithm of Recursive Networks
... In this paper, we present a novel broadcasting algorithm for the complete WKRecursive network, which is much simpler and requires only constant data included in each message and consta[r] ... See full document
1
Fault-free longest paths in star networks with conditional link faults
... interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each node is assumed to be incident with two or more fault-free ... See full document
10
Modeling node mobility for reliable packet delivery in Mobile IP networks
... mobile node may roam across multiple ...delivery in Mobile IP networks can be modeled as a renewal process, because the retransmission over a new tunnel after each boundary crossing is independent of ... See full document
4
相關主題