Abstract: The advancing digitalization and media convergence demands TV broadcasting companies to adjust their content to various platforms and distribution channels. The internet, as convergent carrier medium, is increasingly taking on a central role for additional media. Classical linear TV is still important, but for some audiences it has been developing from a primary medium to a secondary medium. Owing to the growing melding of classical-linear TV contents with online offerings (e.g. video-on-demand platforms or Web–TV), a great dynamic can be seen which has triggered numerous discussions about the future of TV for some time now. This article will summarize the results of two different audience studies. Film and television shows are meanwhile distributed online via Video-on-Demand platforms such as Netflix or Amazon Prime Video. The first audience study has dealt with the use of VoD-platforms in Germany investigating user rituals, user motivation to watch films and TV shows on these platforms, and the meaning of VoD in everyday life. Most of the participants in this study reported that they mainly watch TV drama series at Netflix or Amazon Prime. Therefore, the second audience study focused the online use of television drama series of individuals and couples elaborating the phenomenon of binge watching. In relating the audience practice to the new structures of the television market the article will shed light on the future of television.

Abstract: In vehicular ad-hoc network (VANET), the reliability of communication is associated with driving safety. However, research shows that the safety-message transmission in VANET may be congested under some urgent communication cases. More spectrum resource is an effective way to solve transmission congestion. Hence, we introduce cognitive radio (CR) enabled VANET (CR-VANET), where CR device can detect possible idle spectrum for VANET communications and assist to timely broadcast safety-message. Given high-speed mobility of vehicles and dynamically-changing availability of channels, a novel prediction algorithm is proposed to pick out the channel with the greatest probability of availability, which can meet the quality of service (QoS) requirement of urgent communications and effectively avoid conflict with licensed users. Specifically, the spatiotemporal correlations among historical spectrum sensing data are exploited to form prior knowledge of channel availability probability, and Bayesian inference is used to derive posterior probability of channel availability. Comparing with other spectrum detection methods, the proposed algorithm has more than 8 percent detection performance improvement at false alarm probability 0.2, and thus can avoid access conflict with licensed users dramatically. Furthermore, the proposed algorithm always has larger packet reception probability (PRP) and lower transmission delay compared with conventional VANET broadcasting. Hence, the proposed algorithm can improve reliability of safety-message transmission and enhance driving safety significantly.

Abstract: In some implementations, a system may include an interactive video broadcasting service, implemented on a server, configured to enable a plurality of source devices to broadcast live feed video streams, over a network, to a plurality of viewing devices. The interactive video broadcasting service includes a multi-perspective video sharing engine configured to determine that at least two of the live feed video streams relate to a same event. The multi-perspective video sharing engine provides a multi-perspective display, over the network, to at least one of the plurality of viewing devices in which the multi-perspective display concurrently streams the live feed video streams determined as related to the same event.

Abstract: We study a content delivery problem in a $K$ -user erasure broadcast channel such that a content providing server wishes to deliver requested files to users, each equipped with a cache of a finite size. Assuming that the transmitter has state feedback and user caches can be filled during off-peak hours reliably by the decentralized content placement, we characterize the achievable rate region as a function of the memory sizes and the erasure probabilities for some special cases. The proposed delivery scheme, based on the broadcasting scheme by Wang and Gatzianas et al., exploits the receiver side information established during the placement phase. Our results can be extended to the centralized content placement as well as multi-antenna broadcast channels with state feedback.

Abstract: The privacy issue of location-based service (LBS) applications represents a fundamental and critical research topic that shows distinguished challenges. Specifically, in the scenario of vehicular networks, due to connectivity transitory and throughput degradation caused by high vehicle mobility, traditional methods such as k-anonymity are not sufficient. In an effort to address this issue, we propose a framework that enhances the privacy of LBS by actively caching in the wireless vehicular network scenario. The scheme is designed under the dedicated short-range communication (DSRC) standard, with three original contributions. First, a point-of-interest (POI) query probability model for in-vehicle users is defined, considering the spatial relationship between the current location and the queried location. Second, three broadcasting content selection algorithms of the roadside unit (RSU) are proposed, including two adaptive updating methods and one knowledge-based precaching (KBPC) method. Third, we identify critical parameters that affect privacy, including RSU distance, vehicle speed, query set size of POI, size of each POI entry, and the proportion of channel capacity used for RSU broadcast (defined as channel occupancy). Finally, the proposed scheme is evaluated by extensive simulations, and the results are discussed in detail.

