Deterministic cooperative hybrid ring-mesh network coding for big data transmission over lossy channels in 5G networks

Abstract

Wired and wireless communication data is getting bigger and bigger at such a high pace. Accordingly, the big data (BD) communication networks should be developed as quickly as the quick increase in the exchanging data size is. Based on this regard, this paper proposes a wired and wireless protocol that applies cooperation Network coding (CoNC) in a wired ring topology (WRT) to improve exchanging the BD significantly in wireless mesh network (WMN). The paper presents a solution for distributed nodes to deal with big data over 5G by proposing Hybrid Ring-Mesh Protocols (HRMP) that exploit the CoNC technique at distributed nodes. The proposed protocol (X-ORING) deterministically combines the data that is received at a base station (BS), where the BS wirelessly retransmits the combined data to the WMN members, instead of just forwarding them to the WMN members. Moreover, all members of the WMN are connected by wired optical fibre channels in a WRT and directly to the BS. The results show that applying CoNC in the proposed protocols exploits the advantages of the WRP between the WMN members, and consequently, the WMN packet error rate is significantly improved. Moreover, using optical fibre wires between the mesh network members and the BS increases the WMN coverage region considerably, and allows the BS to receive all members' packets correctly. Finally, the results show that applying CoNC on the WRT improves the entire network maintenance and reliability greatly, simply because the proposed HRMP can continue broadcasting even if one of the direct optical fibre goes out of serves, i.e. the fibre link between one of the N member and the BS lost the connectivity.

1 Introduction

Big data (BD) communication networks are needed for almost all modern applications, starting from simple local networks that may consist of several members to complicated satellite and mobile networks that may connect a large number of users. Based on this regard, new research directions are recently being developed to adapt to this high pace of exchanging data size.

Though BD is a widespread and well-used expression, but yet there is no clear identification with specific parameters to identify the BD, so, to have a clear manner when dealing with BD, this paper identifies the BD by the data that is considered big to be processed smoothly and without creating a problem in the network because of its size. Indeed this identification makes the data size be a criteria to deal with BD issues without ignoring the other issues, which means that data size becomes not the only criteria.

The divide-and-conquer method is one of the relatively new techniques that was applied to mitigate the effect of BD, such as in [1, 2], where BD analysis was performed for a cluster of computers.

In [3], BD technical challenges were investigated and hence suggested Divide-and-Conquer as an effective method to deal with BD applications.

Recently, many research work has been released that investigates BD issues, such as in [4,5,6,7,8], where in [4] the analysis of data partitioning and sampling method is introduced, while [5] provides valuable and recent explains for BD fundamental concepts and analysis according to the theoretical army command information system.

In [6], the analysis of a large-scale data distribution management system was suggested to be tickled by a random sampling of the entire data.

Unlike [1,2,3,4,5,6], this paper proposes implementing cooperating network coding (CoNC) as a useful technique to help in solving the BD challenges for mesh network (MN).

CoNC presented in [7,8,9,10,11,12,13] as a useful technique to improve the data rate and decrease the need for the Automatic Repeat Request (ARQ), besides improving the Packet error rate (PER). The outcome from [7,8,9,10,11,12,13] shows that CoNC is regarded as an excellent technique to decrease the number of ARQ at an acceptable consequence of increasing the bit error rate (BER) in decode-and-re-encode technique, mainly when implementing a good forward error correction code.

Implementing ring topology (RT) in a wireless MN has presented early in [14], where RT was proposed to improve the mesh architecture fault tolerance, based on requiring the support from eight-neighbourhood members connected to the faulty one, regardless of the network’s data size and the number of network’s members, unlike of the proposed work, where all nodes of the ring network cooperate together to complete the communication for all members, by the support of a base station (BS).

Later on, Zheng et al. [15] showed how the RT tends to reduce the mechanical load performed in the wireless mesh central node. Still the work applied in [15] neither exploited the benefits of the CoNC, nor adjusted to fit BD communication networks. Moreover, the presented work in the proposed paper investigates the PER over erasure channels to show the practicality of the proposed HRMP for BD communication networks.

The relation between the number of connected members in the RT with the coverage region and network capacity investigated in [16], which clearly declared that implementing RT extends the mesh wireless coverage region. Though [16] managed to extend the mesh coverage region; still it did not fully exploit the advantage of applying RT, unlike the proposed work in this paper, which imposes CoNC on RT and the BS, resulting in enabling the proposed HRMP to enlarge the coverage region and to be more suitable for BD communication networks, as a result of improving the PER.

