Analytical Modeling of Distributed Location Based Access for Vehicular Ad Hoc Networks

One of the key ingredients of Intelligent Transportation Systems (ITS) is delivery of broadcast status messages among vehicles for safety purposes. This requires an efficient Medium Access Control (MAC) that provides low average delay and high reliability. To this end, Carrier Sense Multiple Access (CSMA) has been commonly proposed for Vehicle Ad Hoc Networks (VANETs). Nevertheless, the hidden-node problem can jeopardize the reliability of CSMA, whereas the latency when accessing the channel can be unbounded. To overcome these limitations, resource allocation based on the geo-location of the vehicles can be applied in VANETs. For example, a distributed location based access (DLOC) algorithm has been proposed such that vehicles access orthogonal resource blocks based on their position, aiming at maximizing the distance of co-channel transmitters. In this paper we propose a stochastic geometry approach to analyze DLOC taking into account path loss and fading as well as the random location of transmitting vehicles. Analytical results include the average interference, average binary rate and capture probability, i.e. probability of successful message transmission. It is shown that increasing the number of RBs increases reliability but there is a trade off between reliability and average BR.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Computer Self-Efficacy of Librarians and Users as Influencers of University Libraries’ Information System Security: Evidence from Nigeria

Librarians and their users interact with the library’s information systems for different reasons. The need to protect information and information systems from unauthorized access, modification, data loss and destruction by librarians has become topical in recent times, hence this study. Using survey research design of the correlation type, three University libraries in the South-western Nigeria were purposively selected. Structured questionnaires for 48 librarians and 44,508 registered library users were used. Proportionate stratified random sampling technique for library users with Undergraduates, post graduates and staff as the basis for stratification was used. Total enumeration was used to capture all the librarians, total of 845 (95%) for library users and 42 (88%) for librarians were successfully completed and used for the study. Findings revealed that the librarians and library users had high computer self-efficacy levels related to information system security. Furthermore, computer self-efficacy of librarians significantly influence information systems security (β = .61, t= 4.86, p.05). The study concludes that these two groups have a strong belief in their abilities to use computers effectively to impact on the information system. The librarians’ belief is in the positive; the users’ appears to be for negative reasons. The study recommends very high level of computer and other technologies efficacy for librarians, regular training and retraining while users should be re-orientated to the realities and benefits of secured information systems

Exploiting Capture Effect in Frameless ALOHA for Massive Wireless Random Access

The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design random access schemes. This approach leads to throughput substantially higher than the one offered by the traditional slotted ALOHA. In the simplest setting, SIC progresses when a successful decoding occurs for a single user transmission. In this paper we consider a more general setting of a channel with capture and explore how such physical model affects the design of the coded random access protocol. Specifically, we assess the impact of capture effect in Rayleigh fading scenario on the design of SIC-enabled slotted ALOHA schemes. We provide analytical treatment of frameless ALOHA, which is a special case of SIC-enabled ALOHA scheme. We demonstrate both through analytical and simulation results that the capture effect can be very beneficial in terms of achieved throughput.Comment: Accepted for presentation at IEEE WCNC'14 Track 2 (MAC and Cross-Layer Design

Characterization of Coded Random Access with Compressive Sensing based Multi-User Detection

The emergence of Machine-to-Machine (M2M) communication requires new Medium Access Control (MAC) schemes and physical (PHY) layer concepts to support a massive number of access requests. The concept of coded random access, introduced recently, greatly outperforms other random access methods and is inherently capable to take advantage of the capture effect from the PHY layer. Furthermore, at the PHY layer, compressive sensing based multi-user detection (CS-MUD) is a novel technique that exploits sparsity in multi-user detection to achieve a joint activity and data detection. In this paper, we combine coded random access with CS-MUD on the PHY layer and show very promising results for the resulting protocol.Comment: Submitted to Globecom 201

Stable Throughput and Delay Analysis of a Random Access Network With Queue-Aware Transmission

In this work we consider a two-user and a three-user slotted ALOHA network with multi-packet reception (MPR) capabilities. The nodes can adapt their transmission probabilities and their transmission parameters based on the status of the other nodes. Each user has external bursty arrivals that are stored in their infinite capacity queues. For the two- and the three-user cases we obtain the stability region of the system. For the two-user case we provide the conditions where the stability region is a convex set. We perform a detailed mathematical analysis in order to study the queueing delay by formulating two boundary value problems (a Dirichlet and a Riemann-Hilbert boundary value problem), the solution of which provides the generating function of the joint stationary probability distribution of the queue size at user nodes. Furthermore, for the two-user symmetric case with MPR we obtain a lower and an upper bound for the average delay without explicitly computing the generating function for the stationary joint queue length distribution. The bounds as it is seen in the numerical results appear to be tight. Explicit expressions for the average delay are obtained for the symmetrical model with capture effect which is a subclass of MPR models. We also provide the optimal transmission probability in closed form expression that minimizes the average delay in the symmetric capture case. Finally, we evaluate numerically the presented theoretical results.Comment: Submitted for journal publicatio

Random Access Protocols for Massive MIMO

5G wireless networks are expected to support new services with stringent requirements on data rates, latency and reliability. One novel feature is the ability to serve a dense crowd of devices, calling for radically new ways of accessing the network. This is the case in machine-type communications, but also in urban environments and hotspots. In those use cases, the high number of devices and the relatively short channel coherence interval do not allow per-device allocation of orthogonal pilot sequences. This article motivates the need for random access by the devices to pilot sequences used for channel estimation, and shows that Massive MIMO is a main enabler to achieve fast access with high data rates, and delay-tolerant access with different data rate levels. Three pilot access protocols along with data transmission protocols are described, fulfilling different requirements of 5G services