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...

The Ad hoc On-demand Distance Vector (AODV) is an on-demand routing protocol designed specifically for mobile, ad hoc networks. But the packet latencies with AODV can be very high, > 100 ms on average, especially when the network load is low and node mobility is high. To mitigate this effect, we have enhanced AODV with a proactive technique, which lets receiver nodes broadcast periodic ‘beacons...

A common operation in wireless ad hoc networks is the flooding of broadcast messages to establish network topologies and routing tables. The flooding of broadcast messages is, however, a resource consuming process. It might require the retransmission of messages by most network nodes. It is, therefore, very important to optimize this operation. In this paper, we first analyze the multipoint rel...

This paper presents an efficient multi-node broadcasting algorithm in a wormhole-routed 2-D torus, where there are an unknown number of s source nodes located on unknown positions each intending to broadcast a message of size m bytes to the rest of network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Most existing results are derived based on findin...

This paper introduces a multicast routing technique that is suitable for multimedia collaborative applications. Typically, the multicast groups for such applications are small and of slow membership dynamics. Moreover, the group members are not assumed to be located in a single domain; rather, they may span a global inter-network. An important requirement for multimedia collaborative applicatio...

Recent trends in Wireless Sensor Networks (WSNs) have suggested converging to such being IPv6-based. to this effect, the Internet Engineering Task Force has chartered a Working Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. This routing protocol, denoted RPL, has been under development for approximately a year, and this memorandum take...

Opportunistic routing (OR) is a recent routing technique for wireless multihop networks. It exploits the broadcast nature of wireless medium which is not utilized by traditional routing. The important features of OR is selection of forwarding nodes and co-ordination among the nodes to deliver the packets to their destination. Therefore, OR works well in wireless multihop networks with higher no...

In this paper, we address the minimum power broadcast problem in wireless networks. Assuming nodes are equipped with omni-directional antennas, the inherently broadcast nature of wireless networks can be exploited to compute power efficient routing trees. We propose a 2-stage cluster-merge algorithm for computing minimum power broadcast trees. The cluster phase is a look-ahead variant of the Br...

In the Wireless Sensor Networks Architecture with the existing routing schemes, the downlink communication from Base station to the Sensors is significantly more expensive than that in the uplink direction. In this paper, we propose a new Wireless Sensor Networks Architecture where the Base Station directly communicates to the Sensor Nodes in the downlink direction over the wireless broadcast c...