Abstract

The implementation of the optimal Huffman coding technique for achieving proficient data compression, lower information redundancy and minimal utilization of the scarce bandwidth is essential to handle the effective processing of massive network data. In this paper, we employ cross-layer design technique among the data link, network and presentation layers of the traditional protocol stack to develop the improved DSDV routing protocol based on n-ary Huffman coding procedure. The entropy-based adaptive prefix codewords with variable length are assigned to the probability of packet successful delivery across the ad-hoc wireless network. Several coding and network efficiency parameters are deployed to assess the performance of the proposed routing scheme under three distinctive IPv4 network scenarios. These investigated network protocols include the default IPv4, multi IPv4 and dynamic IPv4 routing methodologies. Diversified simulation settings are employed with deviating network size to measure the multitude of essential wireless network characteristics incorporating the average delay, packet error rate, packet delivery fraction, data rate, ping loss rate, entropy rate, and reception cache hit. In addition, the set of key data compression/coding indicators are examined through comprehensive numerical analysis such as codeword length, source information rate, mean redundancy, and coding efficiency. Beyond, we significantly compare the performance of our developed cross-layer coded mobile routing model with several previous algorithms to validate its enhanced feasibility and superiority in terms of crucial network operation metrics such as throughput, packet drop rate, mean delay and packet delivery ratio.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.