Efficient broadcasting protocols for regular wireless sensor networks

The wireless sensor network (WSN) has attracted lots of attention recently. Broadcast is a fundamental operation for all kinds of networks and it has not been addressed seriously in the WSN. Therefore, we propose two types of power and time efficient broadcasting protocols, namely one‐to‐all and all‐to‐all broadcasting protocols, for five different WSN topologies. Our one‐to‐all broadcasting protocols conserve power and time by choosing as few relay nodes as possible to scatter packets to the whole network. Besides, collisions are carefully handled such that our one‐to‐all broadcasting protocols can achieve 100% reachability. By assigning each node a proper channel, our all‐to‐all broadcasting protocols are collision free and efficient. Numerical evaluation results compare the performance of the five topologies and show that our broadcasting protocols are power and time efficient. Copyright © 2005 John Wiley & Sons, Ltd.     

Efficient broadcast for wireless ad hoc networks with a realistic physical layer

In this paper, we investigate the low coverage problem of efficient broadcast protocols in wireless ad hoc networks with realistic physical layer models. To minimize energy consumption, efficient protocols aim to select small set of forward nodes and minimum transmission radii. In ideal physical layer model, nodes within forward nodes’ transmission ranges can definitely receive packets; therefore energy efficient protocols can guarantee full coverage for broadcasting. However, in networks with a realistic physical layer, nodes can only receive packets with probability. We present an analytical model to show that the transmission radii used for nodes can be used to establish a tradeoff between minimizing energy consumption and ensuring network coverage. We then propose a mechanism called redundant radius, which involves using two transmission radii, to form a buffer zone that guarantees the availability of logical links in the physical network, one for broadcast tree calculation and the other for actual data transmission. With this mechanism, we extend well-known centralized protocols, BIP and DBIP, and corresponding localized protocols, LBIP and LDBIP. The effectiveness of the proposed scheme in improving network coverage is validated analytically and by simulation.     

Efficient algorithms for performing packet broadcasts in a meshnetwork

A common task for network protocols is the broadcasting of information from one node to the rest of the nodes in the network. This task is often required during the execution of parallel algorithms in a network of processors, or other situations where the nodes of a mesh network generate packets to be broadcast at random time instances. We consider processors communicating over a mesh network with the objective of broadcasting information among each other. One instance of the problem involves a number of nodes all with the same message to be broadcasted. For that problem, a lower-bound on the time to complete the broadcast, and an algorithm which achieves this bound are presented. In another instance, every node in the mesh has packets to be broadcast arriving independently, according to a Poisson random process. The stability region for performing such broadcasts is characterized, and broadcast algorithms which operate efficiently within that region are presented. These algorithms involve interacting queues whose analysis is known to be very difficult. Toward that end we develop an approximation which models an n-dimensional infinite Markov chain as a single-dimensional infinite Markov chain together with an n-dimensional finite Markov chain. This approximate model can be analyzed and the results compare favorably with simulation     

Splitting protocols in presence of capture

The effect of capture on splitting-type protocols in a slotted ALOHA broadcasting network is investigated. At first, it is assumed that the nodes of the network are divided into two groups, and only packets sent by nodes of one of the groups might be captured. The situation in which the receiver can distinguish between success slots and capture slots and that in which it cannot are both considered. For each of these situations, splitting-type multiple access protocols are described and their performance in terms of achievable throughputs is evaluated. Extensions of these protocols to a general capture model are also discussed.     

Shortest Path Evaluation in Wireless Network Using Fuzzy Logic

Evaluation of the shortest path in a wireless network is to ensure the fast and guaranteed delivery of the data over the established wireless network. Most of the wireless protocols are using a shortest path evaluation technique which is based on the random weights assigned to the network nodes. This alone may not be sufficient to get the accurate shortest path for routing process. Most of the shortest path evaluation algorithms perform the blind search to find the shortest routes for routing, this eventually increase the complexity of the whole process itself. This article puts some light on facts of using real time estimated routing delay from source node to other nodes by broadcasting a “knock” message. And this delay is being used to evaluate the shortest path for routing using fuzzy logic. This process is enhanced with its improved inference engine model and furnished fuzzy crisp patterns to deploy the shortest routing path in real time wireless nodes.     

A Unified Approach to Heterogeneous Video-on-Demand Broadcasting

