• The Journal of the Korea Contents Association
• /
• v.22 no.5
• /
• pp.26-36
• /
• 2022

Recently, studies have been conducted to cluster vehicles and disseminate safety messages in a VANET environment for driver safety and smoothy traffic. This paper proposes cluster management scheme for safety message dissemination through V2V communication and V2I communication in a VANET environment with high vehicle density and mobility. The proposed scheme reduces packet loss by selecting CH considering reception quality, total data owned by vehicles, moving speed, and connected vehicles, and maintaining cluster head candidates, which are the main agents of message dissemination, considering frequent cluster departures and subscriptions. In addition, the proposed scheme reduces duplicate messages by utilizing clusters by collaborating with a Road side unit(RSU). To prove the excellence of the proposed scheme, various performance evaluations are performed in terms of message packet loss and the number of RSU processing requests. As a result of performance evaluation, the cluster management scheme proposed in this paper shows better performance than the existing scheme.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1297-1307
• /
• 2013

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1223-1236
• /
• 2014

With the extension of wireless technology, vehicular ad hoc networks provide important services for the dissemination of general data and emergency warnings. However, since, the vehicle topology frequently changes from a dense to a sparse network depending on the speed of the moving vehicles and the time of day, vehicular ad hoc networks require a protocol that can facilitate the efficient and reliable dissemination of emergency messages in a highly mobile environment under dense or intermittent vehicular connectivity. Therefore, this paper proposes a new vehicular broadcast protocol, called BL-CAST, that can operate effectively in both dense and sparse network scenarios. As a low overhead multi-hop broadcast protocol, BL-CAST does not rely on the periodic exchange of beacons for updating location information. Instead, the location information of a vehicle is included in a broadcast message to identify the last rebroadcasting vehicle in an intermittently connected network. Simulation results show that BL-CAST outperforms the DV-CAST protocol in terms of the end-to-end delay, message delivery ratio and network overhead.

• Journal of Korea Multimedia Society
• /
• v.22 no.8
• /
• pp.913-922
• /
• 2019

The Internet of Things (IoT) envisions smart objects collecting and sharing data at a massive scale via the Internet. One challenging issue is how to disseminate data to relevant data consuming objects efficiently. In such a massive IoT network, Mission critical data dissemination imposes constraints on the message transfer delay between objects. Due to the low power and communication range of IoT objects, data is relayed over multi-hops before arriving at the destination. In this paper, we propose a quorum-based adaptive dissemination algorithm (QADA) for the critical data in the monitoring-based applications of massive IoTs. To design QADA, we first design a new stepped-triangular grid structures (sT-grid) that support data dissemination, then construct a triangular grid overlay in the fog layer on the lower IoT layer and propose the data dissemination algorithm of the publish/subscribe model that adaptively uses triangle grid (T-grid) and sT-grid quorums depending on the mission critical in the overlay constructed to disseminate the critical data, and evaluate its performance as an analytical model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.215-221
• /
• 2011

Communication infrastructure of wireless sensor networks significantly tends to depend on application requirements. Gossip communication is becoming one of the promising solutions for addressing its scalability problems in providing information propagation functionality based on the P (publish)/S (subscribe) paradigm. In particular, despite the importance of both guaranteeing message delivery order required and supporting overlapping groups in sensor networks, there exist little research works on development of gossip-style dissemination protocols to satisfy all these requirements. In this paper, we present the latest causal information transmission protocol between publishers and subscribers for overlapping groups. In this protocol, sensor leaders as publishers might guarantee consistently causally ordered message delivery among themselves by aggregating causality information. On the other hand, only the latest causal information piggybacked on each multicast message is transmitted from publishers to subscribers through gossip-style dissemination. Its scalability feature might be highly suitable for the area of the applications requiring only the minimum meaningful information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5744-5764
• /
• 2018

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.37-46
• /
• 2012

In the existing data dissemination methods for mobile P2P networks, the search performance of content that matches the peer profile is very excellent. However, in the search for content that does not match the their profile, additional consideration about case that contents does not match the profile is needed because costs for the query processing will be incurred. To solve these problems, we propose a new data dissemination method for efficient contents search in mobile P2P networks. In the proposed method, peers determine whether they experienced communications by using a timestamp message and then perform data dissemination. We also propose a ranking algorithm to efficiently store dissemination data in a limited memory. The proposed ranking method can reduce query messages by considering the profile matches, the distribution range, and the connectivity to the data distribution peer.

• Journal of Advanced Navigation Technology
• /
• v.23 no.6
• /
• pp.548-553
• /
• 2019

Along with advanced vehicle to vehicle (V2V) communication technologies, platooning is regarded as one of the most promising form of autonomous driving solutions in order to increase road capacity. In this paper, we propose a novel V2V transmission scheme for safety message dissemination in platooning. The proposed scheme enhances the efficiency of channel access and multi-vehicle orthogonal frequency division multiple access (OFDMA) transmission by taking advantage of triggered uplink access technique and null data packet feedback report protocol introduced in the sixth generation WLAN standard, IEEE 802.11ax. The simulation results prove that the proposed scheme outperforms the conventional IEEE 802.11 transmission scheme throughout all measured vehicle density range.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.815-834
• /
• 2012

Recently, along with the innovative development of wireless communication techniques and mobile devices, mobile P2P services in mobile wireless networks have gained a lot of attention. In this paper, we propose a resource discovery scheme with data dissemination over mobile P2P networks. In the proposed scheme, each peer manages a local information table, a resource index table, and a routing table in a local database to enhance the accuracy and cost of resource discovery. The local information table stores the status of a mobile peer, and the resource index table stores the resource information of the neighbor peers via the ranking function. The routing table is used to communicate with the neighbor peers. We use a timestamp message to determine whether or not the resource index table will be changed before the resource information is exchanged. Our ranking function considers the interest and mobility of the mobile peer and prioritizes the resource information transmitted from the neighbor peers. It is shown via various experiments that the proposed scheme outperforms the existing scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.3
• /
• pp.602-612
• /
• 2015

Current IEEE 802.11p which is suggested for vehicle to vehicle communication supports one hop communication. Thus, it has a limitation to carry out efficient data dissemination. In this thesis, we suggest LTE-D2D based vehicle network to provide efficient data dissemination in the vehicle environment. In this network architecture, we use name based message with IP packet options and we put the intermediate vehicle node called 'super vehicle node' and each normal vehicle node in the cell requests data to the super vehicle node. The super vehicle node responses data to the normal vehicle node. Performance analysis is based mathematical modeling. We compare LTE cellular network to LTE-D2D based vehicle network about throughput according to packet delivery time.