Buffered based routing and resiliency approach for WMN

Rathee, Geetanjali; Mundra, Ankit; Rakesh, Nitin; Ghrera, Satya Prakash

doi:10.1109/ichci-ieee.2013.6887776

Cited by 5 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the ACK is received from the next buffered node, the preceding buffered node deletes the packet from the buffer. The detailed explanation of packet transmission and failure cases has been already discussed in our previous paper [16]. Table 3 shows the proposed RPT algorithm.…”

Section: Resilient Packet Transmissionmentioning

confidence: 99%

“…This section shows the time complexity of the proposed BAA [16] and RPT approach. The BBR approach is previously allocating buffer till the destination but now, we have updated the BBR approach to work for the un-traversed link beyond destination (until all the nodes are traversed).…”

Section: Complexity Analysismentioning

confidence: 99%

“…For this purpose, the routing path from the source to the destination in RPT must have following characteristics [16]:…”

Section: Resilient Packet Transmissionmentioning

confidence: 99%

“…At each node the credit cost and threshold value are calculated to forward the packets from the source to the destination. The major drawback of ROMER, during the node or link failure the possibility of successful packet delivery to the destination nodes reduces based on the prescribed credit cost [16]. ROMER broadcasts the packets in the network and this results in increased network communication costs (reduces throughput) and increased network congestion, due to multiple packet delivery in the network.…”

Section: Introductionmentioning

confidence: 99%

“…In our previous work, we have proposed the buffer based routing (BBR) [16] approach, which provides an efficient solution (i.e., to route the data from source to destination) over the drawbacks of Resilient Multicast and ROMER. In BBR we allocated buffers at alternate nodes using the buffer allocation algorithm (BAA) with the aim to enhance resiliency and to increase the throughput and fast packet delivery in the network.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Resilient Packet Transmission (RPT) for Buffer Based Routing (BBR) Protocol

Rathee¹,

Rakesh²

2014

J Inf Process Syst

View full text Add to dashboard Cite

To provide effective communication in the wireless mesh network (WMN), several algorithms have been proposed. Since the possibilities of numerous failures always exist during communication, resiliency has been proven to be an important aspect for WMN to recover from these failures. In general, resiliency is the diligence of the reliability and availability in network. Several types of resiliency based routing algorithms have been proposed (i.e., Resilient Multicast, ROMER, etc.). Resilient Multicast establishes a two-node disjoint path and ROMER uses a credit-based approach to provide resiliency in the network. However, these proposed approaches have some disadvantages in terms of network throughput and network congestion. Previously, the buffer based routing (BBR) approach has been proposed to overcome these disadvantages. We proved earlier that BBR is more efficient in regards to w.r.t throughput, network performance, and reliability. In this paper, we consider the node/link failure issues and analogous performance of BBR. For these items we have proposed a resilient packet transmission (RPT) algorithm as a remedy for BBR during these types of failures. We also share the comparative performance analysis of previous approaches as compared to our proposed approach. Network throughput, network congestion, and resiliency against node/link failure are particular performance metrics that are examined over different sized WMNs.

show abstract

Section: Resilient Packet Transmissionmentioning

confidence: 99%

Section: Complexity Analysismentioning

confidence: 99%

“…For this purpose, the routing path from the source to the destination in RPT must have following characteristics [16]:…”

Section: Resilient Packet Transmissionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%