Abstract: A vast theoretical literature explores inefficient market structures in free-entry equilibria, and previous empirical work demonstrated that excessive entry may obtain in local radio markets. We extend that literature by relaxing the assumption that stations are symmetric, allowing for endogenous horizontal and (unobserved) vertical station differentiation. We find that, in most broadcasting formats, a social planner who takes into account the welfare of market participants eliminates 50%–60% of the observed stations. In 80%–94.9% of markets where high-quality stations are observed, welfare could be unambiguously improved by converting one such station into low-quality broadcasting, suggesting local overprovision of quality.

Abstract: Vehicular Ad hoc Networks (VANETs) have the potential to improve road safety and travel convenience, by providing self-organizing decentralized environments to disseminate traffic data, without requiring fixed infrastructure. The public interest of traffic data makes it appropriate for VANET data dissemination methods to rely on broadcasting. However, scalability issues arise when broadcasting under high density scenarios, where the high percentage of data redundancy and packet collisions may easily lead to the broadcast storm problem. Existing solutions either do not scale well under high density scenarios, or require extra overhead to estimate traffic density, so as to manage data dissemination accordingly. In this paper, we provide a novel approach for data dissemination in multi-hop VAENT that relies on traffic regime estimation to provide scalable broadcast, without extra communication overhead. Simulation results show the efficiency of our broadcasting approach in achieving low broadcasting overhead while maintaining the high data delivery ratio.

Abstract: The downlink of a massive MIMO system is considered for the case in which the base station must concurrently serve two categories of terminals: one group to which imperfect instantaneous channel state information (CSI) is available, and one group to which no CSI is available. Motivating applications include broadcasting of public channels and control information in wireless networks. A new technique is developed and analyzed: joint beamforming and broadcasting (JBB), by which the base station beamforms to the group of terminals to which CSI is available, and broadcasts to the other group of terminals, to which no CSI is available. The broadcast information does not interfere with the beamforming as it is placed in the nullspace of the channel matrix collectively seen by the terminals targeted by the beamforming. JBB is compared to orthogonal access (OA), by which the base station partitions the time-frequency resources into two disjunct parts, one for each group of terminals. It is shown that JBB can substantially outperform OA in terms of required total radiated power for given rate targets.

Abstract: Many users in online social networks are constantly trying to gain attention from their followers by broadcasting posts to them. These broadcasters are likely to gain greater attention if their posts can remain visible for a longer period of time among their followers' most recent feeds. Then when to post? In this paper, we study the problem of smart broadcasting using the framework of temporal point processes, where we model users feeds and posts as discrete events occurring in continuous time. Based on such continuous-time model, then choosing a broadcasting strategy for a user becomes a problem of designing the conditional intensity of her posting events. We derive a novel formula which links this conditional intensity with the visibility of the user in her followers' feeds. Furthermore, by exploiting this formula, we develop an efficient convex optimization framework for the when-to-post problem. Our method can find broadcasting strategies that reach a desired visibility level with provable guarantees. We experimented with data gathered from Twitter, and show that our framework can consistently make broadcasters' post more visible than alternatives.

Abstract: The invention relates to a video live broadcasting method and device. The video live broadcasting method comprises the steps of acquiring target background image data in the video live broadcasting process; generating target live broadcast video data according to the target background image data and original live broadcast video data; and sending the target live broadcast video data to a server. The technical scheme can automatically generate the target live broadcast video data capable of enabling the audience to know current live broadcast conditions host and current live broadcast data of a host visually and intuitively according to the target background image data on the basis of not requiring the host to manually switch a background image in an original video live broadcast interface, thereby enriching a room of the host, enabling the audience to know the current live broadcast conditions of the host in the first time through the target live broadcast video data, such as the currently located geographic position, the weather condition and the mood, thus being conducive to promoting live broadcast interaction, and improving the live broadcast experience of the audience.

Abstract: We consider the concept of faster-than-Nyquist rate (FTN) broadcasting, which nonorthogonally multiplexes more than one user message in the continuous-time domain for transmission over broadcast channels. Two FTN broadcasting approaches, namely, sub-FTN and full-FTN, are considered for broadcasting of $K$ independent messages over $K$ -user continuous time Gaussian broadcast channel. The derived achievable rate regions of the two approaches are shown to be, in general, greater than the capacity region of the optimally coded Nyquist-rate broadcasting using a same modulating pulse. The full-FTN broadcasting provides larger degrees of freedom (capacity pre-log factor) to each user of the broadcast channel while the sub-FTN improves signal-to-interference-plus-noise-ratios of the individual link. The amount of capacity gains in high SNR regime is linearly proportional to excess bandwidth in the modulating pulse used and dependent on FTN signaling rates, channel SNRs, and number of users in the broadcast channel. The simulated sub-FTN and full-FTN broadcast transceivers outperform coded Nyquist-rate systems both in BER performances and in capacity.