Recently in [17], a Hybrid Mesh-Ring topology presented for Bluetooth networks, which showed that the optimum Bluetooth configuration could be achieved to outperform the conventional ring-based method. Again [17] proved that HRMP has a valuable improvement when applied to particular applications.

The research work in [18,19,20] introduces useful proposes for applying Network Coding (NC) on wireless MN, which shows how NC can be helpful to improve the capacity throughput [18], improve the performance of the self-similar flow [19], and improve the multicast acceptance rate for multicast routing in multi-channel multi-radio [20].

Indeed, researches on MN are mainly directed to increase the region’s size, power efficiency, and reliability; for example, in [21], an experimental procedure implements ZigBee to determine the power consumption and reliability optimization, and [22] presented a mobile WMN where an autonomous control method of distribution is applied in a mobile WMN to enhance the energy consumption. More advanced research work performed in [23], where a wireless MN was proposed for the Internet of things (IoT) systems for smart homes and cities, undeniably [23] showed how WMN could be improved to adapt with such specific applications.

The proposed HRMP in this paper combines the advantages of applying a wired ring topology (WRT), with the advantages of applying a WMN to exchange BD via a BS. Hence, the BS applies CoNC on the received data before broadcasting the network coded data through erasure channels, resulting in improving the PER, reducing the ARQ, increasing the mesh coverage region, and decreasing the number of required wires, taking into consideration that reducing the number of required wires and the relative hardware significantly reduces the establishment and maintenance cost of the network, besides improving the network complexity and reliability as a results of applying CoNC on the WRT network.

The 5G networks and beyond are expected to be able to apply Artificial Intelligence (AI) and Machine Learning (ML) in wireless networks [24], and for unbalanced data in general [25], accordingly, proposing a deterministic fault avoidance protocol is regarded as in important step toward AI and ML fault corrections in wireless networks, such as the deterministic protocols proposed and discussed in [26].

The rest of the paper is organized as follows: Sect. 2 explains the system model proposed in this paper with the relative equations and designs, where Sect. 3 introduces the analytical results through MATLAB software codes to illustrate the benefits of the proposed work. Finally, Sect. 4 concludes the paper and presents the future work.

2 The system model and proposed method

Mesh topology is usually implemented in wired networks, where all nodes can exchange their data over direct-wired channels as shown in Fig. 1 for an MN of six members (M = 6) as an example. Figure 1 shows that MN suffers from a large number of wired cables with their relative connections' hardware; indeed, for M nodes MN, M(M − 1) cables and their relative hardware are needed, which is the reason of limiting the wired MN coverage region to ten meters or so. Moreover any connection problem between any two members; results in a total disconnection between them till removing the connection trouble. When a BD exchange network is needed for a large coverage communication region, wired MN becomes practically unsuitable. Consequently, this paper proposes a mix of wired and wireless protocols that exploit CoNC advantages to help in solving the MN challenges for BD networks. Indeed, results show that the proposed protocols significantly increase the MN coverage region and improve the MN applicability, as results, the proposed protocols assist in increasing the number of connected members and simplifying the algorithm that could be adopted for BD in 5G networks.

Fig. 1

Wired mesh network for M = 6 members that are connected by M(M − 1) fibre cables

2.1 The proposed hybrid ring-mesh benchmark

In the HRMP Benchmark scenario, M members are connected to each other’s by a WRT that requires M cables and their relative hardware elements. Simultaneously, the M members are connected to a BS by M optical fibre wires, consequently, 2M wires are required in the proposed Benchmark scenario.

The M members are connected to exchange their data through the WMN, where each member aims to receive and then retrieve the other M − 1 partner's information, as shown in Fig. 2 for a network of six members as an example.

Fig. 2

Six members are connected in a wired ring protocol to each other (solid lines) and a BS (dashed lines)

Figure 2 shows that only twelve (2M) wires are needed for this network because the BS is broadcasting the M member's data wirelessly.

In such a scenario where CoNC is not applied, the BS forwards the received M packets for the M members. After completing a full successful transmission stage, each member will be receiving the other M − l packets from the BS, besides its neighbour's two packets through the ring connected wired topology. It is important to notice that the BS broadcasts the received M packets separately, i.e. it does not combine (X-ORING) packets. The broadcast packets in the Benchmark scenario are called in this paper “single packets.”

Accordingly, the received matrix for node four—as an example—is shown in Eq. 1:

