Broadcasting dependent data for ordered queries without replication in a multi-channel mobile environment
42
Citation
4
Reference
10
Related Paper
Citation Trend
Abstract:
In several mobile applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data mainly consider single broadcast channel environments. In view of this, we explore the problem of broadcasting dependent data in multiple broadcast channels. By analyzing the model of dependent data broadcasting, we derive several theoretical properties for the average access time in a multiple channel environment. In light of the theoretical results, we develop a genetic algorithm to generate broadcast programs.Keywords:
Replication
MAC protocol of Wireless Sensor Network (WSN) requires high efficiency to achieve maximum traffic transmission, while pursuit high reliability at the same time. The paper researched on reliable mixing broadcast implementation manner of WSN. Based on analysis on implementation manners of broadcast, unicast and mixing broadcast, a kind of adaptive MAC protocol supporting reliable mixing broadcast was presented. The protocol dynamically select implementation manner with maximum mixing broadcast efficiency based on given network parameters to complete transmission of data frame. Simulation results based on NS2 shows that the protocol has better performance to achieve reliable mixing broadcast, which solve problems of reliable broadcast/multicast at network layer.
Unicast
Broadcast domain
Cite
Citations (0)
Broadcast is one of the most typical operations in wireless communication. Considering unicast frame structure has been used in IEEE 802.11 protocol, where no reply of the broadcasting signal can be received from medium access control (MAC) layer, thus the quality of service can not be guaranteed. Therefore, to enhance the reliability for the transmission of broadcast service is necessary. In this paper, we propose a reliable broadcast mechanism that uses direct and indirect acknowledgement (ACK) to improve the reliability of broadcast traffic, and then design a polynomial method to approximately solve the total dominating set (TDS). Meanwhile, we apply TDS to determine the virtual backbone network (Forwarding node set) which is responsible for broadcasting forward and indirect confirmation. Simulation results show that compared with the IEEE 802.11 broadcast, our proposed broadcast mechanism can achieve a higher ratio of data packet delivery with a lower time consuming of convergence of the entire network, while having the same transmission reliability as IEEE 802.11 unicast traffic.
Unicast
Broadcast domain
Acknowledgement
Cite
Citations (0)
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcast has been addressed in the context of the radio network model that is characterized by a shared channel, and where a transmission is heard by all nodes within the sender’s neighborhood. This basic defining feature of the radio network model can be termed as the reliable local broadcast assumption. However, in actuality, wireless networks do not exhibit such perfect and predictable behavior. Thus any attempt at distributed protocol design for multi-hop wireless networks based on the idealized radio network model requires the availability of a reliable local broadcast primitive that can provide guarantees of such idealized behavior. We present a simple proof-of-concept approach toward the implementation of a reliable local broadcast primitive with probabilistic guarantees, with the intent to highlight the potential for lightweight scalable solutions to achieve probabilistic reliable local broadcast in a wireless network.
Broadcast domain
Cite
Citations (10)
IEEE 802.11bc introduces enhanced broadcast service (EBCS) to improve data broadcast scheduling and authentication performance in wireless local network (WLAN). The essential design in the EBCS is introducing a central scheduling scheme for data broadcasting, and this makes that the conventional distributed coordination function (DCF) based broadcast performance analysis does not apply. Thus, in this paper, we investigate the frame collision between DCF-based unicast data and scheduling-based broadcast data within the framework of IEEE 802.11bc, which has not been explored yet. Specifically, we study the tradeoff among station arrival intensity, broadcast and unicast frame collision, and broadcast control frame transmission interval, which directly determines the broadcast overhead. We derive an analytical model to quantity the above performance tradeoff. Based on the analytical model and simulation test, we optimize the broadcast control frame transmission interval to balance the broadcast overhead and data collision.
Broadcast domain
Unicast
Cite
Citations (1)
CAM-MAC proposed recently is a well designed wireless multichannel MAC protocol. By cooperating with neighbor nodes and using relative time instead of absolute time, CAM-MAC performs better than most of other multichannel MACs and do not need global synchronization. The deficiency of CAM-MAC is that it has not broadcast mechanism and thus, fails to exploit the broadcast nature of wireless medium and experience performance degradation in broadcast scenarios. In this paper, a broadcast enhanced MAC protocol called BMAC is proposed. The proposed protocol provides both unicast and broadcast service and do not need global synchronous clock either. A transmitter-based reservation scheme of channel selection is introduced in to support broadcast traffic. Simulation results show that the aggregate throughput of this broadcast MAC is significantly higher than its original non-enhanced MAC protocol when there's broadcast traffic in the network, and, this performance gap becomes larger as the proportion of broadcast traffic increases.
Unicast
Broadcast domain
Cite
Citations (6)
Broadcast communication is a key requirement for WSNs Broadcast communication, which forms the basis of all communication in wireless networks. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it important to design a minimumlatency broadcast algorithm, which is known to be NPcomplete. A simple 12-approximation algorithm for the one-to-all broadcast problem that improves latency Problem in the one-to-all broadcast algorithm. This leads to better performance with a collision free broadcasting. The all-to-all broadcast crisis where each node sends its own message to all other nodes. For all-to-all broadcasting the performance is improved by using Collect and Distribute, Interleaved Collect and Distribute algorithm. The message transmission in the wireless network using one-to-all and all-to-all broadcast algorithm gives best result. But it is not enough for very large multihop networks, so in future it can be implemented for very large multihop networks in efficient manner to reduce latency and collision-free and to find the latency time in wireless networks.
Broadcast domain
Cite
Citations (0)
Reliable broadcast is an important communication primitive for wireless mesh networks, which has many applications such as multimedia services and software upgrade. Recently, network coding is introduced into reliable broadcast to enhance the throughput of data transmissions. Existing network coding based reliable broadcast schemes, such as Pacifier and R-Code, fail to take advantage of the unique characteristic of reliable broadcast or the broadcast nature of wireless transmissions, which leads to redundant transmissions and performance degradation. In this paper, we propose a greedy strategy for network coding based reliable broadcast, which is called GreedyCode. GreedyCode opportunistically selects the forwarders with the highest transmission efficiency to transmit the encoded packets while the neighbors just listen. In order to measure the efficiency of broadcast transmission of a node, we also define a metric named One-hop Broadcast Throughput (OBT), which considers not only the current reception status of the destinations but also the quality of the broadcast link. Because GreedyCode only needs the information of its one-hop neighbors, so it can be distributed realized. The simulation results show that GreedyCode achieves 100% packet delivery ratio (PDR) and significantly reduces the number of transmissions and the broadcast delay.
Broadcast domain
Linear network coding
Cite
Citations (6)
This paper presents a scheme to improve the efficiency of radio MAC protocols in the case of broadcast and multicast transmissions, like TCP/IP multicasting. First, the reliability problems with broadcast packets and their consequences are analysed. Then the robust broadcast scheme is presented, which decreases the probability of loss of broadcast packets over MAC protocols based on CSMA/CA. Finally, the new protocol is simulated against other simple solutions to show how it performs.
Broadcast domain
Cite
Citations (57)
Broadcasting/multicasting may be an efficient way to disseminate delay-sensitive content in vehicular networks. However, conventional broadcasting schemes have suffered from reliability issues, since they cannot go along with ACK and RTS/CTS. In this paper, we design a novel receiver-driven broadcast scheme for periodic messaging in vehicular applications, where receivers request broadcasting to their neighbors and data is broadcast as a response. Via simulation study, it is shown that the proposed scheme effectively 1) controls contention and 2) mitigates hidden node effects in broadcast communication.
Broadcast domain
Cite
Citations (1)
Broadcast communication is a key requirement for WSNs since many tasks in the network depend on broadcasting. Broadcasting has been one of the most significant and widely used communication techniques for information transformation. Broadcast communication, which forms the basis of all communication in wireless networks. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it important to design a minimum-latency broadcast algorithm, which is known to be NP-complete. A simple 12-approximation algorithm for the one-to-all broadcast problem that improves latency Problem in the one-to-all broadcast algorithm. This leads to better performance with a collision free broadcasting. The all-to-all broadcast crisis where each node sends its own message to all other nodes. For all-to-all broadcasting the performance is improved by using Collect and Distribute, Interleaved Collect and Distribute algorithm. The message transmission in the wireless network using one-to-all and all-toall broadcast algorithm best result. But it is not enough for very large multihop networks, so in future it can be implemented for very large multihop networks in efficient manner to reduce latency and collision-free and to find the latency time in wireless networks. We can increase the performance in multihop networks over the existing system.
Broadcast domain
Cite
Citations (0)