• Title/Summary/Keyword: Multi-hop broadcast

Search Result 58, Processing Time 0.02 seconds

Vehicle-to-Vehicle Broadcast Protocols Based on Wireless Multi-hop Communication (무선 멀티 홉 통신 기반의 차량간 브로드캐스트 프로토콜)

  • Han, Yong-Hyun;Lee, Hyuk-Joon;Choi, Yong-Hoon;Chung, Young-Uk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.4
    • /
    • pp.53-64
    • /
    • 2009
  • Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

  • PDF

Distributed Multi-Hop Relay Scheme to Reduce Delay-Constrained Broadcast Outage Probability (전달 시간 제한이 있는 브로드캐스트 아웃티지 확률을 감소시키는 분산적인 다중 홉 중계 기법)

  • Ko, Byung Hoon;Byun, Ilmu;Rhee, Duho;Jeon, Ki Jun;Kim, Beom Mu;Lee, Seong Ro;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.2
    • /
    • pp.219-226
    • /
    • 2013
  • Distributed multi-hop relay scheme to reduce delay-constrained outage probability for broadcast network is proposed. We consider multi-hop relay scheme, which is similar to distributed beamforming, where multiple nodes simultaneously relay packets, and we propose channel access control and power control for relaying nodes to satisfy energy constraint. Compared with flooding which is multi-hop relay scheme used for ZigBee, the proposed scheme is better in terms of outage probability and average reception throughput.

NETWORK-ADAPTIVE ERROR CONTROL FOR VIDEO STREAMING OVER WIRELESS MULTI-HOP NETWORKS

  • Bae, Jung-Tae;Kim, Jong-Won
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.385-389
    • /
    • 2009
  • Multi-hop wireless mesh networks (WMNs) suffer from significant packet losses due to insufficient available bandwidth and high channel error probability. To conquer packet losses, end-to-end (E2E) error control schemes have been proposed. However, in WMNs, E2E error control schemes are not effective in adapting to the time-varying network condition due to large delay. Thus, in this paper, we propose a network-adaptive error control for video streaming over WMNs that flexibly operates E2E and hop-by-hop (HbH) error control according to network condition. Moreover, to provide lightweight support at intermediate nodes for HbH error control, we use path-partition-based adaptation. To verify the proposed scheme, we implement it and evaluate its transport performance through MPEG-2 video streaming over a real IEEE 802.11a-based WMN testbed.

  • PDF

Fuzzy Based Multi-Hop Broadcasting in High-Mobility VANETs

  • Basha, S. Karimulla;Shankar, T.N.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.165-171
    • /
    • 2021
  • Vehicular Ad hoc Network (VANET) is an extension paradigm of moving vehicles to communicate with wireless transmission devices within a certain geographical limit without any fixed infrastructure. The vehicles have most important participation in this model is usually positioned quite dimly within the certain radio range. Fuzzy based multi-hop broadcast protocol is better than conventional message dissemination techniques in high-mobility VANETs, is proposed in this research work. Generally, in a transmission range the existing number of nodes is obstacle for rebroadcasting that can be improved by reducing number of intermediate forwarding points. The proposed protocol stresses on transmission of emergency message projection by utilization subset of surrounding nodes with consideration of three metrics: inter-vehicle distance, node density and signal strength. The proposed protocol is fuzzy MHB. The method assessment is accomplished in OMNeT++, SUMO and MATLAB environment to prove the efficiency of it.

A multi-hop Communication Scheme in Vehicular Communication Systems (차량통신시스템에서의 멀티홉 전송 방법)

  • Cho, Woong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.111-116
    • /
    • 2012
  • Vehicular communication is one of main convergence technologies which combines information and communication technology (ICT) with vehicle and road industries. In general, vehicular communication adopts IEEE 802.11p standard which is commonly referred as wireless access in vehicular environments (WAVE). In this paper, we investigate a multi-hop communication scheme for IEEE 802.11p based communication systems which support both vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) communications. First, we briefly overview the performance of IEEE 802.11p based communication systems. Then, a multi-hop communication scheme is introduced for both broadcast and unicast. The performance of proposed scheme is presented via experimental measurements.

MAC Protocol for Reliable Multicast over Multi-Hop Wireless Ad Hoc Networks

  • Kim, Sung-Won;Kim, Byung-Seo;Lee, In-Kyu
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.63-74
    • /
    • 2012
  • Multicast data communication is an efficient communication scheme, especially inmulti-hop ad hoc networks where the media access control (MAC) layer is based on one-hop broadcast from one source to multiple receivers. Compared to unicast, multicast over a wireless channel should be able to deal with varying channel conditions of multiple users and user mobility to provide good quality to all users. IEEE 802.11 does not support reliable multicast owing to its inability to exchange request-to-send/clear-to-send and acknowledgement packets with multiple recipients. Thus, several MAC layer protocols have been proposed to provide reliable multicast. However, additional overhead is introduced, as a result, which degrades the system performance. In this paper, we propose an efficient wireless multicast MAC protocol with small control overhead required for reliable multicast in multi-hop wireless ad hoc networks. We present analytical formulations of the system throughput and delay associated with the overhead.

An MPR-based broadcast scheme using 3 channels for WSNs (무선 센서 네트워크에서 3개의 채널을 이용한 MPR 기반의 브로드캐스트 기법)

  • Lee, Ji-Hye;Lee, Ki-Seok;Kim, Chee-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1043-1049
    • /
    • 2009
  • Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

The Performance Comparison of the Unicast Routing Protocol and the Broadcast Routing Protocol in the Small-sized Ad hoc Network (소규모 애드혹 네트워크에서의 유니캐스트와 브로드캐스트 라우팅 프로토콜의 성능비교)

  • Kim, Dong-Hee;Park, Jun-Hee;Moon, Kyeong-Deok;Lim, Kyung-Shik
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.685-690
    • /
    • 2006
  • This paper compares the performance of the unicast routing protocol and the broadcast routing protocol in a small-sized wireless multi-hop network, such as home network. Normally, ad-hoc routing protocols are designed for general wireless multi-hop networks, not being said to be optimized for the small-sized ad hoc network. This paper compares some unicast routing protocols and optimal broadcast routing protocol, and shows the result. The result of the simulation says the broadcast routing protocol shows better performance than the ad-hoc routing protocols in the small-sired wireless multi-hop network. Especially, the result shows that the broadcast protocol has higher packet delivery ratio and lower packet latency than unicast routing protocols

A Message Broadcast Scheme using Contention Window in Vehicular Ad-hoc Network (차량 애드혹 네트워크에서 경쟁윈도우를 이용한 메시지 브로드캐스트 기법)

  • Kim, Tae-Hwan;Hong, Won-Kee;Kim, Hie-Cheol
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.423-434
    • /
    • 2007
  • Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

The Security DV-Hop Algorithm against Multiple-Wormhole-Node-Link in WSN

  • Li, Jianpo;Wang, Dong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2223-2242
    • /
    • 2019
  • Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.