$${\text{Rp}}_{{\left( {M4} \right)}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3 } } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} 1 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 \\ \end{array} } \right]\;{\text{and}}\; \left[ {\begin{array}{*{20}c} {M_{3} } & {M_{5} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & {0 } \\ \end{array} \begin{array}{*{20}c} 0 & 1 & 0 \\ \end{array} } \\ \end{array} } \right]$$

(1)

where Rp_(M4) denotes to the single received packets at the fourth member.

According to Eq. 1, the M₄ member receives a maximum of five single packets from the BS and two single packets from its neighbour members, i.e. M₃ and M₅, besides the fact that M₄ knows its packet, accordingly, the retrieving matrix at M₄ when all packets are assumed to be received correctly, is:

$${\text{RT}}_{{\left( {M4} \right)}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} { {\text{BS}}\left( {{\text{single}}} \right) \left\{ {\begin{array}{*{20}c} 1 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 \\ \end{array} } \right\}} \\ { M_{4} \left( {{\text{retriever}}} \right) \left\{ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \right\}} \\ { {\text{ RT}} \left\{ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right\}} \\ \end{array} } \right]$$

(2)

where RT_(M4) denotes to the retrieving matrix at M₄ and BS(single) denotes to the single packets received from the BS (without applying CoNC).

When taking into consideration that the duplicated packets (received twice) is regarded as bandwidth and power waste ones; because they do not improve the retrieving matrix’s rank (Eq. 2) as they are not new linearly dependant equations, hence the RT and the retriever’s packet are considered as redundant.

Accordingly, Eq. 2 shows that the packets received through the WRT do not have any new information, and it is the same for each member’s packet in the whole network; so these three packets are pure redundant and hence discarded, which is considered as loss of power and more traffic for no new information.

The Jordan Gaussian Elimination (JGE) retrieving mechanism confirms that a receiver can retrieve all received packets when and only when the received retrieving matrix has a rank that equals the number of the unknown pivots [8, 11]. Based on JGE retrieving condition, each member of the WMN can retrieve all other members if the received rank of Eq. 2 equals M.

In the case that the BS drops any number of packets through the assumed lossy channels between all members and M₄,—as an example—the communication will not be fully completed unless if the dropped packets are the packets that were sent for RT packets (neighbours) (M₃ or/and M₅) or the own retriever packet (M₄). On the other hand, if the retriever member does not receive any packet other than the three known packets (RT and retriever), the communication will not be completed, i.e. the retrieving matrix’s rank (Eq. 2) will be less than M. Based on the above, the RT improved the WMN partially, and when assuming a large number of members, such as tens members, this improvement becomes trivial, as shown in the result Sect. 3.

The only remaining advantage of the Benchmark scenario is the ability of the network to enlarge the coverage region of the mesh network. Yet, the severe relation between the transmission distance and the PER in lossy network channels makes the coverage region to be limited even in the existence of the WRT. Moreover, if any disconnection problem happens to any optical fibre that connects any member of the M WMN members to the BS, the communication will not be completed for the disconnected member because its packet will not be received at the BS, and hence will not be broadcast to the rest of members, just only this member's neighbours that can receive the packet through the wired RT.

Network reliability of the Benchmark scenario is clearly at the minimum level, i.e. any maintenance over any optical fibre for the WNM results in isolating the optical fibre's member from sending its data to the BS, as shown in Fig. 3a for M₄ as an example. Moreover, if any disconnection happens between any two neighbours and either neighbours with the BS, the communication between these two neighbours will be disconnected and at the same time, the connection between either member with the BS is lost; consequently, the full communication between them will be lost, though they are neighbours, as shown in Fig. 3b for M₁ and M₂ as an example.

Fig. 3

Faults in the wired connections that result in the failure of the full communication

Figure 3a shows the case when a wire between an MN member and the BS is disconnected and Fig. 3b shows the case when a wire between two neighbours is disconnected simultaneously with a wire between the BS and either neighbour of the disconnected wire to the BS (M₁ to BS is proposed). Accordingly, in Fig. 3a, M₄ is isolated except from its two neighbours, where in Fig. 3b, M₁'s information will not be received at M₂ though they are neighbours.

Based on the above, the Benchmark scenario does not provide significant benefits to the whole network, other than improving the coverage region that severely depends on the PER in the channels between the N WMN members.

2.2 The proposed hybrid ring-mesh cooperation network coding protocol