Video-on-demand (VoD) is an essential technology for many multimedia applications. However, it remains challenging to efficiently deliver on-demand streams to a large number of receivers in a heterogeneous network environment. Although a number of VoD broadcasting protocols have been proposed for heterogeneous receivers, these protocols considers only single-bit-rate VoD services, which cannot satisfy the diverse quality-of-service requirements of heterogeneous receivers. In this paper, we propose a unified approach to heterogeneous VoD broadcasting, called unified heterogeneous broadcasting (UHB). As a unified approach, UHB is design to integrate different VoD broadcasting protocols and different scalable video coding schemes. The main merits of UHB are threefold. First, unlike conventional VoD broadcasting protocols, UHB supports multiple-bit-rate VoD services. Second, UHB is capable of adapting to network bandwidth fluctuations. Third, UHB enables each heterogeneous receiver to obtain the best visual quality by selecting the optimum system joining time. Our performance evaluation results indicate that UHB is superior to conventional heterogeneous VoD broadcasting protocols under various network conditions.     

Opportunistic large array concentric routing algorithm (OLACRA) for upstream routing in wireless sensor networks

An opportunistic large array (OLA) is a form of cooperative diversity in which a large group of relays or forwarding nodes operate without any mutual coordination, but naturally fire together in response to energy received from a single source or another OLA. When used for broadcast, OLAs form concentric rings around the source, and have been shown to use less transmit energy than conventional multi-hop protocols during broadcasting. The OLA concentric routing algorithm (OLACRA) and its variants, the main contributions of this paper, leverage the concentric ring structure of the OLAs during the initialization phase to limit the node participation on the upstream connection. For the simulation scenarios considered in this paper, OLACRA is shown to save over 80% of the transmit energy relative to other OLA-based schemes. This paper analyzes the performance of OLACRA over ‘deterministic channels’ or non-faded orthogonal channels and on ‘diversity’ or Rayleigh flat-fading channels with limited orthogonality. Enhancements to OLACRA to further improve its energy efficiency by limited broadcasting in the initial upstream level and limiting the downlink ‘step-sizes’ are also considered. A simple contention avoidance scheme for WSNs with multiple flows is also proposed. In addition to this, the robustness of OLACRA over mobile channels is also studied. The protocols are tested using Monte Carlo evaluation.     

Multi-channel support for DMAC in WSNs

Currently most wireless sensor network applications assume the presence of single-channel medium access control (MAC) protocols. However, lower sensing range result in dense networks, single-channel MAC protocols may be inadequate due to higher demand for the limited bandwidth. In this paper we proposed a method of multi-channel support for DMAC in Wireless sensor networks (WSNs). The channel assignment method is based on local information of nodes. Our multi-channel DMAC protocol implement channel distribution before message collecting from source nodes to sink node and made broadcasting possible in DMAC. Analysis and simulation result displays this multi-channel protocol obviously decreases the latency without increasing energy consumption.     

AN EFFICIENT DISTRIBUTED ALGORITHM FOR CONNECTED DOMINATING SET CONSTRUCTION IN WIRELESS SENSOR NETWORKS

Efficient broadcasting protocols based on Connected Dominating Set （CDS） are frequently used; hence the entire broadcast domain is restricted to nodes in the CDS. This letter proves that a node must be a CDS node, if its neighbors with larger keys cannot cover it together. Then a simple distributed CDS construction algorithm is proposed, which is more effective than the existing algorithms in reducing the dominating set size and the computation complexity at the same time. Simulation results also confirm this, especially in relatively dense networks.     

Capacity of practical wireless multihop broadcast networks

In a wireless multihop broadcasting scenario, a number of relay nodes may cooperate the source node in order to improve the capacity of the network. However, the imposition of total energy and maximum hop constraints to this system in a practical setting. In this paper, we study an ad-hoc network with infinitely many nodes and analytically find the number and positions of rebroadcasting relay nodes to achieve the optimal broadcast capacity. The interference due to multiple transmissions in the same geographical area is taken into account. According to the results of this theoretical model, we propose two heuristics, one distributed and one centralized, as suboptimal but practical solutions to the relay selection problem in wireless multihop broadcasting. We discuss the broadcast capacity performances and CSI (channel state information) requirements of these algorithms. The results illustrate that the benefits of peer-assisted broadcasting are more pronounced in the centralized relay selection algorithm when compared to the fully randomized and distributed selection under a realistic system model.     

Distributed space-time coding for multihop transmission in power line communication networks

In this paper, we consider transmission in relatively wide-stretched power line communication (PLC) networks, where repeaters are required to bridge the source-to-destination distance. In particular, it is assumed that each network node is a potential repeater and that multihop transmission is accomplished in an ad hoc fashion without the need for complex routing protocols. In such a scenario, due to the broadcasting nature of the power line channel, multiple repeater nodes may receive and retransmit the source message simultaneously. It is shown that, if no further signal processing is applied at the transmitter, simultaneous retransmission often deteriorates performance compared with single-node retransmission. We therefore advocate the application of distributed space-time block codes (DSTBCs) to the problem at hand. More specifically, we propose that each network node is assigned a unique signature sequence, which allows efficient combining at the receiver. Most notably, DSTBC-based retransmission does not require explicit collaboration among network nodes for multihop transmission and detection complexity is not increased compared with single-node retransmission. Numerical results for multihop transmission over PLC networks show that DSTBC-based retransmission achieves a considerably improved performance in terms of required transmit power and multihop delay compared with alternative retransmission strategies.     

