• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7A
• /
• pp.554-561
• /
• 2009

In this paper, we propose a novel Vehicular Ad-hoc Network(VANET) which includes communication and ranging features, using Spread Spectrum(SS) multi-carrier modulation scheme. In existing methods, a spread spectrum technique was used to communicate with other vehicles and raging was possible by detecting phase difference between transmission/reception of the PN signal. However, the use of high-speed PN signals is mandatory to detect possible errors of phase difference and to increase the analysis capacity. In the proposed system, multi-carrier modulation scheme was used as solution of mentioned problem. The multi-carrier modulation scheme uses smaller PN signal and chip-rate than the single-carrier modulation, so it is possible to send multiple carrier waves using the same frequency range. This technique (multiple carrier waves) allows to have the Equal Gain Combing (EGC) diversity effect, providing better result in phase difference error detection and raging accuracy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.908-917
• /
• 2013

In this paper, we propose a discovery protocol for finding nearby mobile applications and services in a device-to-device communications system. The device-to-device communication technology enables proximity-based services such as mobile social networks and mobile marketing. For realizing these proximity-based services, it is essential to design a discovery protocol which pinpoints the devices with mobile applications of interest among hundreds and thousands of devices in proximity. In the infrastructure-less networks such as ad hoc networks, we can design the discovery protocol that periodically broadcasts a short discovery code containing the compressed information of the mobile applications. In this paper, we design the discovery protocol with the discovery code generated by using a hash function and a Bloom filter. We also mathematically analyze the performance of the proposed protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2665-2670
• /
• 2015

VANET is ad-hoc network in which vehicles are treated as node and these nodes are communicating with each other as well as RSUs on the road. In VANET, scheduling is a very important issue as the request data are to be delivered to the recipient vehicle properly and accurately. It is also critical that any request data which is sent to the vehicle is received by it in the time period for which the vehicle will be in range of RSU. RSU picks the one with the highest priority to serve based on the scheduling scheme. In this paper, we propose a scheduling algorithm to select the one with the highest priority in RSU, in which an RSU can transfer the overload requests to other RSUs. We use the modified DBP scheme to calculate the priority of request data. Simulation results show that our scheme outperforms other scheduling schemes under various conditions.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.103-110
• /
• 2012

In Vehicle Safety Communication (VSC), noted as a representative application of VANET technologies, emergency warning messages (EWM) are broadcast over vehicles in response to an emergency situation. However, as the number of vehicles increases, the so-called Broadcast Storm Problem often occurs due to a huge number of redundant EWM transmitted. Though many approaches in the literature have been proposed to solve the problem, most of them require the preliminary phase for setting up or refreshing neighbor relationship through exchanging beacon messages with nearby vehicles, thereby further increasing the traffic load. In this paper, we propose Longest Leaping Relay (LLR) scheme which can efficiently solve the Broadcast Storm Problem without any preliminary phase for setting up neighbor relationship. Through computer simulations, we compared the performance of the proposed scheme with competitive schemes and verified the proposed scheme outperforms the existing schemes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.278-280
• /
• 2012

We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.