A Joint Activity and Data Detection Scheme for Asynchronous Grant-Free Rateless Multiple Access

This paper considers the frameasynchronous grant-free rateless multiple access(FAGF-RMA)scenario,where users can initiate access at any symbol time,using shared channel resources to transmit data to the base station.Rateless coding is introduced to enhance the reliability of the system.Previous literature has shown that FA-GFRMA can achieve lower access delay than framesynchronous grant-free rateless multiple access(FSGF-RMA),with extreme reliability enabled by rateless coding.To support FA-GF-RMA in more practical scenarios,a joint activity and data detection(JADD)scheme is proposed.Exploiting the feature of sporadic traffic,approximate message passing(AMP)is exploited for transmission signal matrix estimation.Then,to determine the packet start points,a maximum posterior probability(MAP)estimation problem is solved based on the recovered transmitted signals,leveraging the intrinsic power pattern in the codeword.An iterative power-pattern-aided AMP algorithm is devised to enhance the estimation performance of AMP.Simulation results verify that the proposed solution achieves a delay performance that is comparable to the performance limit of FA-GF-RMA.

Grant-Free Random Access in Pilot-Reused Multicell Massive MIMO Systems with Backoff Mechanisms

Grant-free random access(RA)is attractive for future network due to the minimized access delay.In this paper,we investigate the grantfree RA in multicell massive multiple-input multipleoutput(MIMO)systems with pilot reuse.With backoff mechanism,user equipments(UEs)in each cell are randomly activated,and active UEs randomly select orthogonal pilots from a predefined pilot pool,which results in a random pilot contamination among cells.With the help of indicators that capture the uncertainties of UE activation and pilot selection,we derive a closed-form approximation of the spectral efficiency per cell after averaging over the channel fading as well as UEs’random behaviors.Based on the analysis,the optimal backoff parameter and pilot length that maximize the spectral efficiency can be obtained.We find that the backoff mechanism is necessary for the system with large number of UEs,as it can bring significant gains on the spectral efficiency.Moreover,as UE number grows,more backoff time is needed.

Resource allocation for uplink grant-free access in beam-hopping based LEO satellite systems

The low earth orbit(LEO) satellite system provides a promising solution for the global coverage of Internet of Things(IoT) services.Confronted with the sporadic uplink transmission from massive IoT terminals, this work investigates the grant-free access scheme and resource allocation algorithm for the beam-hopping(BH) based LEO satellite systems.To improve the packet success rate, the time slots are pre-allocated to each cell according to the number of terrestrial terminals and the probability of packet arrival.When the packets arrive, the terrestrial terminals perform contention-free or contention-based grant-free access with packet repetition in the time slots allocated to their cells.The analytical expression of the packet collision probability for the grant-free access scheme is derived to provide reference for the resource allocation.To reduce the computational complexity, a heuristic resource allocation algorithm is proposed to minimize the maximum cell packet collision probability in the system.Simulation results show that the proposed resource allocation scheme achieves lower packet collision probability and higher resource utilization ratio when compared with the uniform resource allocation scheme.

Pilot Domain NOMA for Grant-Free Massive Random Access in Massive MIMO Marine Communication System

We propose a pilot domain non-orthogonal multiple access(NOMA)for uplink massive devices grant-free random access scenarios in massive multiple-input multiple-output(MIMO)maritime communication systems.These scenarios are characterized by numerous devices with sporadic access behavior,and therefore only a subset of them are active.Due to massive potential devices in the network,it is infeasible to assign a unique orthogonal pilot to each device in advance.In such scenarios,pilot decontamination is a crucial problem.In this paper,the devices are randomly assigned non-orthogonal pilots which are constructed by a linear combination of some orthogonal pilots.We show that a bipartite graph can conveniently describe the interference cancellation(IC)processes of pilot decontamination.High spectrum efficiency(SE)and low outage probability can be obtained by selecting the numbers of orthogonal pilots according to the given probability distribution.Numerical evaluatioDs show that the proposed pilot domain NOMA decreases the outage probability from 20%to 2 e-12 at the SE of 4 bits/s/Hz for a single device,compared to the conventional method of slotted ALOHA with 1024 antennas at the BS,or increases the spectrum efficiency from 1.2 bits/s/Hz to 4 bit/s/Hz at the outage probability of2 e-12 in contrast with the Welch bound equality(WBE)non-orthogonal pilots.

