Network-wide Broadcast Research Articles

International Logistics Management System Based on Cloud Computing Technology

In order to solve the problems of slow matching between supply and demand, information authenticity and security, and lack of trust in traditional logistics platforms, the author proposes an international logistics management system based on cloud computing technology. The system uses blockchain as the underlying technology, combined with related technologies such as smart contracts and NSGA-II algorithms, matches the supply and demand sides of cross-border logistics resources, writes the important information generated in the platform transaction into the blockchain, and carries out network-wide broadcast and consensus, so as to realize the intelligence of the transaction and the nontampering and traceability of the information. The experiment found that in the case set by this example, max Z 1 = 57.139 , and max Z 2 = 54.679 , meaning that the final matching result is as follows: P2, the cross-border logistics provider, is matched with U5, the consignor; P3 matches U9, P8 matches U4, P9 matches U3, P1 matches U6, P5 matches U1, P7 matches U2, P4 matches U7, P10 matches U8, and P8 matches U10. Satisfactory matching results show that the algorithm is effective. Experimental results show that the system can increase the transparency and sharing of cross-border logistics information, help to reduce forged data information, improve the level of automation and intelligence, and provide a reference for the application of blockchain technology in the field of cross-border logistics.

RETRACTED ARTICLE: Denaturalized cluster organization based improving energy constraints using relay link chain routing protocol in wireless sensor network

Energy constraints is an important for routing standards in cooperative transmission to make a better communication on wireless medium. The WSN broadcast communication leads Loss of energy, broken link, non-relay network issues because of cooperative network does not make efficient routing standards. Most of the energy efficient schemas possess the network wide broadcast protocol (NWBP) to oppose the challenges in WSN. To improve the energy efficiency in WSN, we propose a denaturalized cluster organization to form the centralized cluster head (DNC-CCH) communication on route head to make the transmission without sleeping nodes on networks have the on state available node from source to destination. In Addition by improving energy constraints using relay link chain routing protocol (RLCRP) in wireless sensor network make an relay on routing to choose the non-sleeping cluster nodes relies the neighbor discourse supposed to the delay routing propagation. This select the closest relay links to make the continues link on really transmission with aggregate data from source to destination with improved energy. Also this consider the neighboring senders to improve the lifespan of the network nodes to make energy efficient routing standards and life time of WSN cooperative communication.

ECHO: Efficient Zero-Control-Packet Broadcasting for Mobile Ad Hoc Networks

Applications such as collaborative mapping motivate a need for network-wide broadcasting in Mobile Ad Hoc Networks (MANET) with low-rate long-range links. Existing MANET protocols are inadequate in such low-capacity regimes due to their high use of control packets. We present a novel protocol called ECHO that constructs and maintains a broadcast backbone without using any control packets. Instead, using a field in the data packet header, a node transmits and listens for an “echo” of the specific packet to determine its membership in the backbone. ECHO is deterministic, source-independent, fully distributed, accommodates mobility, and balances battery consumption across nodes. We prove ECHO’s correctness and show that its communication complexity is lower than that of Multi-Point Relay (MPR) and Flooding, and comparable to that of Opportunistic Announcement (OA). Simulations over random mobile low-capacity networks show that ECHO provides at least a 30 percent better delivery ratio than Flooding, MPR, and OA for 50-node networks and dramatically reduces the communication load. Experiments on a 12-node testbed of goTenna mobile mesh networking devices show that ECHO reduces transmissions by about 3x and increases battery life by more than 50 percent over Flooding. ECHO’s performance advantages are crucial for scalable broadcast in low-power, low-capacity wireless networks.

QWRP: Query-driven virtual wheel based routing protocol for wireless sensor networks with mobile sink

