A novel low-complexity wireless neighbor discovery scheme, referred to as sparse orthogonal frequency division multiplexing (sparse-OFDM) is proposed. One area of application is the "Internet of Things" (IoT). The number of devices is very large while every device accesses the network with a small probability, so the number of active devices in a frame is much smaller than the total local device population. Sparse OFDM is a one-shot transmission scheme with low complexity, which exploits both the parallel channel access offered by OFDM and the bursty nature of transmissions. When the transmission delay of each device is an integer number of symbol intervals, analysis and simulation show that sparse OFDM enables successful asynchronous neighbor discovery using a much smaller code length than random access schemes.
Network layer protocol designs for neighbor discovery can be categorized into randomized and deterministic algorithms. The main objective is to optimize random access probability or the transmit schedule of each device such that the system throughput is maximized @cite_22 @cite_0 @cite_23 @cite_2 @cite_13 . Instead of purely avoiding collision, the FlashLinQ technology developed by Qualcomm assigns channels based on signal-to-interference ratios and achieves superior performance over carrier sense multiple access with collision avoidance (CSMA CA) systems @cite_1 @cite_7 . The neighbor discovery algorithm proposed in this paper can be regarded as a physical layer technique, which can be optimized with the network layer protocols to improve the system performance.
@cite_22 @cite_7 @cite_1 @cite_0 @cite_23 @cite_2 @cite_13
2078612414 2143669931 2002645041 2008584289 2164561129 2021578930 1978599484
A novel media access control (MAC) protocol named carrier sense multiple access with idle detection (CSMA ID) is proposed to handle variable-length packets over an all-optical ring network. To evaluate optimal utilization of channel bandwidth, we study packet scheduling based on three transmitting queue discipline (TQD) architectures and four idle space allocation (ISA) algorithms with regard to their impact on performance. For numerical evaluation of performance, an analytical model is developed by a preclassification queue with weighted round-robin (PCQWRR) architecture and a random algorithm. Moreover, three related MAC protocols are examined and compared, namely, multitoken, carrier sense multiple access collision avoidance (CSMA CA) and carrier sense multiple access collision preemption (CSMA CP). Simulation results indicate that, of the TQDs, better performance is obtained by PCQWRR compared with first-in-first-out and preclassification queues. The first fit space (FFS) algorithm has the best performance of the ISAs. The 12 combinations of TQDs-ISAs are then considered. It is found that the combination of PCQWRR with FFS provides the greatest efficiency and has the lowest packet latency, providing better throughput than three different MAC protocols under either symmetric or asymmetric traffic load on all-optical ring networks. In this paper, we analyse the impact of the Contiki Operating System (OS), and its Carrier Sense Multiple Access and Collision Avoidance (CSMA-CA) implementation on an IEEE 802.15.4 node's throughput and wireless channel utilization. The analysis is based on Contiki's Rime networking protocol stack, and its target is to determine an upper bound for the stated metrics. We explain that in Contiki with CSMA-CA as a MAC layer protocol, a node's throughput is limited to 8.1 kbps, at maximum, even without power saving features. In order to maximize a node's transmission capability, we modified Contiki's CSMA-CA implementation. A number of simulations are performed, and it is observed that with our modifications node throughput reaches 45 kbps, at maximum. Simulation results for estimating the channel capacity with our modified CSMA-CA MAC layer protocol show that the average per-node delay is low when the offered data load remains below 100 kbps. For an offered load of 100 kbps, the channel drops almost 20 of packets. Going beyond 100 kbps results in large latencies and significant packet loss. Results presented in this paper can serve as basis for the available bandwidth estimation in Wireless Sensor Networks (WSNs), QoS-based routing, and design of congestion control algorithm. In this paper we consider an IEEE 802.15.4-based Wireless Body Area Network, where wearable sensor devices are distributed on a body and have to send the measured data to a coordinator. The Carrier Sense Multiple Access with Collision Avoidance algorithm defined by the standard is used as Medium Access Control protocol, whereas different modulation schemes are assumed to be available at the physical layer. We propose a novel Link Adaptation (LA) strategy, where nodes select the modulation scheme according to the experienced channel quality and level of interference. The novelty lays in the fact that in case of large Signal-to-Noise Ratio and low Signal-to-Interference Ratio nodes increase the bit rate, instead of reducing it, as largely done in the works present in the literature. The reduction of the bit rate, in fact, allows to decrease the time the channel is occupied and, therefore, the collision probability. Performance is evaluated in terms of packet error rate and results achieved with and without LA are compared. Results show that the proposed strategy improves performance. Channel response and noise in the in-home power-line channel are time varying, and show periodic patterns since electric devices, which are major noise sources, synchronously run with the ac-line cycle. Using the relatively stable channel characteristic of the power line, orthogonal frequency-division multiple access (OFDMA) schemes in power-line communications (PLCs) can achieve multiuser diversity gain even in random access. In this paper, we propose a carrier-sense multiple access with a collision-avoidance (CSMA CA) protocol for OFDMA-based broadband PLC. To achieve the maximum diversity gain, we formulate a utility maximization problem for our considered framework. Then, we solve this problem by dividing it into two subproblems. The first one divides the whole bandwidth into a certain number of subchannels appropriately, and then the second one allocates a subchannel to each node according to the channel condition. To solve each subproblem, we first consider optimal algorithms and then heuristic algorithms to overcome the complexity. Through extensive simulations, we show that our proposal greatly improves the overall system utility compared to the single-channel CSMA CA scheme. The performance improvement of our proposal over the single channel scheme is mainly achieved by lowering collision probability and exploiting multiuser diversity.