Based on the disadvantages in the Benchmark scenario mentioned in Sect. 2.1, CoNC is proposed to fully exploit the benefits of the HRM connection shown in Fig. 2. Indeed, if the CoNC applied to the BS in a deterministic manner, the WRT plays such a significant role to improve the full connectivity of the MN, in addition to the original benefit of increasing the WMN coverage region, taking into consideration that CoNC mitigates the effect of the PER significantly [8], and hence improves the coverage region.

The proposed protocol is as follows: the BS manipulates the M single packets received from the optical fibre channels by deterministically combining (X-ORING) M − 1 different packets for M times, where every single packet is excluded just once from the M combination times, resulting in M different combined packets. This combination algorithm is called in this paper as “M − 1 combination”. Accordingly, the M deterministically combined packets, which are named "Network Coded Packets" (NCP), are as in Eq. 3 for a WMN of six members as an example:

$$T_{{{\text{NCP}}}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} 0 & 1 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 1 & 1 & 0 \\ \end{array} } \right]$$

(3)

where T_NCP denotes to the created NCP packets that are transmitted from the BS to the M members of the WMN, taking into consideration that the BS receives correctly the M single packets from the M WMN members through the optical fibre channels, so, it is always assumed that the BS receives the M packets correctly in a single form, i.e. each packet contains data for just one single member.

The received packets from the BS and RTat M₄, for example, are shown in Eq. 4:

$${\text{Rp}}_{{\left( {M4} \right)}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} { M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} 0 & 1 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 1 & 1 & 0 \\ \end{array} } \right]\;{\text{and}}\; \left[ {\begin{array}{*{20}c} {M_{3} } & {M_{5} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right]$$

(4)

where RT_(M4) denotes to the received packets at M₄, noticing that the receiving row for any none received packet will be a row of zeroes in Eq. 4.

Considering that M₄ knows its packet, so, the JGE retrieving matrix at M₄ is given in Eq. 5:

$${\text{RT}}_{{\left( {M4} \right)}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} 0 & 1 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 1 & 1 & 0 \\ \end{array} } \right] \;{\text{and}}\; \left[ {\begin{array}{*{20}c} {M_{3} } & {M_{4} } \\ \end{array} M_{5} } \right]\left[ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & {1 } \\ \end{array} \begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & {0 } \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right]$$

(5)

According to Eq. 5, the retrieving matrix is shown in Eq. 6.

$${\text{RT}}_{{\left( {M4} \right)}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} { {\text{BS}}\left( {M - 1} \right) \left\{ {\begin{array}{*{20}c} 0 & 1 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 1 & 1 & 0 \\ \end{array} } \right\}} \\ { M_{4} \left( {{\text{self}}} \right) \,\,\, \,\,\left\{ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \right\}} \\ { {\text{RT}} \quad\quad\quad\,\,\,\,\,\left\{ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right\}} \\ \end{array} } \right]$$

(6)

where RT_(M4) denotes to the retrieving matrix for M₄, as an example.

Equation 6 confirms that after the transmission processes, each member of the M WMN is expected to receive M NCP, besides the fact that each member knows its packet and its two neighbours' as well, accordingly the two packets received by the WRT and the member's packet are regarded as three new packets with novel information, based on in Eq. 6.

Though three new novel packets seem to be a small number of packets when compared to a network of tens of members, the effect of these three packets is significant, simply because each member becomes able to retrieve its data even when losing any three packets transmitted from the BS, which is unlike the Benchmark scenario, where each member cannot complete the communication when losing any packet other than its two neighbours.

The reason that each member can retrieve the information for all other members even when not receiving three packets has become dropping any three NCPs from the proposed deterministically combined packets on the BS still gives a transmission matrix of rank M in Eq. 6. The rank of Eq. 6 remains equal M because each single packet (from RT) gives new information to the transmission matrix, so the reception matrix rank remains equal M when replacing the three single packets with any three combined packets in the received matrix (Eq. 6).

GJE processes theory confirms that any matrix of rank M that contains M pivots can be retrieved successfully when receiving M linearly independent equations, regardless these equations are for single or combined packets [8, 11]. Accordingly, the CoNC enables each member to drop any three packets through the lossy wireless channel between the M WMN members, which is such an important advantage that helps in increasing the coverage region and decreasing the ARQ significantly.

The advantage of applying the deterministic combination to the BS can be extended by creating more linearly independent combined packets to produce additional new novel information, as shown in [9].

To enhance the full reception for each member of the WMN, the BS can create more than M novel (linearly independent) combined packets to assure that there is no any created packet that does not maintain the rank M of the receiving matrix when replaced with the lost packet.

