Broadcast Approach Research Articles

A Reliable Smart Interaction With Physical Thing Attached With BLE Beacon

Bluetooth low-energy (BLE) beacon is a key enabler for smart interaction between the user device and the physical thing, in which the physical thing can actively engage users for interaction via its advertising packet. However, reliability is always an issue for the beacon-based interaction since the beacon employs an unreliable broadcasting approach which provides no way to check if the user device has received the correct packet. We define the sparse observation to describe the phenomenon where the number of packets received by the user device within an arbitrarily small time duration is less than the number of deployed beacons. This article studies the sparse observation causing by the following two factors: 1) the unpredictable environmental variations and 2) the uncontrollable operating conditions of a beacon. An analysis is provided to investigate the interaction reliability in connection with the above two factors. Motivated by the above challenges, a novel solution, which exploits the ambient RF fingerprinting to address the sparse-observation issues, is proposed to enhance the interaction reliability. Our proposed solution is validated with extensive experiments consisting of real data collected from both indoor and outdoor environments. Finally, the feasibility of our proposed solution is demonstrated with a proof-of-concept prototype implemented over multiple physical things.

Engaging university students in an ESL live broadcast

PurposeThis study aims to analyze the engagement of community members in an English as a second language (ESL) live broadcast. A platform for encouraging language and culture learning in ESL was planned and implemented. Research purposes were to explore the following aspects for engaging students’ participation: operation-monitoring, planning and implementation, incentives and motives, interactions with multiple formats and challenges.Design/methodology/approachThe platform used for the ESL live broadcast was Open Broadcaster Software Studio. Through the live videos and instant messages delivered by the network, real-time interactions from different virtual sites were achieved. Observations and operation documentation were recorded. Interviews with the teacher, the library administrator and the students were carried out for collecting data. Inductive analysis was used to analyze the qualitative data from the different sources.FindingsIt was observed that the ESL broadcast reached a great number of users weekly. To engage the ESL broadcast community, efforts to monitor and plan for implementation were made. Students were encouraged by both external incentives and internal motivation. Managing the connectivity problems was essential for guaranteeing the quality of the real-time interactions. From their experiences, the participants were positive about the broadcast approach to learning ESL. More diverse topics and alternatives for oral interactions in the class are suggested in future implementations.Research limitations/implicationsThe implementation of the ESL live broadcast provides a model for inviting members within the university community to engage in the language and culture learning. The research is preliminary and is limited to a specific university. Future research on diverse learning settings is needed.Originality/valueThe findings of this study will contribute to the research in streaming media interactions. The case might be applied to other settings and other subject domains.

A Coalitional Graph Game Approach for Minimum Transmission Broadcast in IoT Networks

In this work, we consider the broadcast mechanisms for both reliable links and unreliable links in the Internet of Things (IoT) networks. Focusing on the minimum transmission broadcast (MTB) problem, we propose an efficient algorithm, termed as the Connected Dominating Set Algorithm based on Coalitional Graph Game (CDSA-CGG), to find the minimum connected dominating set (MCDS). Distinct from related work in the literature which adopts a non-cooperative game approach and assumes the interaction among nodes is limited to neighboring nodes, we formulate the interaction and cooperation among nodes over reliable links and over unreliable links as a connected forwarding graph based on coalitional graph game. We prove that the forwarding graph constructed by CDSA-CGG is a Nash network. In addition, we also prove that the final resulting graph is pairwise stable. The simulation results show that the proposed coalition graph game-based algorithm performs well in terms of the number of transmissions, convergence rate, and lifetime of nodes.

Performance Analysis of On-Demand Scheduling with and without Network Coding in Wireless Broadcast

On-demand broadcast is a scalable approach to disseminating information to a large population of clients while satisfying dynamic needs of clients, such as in vehicular networks. However, in conventional broadcast approaches, only one data item can be retrieved by clients in one broadcast tick. To further improve the efficiency of wireless bandwidth, in this work, we conduct a comprehensive study on incorporating network coding with representative on-demand scheduling algorithms while preserving their original scheduling criteria. In particular, a graph model is derived to maximize the coding benefit based on the clients’ requested and cached data items. Furthermore, we propose a heuristic coding-based approach, which is applicable for all the on-demand scheduling algorithms with low computational complexity. In addition, based on various application requirements, we classify the existing on-demand scheduling algorithms into three groups—real-time, non-real-time and stretch optimal. In view of different application-specific objectives, we implement the coding versions of representative algorithms in each group. Extensive simulation results conclusively demonstrate the superiority of coding versions of algorithms against their non-coding versions on achieving their respective scheduling objectives.