Abstract: Each device in being mobile ad hoc network (MANET) is overcome to navigate independently in any direction of side. The key challenge in building a MANET is availing every device to frequently maintain the information using static and dynamic topology. When the mobility is high scalable broadcast algorithm (SBA) is used and when the mobility is low memory aided broadcast algorithm (MaBA) is used for broadcasting packets. The MaBA is the algorithm where hubs on their memory to choose whether to forward stream or backward stream. The fuzzy enabled environs aware broadcast algorithm; a host maintains the local mobility around itself and defined user to choose which of two broadcast mechanisms to use. The Fuzzy logic is a Boolean conventional logic which has been increased to handle the concept of partial values between "completely true" and "completely false". As its name convinced different logic underlying the modes of reasoning which are approximate rather than exact. The significance of fuzzy logic from the host derives. The fuzzy logic is going to work with the two algorithms SBA and MaBA and it divides the network into static, semi-static and dynamic.

Abstract: The rapid growth of the next-generation communication and networks is bringing video services into more pervasive environments. More and more users access and interact with video content using different devices, such as smart televisions, personal computers, tablets, smartphones, and wearable equipments. Providing heterogeneous Quality of Experience (QoE) that supports a wide variety of multimedia devices is critical to video broadcasting over the next-generation wireless network. This paper reviews practical video broadcasting technologies and examines current requirements ranging from heterogeneous devices to transmission technologies. Meanwhile, various coding methodologies, including QoE modeling, scalable compression efficiency, and flexible transmission, are also discussed. Moreover, this paper presents a typical paradigm as an example for video broadcasting with large-scale heterogeneity support, which enables QoE mapping, joint coding, flexible forward error coding, and cross-layer transmission, as well as optimal and dynamic adaptation to improve the overall receiving quality of heterogeneous devices. Finally, a brief summary of the key ideas and a discussion of interesting open areas are summarized at the end of this paper along with a future recommendation.

Abstract: Researching African media audiences and users is urgent more than ever because of the rapidly changing media landscape on the continent in the last few decades. In recent years, media content on the continent has become more diversified as a result of the liberalization of broadcasting, the emergence of private radio and television stations and the growing availability of foreign channels via satellite television. Most African countries have also experienced a rather spectacular growth in access and availability of both mass media devices and digital technologies. In the late 1990s, access to television sets and radio receivers was limited, with 22 percent of Africans having access to a radio in 1997, and only 6 percent reporting to own a television set.1 Although no recent comprehensive statistics are available for the continent, country surveys suggest sharp increases in access to mass media devices in recent years. For example, in 2013, 76 percent of Ghanaians reported to have access to a television while 84 percent had access to a radio.2 Access is likely to be significantly lower in rural as compared to urban areas, and newspapers continue to have fairly modest circulation rates and are often only affordable to a minority of urban readers.

Abstract: In this paper, we consider the wireless broadcasting scenario with a source node sending some common information to a group of closely located users, where each link is subject to certain packet erasures. To ensure reliable information reception by all users, the conventional approach generally requires repeated transmission by the source until all the users are able to decode the information, which is inefficient in many practical scenarios. In this paper, by exploiting the close proximity among the users, we propose a novel two-phase wireless broadcasting protocol with user cooperations based on an efficient batched network code, known as batched sparse (BATS) code. In the first phase, the information packets are encoded into batches with BATS encoder and sequentially broadcasted by the source node until certain terminating criterion is met. In the second phase, the users cooperate with each other by exchanging the network-coded information via peer-to-peer (P2P) communications based on their respective received packets. A fully distributed and light-weight scheduling algorithm is proposed to improve the efficiency of the P2P communication in the second phase. The performance of the proposed two-phase protocol is analyzed and the channel rank distribution at the instance of decoding is derived, based on which the optimal BATS code is designed. Simulation results show that the proposed protocol outperforms most existing cooperative packet exchange schemes, especially when the inter-user links are not reliable. Lastly, the performance of the proposed scheme is further verified via testbed experiments.

