Do you want to publish a course? Click here

Studying the performance and the Efficiency of random linear network coding in achieving the reliable transfer of data in losing wireless networks

دراسة أداء و فعالية ترميز الشبكة الخطي العشوائي في تحقيق النقل الموثوق للبيانات في الشبكات اللاسلكية ذات الضياع

1512   0   26   0 ( 0 )
 Publication date 2017
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

Wireless networks suffer from frequent loss of packets for many reasons such as interference, collision and fading. This makes wireless medium unreliable medium for data transfer. The main methods for ensuring the reliability in this medium are using transmission control protocol (TCP) and the automatic repeat request (ARQ). Recently, network coding has been found as new technology that changes the traditional forwarding method (Store- and- Forward) in the networks to more effective and intelligent method (Code- and- Forward), which contributes to the increase of both capacity and throughput of these networks. In this research, random linear network coding is used as promising technology that aims to achieve the reliable transfer of data in losing wireless networks, and studying the enhancement that this technology presents to the performance of these networks in unicast and multicast transmission. For evaluating the efficiency of this technology and comparing its performance with the performance of reliable transfer protocols, we use the networks simulator (NS3). Simulation results showed that random linear network coding achieve the reliable transfer of data with bigger throughput and less delay and number of transmission compared with the protocols (TCP, ARQ).

References used
Andrea Goldsmith, ―Wireless Communication‖, Cambridge University Press, 1st South Asian Edition 2009
P. Bhagwat, P. P. Mishra, and S. K. Tripathi, ―Effect of topology on performance of reliable multicast communications,‖ in Proc. IEEE INFOCOM, Toronto, Canada, June 1994, pp. 602–609
B. Sardar and D.Saha," A survey of TCP enhancements for last-hop wireless networks," IEEE. Surveys and Tutorials, Vol. 8, pp. 20-34, 2006
rate research

Read More

Random Linear Network Coding (RLNC) is considered to be one of the promised solutions to achieve the reliability of transmission in multi hop wireless networks, Since it is based on correcting the loss of the packets in the medium through the conti nuity of transmitting coded packets from each segment until receiving acknowledgment of getting the required number of these packets for decoding. However, because of the nature of wireless medium and multi hops transfer, a loss or delay of the ACK may occur, which causes transmitting extra packets and time delay to the next segments, consequently decreasing the throughput of these networks. In this research, we propose a new transmission mechanism for reliable transfer in multi hops wireless networks through using the concepts of sliding window and fast retransmit with RLNC, for transmitting packets of consequent segments in specific continues flow and fast correcting the loss in these segments. Simulation results show that proposed mechanism decreases the time delay for transmission process and increases the transfer throughput of these networks.
Multi hop wireless networks face many challenges basically the limitation of bandwidth, loss of packets because of many problems in wireless medium also loss of paths because of the random and unpredictable movement of wireless nodes, which reduce the performance of these networks. Recently, Network coding has been used as promising technology that achieves the reliable transfer of data in wireless networks with high throughput. Considering the efficiency of this technology and with benefiting from both the same cost paths and the broadcasting property of wireless medium, a multi transmission mechanism for random linear network coding has been proposed in multi hop wireless networks, which depends on multicasting of coded packets on the same cost paths.
Network coding isone of the important researches in multi-hop wireless networks domain and it widely participates in improving the performance of these networks, since it benefits from the broadcasting nature of transmission processes to transmit m ore than single packet in one broadcasting transmission. So it achieves double use of the available bandwidth, which can increase the throughput of the network and reduce the congestion.Our aim in this research is to verify the improvement that network coding presents to theperformance of multi-hops wireless Ad-hoc networks, and to study the accelerating of research process for coding chances through constructing a virtual queues according to the packets flows that pass the node, and applying affective manner to manage this queues.
Ad-hoc networks has opened a new dimension in wireless networks. It allows wireless communication in the absence of central support of the contract. In these networks, there are no fixed infrastructure because the mobile nodes are continuously mak ing continuous and dynamic change in the topology. Routing protocols of mobile ad-hoc networks differ from the existing internet protocols which are designed for the fixed structure based wireless networks. MANET protocols have to face high challenges due to dynamically changing of topologies, low transmission power and asymmetric links. Due to link instability, node mobility and frequently changing topologies routing becomes one of the core issues in MANETs. Currently existent routing protocols provide routing solutions up to a certain level and most of them are designed and implemented in small areas. Many researchers are still working on the developments of MANET routing protocols. With the increase in the types of routing protocols used in mobile network it has become necessary to study the effectiveness of each type of protocols In this papper we compared between the most famous species (proactive, Reactive, hybrid) and choose a protocol to be representative of all species previously mentioned and the network performance assessment each type in terms of Throughput, dynamic routing routing, load, delay and determine which of these protocols appropriate for each case.
Mobile Wireless Sensor Network (MWSN) is an emerging technology for attraction of researchers with its research advantage and various application domains. Due to limited resources of sensor nodes such as transmission power, communication capability and size of memory, data aggregation algorithms are the most practical technique that reduces large amount of transmission in this network. Security is an important criterion to be considered because, wireless sensor nodes are deployed in a remote or hostile environment area that is prone to attacks easily. Therefore, security are essential issue for MWSN to protect information against attacks. In this research, we offered an algorithm of secure data aggregation in MWSN based on pair-wise keys technology and hash function. We studied important parameters such as execution time, end-to-end delay and number of storied keys. Results showed that
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا