This paper studies reliability of probabilistic neighbor-aware gossip algorithms over three wellknown large-scale random topologies, namely Bernoulli (or Erdős-Rényi) graph, the random geometric graph, and the scale-free graph. We propose a new and simple algorithm which ensures higher reliability at lower message complexity than the three families of gossip algorithms over every topology in ou...

In this paper, we address the multicast routing problem for mobile ad hoc networks (MANETs). We present the Source Grouped Flooding approach to achieve multicast in MANETs. The protocol creates multiple multicast routes between the source and group members based on hop count distance constraints. We also propose a probabilistic data forwarding mechanism to achieve efficient data dissemination. ...

The overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exp...

Introduction Increasing numbers of mobile computing devices form dynamic networks in daily life. In such environments, nodes (i.e. laptops, PDAs, smart phones) are sparsely distributed, forming a network which is often partitioned due to geographical separation or node movement. We envision a new communication paradigm using dynamic interconnectedness between people leading towards a world wher...

Delay tolerant Network is of great interest during these days. Like adhoc network, there is no route setup and maintenance phase and hence routing is an issue of greatest interest for opportunistic network called Delay Tolerant Network. The majority of routing schemes that have been proposed earlier are broadly classified as flooding and forwarding strategies. In this paper, we try to evaluate ...

The design issues related to routing in Wireless Sensor Networks (WSNs) are inherently different from those encountered in traditional mobile ad hoc networks. Routing protocols forad hoc networks usually impose prohibitive demands on scares resources of a sensor node such as memory, bandwidth and energy; therefore, they are not suitable for WSNs. In this paper, we present a novel, energy adapti...

In dynamic routing construction of ICN, traditional CCN routing mechanism can improve the diversity and reliability of data forwarding. But it also brings problems in retrieval redundancy, taking some load to the network. SoCCeR strategy uses ant colony algorithm to finish single-path routing of CCN in distribution, while it has defects in ant agency control and convergence feature. Therefore, ...

Multihop ad hoc networks were designed assuming trustworthiness and cooperation between all participating nodes; nodes in an ad-hoc network rely on one another in packet forwarding, detecting routes, etc. Thus, the performance of an ad hoc network degrades considerably with the presence of misbehaving nodes. Nodes’ misbehaviour includes, but is not limited to, refusing to relay data packets, co...

The spreading of an epidemic is determined by the connectiviy patterns which underlie the population. While it has been noted that a virus spreads more easily on a network in which global distances are small, it remains a great challenge to find approaches that unravel the precise role of local interconnectedness. Such topological properties enter very naturally in the framework of our two-time...

This paper presents a new prediction-based forwarding protocol for the complex and dynamic Delay Tolerant Networks (DTN). The proposed protocol is called GrAnt (Greedy Ant) as it uses a greedy transition rule for the Ant Colony Optimization (ACO) metaheuristic to select the most promising forwarder nodes or to provide the exploitation of good paths previously found. The main motivation for the ...