A Glimpse at Bicycle-to-Bicycle Link Performance in the 2.4GHz ISM Band

Bicycle-to-bicycle (Bi2Bi) communication can be implemented by well-established technologies in the 2.4GHz ISM band: IEEE 802.11, Bluetooth or IEEE 802.15.4. These technologies have distinct performance due to different physical and data link layers. In this paper, we characterize the mentioned 2.4 GHz-operating technologies over opportunistic links established between bicycles using commodity hardware. We find that, in Bi2Bi links, Blue-tooth, IEEE 802.11 at 24 Mbit/s, and IEEE 802.11 with automatic rate adaptation can communicate only in the immediate surroundings (under 15m of range), to maxima of 1.5 Mbit/s, 17 Mbit/s and 25 Mbit/s, respectively. IEEE 802.15.4 and IEEE 802.11 at 1 Mbit/s sustain connectivity up to 30 and 40 meters and peak transfer rates of 50 kbit/s and 800 kbit/s respectively. In addition, we observed that, in all measurement scenarios, link performance depended strongly on whether bicycles were approaching or moving away, rather than on whether one was at the front or back of the other.info:eu-repo/semantics/publishedVersio

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words