Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observatio...

Broadcast is an important collective communication operation required by many real-world parallel applications. This paper proposes the Coded Path Routing (or CPR for shorr) as a new approach for designing eficient broadcast algorithms for wormhole-switched multicomputer networks. A unique feature of the CPR is that a message can be delivered to an arbitrary number of destination nodes with sin...

The simulated annealing algorithm has been introduced into the broadcast routing of wireless sensor network so as to reduce the length and energy of broadcast path. However, its new solution is generated by randomly exchanging the location of two sensor nodes of broadcast path. Though the simulated annealing algorithm is better than 2-opt algorithm, its method of generating new solution has sti...

All-to-all broadcast is a collective communication in a network with the constraint that every node must send to each other certain piece of its data. This paper addresses the problem of optimal all-port all-to-all broadcast in multidimensional tori. The optimality criteria considered are the minimum exchange steps, no duplicated data in the sense that only new data are conveyed to receivers a...

Broadcast presents a special challenge for Wireless Sensor Networks (WSNs). In situations such as time synchronization or routing path establishment, broadcasted messages must be securely transmitted to all nodes, but this process is subject to attack launched by adversaries. For example, an adversary may attempt to waste the battery power of intermediate nodes by forcing a compromised node to ...

Most reactive routing protocols in MANETs employ a random delay between rebroadcasting route requests (RREQ) in order to avoid “broadcast storms.” However this can lead to problems such as “next hop racing” and “rebroadcast redundancy.” In addition to this, existing routing protocols for MANETs usually take a single routing strategy for all flows. This may lead to inefficient use of resources. ...

Multipath routing allows the establishment of multiple paths between a pair of source and destination node in mobile ad hoc network. It is typically proposed in order to increase the reliability of data transmission or to provide load balancing and has received more and more attentions. In this paper, we present a multipath source routing protocol with some QoS guarantee. During the routing dis...

A deployed wireless sensor network must be managed by an efficient and reliable routing protocol to overcome node degradation and failure, RF communication disruptions and limited energy reserves. RF transmissions are inherently broadcast. Existing research proposals for routing protocol designs typically use either flooding (routing same packet over all available paths) or selective broadcasti...

A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA) offers a low overhead solution, by optimizing the routing process. Three complementary strategies were used in our approach: during the route discovery we have used a new broadcast mechanism, called the Controlled Ne...

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation o...