Query-driven routing protocols are broadly used in wireless sensor networks (WSNs) wherein the sink injects queries into the sensor network concerning a Region-of-Interest (RoI). In response to the query, sensor nodes belonging to the RoIs transmit their data towards the sink. Routing of the data is a challenging task when sink is mobile. Due to sink's mobility, the query injection location, and data collection location can change over time and this could deteriorate the overall performance. The most common mechanism of providing mobile sink's location to the sensor nodes is broadcasting, but it puts an overhead on the resource-constrained sensor nodes. This paper takes up the issues and proposes wheel, a virtual infrastructure with the aim of confining the network-wide broadcasting of sink's location, and Query-driven virtual Wheel based Routing Protocol (QWRP), a routing protocol developed over the virtual wheel for query-driven scenarios. Furthermore, an angle based forwarding algorithm, a novel packet forwarding mechanism is developed under QWRP that aims to improve the data delivery performance. It is a common scheme used by wheel nodes to route the query and data packets efficiently to RoIs and sink respectively. Performance evaluation of QWRP shows significant reduction in overall energy consumption while maintaining the high data delivery ratio and low delay.

An Energy-Efficient Network-Wide Broadcast Protocol for Asynchronous Wireless Sensor Networks

It is very challenging to design an efficient network-wide broadcast protocol for asynchronous wireless sensor networks (AWSNs). Since the neighbors adopt sleep schedule independently and the probability that they wake up concurrently is very low, each single-hop broadcast has to be substituted by multiple unicast transmissions. Moreover, without the schedule knowledge of designated neighbors, a sender has to keep active until all these nodes are covered, which consumes a large amount of energy. In this letter, we propose an energy-efficient network-wide broadcast protocol (EENWB) for AWSNs. By introducing more aggressive cooperations among the neighboring senders, some senders can go to sleep much earlier, only at the cost of increasing the active periods of their cooperators slightly. Extensive simulation results show that EENWB can reduce the total energy consumption greatly.

Minimum-Cost Network-Wide Broadcast over Reliable MAC-Layer Multicast

We consider the network-wide broadcast problem in multihop wireless networks with reliable multicast at the Medium Access Control (MAC) layer, where the cost of transmitting to downstream nodes at each branch point in the broadcast tree depends on the number $k$ of recipients, specifically $1+A k^b$ in our model (for some $b \geq 0$ , $A \geq 0$ ). This allows us to capture a wide array of MAC-layer approaches and their costs, simply by varying the value of $b$ (relative to $A$ ), in a problem formulation subsuming the Connected Dominating Set and Spanning Tree problems. We give a systematic analysis of this problem, including positive and negative results. In particular, we show the problem is: approximable by a factor varying from $2H_{\Delta}+2$ down to 2 as $b$ varies from 0 to 1 (where $\Delta$ is the maximum degree of the network graph and $H_\Delta$ is the $\Delta$ th harmonic number); approximable by a factor varying from 2 to 1 (i.e., optimal) as $b$ varies from 1 to $\log _2 (\frac{1}{A}+2)$ ; and optimally solvable thereafter. Finally, we present numerical results comparing the two algorithms above with other natural heuristics. We find there is an advantage in algorithms taking into consideration the value $b$ , even if $b$ can only be roughly estimated.

Revisiting XOR-based network coding for energy efficient broadcasting in mobile ad hoc networks

Network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple sources. We make the observation that the common approach, which is to benefit from the synergy of XOR network coding with a CDS-based broadcast algorithm, suffers performance breakdowns. After delving into the details of this synergy, we attribute this behavior to an important mechanism of the underlying broadcast algorithm, known as the “termination criterion”. To tackle the problem, we propose a termination criterion that is fully compatible with XOR coding. In addition to that, we revisit the internals of XOR coding. We first enhance the synergy of XOR coding with the underlying broadcast algorithm by allowing each mechanism to benefit from information available by the other. In this way, we manage to improve the pruning efficiency of the CDS-based algorithm while at the same time we come up with a method for detecting coding opportunities that has minimal storage and processing requirements compared to current approaches. Then, for the first time, we use XOR coding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. We validate the effectiveness of our proposed algorithm through extensive simulations on a diverse set of scenarios.