Enhanced Power Choice Barring Scheme For Massive MTCs With Grant-Free NOMA

Massive machine-type communication(m MTC)is a typical application scenario of the fifth generation(5G)mobile communications.To keep the m MTC reliable and minimize the energy consumption of the m MTC devices,this paper proposes an enhanced power choice barring(EPCB)scheme based on the distributed layered grant-free non-orthogonal multiple access(NOMA)framework,where the cell is divided into different layers according to a predetermined power levels.The proposed EPCB scheme not only combines the grant-free strategy with the sleep mode to reduce the energy consumption,but also designs a power level choosing strategy to increase the access success probability.Simulation results show that when compared with existing schemes,the proposed EPCB scheme has better performance in the aspects of the access success probability and energy efficiency.

Contention-Based Beaconless Real-Time Routing Protocol for Wireless Sensor Networks

This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at each hop through integrating the contention and neighbor table mechanisms. More precisely, CBRR maintains a neighbor table via the contention mechanism being dependent on wireless broadcast instead of beacons. Comprehensive simulations show that CBRR can not only achieve higher performance in static networks, but also work well for dynamic networks.

Resource allocation for D2D-assisted haptic communications

Haptic communications is recognized as a promising enabler of extensive services by enabling real-time haptic control and feedback in remote environments,e.g.,teleoperation and autonomous driving.Considering the strict transmission requirements on reliability and latency,Device-to-Device(D2D)communications is introduced to assist haptic communications.In particular,the teleoperators with poor channel quality are assisted by auxiliaries,and each auxiliary and its corresponding teleoperator constitute a D2D pair.However,the haptic interaction and the scarcity of radio resources pose severe challenges to the resource allocation,especially facing the sporadic packet arrivals.First,the contentionbased access scheme is applied to achieve low-latency transmission,where the resource scheduling latency is omitted and users can directly access available resources.In this context,we derive the reliability index of D2D pairs under the contention-based access scheme,i.e.,closed-loop packet error probability.Then,the reliability performance is guaranteed by bidirectional power control,which aims to minimize the sum packet error probability of all D2D pairs.Potential game theory is introduced to solve the problem with low complexity.Accordingly,a distributed power control algorithm based on synchronous log-linear learning is proposed to converge to the optimal Nash Equilibrium.Experimental results demonstrate the superiority of the proposed learning algorithm.

On Uplink Non-Orthogonal Multiple Access for 5G：Opportunities and Challenges

In this paper,the concept of grantfree non-orthogonal multiple access(NOMA) for uplink data transmission is elaborated.NOMA in combination with grant-free can be applied to ultra reliability low latency communication(URLLC),massive machine type communication(m MTC),enhanced mobile broadband(e MBB) small packet and two-step random-access channel(RACH) scenarios.The advantages of grant-free NOMA are low latency and signaling overhead,high access capability and efficient resource utilization.Candidate uplink NOMA schemes are summarized and preliminary comparison among a subset of schemes are presented.Furthermore,design aspects for grant-free NOMA are discussed,with special notes on particular issues such as blind UE identification and transmitter/receiver(Tx/Rx) impairments in realistic deployment.

Neighbor-Aware Multiple Access Protocol for 5G m MTC Applications

In order to support massive Machine Type Communication(mMTC) applications in future Fifth Generation(5G) systems,a key technical challenge is to design a highly effective multiple access protocol for massive connection requests and huge traffic load from all kinds of smart devices,e.g.bike,watch,phone,ring,glasses,shoes,etc..To solve this hard problem in distributed scenarios with massive competing devices,this paper proposes and evaluates a Neighbor-Aware Multiple Access(NAMA) protocol,which is scalable and adaptive to different connectivity size and traffic load.By exploiting acknowledgement signals broadcasted from the neighboring devices with successful packet transmissions,NAMA is able to turn itself from a contention-based random access protocol to become a contention-free deterministic access protocol with particular transmission schedules for all neighboring devices after a short transition period.The performance of NAMA is fully evaluated from random state to deterministic state through extensive computer simulations under different network sizes and Contention Window(CW)settings.Compared with traditional IEEE802.11 Distributed Coordination Function(DCF),for a crowded network with 50 devices,NAMA can greatly improve system throughput and energy efficiency by more than 110%and210%,respectively,while reducing average access delay by 53%in the deterministic state.