Localized broadcast incremental power protocol for wireless ad hoc networks

We investigate broadcasting and energy preservation in ad hoc networks. One of the best known algorithm, the Broadcast Incremental Power (BIP) protocol, constructs an efficient spanning tree rooted at a given node. It offers very good results in terms of energy savings, but its computation is centralized and it is a real problem in ad hoc networks. Distributed versions have been proposed, but they require a huge transmission overhead for information exchange. Other localized protocols have been proposed, but none of them has ever reached the performances of BIP. In this paper, we propose and analyze an incremental localized version of this protocol. In our method, the packet is sent from node to node based on local BIP trees computed by each node in the broadcasting chain. Local trees are constructed within the k-hop neighborhood of nodes, based on information provided by previous nodes, so that a global broadcasting structure is incrementally built as the message is being propagated through the network. Only the source node computes an initially empty tree to initiate the process. Discussion and results are provided where we argue that k = 2 is the best compromise for efficiency. We also discuss potential conflicts that can arise from the incremental process. We finally provide experimental results showing that this new protocol obtains very good results for low densities, and is almost as efficient as BIP for higher densities.     

Efficient Broadcasting in Mobile Ad Hoc Networks

This paper presents two efficient flooding algorithms based on 1-hop neighbor information. In the first part of the paper, we consider sender-based flooding algorithms, specifically the algorithm proposed by Liu et al. In their paper, Liu et al. propose a sender-based flooding algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O(n logn), where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based flooding algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O(n). In Liu's algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. In the second part of the paper we propose a simple and highly efficient receiver-based flooding algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same messageneighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The analytical results are confirmed using simulation.     

Unified routing protocol based on passive bandwidth measurement in heterogeneous WMNs

The past few years have witnessed a surge of wireless mesh networks (WMNs)‐based applications and heterogeneous WMNs are taking advantage of multiple radio interfaces to improve network performance. Although many routing protocols have been proposed for heterogeneous WMNs, most of them mainly relied on hierarchical or cluster techniques, which result in high routing overhead and performance degradation due to low utilization of wireless links. This is because only gateway nodes are aware of all the network resources. In contrast, a unified routing protocol (e.g., optimal link state routing (OLSR)), which treats the nodes and links equally, can avoid the performance bottleneck incurred by gateway nodes. However, OLSR has to pay the price for unification, that is, OLSR introduces a great amount of routing overhead for broadcasting routing message on every interface. In this paper, we propose unified routing protocol (URP), which is based on passive bandwidth measurement for heterogeneous WMNs. Firstly, we use the available bandwidth as a metric of the unification and propose a low‐cost passive available bandwidth estimation method to calculate expected transmission time that can capture the dynamics of wireless link more accurately. Secondly, based on the estimated available bandwidth, we propose a multipoint relays selection algorithm to achieve higher transmission ability and to help accelerate the routing message diffusion. Finally, instead of broadcasting routing message on all channels, nodes running URP transmit routing message on a set of selected high bandwidth channels. Results from extensive simulations show that URP helps improve the network throughput and to reduce the routing overhead compared with OLSR and hierarchical routing. Copyright © 2016 John Wiley & Sons, Ltd.     

Performance analysis of geography‐limited broadcasting in multihop wireless networks

In multihop wireless networks, delivering a packet to all nodes within a specified geographic distance from the source is a packet forwarding primitive (geography‐limited broadcasting), which has a wide range of applications including disaster recovery, environment monitoring, intelligent transportation, battlefield communications, and location‐based services. Geography‐limited broadcasting, however, relies on all nodes having continuous access to precise location information, which may not be always achievable. In this paper, we consider achieving geography‐limited broadcasting by means of the time‐to‐live (TTL) forwarding, which limits the propagation of a packet within a specified number of hops from the source. Because TTL operation does not require location information, it can be used universally under all conditions. Our analytical results, which are validated by simulations, confirm that TTL‐based forwarding can match the performance of the traditional location‐based geography‐limited broadcasting in terms of the area coverage as well as the broadcasting overhead. It is shown that the TTL‐based approach provides a practical trade‐off between geographic coverage and broadcast overhead. By not delivering the packet to a tiny fraction of the total node population, all of which are located near the boundary of the target area, TTL‐based approach reduces the broadcast overhead significantly. This coverage‐overhead trade‐off is useful if the significance of packet delivery reduces proportionally to the distance from the source. Copyright © 2011 John Wiley & Sons, Ltd.     

