The DADCQ protocol utilizes the distance method to select forwarding nodes. The performance of this method Depends heavily on the value of the decision threshold, but it is difficult to choose a value that results in good performance across all Scenarios. Node density, spatial distribution pattern, and wireless channel quality all affect the optimal value. Broadcast protocols Tailored to vehicu...

Following the seminal work of Wieselthier et al. on power-efficient broadcast routing, a novel technique called Embedded Wireless Multicast Advantage (EWMA) was proposed to further reduce the total transmit power of a broadcast routing tree. In our previous work, we showed that when the network lifetime is defined as the time for the first node failure due to battery depletion, the total transm...

This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able t...

Many times, routing of signal nets in the layout design of VLSI circuits turns out to be a bottleneck in designing complex chips, due to the inherent compute-intensive nature of this task. Parallel processing of the routing problem holds promise for mitigating this situation. In this context, we present a parallel channel routing algorithm that is targetted to run on loosely coupled computers l...

Opportunistic routing is based on the use of broadcast transmissions to expand the potential forwarders that can assist in the retransmission of the data packets. The receptors need to be coordinated in order to avoid duplicated transmissions. This is usually achieved by ordering the forwarding nodes according to some criteria. The proposed opportunistic routing protocols differ in the criterio...

A wireless ad hoc network is a notable type of network in which a collection of mobile nodes with wireless network interfaces may form a temporary network, without use of any fixed infrastructure or centralized control. The Dynamic Source Routing protocol (DSR) is a efficient routing protocol explicitly designed for multi-hop wireless ad hoc networks of mobile nodes. A connected dominating set ...

The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper, we study this problem in a wormhole-routed 3D torus which provides the dimension-ordered routing and the all-port communication capability. We propose an efficient scheme to utilize the distance-insensitive characteristic of wormhole routing. The scheme requires at most 4 steps more than the optima...

Unidirectional links can occur in wireless networks and mixed-media networks. However, the vast majority of routing algorithms proposed to date require bidirectional links to operate. We present an efficient link-state routing algorithm, which we call ULPC, that operates with unidirectional links. ULPC is based on the concept of “inclusive cycle” of a link, which is the distance that link-state...