In this paper, we consider roadside infrastructure-to-roadside infrastructure communications in a vehicular ad hoc network. A remote roadside unit (RSU), which does not have connection to the backbone network, needs to send its data traffic to a central RSU (which has backbone connection) by using help from vehicles passing by. Cost is assigned to information transmission energy consumption, as well as possible violation of a soft delay bound. For each passing vehicle, the remote RSU needs to decide whether or not to ask for help from the vehicle, with a target at a minimal rate of cost. We derive an optimal decision strategy of the remote RSU, which is shown to have a conditional pure-threshold structure, i.e., when a vehicle arrives at the remote RSU, if the queuing delay of the data traffic at the remote RSU is above a threshold, it is optimal for the remote RSU to ask for help from the vehicle, with a condition that the vehicle's speed satisfies a requirement. We also provide a method that can theoretically derive the threshold. The conditional pure-threshold structure makes our derived strategy very easy to implement with very low computation complexity.

With the rapid development of the Internet of Things (IoT), the radio frequency identification (RFID) system becomes increasingly important. Tag identification is a basic problem of the RFID system, whose purpose is to inventory tags. However, in recent years, it requires a very short time for massive tag identification, which brings serious challenges. The traditional Aloha based anti-collision algorithms have disadvantages of either low efficiency or high complexity. Therefore, this article proposes a low complexity dynamic frame slotted Aloha (DFSA) anti-collision algorithm, named LC-DFSA. The reader can estimate the range of tag numbers according to the last frame size, the number of successful slots and the ratio of idle slots. Then the optimal frame size can be calculated. Complexity analysis is deployed in this article, and we validate the correctness of the analysis. Through our simulations, LC-DFSA outperforms other schemes in both the average access efficiency and the algorithm complexity. It also can be conveniently applied to engineering implementations.

From the perspective of media protocol control and routing of directional wireless ad hoc sensors networks, neighbor discovery protocol is an important problem to be solved first. In the past period of time, some methods have been studied on neighbor discovery protocol, but they have a common defect of link collision. The collision is caused by mutual interference of multiple transmitting nodes which are in one reception beam of the receiving node. To solve this problem, we propose a neighbor discovery algorithm using a bi-directional carrier sense collision avoidance and multi subchannels based on a scan-based algorithm (BD-SBA). Based on a scan-based algorithm (SBA), bi-directional carrier sense of the BD-SBA algorithm is performed in the first broadcast step which can reduce the collision of broadcasting the scanning request (SREQ) frames. In the second step (the reply step), the mechanism of multiple subchannels and multiple slots is applied to reduce the collision of the scanning response (SRES) frames. From the analysis and simulation, we can see that nodes using proposed algorithm can discover their neighbor nodes in fewer time. Moreover, the proposed algorithm has better performance for different beamwidths and densely distributed scenes. So it has great significance in engineering application.