The Response Time Analysis of Digital Broadcasting System

Digital broadcasting system has become a high-light of research on computer application. To respond to the changes of the playbill in the broadcasting system in real time, the response time of the system must be studied. There is scarcely the research on this area currently. The influence factors in the response time are analyzed; the model on the response time of the system service is built; how the influence factors affect the response time of the system service is validated; and four improvement measures are proposed to minimize the response time of system service.

The Adaptive Long-Distance HF Broadcasting System Based on Backscatter Technique

We put forth a project, that is: using the backscatter technique to realize adaptive long-distance HF broadcasting system in order to improve the quality of HF broadcasting. Then, we analyze errors of the system due to the deviation of the ionospheric parameters' prediction. From the analysis, we draw the conclusion that our project is feasible. In addition, we point out that we can use frequency-spreading and information-coding technique to acquire more clear ionograms. We also offer a judgment on how to choose the control propagation mode on condition of multihop and the existence of more than one propagation mode on the signals' path.

Design and Implementation of the Dance Teaching Live Broadcasting System Based on the Distance Education Platform

With the rapid development of the modem information technologies,to promote the education informatization and share the educational and teaching resources,the live classroom in the distance education emerges as the times require.The live classroom expands the space-time boundaries in our education and teaching,and changes the traditional teaching methods.It is a new model of the distance education.In order to recognize and understand the impact of the live teaching on the dance teaching and promote the development of the live teaching in the dance education,this paper,from the perspective of the distance education,uses the theories and methods of the distance education to analyze the characteristics of the live teaching,which is a feasible way.

Performance Evaluation of Pipelining Broadcasting in Multicomputer System

ＰｅｒｆｏｒｍａｎｃｅＥｖａｌｕａｔｉｏｎｏｆＰｉｐｅｌｉｎｉｎｇＢｒｏａｄｃａｓｔｉｎｇｉｎＭｕｌｔｉｃｏｍｐｕｔｅｒＳｙｓｔｅｍＬＩＵＨｏｎｇｗｅｉＬＩＸｉａｏｍｉｎｇＣＵＩＧｕａｎｇｚｕｏ（刘宏伟）（李晓明）（崔光佐）（Ｄｅｐｔ．ｏｆＣｏｍｐ...

Machine-Learning Based Packet Switching Method for Providing Stable High-Quality Video Streaming in Multi-Stream Transmission

Broadcasting gateway equipment generally uses a method of simply switching to a spare input stream when a failure occurs in a main input stream.However,when the transmission environment is unstable,problems such as reduction in the lifespan of equipment due to frequent switching and interruption,delay,and stoppage of services may occur.Therefore,applying a machine learning(ML)method,which is possible to automatically judge and classify network-related service anomaly,and switch multi-input signals without dropping or changing signals by predicting or quickly determining the time of error occurrence for smooth stream switching when there are problems such as transmission errors,is required.In this paper,we propose an intelligent packet switching method based on the ML method of classification,which is one of the supervised learning methods,that presents the risk level of abnormal multi-stream occurring in broadcasting gateway equipment based on data.Furthermore,we subdivide the risk levels obtained from classification techniques into probabilities and then derive vectorized representative values for each attribute value of the collected input data and continuously update them.The obtained reference vector value is used for switching judgment through the cosine similarity value between input data obtained when a dangerous situation occurs.In the broadcasting gateway equipment to which the proposed method is applied,it is possible to perform more stable and smarter switching than before by solving problems of reliability and broadcasting accidents of the equipment and can maintain stable video streaming as well.

Cooperative Covert Communication in Multi-Antenna Broadcast Channels

With the gradual popularization of 5G communications,the application of multi-antenna broadcasting technology has become widespread.Therefore,this study aims to investigate the wireless covert communication in the two-user cooperative multi-antenna broadcast channel.We focus on the issue that the deteriorated reliability and undetectability are mainly affected by the transmission power.To tackle this issue,we design a scheme based on beamforming to increase the reliability and undetectability of wireless covert communication in the multi-antenna broadcast channel.We first modeled and analyzed the cooperative multi-antenna broadcasting system,and put forward the target question.Then we use the SCA(successive convex approximation)algorithm to transform the target problem into a series of convex subproblems.Then the convex problems are solved and the covert channel capacity is calculated.In order to verify the effectiveness of the scheme,we conducted simulation verification.The simulation results show that the proposed beamforming scheme can effectively improve the reliability and undetectability of covert communication in multi-antenna broadcast channels.

Equalization Reconstruction Algorithm Based on Reference Signal Frequency Domain Block Joint for DTMB-Based Passive Radar

