Search

The symbol error rate (SER) performance analysis of a broadcast underlay cognitive radio (CR) network, under Nakagami-m fading channels is studied in this paper. Particularly, the underlay CR network is studied as a closed loop multiple antenna system, presented with dirty paper coding (DPC) approach with the aim to allowing the secondary user (SU) transmission to utilize the spectrum resources efficiently and avoid interference to the primary user (PU) receiver. The proposed approach is capable of achieving the same performance as that of the zero-forcing (ZF) algorithm over Nakagami-m fading channels at the SU receiver. We further show with the simulation results that the SER and bit error rate (BER) performances of the PU under Nakagami-m and Rician fading channels are significantly improved for the proposed study. Finally, we optimize the power allocation of the PU transmitter and approximately achieve 3 dB performance gain over Nakagami-m fading for the SU receiver.

In recent times, it has been witnessed that wireless systems based on IoT-based have developed rapidly in various sectors. The IoT (Internet of Things) is the network in which physical devices, equipment, sensors and other objects can communicate among themselves without human involvement. The WSN (Wireless Sensor Network) is a central component of the IoT, which has proliferated into several different applications in real-time. The IoT and WSNs now have various critical and non-critical applications impacting nearly every area of our everyday life. WSN nodes are usually small and battery-driven machines. Thus, the energy effective data aggregation techniques that increase the lifespan of the network are highly significant. Various approaches and algorithms for energy-efficient data aggregation in IoT-WSN systems were presented. This paper reviews the literature with specific attention to aspects of wireless networking for the preservation of energy and aggregation of data.

This paper presents the main disadvantages of receipts printed on thermal paper, underlining the impact that BPA (component of thermal paper) has on the environment and human health. The conceptual solution proposes to use the near-field communication (NFC) protocol available in smartphones, integrating a virtual receipt printing device (called e-receipt) at the end of the contactless payment chain.

Many applications of Wireless Mobile Communication are used in military, defense etc .however this type of network have many constraints mainly including power constrains, less range of communication & insecure transmission channel which makes it more vulnerable to attacks .such as sinkhole and black hole attack which hampers the communication by attacking on data traffic and communication links on which packets are routed. The attack which operates by falsely claiming a fresh route to destination is a kind of denial of service is known as Sink hole attack. On the other hand black hole attack, intentionally dropped the incoming packets through malicious node in between the intermediately nodes. In this research paper we can examine and investigate the impact of sink hole and black hole attack on the performance of MANET network using DSR protocol in terms of throughput ,packet delivery ratio over the network.

This paper studies the secure transmission in a multiuser broadcast channel where only the statistical channel state information of the eavesdropper is available. We propose to apply secret dirty-paper coding (S-DPC) in this scenario to support the secure transmission of one user and the normal (unclassified) transmission of the other users. By adopting the S-DPC and encoding the secret message in the first place, all the information-bearing signals of the normal transmission are treated as noise by potential eavesdroppers and thus provide secrecy for the secure transmission. In this way, the proposed approach exploits the intrinsic secrecy of multiuser broadcasting and can serve as an energy-efficient alternative to the traditional artificial noise (AN) scheme. To evaluate the secrecy performance of this approach and compare it with the AN scheme, we propose two S-DPC-based secure transmission schemes for maximizing the secrecy rate under constraints on the secrecy outage probability (SOP) and the normal transmission rates. The first scheme directly optimizes the covariance matrices of the transmit signals, and a novel approximation of the intractable SOP constraint is derived to facilitate the optimization. The second scheme combines zero-forcing dirty-paper coding and AN, and the optimization involves only power allocation. We establish efficient numerical algorithms to solve the optimization problems for both schemes. Theoretical and simulation results confirm that, in addition to supporting the normal transmission, the achievable secrecy rates of the proposed schemes can be close to that of the traditional AN scheme, which supports only the secure transmission of one user.

The Internet of things (IoT) refers to a type of network to connect anything with the Internet based on stipulated protocols through information sensing equipment’s to conduct information exchange and communications in order to achieve smart recognitions, positioning, tracing, monitoring, and administration. In this paper we briefly discussed about what IOT is, how IOT enables different technologies, about its architecture, characteristics & applications. The purpose of this paper is to provide the basic information about IoT for young readers.

