• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.6
• /
• pp.588-594
• /
• 2010

In a multi-hop wireless sensor network, broadcasting is an elementary operation to support command message sending, route discovery and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless sensor network. How to decide whether re-broadcast or not also poses a dilemma between reach ability and efficiency under different host densities. In this paper, we present popular broadcasting schemes, which can reduce re-broadcast packets and improve SRB(Saved ReBroadcast). Simulation results show different levels of improvement over the simple flooding scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.170-177
• /
• 2005

Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.69-85
• /
• 2006

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile clients over a single or multiple channels. Conventional concurrency control protocols for mobile transactions are not suitable for the wireless broadcast environments due to the limited bandwidth of the up-link communication channel. In wireless broadcast environments, the server often broadcast different data items with different frequency to incorporate the data access patterns of mobile transactions. The previously proposed concurrency control protocols for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. However, these protocols perform poorly when the data access pattern of update mobile transaction are not uniform but skewed. The update mobile transactions with skewed data access patterns will be frequently aborted and restarted due 4o the update conflict of the same data items with a high access frequency. In this paper, we propose an energy-efficient concurrence control protocol for mobile transactions with skewed data access as well as uniform data access patterns. Our protocol use a random back-off technique to avoid the frequent abort and restart of update mobile transactions. We present in-depth experimental analysis of our method by comparing it with existing concurrency control protocols. Our performance analysis show that it significantly decrease the average response time, the amount of upstream and downstream bandwidth usage over existing protocols.

• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.79-85
• /
• 2006

We concern practical of utilizable frequency with wireless communication and broadcast technology. And, present that wireless application technology such of Ubiquitous sensor network, mobile or fixed wireless communication and wireless broadcast will require more efficiently using of frequency. In this paper, we studied Cognitive Radio that necessity of cognitive and intelligent technology in variable wireless environment and IEEE 802.22 standardization.

• Journal of Digital Contents Society
• /
• v.6 no.3
• /
• pp.179-184
• /
• 2005

We concern practical of utilizable frequency with wireless communication and broadcast technology. And, present that wireless application technology such of Ubiquitous sensor network, mobile or fixed wireless communication and wireless broadcast will require more efficiently using of frequency. In this paper, we studied Cognitive Radio That necessity of cognitive and intelligent technology in variable wireless environment and IEEE 802.22 standardization.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.41-47
• /
• 2010

The emergency between vehicles on the superhighway should be transmitted quickly to the following vehicles for safety of people. The message between them has been transmitted by broadcast method in an wireless environment of 802.11, so far. That causes the broadcast storm and a waste of the bandwidth of Wireless network owing to unnecessary process of sending messages to even vehicles that do not have to receive the information. The message collision is a main cause of the increase of message delay. In order to overcome the existing problem, this paper proposed a message broadcast scheme based on cell (MBC), which is the way to divide cars into different groups by cell unit and transmit messages to the members of the groups through the cell primary (cp) vehicles. This paper shows the proposed broadcast's performance in the same environment is much superior to other conventional broadcast schems for inter-vehicle communication, since the receiving ratio among the following vehicles is improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.673-684
• /
• 2007

In this paper, we introduce an FARNS (Flooding algorithm with Adaptive Retransmission Nodes Selection). It is an efficient cross layer-based flooding technique to solve broadcast storm problem that is produced by simple flooding of nodes in wireless sensor network. FARNS can decrease waste of unnecessary energy by preventing retransmission action of whole network node by deciding retransmission candidate nodes that are selected by identification in MAC and distance with neighborhood node through received signal strength information in PHY. In simulation part, we show the results that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, number of redundancy packets and overhead. And FARNS can adjust of node ratio for retransmission operation, it can solve broadcast storm problem as well as meet the requirements of various network environments.

• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.27-36
• /
• 2010

In wireless networks environment, there are attempts for constructing systems through which we can monitor and control various electronic devices used in large buildings at remoteness by using Zigbee protocol. Since address assignment method of DAA in Zigbee has a depth restriction, we cannot construct a network in large buildings. And also communication failures are frequent in a large network since broadcast storm can be occurred due to frequent broadcasts among a lot of nodes at AODV routing used in Zigbee. In order to solve these problems, in this paper, we propose a novel protocol which has improved the restriction of depth by using a fixed address assignment method, and has enhanced the broadcast occurrence by devising a static routing method to a packet movement between floors. Regardless of entire network, additionally, this was to enable internal communication reliably by composing an independent PAN. Specially, in this paper, we implemented the proposed wireless protocol and proved stability and practicality through experiment appliances of control of devices established in a large building.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.1-8
• /
• 2016

This paper proposes a novel broadcast scheduling algorithm for wireless large-scale networks based on theory of complex networks. In the proposed algorithm, the network topology is formed based on a scale-free network and the probability of link distribution is analyzed. In this paper, the characteristics of complex systems are analyzed (which are not concerned by the existing broadcast scheduling algorithm techniques) and the optimization of network transmission efficiency and network time delay are provided.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.404-415
• /
• 2002

In this paper, we address the issue of ensuring consistency of multiple data items requested in a certain order by read-only transactions in a wireless data broadcast environment. To handle the inherent property in a data broadcast environment that data can only be accessed strictly sequential by users, we explore a predeclaration-based query optimization and devise two practical transaction processing methods in the context of local caching. We also evaluate the performance of the proposed methods by an analytical study Evaluation results show that the predeclaration technique we introduce reduces response time significantly and adapts to dynamic changes in workload.