Channel equalization plays a pivotal role within the reconstruction phase of passive radar reference signals.In the context of reconstructing digital terrestrial multimedia broadcasting(DTMB)signals for low-slow-small(LSS)target detection,a novel frequency domain block joint equalization algorithm is presented in this article.From the DTMB signal frame structure and channel multipath transmission characteristics,this article adopts a unconventional approach where the delay and frame structure of each DTMB signal frame are reconfigured to create a circular convolution block,facilitating concurrent fast Fourier transform(FFT)calculations.Following equalization,an inverse fast Fourier transform(IFFT)-based joint output and subsequent data reordering are executed to finalize the equalization process for the DTMB signal.Simulation and measured data confirm that this algorithm outperforms conventional techniques by reducing signal errors rate and enhancing real-time processing.In passive radar LSS detection,it effectively suppresses multipath and noise through frequency domain equalization,reducing false alarms and improving the capabilities of weak target detection.

Impact of small-world topologies on broadcasting for wireless sensor networks

Broadcasting is an important operation and been widely used in wireless sensor networks （WSNs）. These networks are power constrained as nodes operate with limited battery power. Wireless sensor networks are spatial graphs that have much more clustered and much high path-length characteristics. After considering energy- efficient broadcasting in such networks, by combining the small-world characteristic of WSNs and the properties of ant algorithm to quickly identify an optimal path, small-world power-aware broadcast algorithm is introduced and evaluated. Given different densities of network, simulation results show that our algorithm significantly improves life of networks and also reduces communication distances and power consumption.

Partially secret broadcasting,partially secret splitting with quantum entanglement

In this paper, we propose a classical secret broadcasting and splitting joint protocol in a quantum scenario. With those genuinely entangled states, the boss can always broadcast some of his secrets and split some others to multi- receivers at the same time. The efficiency of the joint protocol is also compared with that of two separate ones which realise classical secret broadcasting and classical secret splitting respectively, and based on the comparison we can see the promising advantage of our joint protocol is that it can realise the two tasks more efficiently and more conveniently.

Broadcasting with Controlled Redundancy and Improved Localization in Wireless Sensor Networks

Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There are many challenging tasks in the network, including redundancy control and sensor node localization that mainly depend on broadcasting. In this paper, we propose a broadcasting algorithm to control redundancy and improve localization （BACRIL） in WSNs. The proposed algorithm incorporates the benefits of the gossip protocol for optimizing message broadcasting within the network. Simulation results show a controlled level of redundancy, which is up to 57.6% if the number of sensor nodes deployed in a 500 m×500 m area are increased from 50 to 500.

High Robust Broadcasting over DTMB-A with Low-rate LDPC Codes

As the 2nd generation digital terrestrial television broadcasting(DTTB)standard,digital terrestrial/television multimedia broadcasting-advanced(DTMB-A)can provide higher spectrum efficiency and transmission reliability by adopting flexible frame structure and advanced forward error correction coding compared with the 1 st generation DTTB systems.In order to increase the flexibility and robustness of the DTTB network,the frequency reuse scheme of factor one(reuse-1)is proposed,where the same RF channel is used by different stations covering the adjacent service areas.However,it demands a very low carrier-tonoise ratio(C/N)threshold below 0 dB at the DTTB physical layer.In this paper,a robust broadcasting technique is proposed based on DTMB-A with newly designed low-rate low density parity check(LDPC)codes.By adopting quasi-cyclic(QC)Raptor-like structure and progressive lifting method,the high performance low-rate LDPC codes are designed supporting multiple code lengths.Both density-evolution analyses and laboratory measurements demonstrate that DTMB-A with low-rate coding can complete the demodulation reliably with the C/N threshold below0 d B,which is one important necessary condition to support frequency reuse-1 scheme.

Real-time Audio &Video Transmission System Based on Visible Light Communication

With the increasing popularity of solid sate lighting devices, Visible Light Communication (VLC) is globally recognized as an advanced and promising technology to realize short-range, high speed as well as large capacity wireless data transmission. In this paper, we propose a prototype of real-time audio and video broadcast system using inexpensive commercially available light emitting diode (LED) lamps. Experimental results show that real-time high quality audio and video with the maximum distance of 3 m can be achieved through proper layout of LED sources and improvement of concentration effects. Lighting model within room environment is designed and simulated which indicates close relationship between layout of light sources and distribution of illuminance.

Improved Delay Priority Resource Scheduling with Low Packet Loss Rate for MBMS in LTE Systems

An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE systems require lower delay and packet loss rate.However,it is difficult to meet the QoS requirements of real-time services using the current MBMS resource scheduling algorithm.The proposed algorithm in this paper jointly considers user delay information and real-time channel conditions.By introducing the user delay information,the lower delay and fairness of users are guaranteed.Meanwhile,by considering the channel conditions of users,the packet loss rate can be effectively reduced,improving the system throughput.Simulation results show that under the premise of ensuring the delay requirements of real-time services,the proposed algorithm achieves a lower packet loss rate compared to other existing algorithms.Furthermore,it can achieve a good balance between system throughput and user fairness.

A Preamble-Based Broadcasting Technique for Wireless Ad Hoc Sensor Networks