Smart infrastructure demands resilient data storage, and emerging applications execute queries on this data over time. Typically, time-series databases serve these queries; however, cloud-based time-series storage can be prohibitively expensive. As smart devices proliferate, the amount of computing power and memory available in our connected infrastructure provides the opportunity to move resilient time-series data storage and analytics to the edge. This paper proposes time-series storage in a Distributed Hash Table (DHT), and a novel key-generation technique that provides time-indexed reads and writes for key-value pairs. Experimental results show this technique meets demands for smart infrastructure situations.

With the development of the Internet and smart phone, mobile data sharing have been attracted many researcher’s attentions. In this paper, we investigate the mobile data sharing problem in mobile crowdsensing. There are a large number of users, each user can be a mobile data acquisition, or can be a mobile data sharing, the problem is how to optimal choose users to collaborative sharing their idle mobile data to others. We consider two data sharing models, One-to-Many and Many-to-Many data sharing model when users share their mobile data. For One-to-Many model, we propose an OTM algorithm based on the greedy algorithm to share each one’s data. For Many-to-Many model, we translate the problem into the stable marriage problem (SMP), and we propose a MTM algorithm based on the SMP algorithm to solve this problem. Experimental results show that our methods are superior to the other approaches.

Anstract- While wireless technologies are common solutions to the last mile problem for IoT systems, challenges exist with devices that are in remote locations, sparse deployments, have power and cost constraints, and low data applications as the cost of wireless and the supporting infrastructure presents barriers to entry. This work presents a last mile solution relying on smartphones to bridge the gap between the data generation device and the internet. A unique, low-power solution is presented based on QR codes and e-paper displays that allows a user's smartphone to carry the power and processing burden for data transmission. Utilizing the persistent nature of e-paper displays with low power requirements, QR codes can efficiently communicate data with minimal power impacts to a device's power budget and create large communication windows for user data pickup, leveraging the power of the smartphone without the need for extensive user training and costly infrastructure.

In this paper we propose to implements blockchain technology for Internet of Things (IoT) networks that use Practical Byzantine Fault Tolerance (PBFT) consensus algorithm. To eliminate the reliance on a single leader and improve performance, we propose to allow multiple leaders to propose request batches independently and, possibly, concurrently, by using different overlay networks. Nodes participate in parallel consensus rounds without contention, and they only contend with others to reserve the next available spot for the atomic insertion of a new transaction batch or block into the replicated blockchain ledger. We develop an analytical model for the multiple leader PBFT ordering service by using a Discrete-time Markov chain. Our evaluations show that our model outperforms the original multiple entry point PBFT protocol in a wide range of parameter values, and that it scales well with the number of orderer nodes in the PBFT committee and block arrival rate.

The space-based integrated information network is composed of space-based backbone network, space-based access network and ground-based node network. It is interconnected with the ground Internet and mobile communication network to build a “ global coverage, on-demand access, on-demand service, safe and reliable ” space-based integrated information network system. As an important part of the system, the space-ground laser communication equipment is faced with many problems, such as the integration of multiple modulation systems and the location of different places. In this paper, the related problems are analyzed and verified by experiments. The results show that the system works at 1550nm wavelength, adopts coherent communication system and IM/DD communication system, coherent communication system supports BPSK, QPSK and DPSK modulation format, IM/DD communication system adopts OOK modulation format, the communication rate reaches 5Gbps under the condition of 1E-9 bit error rate.

One great challenge of modern networks is how to select paths and react to highly variable and demanding traffic patterns. In recent years, emerging networking languages and architectures, such as P4/PISA, have created unprecedented opportunities for rapidly prototyping disruptive solutions in programmable data planes. In this direction, source routing (SR) is a prominent alternative to conventional table-based routing, since it reduces the convergence time of building distributed routing tables. In particular, PolKA explores the polynomial residue number system (RNS) for a fully stateless SR, i.e., no state update on packet headers needs to be conveyed along the route. This paper reports the deployment of PolKA in a continental testbed composed of P4 programmable switches. Results for end-to-end throughput and forwarding latency show that PolKA matches the data plane performance of traditional approaches, while paving the way for further innovative applications by exploring RNS properties in dynamic scenarios.

