A Novel Network Coding Approach: Packets Conflict Based for Matrix Optimization
Oct 31, 2017
DOI:
Published in: Journal of Theoretical and Applied Information Technology
Publisher: SAP
Network coding (NC) is a technique used to improve wireless networks throughput, efficiency, and scalability. When employing this technique, wireless nodes collect several packets and combine them together in one single transmission. This technique is used to attain the maximum possible network flow with minimum number of transmissions. COPE, OpNC and FENC are widely known approaches in network coding that vary in complexity and optimality. COPE is the first proposed approach for network coding that is considered as a complex approach and may lead to a packet deadline termination; thus, transmitter should resend packets, and therefore, the overall throughput decreases. OpNC employs the COPE approach in order to find all possible codes for a set of packets, brute force searching, hence it is an exhaustive approach where the optimal solution is not always reachable. On the other hand, FENC utilizes division and conquers technique, in order to find an optimal network coding of a set of native packets, in which a repetitive algorithm is applied on the output queue more than once, in order to increase the possibility of finding an optimal coding solution. In this paper, we propose a novel technique which utilizes two basic concepts of network coding: matrix optimization and the notion of conflict between packets. This technique is called “Conflict based Matrix Optimization for Network Coding Enhancement” (CMO-NCE), in which the opportunity of recovering more packets within the transmitted encoded packets combination is increased. Our proposed technique chooses better packets combination when transmitting the encoded stream; consequently, more packets are recovered at destination nodes. Simulation results show that the proposed technique is better in terms of complexity and optimality than other existing techniques such as COPE and OpNC. Also, it shows that the proposed CMO-NCE mechanism results are close to FENC approach. However, CMO-NCE’s time complexity is less than FENC and it is linear, O(n), where n is number of wireless nodes, while FENC’s time complexity is not linear, O(P^2/log2P ), where P is number of packets.
Other Researches
Black holes attack in ad-hoc network systems can obstruct network functions, e.g.; successful packets delivery to destinations. Current conventional detection mechanisms are based on single layer information, lack of appropriate performance metrics,...
Finding an Immuned Path against Single Primary User Activity in Cognitive Radio Networks
Due to recent crowdedness in unlicensed spectrum, a new technology is introduced which allows unlicensed users, known as Secondary Users (SUs), to dynamically access licensed spectrum whenever they are not used by their licensed users, known as Prim...
An efficient speech recognition system for arm-disabled students based on isolated words
Over the previous decades, a need has emerged to empower human-machine communication systems, which are essential to not only perform actions, but also obtain information especially in education applications. Moreover, any communication system has t...
ON ARABIC OBJECT CHARACTER RECOGNITION USING DYNAMIC TIME WARPING
Due to the large volume of Arabic texts in many generated and historical documents, it is essential to use computers in order to make generated texts editable, this is actually the main task of Arabic Object Character Recognition (OCR) systems. The ...
Advances introduced to electronics and electromagnetics leverage the production of low-cost and small wireless sensors. Wireless sensor networks (WSNs) consist of large amount of sensors equipped with radio frequency capabilities. In WSNs, data rout...
Improving Routing Performance Using Cooperative Spectrum Sensing in Cognitive Radio Networks
The traditional fixed spectrum assignment policy, in wireless networks, has led to significant underutilization (both spatially and temporally) of some licensed spectrum bands and crowdedness of unlicensed spectrum bands. These challenges gave birth...
On GPS Fault-Tolerance for City-Bus Tracking System using Wireless Sensor Networks
In modern crowded cities, public transportation is one of primary ways for people to go to work, shopping, etc. Therefore, it is necessary to provide an application which estimates buses’ real-time current location, supported by Google map applicati...
Pap smear screening is the most successful attempt of medical science and practice for the early detection of cervical cancer. Manual analysis of the cervical cells is time consuming, laborious and error prone. This paper presents a Neural Network (...
Resilient Multicast Routing in CRNs Using a Multilayer Hyper-graph Approach
Cognitive Radio Networks (CRNs) have a dynamic nature where channels availability changes over time. In this paper, we introduce a strategy to route multicast sessions in CRNs and to protect them against failures or disappearance of channels. We mod...
Performance Modeling of Secondary Users in CRNs with Heterogeneous Channels
The goal of this paper is to model heterogeneous channel Access in Cognitive Radio Networks (CRNs). In CRNs, when licensed users, known as Primary Users (PUs), are idle, unlicensed users, known as Secondary Users (SUs) can use their assigned channel...
Interference-Based Packet Recovery for Energy Saving in Cognitive Radio Networks
In this paper, we propose to recover collided packets between Primary Users (PUs) and Secondary Users (SUs) in Cognitive Radio Networks (CRNs) for two scenarios. When a collision occurs between an SU and a PU transmitters, the SU's receiver consider...
Uplink Channel Assignment in Cognitive Radio WMNs Using Physical Layer Network Coding
In this paper, we introduce a low overhead scheme for the uplink channel allocation within a single cell of Cognitive Radio Wireless Mesh Network (CR-WMNs). The scheme does not rely on using a Common Control Channel (CCC). The mechanism is based on ...
Optimized Sink Mobility for Energy and Delay Efficient Data Collection in FWSNs
Network fragmentation is a potential problem in wireless sensor networks (WSNs) due to many reasons like, node failures or environmental conditions (obstacles) that prevent connected deployments. One approach to cope with this problem is to have a m...