Broadcasting is a fundamental operation in any wireless networks, more so in wireless ad hoc sensor networks, where each sensor node has limited transmission range as well as battery power. Although broadcasting in wireless ad hoc sensor networks has many advantages but it can cause serious problems like-broadcast storm, which could cause a lot of contention, redundant retransmission, collision and most importantly, drain immense amount of energy from limited battery powered sensor nodes. In this work, our objective is to reduce the number of retransmission and energy consumption of sensor nodes by using the duty cycle property of wireless ad hoc sensor networks. We propose a preamble-based broadcasting technique for wireless ad hoc sensor networks. We show that in dense wireless ad hoc sensor networks a small size preamble can give maximum network-wide data dissemination rather than using the large preamble, which will only consume immense amount of energy during packet reception.

Environmental impact of electromagnetic radiation from the 10kWmedium wave transmitter of Weihai Broadcasting Station

Ｅｎｖｉｒｏｎｍｅｎｔａｌｉｍｐａｃｔｏｆｅｌｅｃｔｒｏｍａｇｎｅｔｉｃｒａｄｉａｔｉｏｎｆｒｏｍｔｈｅ１０ｋＷｍｅｄｉｕｍｗａｖｅｔｒａｎｓｍｉｔｔｅｒｏｆＷｅｉｈａｉＢｒｏａｄｃａｓｔｉｎｇＳｔａｔｉｏｎＷｅｎＣｏｎｇｊｉａｎｇ；ＬｕＤｅｍｉｎｇ...

Forwarding vs. Network Coding: Efficient Broadcasting in Multihop Wireless Networks

Broadcasting is used as a building block in many MANET (Mobile Ad hoc Network) routing protocols. In addition, broadcasting is a key primitive in ad hoc networks to support group-based applications. Efficiently supporting broadcasting in multihop wireless networks is therefore important. In this paper, we compare ef-ficient broadcasting protocols based on packet forwarding with those based on network coding. Using a number of network scenarios, we derive lower bounds for the required number of packet retransmissions at the MAC layer to support broadcast with and without applying network coding techniques. We compare these lower bounds with each other, as well as with protocols proposed for each approach. More specifically, we use SMF and PDP as sample forwarding-based broadcast protocols, and a simple XOR-based coding protocol over SMF and PDP as representative network coding solution. The results show that neither packet forwarding protocols nor network coding protocols achieve the theoretical lower bounds, in particular as the size of the network area (at constant density) increases. The comparison of the lower bounds also shows that network coding does have a potential performance advantage over packet forwarding solutions for broad-casting in multi-hop wireless networks, in particular for larger fixed density networks, justifying its inherent increased complexity.

Spectrum-Efficient and Fair Resource Scheduling for MBMS in LTE Systems

An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel conditions of all the users,the average packet loss rate,and the fairness of users in the MBMS group,the transmission data rate of the MBMS group is first selected according to the link adaptation and the average packet loss rate of users.Then,the resource blocks are allocated to MBMS groups according to the scheduling priority.Such a resource scheduling algorithm further balances the system throughput and user fairness.Theoretical analysis and simulation results show that the proposed algorithm can achieve a good tradeoff between system throughput and user fairness in comparison with traditional scheduling algorithms.

Live Video Services Using Fast Broadcasting Scheme

The Fast Broadcasting scheme is one of the simplest schemes that provide video services. In this scheme, the video is divided into equal-sized segments depending upon the bandwidth allocated by the video server. If the video length is not known, then this scheme cannot be applied as the number of video segments cannot be determined. In a live video wherein the video size is unknown, especially the ending time of the live broadcast, e.g., cricket match, this scheme cannot be applied. In this paper, we propose a model that helps the Fast Broadcasting scheme to support live video broadcasting. The basic architecture of the system consists of a live system with one video channel that broadcasts the live video and a video server that broadcasts the already broadcast live video to users.

Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks

Reducing number of forwarding nodes is the main focus of any broadcasting algorithm designed for ad-hoc wireless networks. All reliable broadcasting techniques can be broadly classified under proactive and reactive approaches. In proactive approach, a node selects a subset of its neighbors as forwarding node and announces the forwarding node list in the packet header during broadcast. On the other hand, no such forwarding list is generated in reactive approach. Rather, a node (cognitively) determines by itself whether to forward the packet or not based on neighbor information. Dominant pruning and Self-pruning are two example techniques that fall under proactive and reactive approach respectively. Between the two methods, dominant pruning shows better performance than self-pruning in reducing number of forwarding nodes as they work with extended neighbor knowledge. However, appended forwarding node list increases message overhead and consumes more bandwidth. As a result, the approach becomes non-scalable in large networks. In this paper, we propose a reactive broadcasting technique based on self-pruning. The proposed approach dubbed as “Improved Self-pruning based Broadcasting (ISB)” algorithm completes the broadcast with smaller packet header (i.e., with no overhead) but uses extended neighbor knowledge. Simulation results show that ISB outperforms dominant pruning and self-pruning. Furthermore, as the network gets more spread and denser, ISB works remarkably well.