Broadcast Approach to Multiple Access with Local CSIT

Broadcast Approach to Multiple Access with Local CSIT

Broadcast Approach to Multiple Access With Local CSIT

A two-user multiple access channel is considered, in which the channels undergo slow block fading and the state of each channel is known only to its corresponding transmitter. This paper proposes a novel broadcast strategy for multiple access communication in this channel. In the broadcast approach, in principle, a transmitter with CSI uncertainty sends multiple independent superimposed information layers where the rate of each layer is adapted to a specific channel realization. In the existing broadcast approaches to multiuser communication, the transmitters often directly adopt a single-user strategy and each transmitter adapts its transmission to one unknown channel. The novel aspect of the proposed strategy is that it adapts the designed codebooks to the state of the entire network. This is motivated by the fact that the contribution of each user to the network-wide measures (e.g., capacity region) depends not only on the user’s direct channel to the receiver, but also on the qualities of other channels. Average achievable rate region and outer bounds on the capacity region are characterized. Furthermore, the expected capacity region is investigated, where most part of the capacity region boundary is characterized. Finally, an asymptotic capacity region is also characterized.

Analysis of Transmission Rate of Wireless Networks Under the Broadcast Approach With Continuum of Transmission Layers

In this letter, we characterize the performance of broadcast approach with continuum of transmission layers in random wireless networks where the channel state information (CSI) is assumed to be known only at the receiver. By modeling the transmitter-receiver pairs using bipolar Poisson point process, we derive analytical expressions for the mean and variance of achievable transmission rate and the network transmission capacity under broadcast approach. Our analysis shows that the broadcast approach provides better mean transmission rate with lower variance compared to outage strategy.

2-IMMERSE: A Platform for Production, Delivery, and Orchestration of Distributed Media Applications

This paper describes an overview of the architecture of an evaluated multiscreen experience based on MotoGP sports content, which was developed using an object-based broadcasting approach. This architecture enables experiences to be implemented as distributed media applications consisting of components orchestrated by a cloud-hosted service platform. The MotoGP service prototype was evaluated by more than 90 MotoGP fans, and assessments of the features and the experience have been broadly positive.

Speed Adaptive Beacon Broadcast for Information Dissemination in Vehicular Ad hoc Networks

Vehicular Ad hoc Network has been a key component of the Intelligent Transport System. An efficient mechanism for dissemination of information in VANETs is a challenging task. The high mobility of vehicular nodes and varying traffic flows makes selection of best relay vehicle to disseminate information a taxing task. Periodic beaconing for gathering information about the vehicles in the vicinity is though commonly employed in VANETs, but it degrades the performance resulting in channel contention and collisions. This paper presents a Speed Adaptive Beacon Broadcast approach that controls the beaconing rate depending upon the speed at which the vehicle is moving in comparison to the other vehicles in its locality. The selection of the relay vehicle is done keeping in consideration its distance from the source, local density and priority is given to the vehicle at an intersection. The approach is evaluated for both highway and urban scenario and simulation outcome reveals that SABB performs well in comparison to some of the existing approaches.

Broadcast Approach for the Single-User Energy Harvesting Channel

This paper proposes a broadcast strategy for the single-user slowly fading channel in which the transmission power is supplied by an energy harvesting unit. In this strategy, the channel state information (CSI) is known only to the receiver, and the transmitter is assumed to be oblivious to the CSI. The broadcast approach enables preventing outage events in the face of the lack of CSI at the transmitter. In the proposed broadcast approach, the transmitter splits its message into multiple superimposed information layers. This facilitates sustaining reliably decodable transmission rates adapted to the unknown state of the randomly-varying fading state of the channel. The objective is to characterize the optimal allocation of the randomly varying harvested power over time and across information layers in the contexts of maximizing the average communication rate and minimizing the likelihood of outage. First, the setting in which the transmitter has non-causal and complete information about the state of the energy harvesting process is considered. A closed-form characterization of the optimal allocation of power across layers is established, and an algorithm that analytically determines the exact optimal allocation of power over time is provided. Furthermore, an online algorithm is proposed for a setting in which the energy harvesting process is known only causally to the transmitter.

Node Density Based Performance comparison of Neighbor Knowledge and Probability Based Broadcast Approaches with Conventional routing protocols in MANET's

Node Density Based Performance comparison of Neighbor Knowledge and Probability Based Broadcast Approaches with Conventional routing protocols in MANET's

Towards efficient and scalable implementation for coding-based on-demand data broadcast