Rate-Splitting Multiple Access (RSMA) is a flexible and robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. In this work, we study the performance of RSMA in the scenarios related with the important core services of New Radio (NR) and 6G, namely, enhanced Ultra-Reliable and Low-Latency (URLLC) and enhanced Mobile Broadband Communications (eMBB). We present the optimal system designs employing RSMA that target short-packet and low-latency communications as well as robust communications with high-throughput under the practical and important setup of imperfect Channel State Information at Transmitter (CSIT) originating from user mobility and latency/delay (between CSI acquisition and data transmission) in the network. We demonstrate via numerical results that RSMA achieves significantly higher performance than Space Division Multiple Access (SDMA) and Non-Orthogonal Multiple Access (NOMA), and is capable of addressing the requirements for enhanced URLLC and eMBB in 6G efficiently.

We proposed a deep reinforcement learning (DRL) based approach to reconfigure the multicast sessions in an elastic optical network (EON) adaptively. Simulation results demonstrate that our proposal maintains the optimality of light-trees with less reconfigurations and reduces blocking probability.

We consider a game-theoretic setting of contention in communication networks. In a contention game each of \(n \ge 2\) identical players has a single information packet that she wants to transmit in a fast and selfish way through one of \(k \ge 1\) multiple-access channels by choosing a protocol. Here, we extend the model and results of the single-channel case studied in [2] by providing equilibria characterizations for more than one channels, and giving specific anonymous, equilibrium protocols with finite and infinite expected latency. For our equilibrium protocols with infinite expected latency, all players, with high probability transmit successfully in optimal time, i.e. \(\varTheta (n/k)\).

GSMA is developing and standardizing specifications for embedded SIM cards with remote provisioning, called eUICCs, which are expected to revolutionize the cellular network subscription model. We study GSMA’s “Remote Provisioning Architecture for Embedded UICC” specification, which focuses on M2M devices, and we analyze the security of remote provisioning. Our analysis reveals weaknesses in the specification that would result in eUICCs being vulnerable to attacks: we demonstrate how a network adversary can exhaust an eUICC’s memory, and we identify three classes of attacks by malicious insiders that prevent service. We disclosed our findings to GSMA; GSMA confirmed the validity of these attacks and acknowledged their potential to disrupt the cellular industry. We propose fixes, which GSMA is incorporating into its specification. Thus, we improve security of next generation telecommunication networks.

This paper presents the main outcomes of the ESA funded project entitled: “SPACEMAN — A SpaceWire Network Management Tool” that was jointly carried out by ITTI Sp. z o.o. and TELETEL SA., and dealt with SpaceWire Network Discovery and Configuration Protocol (SpW-NDCP). We give a brief overview of the SpW-NDCP, present the main features of the SPACEMAN tool for discovering and configuring SpaceWire networks, and introduce a novel XML representation of SpaceWire networks, implemented in the tool.

European Rail Traffic Management System(ERTMS) efficiently manages and schedules the trainsguaranteeing passengers safety and service constraints andmaximizing railways capacity. The management system isresponsible of the elaboration needed to control the trainscirculation and to derive the necessary commands for trainsand trackside actuators such as railroad switches. Theseoperations need heavy computational resources and require anexchange of information between trains, trackside equipmentsand elaboration components. Currently the managementsystem is hosted in the Central Control Rooms that centrallymanage and supervise trains traffic of different geographicalareas. This paper proposes a new paradigm about the executionof the ERTMS management activities taking advantage fromcloud networks. It suggests to distribute among cloud resourcesthe computational load due to the elaboration of the collecteddata and the derivation of required commands for trains andactuators. This can make possible a proactive approach tothe trains management, suitable not only to consider the datasent by the trackside equipments, but also the informationdirectly collected onboard of the train. Despite trackside dataare considered by the management system, actually they arenot integrated with onboard real-time data that are sent tothe ground system for diagnosis purposes. These two sourcesof information can be jointly used to simulate in advance thetrain transit, deduce possible delays and anomalies and moreefficiently manage the trains circulation.

SpaceWire is a new bussing technology provided by European Space Agency. SpaceWire enhances the functions of error detection and error recovery [1]. Considering the application background, the reliability of SpaceWire network must be guaranteed. The paper develops a new hot back-up method for improving the reliability of SpaceWire network. The method uses the one of the reserved bits of time-code in SpaceWire to shift working mode of the SpaceWire router to realize the hot backup function and enhance the reliability of the SpaceWire network.