Based on the network data rate, erasure probability of the WMN channel, and the required coverage region; the BS can create as many novel combinations as required, taking into consideration that the novel packet is regarded as the packet that can be replaced in Eqs. 2 and 6 without decreasing the matrix's rank (rank = M).

So, it is clear that implementing WRN with applying CoNC on the BS gives an important trade-off between the data rate and both of the PER and the coverage region, which is investigated through the simulation results in Sect. 3.

Several deterministic combinations can maintain the full rank of the receiving matrix when replaced with the lost packets, which were proposed in [9] for different scenarios, such as Odd–Even combination, Next-Neighbour combination, Previous-Neighbour combination, and others. The key issue is to follow a deterministic manner of combination to assure that the same NCP is not created and broadcast more than once to avoid a redundant transmission that does not improve the retrieving matrix's rank.

It is easy to notice that when combining all of the M packets, a new novel packet is created, so the BS can broadcast M + 1packets to enable each member to drop even four different packets, as shown in Eq. 7

$${\text{RT}}_{{\left( {M4} \right) + 1}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}l} {{\text{BS}}\left( {M - 1} \right)\left\{ {\begin{array}{*{20}c} 0 & 1 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 1 & 1 & 0 \\ \end{array} } \right\}} \hfill \\ {M_{4} \left( {{\text{retriever}}} \right)\left\{ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \right\}} \hfill \\ { {\text{RT }} \left\{ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right\}} \hfill \\ {{\text{All}}\;{\text{ combined}} \left\{ {\begin{array}{*{20}c} 1 & 1 & 1 \\ \end{array} \begin{array}{*{20}c} { 1} & 1 & 1 \\ \end{array} } \right\}} \hfill \\ \end{array} } \right]$$

(7)

where RT_(M4)+1is the retrieving matrix at M₄ with the extra suggested all combined packet in the case of full reception.

The Odd–Even combination can create M new novel (linearly independent) combination protocol [9], which is one of the recommended protocols for this scenario.

Equation 8 shows the retrieving matrix for the M created novel packets when the Odd–Even combination algorithm is adopted at the BS.

$${\text{RT}}_{{\left( {{\text{Odd}} - {\text{Even}}} \right){\text{NCP}}}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} { M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} {{\text{BS}}\left( {{\text{odd}} - {\text{even}}} \right)\left\{ {\begin{array}{*{20}c} 0 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 & 0 \\ 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 \\ 0 & 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 1 & 0 & 0 \\ \end{array} } \right\}} \\ { M _{4 } \left( {{\text{retriever}}} \right)\left\{ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \right\}} \\ { {\text{RT}} \left\{ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right\}} \\ \end{array} } \right]$$

(8)

where RT_{(Odd–Even)NCP} is the retrieving matrix at M₄ as an example when the Odd–Even combined packets algorithm is applied.

The deterministic Odd–Even combination process is partially similar to the combination proposed in Eq. 2; just it is applied twice, once for even members where all even members are combined excluding each even packet just once, and the other time when odd members are combined excluding each odd packet just once, resulting to M new linearly independent equations as shown in Eq. 8.

Other deterministic combination algorithms can be created, such as Eq. 9, where the Next-Neighbour combination algorithm is adopted, and the Previous-Neighbour combination algorithm is shown in Eq. 10, where each packet is combined just with the previous neighbour's packet.

$${\text{RT}}_{{\left( {{\text{NN}}} \right){\text{NCP}}}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} { {\text{BS}}\left( {{\text{NN}}} \right) \left\{ {\begin{array}{*{20}c} 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 1 & 1 \\ 1 & 0 & 0 & 0 & 0 & 1 \\ \end{array} } \right\}} \\ {M_{4} \left( {{\text{retriever}}} \right)\left\{ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \right\}} \\ { {\text{RT }} \left\{ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right\}} \\ \end{array} } \right]$$

(9)

where RT_(NN)NCP is the retrieving matrix for the Next-Neighbour combination algorithm at M₄ as an example.

$${\text{RT}}_{{\left( {{\text{PN}}} \right){\text{NCP}}}} = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} { {\text{BS}}\left( {{\text{PN}}} \right) \left\{ {\begin{array}{*{20}c} 1 & 0 & 0 & 0 & 0 & 1 \\ 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 & 1 \\ \end{array} } \right\}} \\ {M_{4} \left( {{\text{retriever}}} \right)\left\{ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \right\}} \\ { {\text{RT}} \left\{ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right\}} \\ \end{array} } \right]$$