Abstract: In recent years, the public safety community has been aligning behind Long Term Evolution (LTE) technology as the basis for next generation public safety networks. Correspondingly, the 3rd Generation Partnership Project (3GPP) standards body has started multiple technical work initiatives on LTE enhancements to better support public safety use cases and requirements. Of particular importance to the public safety community is the addition of direct device-to-device (D2D) broadcast capability that can enable off-network push-to-talk (PTT) group communications in a manner equivalent to existing public safety communication systems. In this paper, we briefly explore the design objectives for, and challenges associated with, providing a D2D broadcast service. We then present and analyze a new distributed media access control (MAC) scheme for interference-aware coordination of both unicast and broadcast transmission. System-level simulation results are provided to validate the performance and the effectiveness of our approach, using a CSMA-based approach as a basis for comparison.

Abstract: In Cognitive Radio (CR) networks unlicensed secondary users aim at transmitting in licensed bands while preserving primaries from harmful interference. CR communications have been especially studied in the white spaces of TV band (TVWS), defined as the TV free channels left unused in each territorial area by the reallocation of TV services as a direct consequence of the switchover plans. The first full CR standard, the IEEE 802.22 Wireless Regional Area Network (WRAN), has been developed to bring wireless broadband access to remote, rural areas where other wireless networks are not present due to low revenue impact or critical network deployment. IEEE 802.22 WRAN devices are designed to operate in the range of frequencies between 54MHz and 862MHz alongside digital terrestrial television (DTT) operation. In this work we perform a complete analysis to evaluate the performance of IEEE 802.22 WRAN devices coexisting with DVB-T2 adjacent channel transmission in the TV bands in a rural environment. The link budget analysis for IEEE 802.22 WRAN in different coexistence scenarios, such as fixed DTT reception with indoor/outdoor IEEE 802.22 WRAN reception shows that its robustness is comparable to long term evolution (LTE) which represents the state-of-the art of cellular networks in rural scenario.

Abstract: In vehicular networks, since many applications use multi-hop broadcast to exchange traffic and road information, broadcasting has become a critical component. In this paper using fuzzy logic techniques, we propose a receiver-based intelligent broadcast protocol. Relying on coverage, connectivity, and mobility factors calculated by a receiver node, the fuzzy logic system decides if the node is required to rebroadcast or not. Ns-3 simulations have been developed to investigate the effectiveness of our proposed system in terms of reachability, the average number of rebroadcasts per covered node, and bytes sent per covered node. The proposed protocol is shown to perform better than DTM, DADCQ, and SLAB protocols.

Abstract: live television time space and the broadcast event is available in our book collection an online access to it is set as public so you can get it instantly. Our books collection spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the live television time space and the broadcast event is universally compatible with any devices to read.

Abstract: Today, it is tempting to see the rise of HD television as ushering in a new era of spectacular television. Yet since its earliest days, the medium has been epitomised by spectacle and offered its viewers diverse forms of visual pleasure. Looking at the early promotion of television and the launch of colour broadcasting, Spectacular Television traces a history of television as spectacular attraction, from its launch to the contemporary age of surround sound, digital effects and HD screens. In focusing on the spectacle of nature, landscape, and even our own bodies on television via explorations of popular television dramas, documentary series and factual entertainment, and ambitious natural history television, Helen Wheatley answers the questions: what is televisual pleasure, and how has television defined its own brand of spectacular aesthetics?