Multi-Sensor Estimation for Unreliable Wireless Networks with Contention-Based Protocols

The state estimation plays an irreplaceable role in many real applications since it lays the foundation for decision-making and control. This paper studies the multi-sensor estimation problem for a contention-based unreliable wireless network. At each time step, no more than one sensor can communicate with the base station due to the potential contention and collision. In addition, data packets may be lost during transmission since wireless channels are unreliable. A novel packet arrival model is proposed which simultaneously takes into account the above two issues. Two scenarios of wireless sensor networks （WSNs） are considered： the sensors transmit the raw measurements directly and the sensors send the local estimation instead. Based on the obtained packet arrival model, necessary and sufficient stability conditions of the estimation at the base station side are provided for both network scenarios. In particular, all offered stability conditions are expressed by simple inequalities in terms of the packet arrival rates and the spectral radius of the system matrix. Their relationships with existing related results are also discussed. Finally, the proposed results are demonstrated by simulation examples and an environment monitoring prototype system.

Duplicated transmission based-resource scheduling for uplink grant-free SCMA system

Sparse code multiple access-based uplink grant-free transmission(SCMA-UGFT)has been proposed to realize ultra reliable and low latency communication(URLLC)in the fifth generation(5 G)system.Without the process of resource request and grant,users may collide in the same resource.To compensate the potential user performance decline,resource scheduling becomes a tough issue in the SCMA-UGFT system.This article proposes a duplicated transmission-based resource scheduling(DTBRS)scheme for SCMA-UGFT system by considering the URLLC scenario.Different from the existing schemes,not only one shared basic transmission units(BTUs)are allocated to a user equipment(UE)in the proposed DTBRS scheme for initial transmission to realize the duplicated transmission and to guarantee the transmission reliability.Besides,according to the proposed DTBRS scheme,one or two exclusive BTUs are assigned to a UE for retransmission to avoid the re-collision.At last,each packet is given a lifetime to limit the transmission latency to meet the URLLC latency requirement.The simulation demonstrates that the DTBRS scheme can achieve a better performance than the existing state-of-the-art scheme in terms of the average packet drop rate.

Two-Tier Hierarchical Cluster Based Topology in Wireless Sensor Networks for Contention Based Protocol Suite

The 802.15.4 Wireless Sensor Networks (WSN) becomes more economical, feasible and sustainable for new generation communication environment, however their limited resource constraints such as limited power capacity make them difficult to detect and defend themselves against variety of attacks. The radio interference attacks that generate for WSN at the Physical Layer cannot be defeated through conventional security mechanisms proposed for 802.15.4 standards. The first section introduces the deployment model of two-tier hierarchical cluster topology architecture and investigates different jamming techniques proposed for WSN by creating specific classification of different types of jamming attacks. The following sections expose the mitigation techniques and possible built-in mechanisms to mitigate the link layer jamming attacks on proposed two-tier hierarchical clustered WSN topology. The two-tier hierarchical cluster based topology is investigated based on contention based protocol suite through OPNET simulation scenarios.

Reconfigurable intelligent surface assisted grant-free massive access

Massive machine-type communications(mMTC)is envisioned to be one of the pivotal scenarios in the fifth-generation(5G)wireless communication,where the explosively emerging Internet-of-Things(IoT)applications have triggered the demand for services with low-latency and high-reliability.To this end,grant-free random access paradigm has been proposed as a promising enabler in simplifying the connection procedure and significantly reducing access latency.In this paper,we propose to leverage the burgeoning reconfigurable intelligent surface(RIS)for grant-free massive access working at millimeter-wave(mmWave)frequency to further boost access reliability.By attaching independently controllable phase shifts,reconfiguring,and refracting the propagation of incident electromagnetic waves,the deployed RISs could provide additional diversity gain and enhance the access channel conditions.On this basis,to address the challenging active device detection(ADD)and channel estimation(CE)problem,we develop a joint-ADDCE(JADDCE)method by resorting to the existing approximate message passing(AMP)algorithm with expectation maximization(EM)to extract the structured common sparsity in traffic behaviors and cascaded channel matrices.Finally,simulations are carried out to demonstrate the superiority of our proposed scheme.