(10)

where RT_(PN)NCP is the retrieving matrix for the Previous-Neighbour combination algorithm at M₄ as an example.

Any two combinations, such as the M − 1combination algorithm and the Odd–Even combination algorithm shown in Eq. 11 can be applied at the BS to generate extra M linearly independent equations.

$$\begin{aligned} & {\text{RT}}_{{\left( {{\text{Odd}} - {\text{Even}}\;{\text{and}}\;M - 1} \right){\text{NCP}}}} \\ & \quad = \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}l} {{\text{BS}}\left( {{\text{Odd}} - {\text{Even}}} \right)\left\{ {\begin{array}{*{20}c} 0 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 & 0 \\ 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 \\ 0 & 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 1 & 0 & 0 \\ \end{array} } \right\}} \hfill \\ {{\text{BS}}\left( {M - 1} \right) \left\{ {\begin{array}{*{20}c} 0 & 1 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 1 & 1 & 0 \\ \end{array} } \right\}} \hfill \\ { M_{4} \left( {{\text{retriever}}} \right) \left\{ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 1} & 0 & 0 \\ \end{array} } \right\}} \hfill \\ { {\text{RT}} \left\{ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 0 & 1 \\ \end{array} \begin{array}{*{20}c} { 0} & 0 & 0 \\ \end{array} } \\ {\begin{array}{*{20}c} 0 & 0 & 0 \\ \end{array} \begin{array}{*{20}c} { 0} & 1 & 0 \\ \end{array} } \\ \end{array} } \right\}} \hfill \\ \end{array} } \right] \\ \end{aligned}$$

(11)

where RT_{(Odd–Even and N−1)NCP} is the retrieving matrix for the Odd–Even and the M − 1 combination algorithms at M₄ as an example.

According to Eq. (11), the BS broadcasts 2M packets instead of M, which is regarded as a trade-off between the data rate and the PER, considering that the better PER, the larger the WMN coverage region.

So, when sending 2M novel packets, besides the pre-mentioned three packets (RT and retriever’s packet), each wireless member's channel has the permeability to drop till M + 3 packets, which is regarded as an extremely great improvement to the WMN PER that enables to increase remarkably the coverage region. Any extra broadcast packet can be set according to the network's PER and the desired coverage region, shown through the simulation results in Sect. 3. For BD transmission, the authors of this paper recommends following fair trade-off between the data rate and the PER (coverage region) so, M + 20% of M is considered as a reasonable trade-off. However, the extra number of packets depends on the needed coverage region and the PER in the WMN channels. The recommendation mentioned above is based on the authors' personal experience in this field. Still the main rule is as follows: the more transmitted packets, the better performance, coverage region and worse data rate efficiency. Finally, Eqs. 1–11 show how the proposed protocol works in a clear and systematic manner.

2.3 Cooperation networking coding over ring topology and reliability improvement

When a wire that connects a member with the BS got disconnected as a result of maintenance operations, or any an unexpected fault as shown in Fig. 3a, or two wires got disconnected as shown in Fig. 3b, the disconnected member is named in this paper as a “dead member”; however, CoNC can solve this problem once applied over the RT in the following algorithm:

The data packet of the dead member already sent to the two neighbours; hence, each dead member’s neighbour combines (X-ORING) the dead packet's data to its data packet and then sends the combined packet to the BS through its wires. Consequently, the dead member’s neighbours pass the dead member’s data packet to their neighbours instead of passing their data packets. The rest of the WMN members do the same, i.e. combining the dead member’s data packet to their packets and passing the dead member’s data packet to their neighbours, as shown in Fig. 4a, b.

Fig.4

The scenario where full communication is obtained with faulty connections

At the end of the passing processing shown in Fig. 4a, b, each member of the WMN will be sending its data combined with the dead member’s data. Accordingly, the BS will be receiving Eq. 12 when assuming that M₄ is the dead member as in Fig. 4a, and Eq. 13 if M₁ got two disconnected wires as shown in Fig. 4b:

$${\text{Rp}}_{{\left( {{\text{BS}}} \right) = }} \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 \\ \end{array} } \right]$$

(12)

where Rp(BS) denotes to the received packets at the BS that have been sent through the M − 1 wires based on Fig. 4a.

Equation 12 shows that the BS receives five combined packets (M − 1), and the row of the disconnected wire (row 4 in Eq. 12 in this example) is zeroed.