Abstract: When Netflix launched in April 1998, Internet video was in its infancy. Eighteen years later, Netflix has developed into the first truly global Internet TV network. Many books have been written about the five broadcast networks – NBC, CBS, ABC, Fox, and the CW – and many about the major cable networks – HBO, CNN, MTV, Nickelodeon, just to name a few – and this is the fitting time to undertake a detailed analysis of how Netflix, as the preeminent Internet TV networks, has come to be. This book, then, combines historical, industrial, and textual analysis to investigate, contextualize, and historicize Netflix's development as an Internet TV network. The book is split into four chapters. The first explores the ways in which Netflix's development during its early years a DVD-by-mail company – 1998-2007, a period I am calling "Netflix as Rental Company" – lay the foundations for the company's future iterations and successes. During this period, Netflix adapted DVD distribution to the Internet, revolutionizing the way viewers receive, watch, and choose content, and built a brand reputation on consumer-centric innovation. This reputation served it well during its second phase, "Netflix as Syndicator" (2007-12), when the company turned from DVD rentals to online distribution. In chapter two, I explain who Netflix adapted syndication – a business model that has been a staple of US broadcasting for half a century – to Internet distribution. By doing so, Netflix up-ended both the TV industry's traditional content release structures and viewers' habits. By shifting TV distribution to the Internet, Netflix drastically increased the control viewers have over where, when, and on what devices viewers watch TV. In its third phase, Netflix entered the original programming business by subtly adapting traditional program genres, content, and release schedules to Internet video. I split this phase – "Netflix as Internet Network" (2012-present) – into two chapters. While many of Netflix's concerns parallel those of traditional networks – in terms of production and financing, for example – Internet networks also have a number of unique concerns in areas such as Net Neutrality and distribution windows. Netflix has led the charge on these issues, and chapter three explores Netflix's role as the first Internet network, including the development of its bingeviewing strategy and its push into international distribution. Finally, chapter four takes a deep dive in Netflix's foray into original program production. In its third phase, Netflix has adapted traditional TV structures to Internet distribution. Despite the innovations in short-form and user-generated content that sites like YouTube, Crackle, and Twitch have named, Netflix's traditional approach to programming has set the template for successful Internet networks that has been adopted by the likes of Hulu, Amazon, and Yahoo Screen. Chapter four analyses Netflix's biggest programs including House of Cards, Orange is the New Black, Daredevil and others to explain how Netflix has adapted traditional TV genres and structures to the freedoms in production, marketing, and content possibilities that the Internet affords. In the same was that NBC set the example for broadcast networks in the 1950s and HBO developed the framework for cable TV in the 1990s, Netflix has set the template for Internet TV in the 2000s. Netflix's mix of technological advancements, consumer-centric practices, personalized content, and global mindset have become the gold standard for the how-and-why of developing a successful Internet TV network. Although other aspiring Internet networks Hulu and Amazon started out with a different ethos than Netflix, Netflix's financial, creative, and cultural success has forced a series of reactionary decisions from both Hulu and Amazon that have brought them closer and closer to the foundations Netflix began laying out in 1998. So while the Netflix model isn't the only possible model for an Internet network, it has become the blueprint for the newly-developing Internet TV ecosystem. NETFLIX AND THE DEVELOPMENT OF THE INTERNET TELEVISION NETWORK

Abstract: Satellite systems have attracted much attention from academic and industrial communities in the past 20 years. There are many satellites that have been launched for all kinds of applications. Broadcast is a fundamental operation in satellite networks. It is frequently used for satellites self-organization, coordination and collaboration. The problem of our concern is, given an Low earth orbit (LEO) satellite network and a delay-bound, to find a broadcast schedule that delivers a message to all satellites within the delay-bound and the total number of transmissions is minimized. In this paper, we propose a broadcast routing and transmission scheduling algorithm for satellite networks. We first develop a space-time graph that models the dynamic connectivity of the satellite network as time progresses forward. The broadcast message is carried from one position to the other where it is forwarded to other recipients. A greedy algorithm with back-track search is designed to find the best transmitting nodes and the best transmission time in order to achieve the minimal number of transmissions subject to the constraint of delay-bound. Simulations have been conducted in the real LEO satellite constellations. Simulation results show good performance of our proposed scheme.

Abstract: Many users in online social networks are constantly trying to gain attention from their followers by broadcasting posts to them. These broadcasters are likely to gain greater attention if their posts can remain visible for a longer period of time among their followers' most recent feeds. Then when to post? In this paper, we study the problem of smart broadcasting using the framework of temporal point processes, where we model users feeds and posts as discrete events occurring in continuous time. Based on such continuous-time model, then choosing a broadcasting strategy for a user becomes a problem of designing the conditional intensity of her posting events. We derive a novel formula which links this conditional intensity with the visibility of the user in her followers' feeds. Furthermore, by exploiting this formula, we develop an efficient convex optimization framework for the when-to-post problem. Our method can find broadcasting strategies that reach a desired visibility level with provable guarantees. We experimented with data gathered from Twitter, and show that our framework can consistently make broadcasters' post more visible than alternatives.

Abstract: We propose a multi-hop reliable broadcasting (M-HRB) scheme suitable for a wide range of vehicular ad-hoc network (VANET) applications in urban setting. Multi-hop reliability is performed using local state information. Basically, a street is divided into multiple cells to form grid-like zones. We apply a proactive local state processing scheme exploiting features of periodic beacons to estimate wireless link quality of the neighbours. With availability of local state information, adequate numbers of forwarders are selected to achieve desired reliability in each hop for a multi-hop broadcast. Furthermore, M-HRB saves bandwidth consumption by enabling cooperation among forwarders. Simulation results show the superior performance of M-HRB in city environment in terms of reliability and bandwidth consumption. M-HRB also satisfies transmission latency requirements for time-sensitive vehicular applications.

