119,881 research outputs found
Distributed MIMO coding scheme with low decoding complexity for future mobile TV broadcasting
A novel distributed space-time block code (STBC) for the next generation
mobile TV broadcasting is proposed. The new code provides efficient performance
within a wide range of power imbalance showing strong adaptivity to the single
frequency network (SFN) broadcasting deployments. The new code outperforms
existing STBCs with equivalent decoding complexity and approaches those with
much higher complexities
WARC 92 and some thoughts as to its impact on the NASA propagation program
The World Administrative Radio Conference of 1992 (WARC 92) was held in Torremolinos, Spain, 3 Feb. - 3 Mar. 1992. Major topics considered included shortwave broadcasting, mobile and mobile-satellite service, broadcasting satellite service (sound and HDTV), space services above 20 GHz, and space research. Considerable attention was given to the congested 1-3 GHz band in general and to Low Earth Orbit (LEO) Mobile-Satellite Service, including 'little' LEO's operating below 1 GHz and to 'big' LEO's operating above 1 GHz. Significant new allocations were made for generic Mobile-Satellite Services (MSS). Proposals for allocations for uplink power control beacons and for space research received favorable treatment
An efficient counter-based broadcast scheme for mobile ad hoc networks
In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency
On the Fundamental Limits of Broadcasting in Wireless Mobile Networks
In this talk, we investigate the fundamental properties of broadcasting in mobile wireless networks. In particular, we characterize broadcast capacity and latency of a mobile network, subject to the condition that the stationary node spatial distribution generated by the mobility model is uniform. We first study the intrinsic properties of broadcasting, and present a broadcasting scheme, called RippleCast, that simultaneously achieves asymptotically optimal broadcast capacity and latency, subject to a weak upper bound on the maximum node velocity. This study intendedly ignores the burden related to the selection of broadcast relay nodes within the mobile network, and shows that optimal broadcasting in mobile networks is, in principle, possible. We then investigate the broadcasting problem when the relay selection burden is taken into account, and present a combined distributed leader election and broadcasting scheme achieving a broadcast capacity and latency which is within a factor from optimal, where is the number of mobile nodes and is the path loss exponent. However, this result holds only under the assumption that the upper bound on node velocity converges to zero (although with a very slow, poly-logarithmic rate) as grows to infinity.
To the best of our knowledge, our is the first paper investigating the effects of node mobility on the fundamental properties of broadcasting, and showing that, while optimal broadcasting in a mobile network is in principle possible, the coordination efforts related to the selection of broadcast relay nodes lead to sub-optimal broadcasting performance
Recommended from our members
A survey of handover algorithms in DVB-H
Digital Video Broadcasting for Handhelds (DVB-H) is a standard for
broadcasting IP Datacast (IPDC) services to mobile handheld terminals.
Based on the DVB-T standard, DVB-H adds new features such as time
slicing, MPE-FEC, in-depth interleavers, mandatory cell id identifier,
optional 4K-modulation mode and the use of 5 MHz bandwidth in addition
to the usually used 6, 7, or 8 MHz raster. IPDC over DVB-H is proposed
for ETSI to complement the DVB-H standard by combining IPDC and
DVB-H in an end-to-end system. Handover in such unidirectional broadcasting
networks is a novel issue. In the last few years since the birth of
DVB-H technology, great attention has been given to the performance
analysis of DVB-H mobile terminals. Handover is one of the main research
topics for DVB-H in mobile scenarios. Better reception quality and greater
power efficiency are considered to be the main targets of handover
research for DVB-H. New algorithms for different handover stages in
DVB-H have been the subject of recent research and are currently being
studied. Further novel algorithms need to be designed to improve the
mobile reception quality. This article provides a comprehensive survey of
the handover algorithms in DVB-H. A systematic evaluation and categorization
approach is proposed based on the problems the algorithms solve
and the handover stages being focused on. Criteria are proposed and analyzed
to facilitate designing better handover algorithms for DVB-H that
have been identified from the research conducted by the author
ETS-5, ETS-6, and COMETS projects in Japan
Three satellite communication projects now in progress in Japan are described. The first is a project to establish a telecommunication network for tele-education, TV conference, and tele-medicine in the Asia-Pacific region by using the Japan's Engineering Test Satellite-5 (ETS-5). The second is a project of the ETS-6 satellite, to be launched in 1993, for inter-satellite communication, mobile and fixed communication, and millimeter wave personal communication experiments. The third is a project of the Communications and Broadcasting Engineering Test Satellite (COMETS), to be launched in 1997, for advanced mobile satellite communication, inter-satellite link, and advanced broadcasting experiments at higher frequencies
Multiobjective algorithms to optimize broadcasting parameters in mobile Ad-hoc networks
Congress on Evolutionary Computation. Singapore, 25-28 September 2007A mobile adhoc network (MANETs) is a self-configuring network of mobile routers (and associated hosts). The routers tend to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change fast and unpredictably. Nowadays, these networks are having a great influence due to the fact that they can create networks without a specific infrastructure. In MANETs message broadcasting is critical to network existence and organization. The broadcasting strategy in MANETs can be optimized by defining a multiobjective problem whose inputs are the broadcasting algorithm's parameters and whose objectives are: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. The network can be simulated to obtain the expected response to a given set of parameters. In this paper, we face this multiobjective problem with two algorithms: Multiobjective Particle Swarm Optimization and ESN (Evolution Strategy with NSGAII). Both algorithms are able to find an accurate approximation to the Pareto optimal front that is the solution of the problem. ESN improves the results of MOPSO in terms of the set coverage and hypervolume metrics used for comparison
- …