Routing strategy in disconnected mobile ad hoc networks with group mobility

Abstract

Most of the current proposed routing protocols in delay-tolerant network (DTN) are designed based on the entity mobility. In this article, we consider the routing in DTN with group mobility, which is useful in modeling those cooperative activities. The new proposed routing scheme is called group-epidemic routing (G-ER). G-ER is designed on the basis of one DTN protocol called epidemic routing (ER). In G-ER, two strategies related to the unique characteristics of the group mobility have been proposed to greatly improve ER. The first is to treat each group as a single node and exchange packets between groups instead of individual nodes. Thus, the resource-consuming problem of ER could be much alleviated. In the meantime, exchanging packets between two groups could speed up the packet delivery. The second is the buffer sharing inside a group, which is supported by the cooperative nature in group mobility. Moreover, we specifically propose a group dynamic model for group mobility to realize group splitting and merging. The performance of G-ER is studied by extensive simulations and compared with ER and dynamic source routing (DSR). Results show that G-ER outperforms ER and DSR in different network scenarios even with group dynamics.

Towards network coding enhanced routing protocols for group mobility

“…We propose a packet replication based (or flooding based) routing scheme called group-epidemic routing (G-ER) [14] to achieve the first objective above. Thus far, although various routing strategies have been proposed to deliver packets in a DTN [15,16], we find that the simple strategy, i.e., the flooding based strategy, is a good match for group mobility.…”

“…1 (2,4) ≤ 2 (14) { 5 (0,4) , 3 1 } + 0 (1,5) + 1 2 + 4 5 + 1 4 + 1 (2,4) ≤ 1 (15) Note that Inequality (14) actually corresponds to the restriction mentioned above in NC-VOH because 1 (2,4) denotes the number of encoded bits received by node 4 per time unit and 2 , the flow rate of f2, amounts to the number of virtually overheard bits at node 4 per time unit. Hence, with Inequality (14) above, all encoded packets from f3 can be successfully decoded at node 4.…”

“…14 shows the overall throughput of DCAR-VOH+, DCAR-VOH, and DCAR. Not surprisingly, DCAR-VOH+ is the best performer among them.…”

Cooperative opportunistic data delivery solutions for challenging wireless networks

“…HYMAD [48] is a hybrid DTN-MANET routing protocol, which uses end-toend routing to forward messages within cluster/group and uses SCF routing to forward messages between groups. Group epidemic routing (G-ER) [82] is another type of hybrid routing protocol similar to HYMAD. In G-ER, it treats a group of connected nodes as an individual node.…”

“…Some mobility models which consider the social ties between nodes and community/group movement patterns have been proposed [81]. In addition, community/group/cluster/social aware SCF-based routing protocols have also been proposed [58,26,20,82,48,36,19,18].…”