New mixed broadcast scheduling approach using neural networks and graph coloring in wireless sensor network

Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.

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.

Efficient Broadcast Retransmission Based on Network Coding for InterPlaNetary Internet

In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).

Scheduling for Uncertain Data Broadcast in Mobile Networks

With the increasing popularity of wireless sensor network and GPS （ global positioning system）, uncertain data as a new type of data brings a new challenge for the traditional data processing methods. Data broadcast is an effective means for data dissemination in mobile networks. In this paper, the def＇mition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for uncertain data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted uncertain data effectively at the cost of a minor increase in data access time, in the case of no transmission error and presence of transmission errors. As a result, lower uncertainty of data benefits the qualifies of the query results based on the data.

A NEW METHOD FOR CONSTRUCTING MINIMAL BROADCAST NETWORKS

Ⅰ. INTRODUCTION Broadcast is the process of message dissemination in a communication network whereby a message, originated by a node (originator), is transmitted to all the other nodes of the network. This concept finds wide applications in the control of distributed systems. Broadcast considered in this note possesses the following constraints:

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.

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.

Quantum Secret Broadcast for Wireless Quantum Networks

In wireless quantum networks, nodes communicate by means of pre-distribution for entangled pairs and relay path establishment for quantum teleportation. However, simple point-to-point communication seriously restricts the efficiency of quantum communication. Inspired by sharing idea of quantum secret sharing (QSS), which is based on three collaborative nodes with pre-shared GHZ (Greenberger-Horne-Zeilinger) states, we propose a quantum secret broadcast scheme to improve network performance. In a cluster net-work cored on three parties of QSS, three cluster heads with pre-shared GHZ states are senders, while cluster members are receivers. One cluster head encodes secret messages on auxiliary particles by performing certain operations on them with GHZ particles, then three cluster heads measure their own par-ticles and broadcast measurement results honestly. Based on the specific correlation of measurement results and secret messages, all receivers can re-cover the secret messages. Furthermore, to prevent eavesdropping, cluster heads can update an encoding key periodically. Analysis shows the proposed scheme is more efficient than previous schemes in wireless quantum net-works, especially when the number of receivers is larger. Besides, in the proposed scheme, attacks on quantum channel based on GHZ state can be detected, and eavesdroppers cannot recover messages correctly for lack of suitable decoding key.

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.

Joint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding

We consider the energy minimization problem for a two-cell broadcasting system, where the focus is devising energy efficient joint power control and scheduling algorithms. To improve the retransmission efficiency, linear network coding is applied to broadcast packets. Combined with network coding, an optimal algorithm is proposed, which is based on dynamic programming. To reduce computational complexity, two sub-optimal algorithms are also proposed for large networks. Simulation results show that the proposed schemes can reduce energy consumption up to 57% compared with the traditional Automatic Repeat-reQuest (ARQ).

Scheduling for constantly-evolving data broadcasting in asymmetric communication networks

Recent advances in wireless sensor networks and GPS have made constantly-evolving data a new type of data which bring a new challenge to traditional data processing methods. Data broadcasting is an effective means for data dissemination in asymmetric communication networks, such as wireless networks. In this paper, definition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for constantly-evolving data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted constantly-evolving data effectively at the cost of minor increase in data access time, in the case of no transmission error, transmission errors present, and multiple broadcast channels. As a result it benefits the qualities of the query results based on the data.

Network coding-aware cache replacement policy in on-demand broadcast environments

Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previous studies showed that its efficiency is highly related to the content of clients' cache. However, existing data broadcast systems do not take network coding information into account when making cache replacement decisions. In this paper, we propose two networks coding-aware cache replacement policies called DLRU and DLRU-CP to supplement network coding assisted data broadcast in on-demand broadcast environments. In DLRU, both data access and decoding contribution are taken into account to make replacement decisions. DLRU-CP is based on DLRU but allows clients to retrieve decodable data items that have not been requested yet. The performance gain of our proposed cache replacement policies over traditional cache replacement policy is shown in the simulation results, which demonstrate conclusively that the proposed policies can effectively reduce the overall response time.