$${\text{Rp}}_{{\left( {{\text{BS}}} \right) = }} \left[ {\begin{array}{*{20}c} {M_{1} } & {M_{2} } & {M_{3} } \\ \end{array} \begin{array}{*{20}c} {M_{4} } & {M_{5} } & {M_{6} } \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 & 0 & 0 \\ 1 & 0 & 1 & 0 & 0 & 0 \\ 1 & 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 & 0 & 1 \\ \end{array} } \right]$$

(13)

Equation 13 shows that row one is zeroed because M₁ is the dead member; hence, the way to retrieve the all member's data is similar to the case when one wire is disconnected.

In the case of full and correct WMN broadcasting, each member of the M WMN will be receiving the same M − 1 combined packets, including the dead member. The retrieving processes for each member simply performed by X-ORING the retriever's packet with each combined packet separately, to retrieve the M − 1 neighbours one by one. Based on the above, applying CoNC enables the network to communicate even if one member is not connected to the BS, which means that the communication can be running in the case of fault or maintenance operations, i.e. the network's reliability is improved.

Based on above, the importance of mixing ring and mesh protocols is justified by the dramatically increasing in the wireless transmission rejoin for some of the resent wireless broadcasting elements, such as Sigfox that can cover a region from 10 to 40 kM, LoRa that can cover a region from 5 to 20 kM, NB-IoT that can cover a region from 1 to 10 kM, LTE-M that can cover a region up to 5 kM radius, and Zegbi that can cover around 200 m radius region.

Accordingly, the proposed protocols are clearly useful for many practical applications such as, IoT applications, remote sensing applications, smart agriculture, smart cities, and etc.

3 Simulation results

The simulation results have been obtained by MATLAB software, where a minimum of 100 errors were collected. The error is identified according to JGE as a received retrieving matrix at M₄ (proposed receiver example) with a rank less than M, where M is the number of the mesh network members.

Moreover, the collected results are only for user four (M = 4), so it is important to declare that the achieved PER gain for the M MN is M folder times more than the gained improvement at M₄ when the gain extended for to the whole MN members assuming that each member is expected to gain the same improvement as for M₄.

The investigation starts from comparing the Benchmark scenario that applies the selfish mode (without combination) for a single stage on the BS, with and without RT, to evaluate the benefits of implementing the RT over the PER.

So, for the Benchmark scenario, Fig. 5 shows that the PER gain resulted from the existence of RT is trivial for a member of twenty MN members, and this is justified by the fact that the extra three packets added from the RT have no new information, accordingly, the retrieving matrix's rank at M₄ is not improved as a result of these three transmitted packets, as shown in Eq. 2. Indeed, this is regarded as a big loss in terms of the PER improvement that could have been obtained. So, RT is just restricted to improve the WMN coverage region [16].

Fig.5

PER for M = 20 on an HRMP for single stage, when the selfish, the Next-Neighbour, the M − 1, and the Odd–Even protocols are applied on the BS

Moreover, Fig. 5 shows the excellent PER improvement achieved when the BS applies the CoNC rather than broadcasting the single received packets from the optical fibre wires in a selfish mode. The Odd–Even protocol outperforms the Benchmark scenario in two to three folders at PER of 0.1, which means that the proposed CoNC protocol exploits the existence of RT in such desired scale. The improvement in the PER becomes much higher when the PER drops to less than 0.1, taking into consideration that the whole WMN will be improved M folders and this is because each member on the WMN behaves similarly to M₄.

The justification for the good improvement is that the three RP packets give novel information for the full retrieving matrix at M₄ as an example, which enables M₄ to drop till three packets before the retrieving matrix's rank becomes less than M. the retrieving matrix at M₄ becomes less than M, only when M₄ drops more than three packets. Similarly, each member of the WMN has the ability to drop up to three packets before its retrieving matrix's rank becomes less than M as shown in Eqs. 6, 8, 9, and 10 for the M − 1, the Odd–Even, the Next-Neighbour, and the Previous-Neighbour, respectively.

Figure 5 illustrates as well that the Odd–Even combination protocol is the best-proposed one when compared with the Next-Neighbour, and the M − 1 protocols, which is because the combination algorithm of the Odd–Even has a good diversity of combined packets.

Figure 6 shows the effect of increasing the number of WMN members, starting from ten to twenty. Indeed, Fig. 6 discloses clearly that the PER increases when the number of members increases, and this is because the effect of the three RT packets becomes less effective, i.e. extra three novel packets to a total of ten linearly independent equations, have better influence than three to twenty, simply because it is more likely to drop four packets out of twenty rather than four packets out of ten. (Four lost packets mean that the rank is less than M; hence, it is regarded as an error.)

