• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.188-190
• /
• 2014

In mobile ad hoc networks(MANETs), each node rebroadcast received route request packets for route discovery. Flooding from large number of nodes induces the broadcast storm problem which causes severe degradation in network performance due to redundant retransmission, collision and contention. This paper presents a node status algorithm based on probabilistic scheme to alleviate the broadcast storm problem for wireless ad hoc networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.11-18
• /
• 2005

In ad hoc networks, many applications use the broadcast service that is elementary operation to support various important functions such as route discovery procedure. This paper presents several adaptive probabilistic broadcast schemes base on local information to alleviate the broadcast storm problem for wireless ad hoc network. Our schemes dynamically determine the rebroadcast probability at each node based on the neighbor information within two-hop span. Simulation results are presented, which show our schemes have a better performance over the deterministic flooding approach.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.197-203
• /
• 2011

Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.49-56
• /
• 1999

In this paper, the general formula of disparity estimation based on Bayesian Maximum A Posteriori (MAP) algorithm is derived. The generalized formula is implemented with the plane configuration model and applied to multiple baselined stereograms. The probabilistic plane configuration model consists of independence and similarity among the neighboring disparities in the configuration. The independence probabilistic model reduces the computation and guarantees the discontinuity at the object boundary region. The similarity model preserves the continuity or the high correlation of disparity distribution. In addition, we propose a hierarchical scheme of disparity compensation in the application to multiple-view stereo images. According to the experiments, the derived formula and the proposed estimation algorithm outperformed other ones. The proposed probabilistic models are reasonable and approximate the pure joint probability distribution very well with decreasing the computations to O(n(D)) from O(n(D)4) of the generalized formula. And, the hierarchical scheme of disparity compensation with multiple-view stereos improves the performance without any additional overhead to the decoder.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.128-135
• /
• 2009

In this paper, we proposed an interactive GUI (Graphical User Interface) system to model buildings with an editable script. Our system also provides probabilistic finite-state machine (PFSM) to define the relationships of sub-models with transformation matrices and transition probabilities for constructing new novel building models automatically. User can not only get various building models by PFSM but also adjust the probabilities of sub-models from PFSM to get desired building models. As shown in the results, the various and vivid building models can be constructed easily and quickly for non-expert users. Besides, user can also edit the script file which is provided by our system to modify the properties directly.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.3
• /
• pp.25-32
• /
• 2016

Mobile Ad Hoc Networks(MANETs) consists of mobile nodes which communicate with each other without any centralized infrastructure. Message broadcasting by flooding for route discovery in MANET can result in high redundant retransmission, contention and collision of broadcasting packet, known as the broadcast storm problem collectively. The cross-layer design is adopted in this paper, which lets routing layer share the received signal strength information at MAC layer. Also this paper proposes a new probabilistic approach that dynamically adjusts the rebroadcasting probability of a node for routing request packets (RREQs) according to the received signal strength. The simulation results show that the proposed approach demonstrates better performance than blind flooding, fixed probabilistic broadcasting approaches.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1613-1622
• /
• 2005

Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2001.11b
• /
• pp.29-33
• /
• 2001

사용자에게 적합한 프로그램을 추천하거나 필터링을 수행하는 지능형 방송 단말 응용 소프트웨어 에이전트에서 필수적으로 사용되는 사용자 선호도 (User Preference)를 추출하는 알고리즘을 연구하였다. 시청자 선호도 추출 알고리즘으로는 시청자의 프로그램 장르나 출연 배우 등에 대한 선호도, 프로그램 시청 시간 등에 대한 선호도나 시청 프로그램에 대한 사용자의 인터랙션 습성 분석에 의한 프로그램 선호도 등을 probabilistic framework과 rule-based framework을 근간으로 추출하는 알고리즘 연구에 대한 결과를 본 논문에서 제시한다.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.499-504
• /
• 2010

The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.