The paper deals with the aspects of implementation and validation of the SpaceWire-R protocol as carried out in the ESA-funded project SpaceR. We give a brief overview of the SpaceWire-R protocol for providing reliable data transfer services over SpaceWire networks and describe the SpW-R protocol software implementation elaborated in the SpaceR project. The testing platform developed for validation of the protocol is presented, as well as preliminary SpW-R performance results obtained within the project.

Conventional wisdom states that Network-on-Chip router area grows quadratically with the channel width, and this perception has fundamentally shaped the assumptions of thousands of NoC papers that have been written to date, and many chip designs. However, this assumption is not entirely true. Simple analysis and empirical data from this paper shows that, in modern standard cell technology, a router’s standard cell logic area actually grows only linearly; it is solely the wire routing area that grows quadratically.If we think of a NoC as a standalone block as is done in standard hierarchical VLSI design, then the overall area growth is indeed quadratic. But this approach either vastly under-utilizes logic area, or, in designs that match wire and logic area, leads to small network links. At the same time, many standard non-NoC logic blocks like processors or accelerator blocks typically use the standard cell logic area but need only a fraction of available wiring resources.We propose an alternative approach, NoC Symbiosis, in which router logic and the node logic it services are jointly placed together. The router absorbs excess wiring resources from the node logic, and the node logic absorbs excess standard cell area from the router. Current-day automatic place and route (APR) tools already automatically distribute the router logic across the node logic, in order to provide enough space for the wiring resources. With this approach, future SoC’s can leverage vastly larger amounts of wiring bandwidth than ever before, or alternatively, reduce the area overhead of existing routers.We describe how we first encountered this phenomena, perform experiments to demonstrate its behavior, and provide design tips to help teams realize the potential of NoC Symbiosis.

Qualitative Communication has been proposed to reduce the granularity of packet dropping due to congestion, from packet level to chunk level, which can significantly improve the user experienced latency and reduce the number of packet retransmissions under the reliable transmissions. This paper proposes an approach to achieve Qualitative Communication by applying random linear network coding to chunks in packet payload. With the help of New IP framework, the network can efficiently perform packet wash in order to retain as many chunks in the packets as possible when congestion happens. The paper proposes several advanced features to further boost the benefits of this approach.

Vehicular ad hoc networks (VANETs) is a class of Mobile ad hoc networks (MANETs). The vehicles move at a high speed; hence, the network topology continuously changes with time. It’s base work for the Intelligent Transport System is promising. There are many challenges which need to be addressed when employing VANET. The complex mobility scheme and dynamic topology make the MANET protocol futile for VANET implementation. This paper aims to compare the various concepts used in field of VANET and provide an efficient solution to the related problems.

With the spread of electronic devices such as smartphones and tablets, the transfer of electronic information such as images and videos has become commonplace. To exchange electronic information using e-mail or social network services a sender needs to know the recipient's contact information. However, if the recipient is a newly-encountered person or an ad hoc partner, a significant number of them are reluctant to exchange contact details. To address this issue, we propose an interaction method for transferring electronic information by tearing a sheet of paper. This is an approach that utilizes the fact that when a piece of paper is torn into two pieces, the features of the torn edges of the two pieces match.

Although the Domain Name System (DNS) was designed as a naming system, its features have made it appealing to repurpose it for the deployment of novel systems. One important class of such systems are security enhancements, and this work sheds light on their deployment. We show the characteristics of these solutions and measure reliability of DNS in these applications. We investigate the compatibility of these solutions with the Tor network, signal necessary changes, and report on surprising drawbacks in Tor’s DNS resolution.

In a companion paper [1], we introduced Latency-Based Forwarding (LBF) as a new approach to achieving stringent end-to-end latency objectives with precisely specified lower and upper bounds. In order to accomplish this, a new forwarding protocol is used that can carry latency objectives as part of packet metadata and take differentiated actions at network nodes depending on a packet’s remaining latency budget, its destination, and the latency encountered so far. LBF is intended to enable new emerging network applications such as Industry 4.0, haptic applications, and holographic-type communications which require support for corresponding high-precision network latency services that are not possible with current best-effort Internet or QoS mechanisms.This demo shows a near real-time, lightweight network emulator for LBF. Individual network nodes are emulated by separate cores on a host. As part of the demo, we vary the end-to-end latency objectives of multiple competing simultaneous flows and compare minimum, maximum, average packet latencies across different scenarios. This demonstrates the behavior and effectiveness of LBF and how it affects flows and packets.