Fig. 6

PER when increasing the number of HRMP members from M = 10 to M = 20, for selfish, Next-Neighbour, M − 1, and Odd–Even protocols

Figure 7 illustrates the big improvement in the PER due to sending an extra one full stage of M combined packets (CoNC packets). The results compare the proposed combination algorithms in the second stage for several scenarios, taking into consideration that two stages of single packets with the RT packets are shown in Fig. 6 for the propose of comparison with the confirmed Benchmark scenario. So, Fig. 7 proves that the effect of the three RT packets has significant improvement. Moreover, the two stages with different combination algorithms in each stage give better PER improvement, which is justified by the more linearly independent equations that results in better retrieving matrix rank. So, there is a valuable improvement when selfish and Odd–Even packets are broadcast by the BS; indeed, the PER improved to 0.04 at the channel erasure probability of 0.1, compared to 0.1 PER when sending the same single-stage twice. The same improvement can be noticed with the other combination algorithms; however—as in a single-stage—the Odd–Even combination outperforms the other algorithms because of its wide combination diversity for the combined packets.

Fig. 7

2-Stage transmission for 2-selfish, 2-Odd–Even, selfish and Odd–Even, and selfish with M − 1 algorithms

Figure 8 illustrates the trade-off between sending extra packets and the PER improvement to evaluate the benefits of sending extra packets. The results in Fig. 8 show that the PER can be significantly improved but at the cost of the data rate. Moreover, broadcasting the Next-Neighbour protocol with the Odd–Even gives a better improvement than the M − 1 combination algorithm.

Fig. 8

The PER for single Odd–Even stage with extra 5, 10, and 15 combined packets for a network of 30 members

Finally, it is important to mention that processing time for JGE retrieving matrix depends on the number of combined packets, so the fewer combined packets, the shorter the processing time [26], which is the reason to recommend the Odd–Even algorithm rather than the M − 1 combination, besides to the better PER.

Regarding the reliability improvement achieved from applying CoNC over the RT, Fig. 9 shows that even when one optical fibre wire is not connected between the RT and the BS, as in Fig. 4a and Eq. 12, the communication can continue with better PER than selfish mode. Moreover, when two connections are lost, as in Fig. 4b and Eq. 13, the communication will continue with even better PER than when one optical fibre is disconnected, and this is justified by the strong cooperation algorithm proposed for this scenario where all RP members combine the disconnected member's packet to their packets, resulting to more processing time with better PER.

Fig. 9

PER for the cases of one and two wires disconnections shown in Fig. 4a, b

At the end, it is of interest to be mentioned that our research in the physical layer alongside other approaches in the area of 5G networks [27,28,29,30] (including high-performance computing for 5G-assisted IoT/IoV, networking architecture (e.g. software defined networks), big data processing/transmission over 5G, and various 5G applications (e.g. intelligent transportation systems) [27,28,29,30,31,32,33]) can make this topic more interesting for the prospective readers and investigators.

4 Conclusions

This paper proposes cooperative network coding (CoNC) algorithms to be applied for big data (BD) communication over a Hybrid Ring-Mesh Protocol (HRMP) that mixes wired and wireless data exchange, to decrease the exchanged amount of transmitted data remarkably, increase the mesh coverage area, and decrease the number of connection wires, and decrease the network construction and maintenance cost. The proposed CoNC HRMP decreases the number of required wires from M² to 2M as M wires are needed between the M members in the ring protocol (RP) plus M wires between the M members and the BS.

The results that have been obtained by MATLAB analysis confirm that applying CoNC over HRMP exploits the advantage of the RP and the PER improved significantly, for example, from 0.1 for two single stages to 0.04 for single and Odd–Even stages, at a channel erasure probability of 0.1. The proposed algorithms created such a useful trade-off between the data rate and PER, which indirectly means a trade-off between the data rate and the coverage region. Finally, the proposed algorithms managed to solve the problem when one or two wires got disconnected with PER better than the selfish mode, resulting in improving the network's reliability.

Based on above, the authors are proposing applying the proposed protocols over Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology [34,35,36]. Moreover, the queuing algorithms of FIFO, PQ, CQ, and WFQ in [37] are planned to be investigated to determine the performance after applying the proposed protocols. Finally, applying the proposed protocols over OFDM, DFrFT-OCDM, and MIMO-OFDM/OCDM for the work published in [38,39,40] is regarded as another direction for future work.