Asymptotic Gain Analysis of Cooperative Broadcast in Linear Wireless Networks

We analyze the maximum gain that can be achieved through cooperative broadcast with energy accumulation and memory. We consider a linear network, where a known number of nodes are placed on a line, and derive an upper bound on $G_{tot}$ , the gain of cooperative broadcast over noncooperative broadcast with respect to total power consumption. Specifically, we prove that, in linear networks with path loss exponent $\alpha=2$ , $G_{tot} \leq \frac{\pi^2}{12-\pi^2}\approx 4.64$ , irrespective of the number of devices, the size of the network, the node placement strategy, and the cooperative broadcast strategy. We extend this result to any path loss exponent $\alpha\geq 2$ . We also show that the cooperation gain in short-range transmissions, wherein the circuit energy consumption is nonnegligible, is smaller than that in long-range transmissions. We further study the cooperative broadcast gain when the objective is to reduce the maximum transmission power used by any node in the network. In this case, we show that, when nodes are distributed uniformly at random, the maximum cooperation gain will be $O$ (log $n$ ), with high probability, where $n$ is the number of nodes in the network. These are important observations that should be considered in designing power-efficient broadcast algorithms in future network-wide cooperative broadcast.

SECURE DATA STORAGE OVER DISTRIBUTED NODES IN NETWORK THROUGH BROADCAST TECHNIQUES

Abstract Network wide broadcasting is one of the major mechanisms in wireless network to resolve may issues. In wireless network communication the source node sends a message to all other nodes that are present in the network. The nodes are communicating with each other but these nodes do not have any pre-existing routing infrastructure for communication. No static infrastructure is available in wireless network communication, because of this there is limited transmission range. When source node wants to communicate with nodes that are outside the radio range of network then there is need to form a multihop network. This paper proposes secure data storage over distributed network distributed through broadcast algorithm. System manages the data security, data backup, perform faster communication in between node and reduce the collision

Efficient broadcasting for a MANET-based peer-to-peer community radio service

Ad hoc networks consisting entirely of simple mobile phones can be used to deploy village level telephony. We investigate a novel application for such networks – a peer-to peer community radio service. We envision a system, where any user in the network is equally empowered to generate and distribute audio content to the entire network, using his or her mobile phone. This study concentrates on a critical aspect of this service – the choice of the network-wide broadcast protocol. Using extensive simulations, we evaluate the suitability of various broadcast techniques for a rural peer-to-peer mobile ad hoc network. Our simulations identify the best choice of protocols under various village network conditions while simultaneously identifying limitations of the current protocols and suggestions for better performance.

DBridges: Flexible floodless frame forwarding

Ethernet has become the de facto layer 2 transmission technology, partly due to ease of use and cost efficiency. The cores of most data centers around the world are based on Ethernet, and large access and core networks are built without IP routing. The inherent simplicity of Ethernet has several drawbacks, including the overhead of network-wide broadcasting and the use of the spanning tree protocol. The academia and the industry have presented numerous solutions to overcome the limitations of Ethernet. Many of these solutions have deployment constraints and often force a change of the whole network.In this paper, we present DBridges, an efficient solution for building large-scale Ethernets based on the IETF-driven RBridges and SEATTLE. DBridges provide loop-safety, dramatic decrease in broadcast traffic, and resiliency and graceful failover without affecting the plug-and-play vision of Ethernet. The key contributions of our solution are that we are backward compatible with RBridges and can support incremental deployment. We analyze and show these benefits in detail, and present various performance measurements using our proof-of-concept implementation. We estimate that with DBridges it is possible to increase the size of Ethernet broadcast domains at least tenfold.

Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks

Network–wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that can achieve high delivery ratio, flooding consumes much of the communication bandwidth and causes serious packet redundancy, contention and collision. In this paper, the authors propose new broadcast schemes that reduce the overhead associated with flooding. In these schemes, a node selects a subset of its neighbors for forwarding the packet being broadcast to additional nodes. The selection process has for goal reducing the number of neighbors and maximizing the number of nodes that they can reach (i.e., forward the packet to). By applying this novel neighborhood-based broadcasting strategy, the authors have come up with routing protocols that have very low overhead. These protocols were implemented and simulated within the GloMoSim 2.03 network simulator. The simulation experiments show that our routing protocols can reduce the overhead for both low and high mobility substantially, as compared with the well-known and promising AODV routing protocol. In addition, they outperform AODV by increasing the delivery ratio and decreasing the end-to-end delays of data packets.

Comparing wireless flooding protocols using trace-based simulations

Most wireless multi-hop networks, such as ad hoc networks and wireless sensor networks, need network-wide broadcasting, which is best done with a flooding protocol. In this article, we use packet trace information from a real test-bed network to define a simulator for flooding protocol performance studies. Five protocols are compared using the simulator. Trace-based simulations promise to have the benefits of the simulator, such as reducing required work effort and repeatability but still produce results close to the real test-bed or deployment. We propose and evaluate different approaches on how to use collected trace data and how to tune the parameters to achieve the best possible accuracy in comparison with actual test-bed measurements. We study the resulting accuracy of the model so that performance studies know with what confidence a certain conclusion can be made. Using the new trace-based model and knowing its accuracy, we compare the five flooding protocols to gain additional insights into their performance. Finally, by modifying the trace data, we study how real-world effects, such as links with in-between qualities and asymmetric links, influence the different flooding protocols.

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The objective is to minimize the total cost of the network-wide broadcast, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based on a simplicial complex model that allows us to capture the broadcast nature of the wireless medium and the heterogeneity across radios and channels. Specifically, we show that broadcasting in multi-radio multi-channel ad hoc networks can be formulated as a minimum spanning problem in simplicial complexes. We establish the NP-completeness of the minimum spanning problem and propose two approximation algorithms with order-optimal performance guarantee. The first approximation algorithm converts the minimum spanning problem in simplical complexes to a minimum connected set cover (MCSC) problem. The second algorithm converts it to a node-weighted Steiner tree problem under the classic graph model. These two algorithms offer tradeoffs between performance and time-complexity. In a broader context, this work appears to be the first that studies the minimum spanning problem in simplicial complexes and weighted MCSC problem.

A distributed resource discovery algorithm for P2P grids

Centralized or hierarchical administration of the classical grid resource discovery approaches is unable to efficiently manage the highly dynamic large-scale grid environments. Peer-to-peer (P2P) overlay represents a dynamic, scalable, and decentralized prospect of the grids. Structured P2P methods do not fully support the multi-attribute range queries and unstructured P2P resource discovery methods suffer from the network-wide broadcast storm problem. In this paper, a decentralized learning automata-based resource discovery algorithm is proposed for large-scale P2P grids. The proposed method supports the multi-attribute range queries and forwards the resource queries through the shortest path ending at the grid peers more likely having the requested resource. Several simulation experiments are conducted to show the efficiency of the proposed algorithm. Numerical results reveal the superiority of the proposed model over the other methods in terms of the average hop count, average hit ratio, and control message overhead.

A voice for the voiceless

We propose a new application for mobile ad hoc networks (MANETs) – community radio. We argue how MANETS help overcome important limitations in how community radio is currently operationalized. We identify critical design elements for a MANET based community radio service and propose a broad architecture for the same. We then investigate a most critical issue – the choice of the network wide broadcast protocol for the audio content. We identify desired characteristics of a community radio broadcasting service. We choose and evaluate eight popular broadcasting protocols on these characteristics, to find the protocols most suited for our application.

Performance improvements for network-wide broadcast with instantaneous network information

