We present new distributed deterministic solutions to two communication problems in n-node ad-hoc radio networks: rumor gathering and multi-broadcast. In these problems, some or all nodes of the network initially contain input data called rumors, which have to be learned by other nodes. In rumor gathering, there are k rumors initially distributed arbitrarily among the nodes, and the goal is to ...

Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threats. Flooding is a robust algorithm but, because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to a broadcast storm in which th...

The problem of online routing on SIMD meshes arises when these processors are used for real-time analysis of sensory input. Existing algorithms|ones not making unrealistic hardware assumptions|use sorting as a subroutine and so, while asymptotically optimal, have running times at least 3 times greater (for likely array sizes) than the lower bound of 4n 4 communication steps. Dedicated router ne...

A wireless sensor network is an ad hoc network consisting of numerous sensor devices (nodes). These nodes are linked via short-range ad hoc radio connections. Each node in such a network has a limited energy resource (battery), and each node operates unattended. Consequently, energy efficiency is an important design consideration for these networks. Inspired by the fact that in complex systems ...

Paths with loops, even transient ones ,can pose significant stability problems in networks. Some earlier approaches like Shortest path routing (Dijkstra),Flooding, Flowbased routing, Distance vector routing(OSPF),Link state routing(Bellmen-Ford),Hierarchical routing, Broadcast routing, Multicast routing have problems maintaining the balance between node delays and link delays. We present a new ...

Mobile ad hoc networks comprise a collection of wireless nodes that dynamically create a network among themselves without using any pre-existing infrastructure. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to answer the organization, scalability and routing problems of mobile ad hoc networks. In this work, we propose an efficient distributed clust...

Routing is a key issue in wireless ad-hoc networks. The goal of an efficient routing strategy is to improve packet delivery ratio (PDR) and end-to-end delay in MANETs. Limited ability of layered architecture leads to the crosslayer design usage for routing operation in wireless environment. In this paper, a cross-layer connectionless routing is proposed based on Dynamic Virtual Router (DVR). In...

Clustered multi-hop wireless networks have attracted significant attention for their robustness to fading, hierarchical structure, and ability to exploit the broadcast nature of the wireless channel. The authors propose an opportunistic routing (or relay selection) algorithm for such networks. In contrast to the majority of existing approaches to routing in clustered networks, the algorithm pre...