Abstract: MANETs are collection of independent nodes, which communicate with each other to perform a task. Broadcasting methods are widely used in this infrastructureless networks. Although broadcasting is easy to implement and a method to perform routing and safety functions, in a wide and high mobility MANET it is a difficult and expensive task to achieve. It is required that the underlying algorithm used for communication must consider parameters such as neighborhood density, the size and shape of the network, and the efficient use of channel. Probabilistic strategies are frequently used, as they do not introduce additional latency. Several researchers have proposed using various parameter instances which are managed dynamically, for instance, the change in the number of neighbor nodes and corresponding change in retransmission probability. But the authors did not optimize the parameters for specific environments. The proposed work in this research article suggests and determines the most efficient strategy for each node to decide the retransmission probability according to its neighborhood density, available bandwidth and remaining energy of a node. It describes a tool combining a network simulator (ns-2) and a particle swarm optimization algorithm. Then, it is applied to the MANET broadcasting problem. The simulation results show that the proposed particle swarm optimization probabilistic broadcasting (PSOPB) scheme is reliable and efficient in comparison with the other artificial intelligence broadcasting schemes such as elitist simulated binary evolutionary algorithm (ESBEA), multi-objective problems with Pareto front solution (MOP_PF) and efficient fuzzy logic-based probabilistic broadcasting (EFPB).

Abstract: The blind flooding of query packets in route discovery more often characterizes the broadcast storm problem, exponentially increases energy consumption of intermediate nodes and congests the entire network. In such a congested network, the task of establishing the path between resources may become very complex and unwieldy. An extensive research work has been done in this area to improve the route discovery phase of routing protocols by reducing broadcast expenses. The purpose of this study is to provide a comparative analysis of existing broadcasting techniques for the route discovery phase, in order to bring about an efficient broadcasting technique for determining the route with minimum conveying nodes in ad-hoc networks. The study is designed to highlight the collective merits and demerits of such broadcasting techniques along with certain conclusions that would contribute to the choice of broadcasting techniques.

Abstract: This paper presents the detailed design and the key system performance results of a comprehensive laboratory demonstrator (testbed) for a hybrid satellite/terrestrial S-band mobile digital broadcasting system. The physical layer is based on an enhanced version of the digital video broadcasting—satellite to handheld (DVB-SH) standard, exploiting dual-polarization multiple-input–multiple-output (MIMO) technology. This complete digital MIMO demonstrator, which is the first of its kind, allows for an in-depth verification and optimization of the MIMO techniques applied to satellite broadcasting networks. Moreover, this demonstrator allows for complementing and confirming the theoretical or simulation-based findings published thus far. It is shown that dual-polarization MIMO diversity is able to provide remarkable gains in terms of satellite/terrestrial transmit power reduction and/or capacity increase compared with more conventional non-MIMO solutions. It is also demonstrated that the adoption of a relatively simple spatial multiplexing MIMO technique represents the best way to grasp these gains. This paper provides an extensive set of laboratory measurement results for existing stochastic satellite and hybrid MIMO channels, as well as results based on an S-band satellite-measured dual-polarization time series recently collected during a campaign sponsored by the European Space Agency. Results obtained using MIMO techniques are also compared with a dual- and single-polarization single-input–single-output (SISO) DVB-SH benchmark system and with computer simulation results.

Abstract: Multi-hop broadcast communication is extensively used as the main communication scheme to enable safety and non-safety applications for Vehicular Ad hoc Networks (VANETs). In order to design a bandwidth efficient VANET broadcast protocol, we propose a fuzzy logic-assisted intelligent receiver-based scheme. A receiver vehicle uses a fuzzy logic system , which relies on mobility and coverage factors, to determine the rebroadcaster candidate vehicles, and then based on the distance-to-mean parameter of each vehicle in this candidate set, the receiver vehicle decides to rebroadcast or drop the message. Ns-3 simulations have been developed to investigate the effectiveness of our proposed system in terms of reachability, the average number of rebroadcasts per covered node, and bytes sent per covered node. The proposed protocol performance is compared to DTM, DADCQ, SLAB, FLB, and CSBD protocols. The proposed protocol is shown to have bandwidth efficiency advantage over all the other protocols while maintaining an acceptable reachability level.