We study the performance of network-wide broadcasting as a function of the information implicitly available at nodes from neighbourhood transmissions. We term this set of instantaneous information as network information. Our discussion is focused on stateless broadcasting algorithms in which nodes decide on their forwarding behaviour based on the available network information. While stateless broadcasting schemes in the existing literature use various design guidelines that take advantage of specific aspects of the information, we develop a unified analytical model by characterizing the information available during different stages of broadcasting. Thus, our results are applicable to all stateless algorithms. We analyze broadcasting performance in terms of the transmission probability and redundancy of transmissions. Subsequently, we use our results to obtain insights on the feasibility conditions governing algorithm design depending on the network density and costs. While the first part of the work considers ideal channel conditions modeled as a unit disk graph (UDG), we subsequently enhance the model using a quasi-unit disk graph model (QUDG) to understand the effect of dynamic channel conditions.

An experimental investigation of optimized flooding protocols using a wireless sensor network testbed

In addition to unicast routing, most wireless multi-hop networks also need network-wide broadcasting. In this paper, we investigate Blind Flooding and two different types of optimized flooding protocols: Counter-Based Broadcasting (CBB) and a neighbor knowledge-based flooding protocol called Prioritized Flooding with Self-Pruning (PFS). The latter is investigated in more detail. We test both protocols in a real wireless multi-hop network based on sensor motes and compare their performance. To the best of our knowledge, this is the first time optimized flooding protocols that support mobility are being tested and measured in a real wireless network. We outline problems found when using the protocols in real wireless networks and how to alleviate the encountered problems. The final results indicate that PFS and CBB achieved significant reduction of retransmissions compared to Blind Flooding and that they have comparable performance. We also combine these two protocols and show how this leads to further performance improvements.

Reliable and Efficient Broadcasting in Asymmetric Mobile Ad Hoc Networks Using Minimized Forward Node List Algorithm

Problem statement: Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. Unlike in a wired network, a packet transmitted by a node in ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (Forwarding nodes) used as the cost criterion for broadcasting. Approach: This study proposes a reliable and efficient broadcasting algorithm using minimized forward node list algorithm which uses 2-hop neighborhood information more effectively to reduce redundant transmissions in asymmetric Mobile Ad hoc networks that guarantees full delivery. Among the 1-hop neighbors of the sender, only selected forwarding nodes retransmit the broadcast message. Forwarding nodes are selected such a way that to cover the uncovered 2-hop neighbors. Results: Simulation results show that the proposed broadcasting algorithm provides high delivery ratio, low broadcast forward ratio, low overhead and minimized delay. Conclusion: In this study, reliable and efficient broadcasting algorithm in asymmetric Mobile Ad Hoc Networks using minimized forward node list algorithm has been proposed which provides low forward ratio, high delivery ratio while suppressing broadcast redundancy.

Reliable and Efficient Algorithm for Broadcasting in Asymmetric Mobile Ad hoc Networks

Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. Unlike in a wired network, a packet transmitted by a node in ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (Forwarding nodes) used as the cost criterion for broadcasting. The broadcast operation, as a fundamental service in mobile ad hoc networks (MANETs), is prone to the broadcast storm problem if forwarding nodes are not carefully designated. The forward node selection has been studied extensively in undirected graphs in which each node has the same transmission range. In practice, the transmission ranges of all nodes are not necessarily equal. This thesis proposes a reliable and efficient localized broadcasting algorithm using 2-hop neighborhood information more effectively to reduce redundant transmissions in asymmetric Mobile Ad hoc networks that guarantees full delivery. Among the 1-hop neighbors of the sender, only selected forwarding nodes retransmit the broadcast message. Forwarding nodes are selected such a way that to cover the uncovered 2-hop neighbors. The retransmissions of the forwarding nodes are received by the sender as the confirmation of their reception of the packet. The non forwarding 1-hop neighbors of the sender only acknowledge the reception of the broadcast. If the sender does not detect all its forwarding nodes retransmissions and non forwarding nodes acknowledgements, it will resend the packet until the maximum number of retries is reached. Simulation results show that the proposed broadcast algorithm provides good broadcast delivery ratio with low overhead and minimum latency.