Cloud computing is a continuous and rapidly propelling model, with new points and capacities being declared consistently. Cloud is the best solution for sharing, maintaining, handling large amount of data. Using the cloud computing the user can access the data anywhere and anytime through any mobile devices. Cloud server provides the storage services but this storage service is not fully trusted by users, hence many times users will upload encrypted data on cloud. In this paper different techniques related to regular language search on encrypted data are studied. These techniques are compared based on attributes like privacy, efficiency, accuracy and overhead. Here we propose regular language search over encrypted data store on public cloud using DFA based token generation method.

Quality of service is an important parameter in wireless communication systems. To provide the good data delivery and end-to-end delivery to its users, a system or a network must work on its services. Providing quality of services like excellence throughout and less delay are the main tasks and responsibility of IEEE 802.11e. In this paper, various techniques were discussed to improve the network performance of IEEE 802.11e, and results were compared with existing techniques for better experiments and results.

This paper studies the dirty-paper coding (DPC) based secure transmission in a multiuser broadcast channel. Since the encoding order of DPC determines which information-bearing signals must be treated as noise by potential eavesdroppers, adopting DPC enables the accurate characterization of the intrinsic secrecy as well as secrecy outage of multiuser broadcasting. Furthermore, the information-bearing signals can be designed to provide secrecy in addition to supporting normal (unclassified) transmission. To show this, we consider the scenario where one user requests secure transmission and the other users request normal transmission, and propose a hybrid secure transmission scheme which combines zero-forcing DPC and artificial noise (AN). By solving the secrecy rate maximization problem under constraints on the secrecy outage probability and the normal communication rates, we find that in addition to supporting the normal transmission, the proposed scheme has the potential to achieve a secrecy rate close to that of the traditional AN-based beamforming.

Fog-based radio access network (F-RAN) have the potential to meet the stringent latency and bandwidth requirements of next-generation mobile networks. However, the current F-RAN is implemented mainly by utilizing dedicated hardware and does not leverage on the available large number of distributed edge devices. This motivated us to recently propose the idea of an opportunistic fog RAN (OF-RAN) which introduces the concept of a virtual fog access points (v-FAP) formed by two or more local edge devices (referred as service nodes), and monitored by physical FAPs (referred to as seed nodes). Some of the challenges arising from having many devices opportunistically deployed to serve client nodes are accessing, forming and managing them. In this paper, we propose to harness blockchain technology for assigning roles and permissions to service nodes and seed nodes in our OF-RAN, and supporting the formation and management of v-FAPs. For this blockchain architecture, the distributed formation and management algorithm (DFMA) is implemented as a script in the smart contract. The blockchain then executes the logic of the smart contract while considering the resources from all service nodes participating in the system. By integrating OF-RAN with blockchain systems and smart contracts, it is possible to provide verifiable automation of physical processes involving different nodes.

Spectrum auction has been considered a promising solution to release the under-utilized spectrum from primary spectrum licensee to potential secondary users. In this paper, we introduce an auction-based resource allocation scheme between a spectrum broker and base stations (BS)s that belong to a wireless service provider (WSP). Each BS submits the proportion of resources it wishes to lease from each auctioned spectrum band based on its true demand and the auctioneer's offered price. The spectrum broker leases the resource blocks (RB)s of its under-utilized spectrum bands to the WSP base stations using an iterative resource allocation algorithm. The proposed algorithm is based on a fair spectrum auction. The spectrum broker who manages the under-utilized spectrum resources plays the role of an auctioneer. First, we establish utility functions for the auctioneer and each participating BS. Then we maximize these utilities in iterations in order to achieve optimal price and allocated resources. Furthermore, we introduce a cheat-prevent auction mechanism based on ascending-bid auction to prevent greedy BSs from cheating activities to obtain lower prices for the auctioned resources. Finally we present simulation results on the performance of the proposed resource leasing mechanism.