直播平台内观众与主播间法律关系的性质研究

直播打赏关系的性质界定对消费者权益保护与纠纷预防具有重大意义。直播打赏关系中虚拟货币的转移作为实质上的财产转移值得法律评价和规范,该关系完全符合合同成立的要件,应被认定为独立的合同关系。直播打赏基本运行模式为“非强制性付费”商业模式,基于对主播与观众之间真实意思表示的尊重,直播打赏合同不宜被认定为赠与合同,而应是网络服务合同。相较于平台和观众之间的网络服务合同,直播打赏网络服务合同在格式、主体、权利义务、履行等方面具有特殊性,可以考虑引入打赏冷静期作为配套措施,但在其具体规则的设计上应注重规制消费者的“恶意反悔”。同时,直播平台作为网络服务交易平台提供者,在不能提供主播的有效联系方式时,应当依据《消费者权益保护法》规定,承担对消费者的先行赔偿责任,以辅助相关纠纷的妥善化解。

校园网二层环路防治技术研究

作为校园网常见问题,二层环路故障不仅隐蔽性强,而且定位也较为困难。文章分析了二层环路网络故障所带来的危害,给出了具体检测方法和防范措施。研究对于优化校园网运维管理体系,进一步提高校园网的可靠性和稳定性具有一定实践意义。

基于深度学习的乘务英语自动播报检测系统设计

乘务英语能够引导国外游客做出正确的选择,因此,为了使乘务英语自动播报中的表达更为准确和清晰,提出了一种基于深度学习的乘务英语播报语法纠错检测系统。在系统中利用深度置信网络来构建乘务英语播报语法纠错模型,并在此模型基础上进行乘务英语自动播报语法检测和纠正系统。在模型和系统的测试中显示,基于深度置信网络的语法纠错模型帧损失率仅为0.11%,乘务英语播报检测系统也能够在运行中不断进行更新,确保语音数据的实效性。以上结果表明,深度置信网络能够对乘务英语进行语法纠错,并通过反馈提升乘务英语播报的准确性,对我国商用英语的应用和发展具有重要意义。

独家签约模式下主播“跳槽”纠纷的法律适用问题

随着网络直播行业的蓬勃发展,主播“跳槽”纠纷频频发生。实践中,独家签约主播“跳槽”纠纷争议焦点主要集中于竞业限制制度和违约金司法酌减规则的适用问题,相关裁判存在分歧,有损司法权威。根据网络主播法律身份,劳动关系下主播竞业限制具有合法性基础,应依据《劳动合同法》审查各项要件。具有演艺经纪关系主播可以与直播公司约定竞业限制,但应严格审查该条款的合法性与合理性。在审查认定竞业限制约定有效的基础上,进一步明确违约金司法酌减的举证责任分配与具体考量因素。

无线发射台站智慧运维支撑管理系统审计日志模块的设计与实现

阐述应用于广播电视无线发射台站智慧运维支撑管理系统审计日志模块的总体设计思路和实现要点。该模块通过对系统操作和事件进行全面收集、存储、分析和告警通知,旨在提高广播电视的安全播出和网络安全水平。

人工智能技术在广电网络安全中的应用

随着信息技术的飞速发展,人工智能技术以其卓越的数据处理能力和自动化决策水平,在众多领域发挥着不可或缺的作用。广电网络作为信息传播的重要载体,其安全性直接关系到国家文化安全、社会稳定和民众权益。基于此,探讨人工智能技术在广电网络安全中的应用,概述广电网络面临的安全挑战,详细介绍人工智能技术在广电网络安全领域的多个应用场景,提出相应的技术优化策略,并展望其在未来广电网络安全发展中的广阔前景,以期为相关工作者提供参考。

计算机网络安全技术在广电网络维护中的应用

在当今数字化时代,广电网络的重要性愈发凸显,随之而来的网络威胁也变得更加严峻。计算机网络安全技术是保障广电网络正常运行的关键因素,需要应对广电网络的复杂性和开放性所引发的安全挑战。对此,介绍计算机网络安全技术在广电网络维护中的应用,以保障广电信息传播的可靠性和安全性。