Network coding has been demonstrated as a promising solution to further enhancing the bandwidth efficiency for on-demand broadcast. In this work, first, we show the performance improvement of a straightforward implementation of coding based on-demand data broadcast algorithms over the traditional on-demand broadcast approaches. Second, as the straightforward implementation of the optimal approach has overwhelming computational overhead, we propose an efficient generalized implementation scheme, which can be applied to all the existing on-demand scheduling algorithms. The proposed scheme reduces the computational overhead while achieves the same performance as the straightforward implementation. Third, to further enhance system scalability, we propose an approximate implementation method with even lower computational overhead while maintaining near optimal performance. Finally, we conduct an extensive simulation study and the results demonstrate that the proposed efficient implementation schemes can improve the system performance over 40% compared with the traditional broadcast approach, and the computational overhead can be reduced by 75% compared with the straightforward implementation. In addition, we show that the proposed approximate implementation can further reduce the computational overhead significantly and it is able to strike a balance between the service performance and system scalability.

Broadcast Based Code Dissemination Scheme for Duty Cycle Based Wireless Sensor Networks

The technology of software-defined devices has great prospect in updating the programs of the sensing devices to enable the devices to adapt to the new environments and applications. However, to effectively spread the code to each node in the software-defined-based wireless sensor networks (WSNs) is still a challenging task. In this paper, a proportion to duty cycle length-based broadcast (PDLB) scheme is proposed to disseminate code in duty cycle-based WSNs in a fast and energy-efficient style. In PDLB scheme, the sink first initiates a code broadcast. Then, the nodes that have received code start counting and calculate the priority of broadcasting based on an improved counter-based priority broadcasting approach proposed in this paper. Next, the nodes with the highest priority select k slots to broadcast according to the length of duty cycle so that the code can be spread from the sink to the network periphery. Finally, the nodes that have not obtained the code wait for a period of timeout to broadcast to actively send code request; after receiving code request, the node that obtained the code initiates a code broadcast to cause the code requester to obtain the code. The PDLB scheme has been validated by comprehensive experiments that show the following regularities. The smaller the count threshold value C h , the larger the number of slots selected for broadcasting that can guarantee a certain coverage ratio, while the code dissemination speed slows down at the same time. The longer the duty cycle is, the more the broadcast time is required, and the larger the transmission delay is. For each slot added in a working cycle, the number of broadcasts is increased by 1.54%-33.33% and the transmission delay is augmented by 2.27%-70.04%. The higher the node density is, the shorter the code spread speed is. As the network density increases, the transmission delay is reduced by 0.83%-65.87%. When the number of broadcasting slots is half of the total number of slots in a work cycle, the energy consumption reaches the lowest value.

Optimal Control of Wireless Computing Networks

Augmented information (AgI) services allow users to consume information that results from the execution of a chain of service functions that process source information to create real-time augmented value. Applications include real-time analysis of remote sensing data, real-time computer vision, personalized video streaming, and augmented reality, among others. We consider the problem of optimal distribution of AgI services over a wireless computing network, in which nodes are equipped with both communication and computing resources. We characterize the wireless computing network capacity region and design a joint flow scheduling and resource allocation algorithm that stabilizes the underlying queuing system while achieving a network cost arbitrarily close to the minimum, with a tradeoff in network delay. Our solution captures the unique chaining and flow scaling aspects of AgI services while exploiting the use of the broadcast approach coding scheme over the wireless channel.

Proper multi‐layer coding in fading dirty‐paper channel

This study investigates multi-layer coding over a dirty-paper channel. First, it is demonstrated that superposition coding in such channel still achieves the capacity of interference-free additive white Gaussian noise channel when the transmitter is non-causally aware of interference signal. Then, the problem is extended to the dirty-paper block fading channel, where it is shown that in the lack of channel information at the transmitter, the so-called broadcast approach maximises the average achievable rate of such channel.

Efficient Real-Time Coding-Assisted Heterogeneous Data Access in Vehicular Networks

