Citation Context

...ay strategy. The order of magnitude improvement in network capacity comes at the cost of the unpredictable end-toend transmission delay. Furthermore, partition-aware protocols, such as hypergossiping =-=[18]-=-, epidemic routing [27] and negotiation-based diffusion protocol [14], exploit mobility to overcome network partitioning. To profit from these mobility benifits, a new challenging class of mobility-ai...

Citation Context

...orm mobility traces based on a large training manoeuvre from FIFA world cup in Germany [1] – careful reconstruction of a recently published partition-tolerant algorithm (Hypergossiping) as a baseline =-=[12]-=- • preliminary model for optimising protocol parameters to reduce transmission energy The rest of this paper is organised as follows: We proceed by presenting the related work in Section II. The algor...

Citation Context

...protocol initiates the multicast group election procedure once the multicast tree becomes partitioned. If two parts of the tree become connected once again the tree has to be repaired. Hypergossiping =-=[7]-=- is a MANET broadcasting protocol that considers network partitioning in order to increase the delivery reliability of gossiping in sparse networks. Hypergossiping deploys a heuristic to detect partit...

Citation Context

...n the other hand, low density or particular mobility patterns render the network liable to ‘partitioning’ (Hahner et al, [12]). For such networks the flooding coverage tends to be poor (Khelil et al, =-=[17]-=-, Obraczka et al, [22]). Modifications of the flooding protocol, such as ‘Hypergossiping’ [17,16] and ‘Adaptive-Flooding’ [27] aim to improve coverage by allowing nodes to make more than one broadcast...

Citation Context

...y can be calculated off line, it heavily relies on the parameters of the environment. To overcome this limitation there are adaptive versions of the basic methods, like Hypergossiping. Hypergossiping =-=[37]-=- is one of the most recent algorithms discussed in this document. It is specifically designed for partitioned networks, where nodes are mobile, and partitions join and split from time to time. It is a...

Citation Context

...used depending on the ratio of P-MNs to nonparticipant MNs. The efficiency and availability of ParTAC can be enhanced by using partition aware dissemination and routing mechanisms like Hypergossiping =-=[15]-=-. Our proposed approach reduces the transaction decision time. Consequently the resource blocking time of P-MNs is reduced as the COs do not wait arbitrarily long to connect to decide the outcome of t...

Citation Context

...s. Another challenge for ad-hoc scenarios is the dissemination of parts of the MT to their corresponding MHs. For this partition-aware broadcast/multicast protocols can be used such as Hypergossiping =-=[12]-=-. Assuming that every MH in a partition knows all the members of the partition it is belonging to like in [13], then the members of every partition can exchange their votes (either to commit or abort ...

Citation Context

...wasting resources and the risk of messages not being propagated, the latter provides full coverage but generally results in slow propagation as well as a high bandwidth usage. Recently, Khelil et al. =-=[3]-=- proposed to use a combination of these approaches called hyper-gossiping to achieve best-effort broadcasts in partitioned networks. We believe that cooperation in post-disaster areas requires a new k...

Citation Context

...y can be calculated off line, it heavily relies on the parameters ofsthe environment. To overcome this limitation there are adaptive versions of the basicsmethods, like Hypergossiping.sHypergossiping =-=[64]-=- is specifically designed for partitioned networks, where nodes aresmobile, and partitions join and split from time to time. It is an advanced version of thesGossip algorithm, extended by neighbour in...