Mobile ad hoc network broadcasting: A multi‐criteria approach

Nodes in a computer network often require a copy of a message to be delivered to every node in the network. The network layer can provide such a service, referred to as network‐wide broadcast routing or simply ‘broadcasting’. Broadcasting has many applications, including its role as a service to many routing protocols. In a mobile ad hoc network (MANET), simplistic broadcast schemes (such as flooding) inundate the network with redundancy, contention, collision, and unnecessary use of energy resources. This can prevent broadcasts from achieving their primary objective of maximizing delivery ratio, while also considering secondary objectives, such as balancing energy resources or reducing the network's burden on congested or busy nodes. As a solution, we propose multiple‐criteria broadcasting (MCB). In MCB, the source of each broadcast specifies the importance assigned to broadcast objectives. Network nodes use these priorities, along with local and neighbor knowledge of distributed factors, to broadcast in accordance with the objective priorities attributed to the message. Using ns2, the performance of MCB is evaluated and compared to that of other broadcast protocols. To present knowledge, MCB constitutes the first reconfigurable, multi‐objective approach to broadcasting. Copyright © 2010 John Wiley & Sons, Ltd.     

An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks

A mobile ad hoc network (or manet) is a group of mobile, wireless nodes which cooperatively form a network independent of any fixed infrastructure or centralized administration. In particular, a manet has no base stations: a node communicates directly with nodes within wireless range and indirectly with all other nodes using a dynamically-computed, multi-hop route via the other nodes of the manet.Simulation and experimental results are combined to show that energy and bandwidth are substantively different metrics and that resource utilization in manet routing protocols is not fully addressed by bandwidth-centric analysis. This report presents a model for evaluating the energy consumption behavior of a mobile ad hoc network. The model was used to examine the energy consumption of two well-known manet routing protocols. Energy-aware performance analysis is shown to provide new insights into costly protocol behaviors and suggests opportunities for improvement at the protocol and link layers.     

Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks

We propose some improvements to the flooding protocols that aim to efficiently broadcast given information in ad-hoc networks. These improvements are based on probabilistic approach and decrease the number of emitted packets. Indeed, it is more interesting to privilege the retransmission by nodes that are located at the radio border of the sender. We observe that the distance between two nodes can be approximated by comparing neighbor lists. This leads to broadcasting schemes that do not require position or signal strength information. Moreover, proposed broadcast protocols require only knowledge of one hop neighborhood and thus need only short hello message and then support high mobility.     

Improved algorithms for computing with faulty SIMD hypercubes

Computation time for various primitive operations, such as broadcasting and global sum, can significantly increase when there are node failures in a hypercube. In this paper we develop nearly optimal algorithms for computing important basic problems on a faulty SIMD hypercube. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. Our parallel machine model is an n-dimensional SIMD hypercube Q _n with up to n-1 node faults. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. We use the concept of free dimension to develop our algorithms, where a free dimension is defined to be a dimension i such that at least one end node of any i-dimension link is nonfaulty. In an n-cube, with f < n faults, it is known that there exist n-f+1 free dimensions. Using free dimensions, we show that broadcasting and global sum can be performed in n+5 steps, thereby improving upon the previously known algorithms for these primitives. The broadcasting algorithms work independent of the location of source node and faulty nodes. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Distributed Intelligent Broadcasting Protocol for Mobile Ad Hoc Networks

The control and routing performances of mobile ad hoc networks (MANETs) depend upon the efficiency of the network-wide broadcasting schemes that are in place. Ad hoc networks are often characterized by poor infrastructure quality, limited resources, dynamic variation and a need for mobility; therefore, ease of deployment, adaptability and potential for energy-savings are the primary drivers considered in the design of typical broadcasting schemes. This paper proposes a distributed intelligent broadcasting protocol (DIBP) that is capable of dynamically determining the broadcasting nodes in a MANET, based upon the distribution of network nodes. This eliminates the need for active network monitoring and periodical maintenance is not required. In addition, the distributed intelligent broadcasting protocol employs an adjustable parameter for determining the broadcasting node, broadcasting timing and the number of broadcasting nodes. This parameter can be changed dynamically based on different operational requirements; such as energy savings, hop count, network delay and other similar targets. Simulations of networks employing the protocol yield results showing that the DIBP performs better in terms of delivery delay, number of rebroadcast nodes, and delivery ratio.