Through the embedded processors and communication technologies, vehicles are increasingly being connected with the Internet of Things. Recently, much attentions have been paid to network-coding-assisted data broadcast in vehicular networks. However, majority of the works consider all the accessed data items are the same size. In this paper, we have studied the network coding-assisted heterogeneous on-demand real-time data access in vehicular networks. First, we have investigated the less efficiency of conventional coding assisted approach in accessing heterogeneous data items in real-time vehicular environment. Due to ignoring the impact of heterogeneous data items in decoding, the conventional coding does not achieve expected performance in accessing data items with diverse size. Second, based on our observations, for efficiently serving heterogeneous data items, we have proposed a dynamic threshold-based coding-assisted real-time data broadcast approach called earliest deadline first <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Θ</sub> . Third, we have derived the probabilistic analysis of the system performance of the proposed approach and the state-of-the-art approaches. Fourth, based on our further investigations, we have proposed another approach, called inverse of slack time multiply distance with THRESHOLD (Θ) (ISXD <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Θ</sub> ). The proposed network coding-assisted ISXD <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Θ</sub> exploits the different modulation and coding scheme of IEEE 802.11p physical layer for leveraging the variable serving rate considering the dynamic positions of vehicles along with the vehicle mobility. The comprehensive simulation results demonstrate the efficacy of the proposed approaches over the state-of-the-art approaches in terms of improving the on-demand requests serving capability and reducing the system response time.

Multiaccess Communication via a Broadcast Approach Adapted to the Multiuser Channel

A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into multiple independent information streams, each adapted to a specific actual channel realization. The major distinction between the proposed strategy and the existing ones is that in the existing approaches, each transmitter adapts its transmission strategy only to the fading process of its direct channel to the receiver, hence, directly adopting a single-user strategy previously designed for the single-user channels. However, the contribution of each user to a network-wide measure (e.g., sum-rate capacity) depends not only on the user’s direct channel to the receiver, but also on the qualities of other channels. Driven by this premise, this paper proposes an alternative broadcast strategy in which the transmitters adapt their transmissions to the combined states resulting from all users’ channels. This leads to generating a larger number of information streams by each transmitter and adopting a different decoding strategy by the receiver. An achievable rate region and an outer bound that capture the tradeoff among the rates of different information layers are established, and it is shown that the achievable rate region subsumes the existing known capacity regions obtained based on adapting the broadcast approach to the single-user channels.

Video On-Demand Service via Wireless Broadcasting

Video on-demand (VoD) service is very popular over the mobile Internet. With the demand and quality of video contents become increasingly high, the capacity demand on mobile networks is explosively increasing. In order to sustainably accommodate the future traffic growth, operators such as Verizon start to offload video traffic with broadcasting. However, how to improve VoD users’ quality of experience (QoE) under wireless broadcasting is still an open issue, where the major challenge is the time-varying wireless channel capacity. In this paper, we design a wireless VoD scheme with a periodic broadcasting approach. The basic idea is to fragment a video into segments, which are then delivered over different broadcasting channels periodically. We integrate network coding into our scheme so that packet redundancy can counteract the wireless unreliability. Moreover, we reveal the fundamental limits our proposed scheme can achieve in terms of two key QoE metrics: access delay and probability of continuous playout. We then show the intrinsic connections between the two QoE metrics and the choice of design parameters. The tradeoff between QoE improvement and bandwidth overhead is also presented. We implement the scheme in a testbed and demonstrate comprehensive experiment results.

Performance evaluation of single layer HDR video transmission pipelines

Thanks to the recent developments in both High Dynamic Range (HDR) content creation and HDR consumer displays, HDR technology is now mature enough for consumer TV broadcasting. Considering that HDR displays have been introduced to the consumer market just recently, backward compatible broadcasting approaches that can also address the Standard Dynamic Range (SDR) displays are preferred during this transition period. While several backward compatible single layer approaches have been proposed for HDR content delivery, there is no comprehensive study on the subjective quality of the delivered content on both SDR and HDR displays. In this work, we investigate the performance of two single layer HDR delivery pipelines, namely HDR10 and SDR10 through three sets of subjective test experiments. The effect of different video preprocessing and post-processing methods used in the HDR10 and SDR10 pipelines on the visual quality of the HDR and SDR outputs is investigated in these comprehensive tests. The analysis of the results shows that the HDR10 pipeline can achieve superior HDR quality compared to that of the SDR10 while the SDR subjective quality of the HDR10 pipeline is comparable to that of the SDR10 pipeline. Therefore, it is concluded that HDR10 can be used as a backward compatible single layer pipeline addressing both HDR and SDR displays. It is also shown in this work that by addressing the display in 4:4:4 mode, the SDR subjective quality of the HDR10 pipeline is further improved compared to the 4:2:0 mode. The findings of this work can be used as guidelines for addressing both HDR and SDR displays with HDR10 pipeline.

Y-Hamiltonian Layers Broadcast Algorithm

Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most important process in communication and parallel computer is broadcast approach.. The approach of this case of Broadcasting is to send the message from one source to all destinations in the network which corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in modern parallel computers which is characterized with low communication latency. We show how to apply this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our simulation results show the average of our proposed algorithm over the other algorithms that presented.