Many datasets change over time. As a consequence, long-running applications that cache and repeatedly use query results obtained from a SPARQL endpoint may resubmit the queries regularly to ensure up-to-dateness of the results. While this approach may be feasible if the number of such regular refresh queries is manageable, with an increasing number of applications adopting this approach, the SPARQL endpoint may become overloaded with such refresh queries. A more scalable approach would be to use a middle-ware component at which the applications register their queries and get notified with updated query results once the results have changed. Then, this middle-ware can schedule the repeated execution of the refresh queries without overloading the endpoint. In this paper, we study the problem of scheduling refresh queries for a large number of registered queries by assuming an overload-avoiding upper bound on the length of a regular time slot available for testing refresh queries. We investigate a variety of scheduling strategies and compare them experimentally in terms of time slots needed before they recognize changes and number of changes that they miss.

With the advent of Network Function Virtualization (NFV) techniques, a subset of the Internet traffic will be treated by a chain of virtual network functions (VNFs) during their journeys while the rest of the background traffic will still be carried based on traditional routing protocols. Under such a multi-service network environment, we consider the co-existence of heterogeneous traffic control mechanisms, including flexible, dynamic service function chaining (SFC) traffic control and static, dummy IP routing for the aforementioned two types of traffic that share common network resources. Depending on the traffic patterns of the background traffic which is statically routed through the traditional IP routing platform, we aim to perform dynamic service function chaining for the foreground traffic requiring VNF treatments, so that both the end-to-end SFC performance and the overall network resource utilization can be optimized. Towards this end, we propose a deep reinforcement learning based scheme to enable intelligent SFC routing decision-making in dynamic network conditions. The proposed scheme is ready to be deployed on both hybrid SDN/IP platforms and future advanced IP environments. Based on the real GEANT network topology and its one-week traffic traces, our experiments show that the proposed scheme is able to significantly improve from the traditional routing paradigm and achieve close-to-optimal performances very fast while satisfying the end-to-end SFC requirements.

The IP is a primary data plane protocol on the Internet, which has several deficiencies when addressing the needs of modern digital society involving machine-to-machine communication and a remarkably enhanced user experience. New IP is an advanced network protocol specification to modernize the network layer without changing the fundamental Internet architecture. New IP envisions a new header format with 3 functional characteristics, i.e., shipping spec, contract spec, and payload spec. Using these fundamental blocks, New IP proposes a new data plane forwarding paradigm with far more advanced capabilities, such as ManyNets addressing, high precision services and qualitative communications.

The IoT Integration Middleware (IoTIM) assists as an integrating level for distinctive groups of Receptors, Actuators, units, and software. The broking is definitely responsible for getting information right from the linked gateway, digesting the received information, offering the received specifics to connected deals, and managing devices. A gateway can articulate at once by way of the IoT incorporation middleware if it facilitates the suitable spoken switch concept, which contains a related delivery process, like CoAP, HTTP or MQTT. additionally, supplier orientated Architectures (SOA) give favored systems and standards for finding, handling, gain access to control, invocation and structure of service which may easily become presented at the cyberspace, by techniques of leverage as well as, boosting web-affiliated protocols that feature HTTP and so open up model patterns just like XML. Proposed function can be concentrated about middleware broking to offer appropriate multimodal communique.

As vehicles meet each other occasionally in VANETs, users will naturally have the requirement of protecting their privacy during VANET communications. The privacy requirements bring unique challenges for the communication setup and maintenance as any information (such as IP address and MAC address) that may relate to the users' IDs should not be used. To resolve this problem, we propose to utilize the dynamic physical level information, RSS-Ratio, as the address. This short paper briefly presents why RSS-Ratio can be used as an address while not revealing users' IDs, and our proposed method of utilizing RSS-Ratio for anonymous connection setup and maintenance.

This article considers the two-way multiple-input multiple-output (MIMO) relaying channels with multiple users, in which multiple users are served simultaneously by the base station (BS) with the assistance of the relay. The transmission consists of only two phases, doubling the system throughout over traditional one-way half-duplex transmission. A zero-forcing dirty paper coding (ZFDPC) aided physical-layer network coding (PNC) scheme is proposed in this article and the achievable capacity of the ZFDPC aided PNC scheme is derived. Simulation results show that the proposed scheme outperforms the previous decode-and-forward (DF) and zero-forcing beamforming (ZFBF) aided PNC scheme due to more degrees of freedoms and the advantage of PNC. Moreover, we analyze the effect of the imperfect channel state information (CSI) from RS to users at BS side to show the robustness of the proposed ZFDPC aided PNC scheme.