A new phase for screening redundant broadcast nodes in source-independent broadcasting protocols

Following the distributed approach, source-independent broadcasting protocols select a subset of nodes in a network as broadcasting nodes to cover the entire network. The selection of broadcasting nodes is performed prior to actual message transmission. These broadcasting nodes collectively form a connected dominating set or CDS. Aiming at finding a minimum CDS, existing source-independent broadcasting protocols consist of two phases. In this paper, we propose to add a third phase to eliminate unnecessary nodes in a CDS while ensuring all remaining nodes are still connected. We call it the redundant node screening phase. This paper shows that this new phase is a very important element that has been ignored by existing source-independent broadcasting protocols. When applying the new phase on existing broadcasting protocols, the savings in terms of number of nodes in the CDS could be as high as 21% in a 1000m x 1000m network of 20 nodes. © 2011 IEEE.published_or_final_versionThe 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of the IEEE ICC, 2011, p. 1-

The Internet of Everything

In the era before IoT, the world wide web, internet, web 2.0 and social media made people’s lives comfortable by providing web services and enabling access personal data irrespective of their location. Further, to save time and improve efficiency, there is a need for machine to machine communication, automation, smart computing and ubiquitous access to personal devices. This need gave birth to the phenomenon of Internet of Things (IoT) and further to the concept of Internet of Everything (IoE)

The Internet of Everything

In the era before IoT, the world wide web, internet, web 2.0 and social media made people’s lives comfortable by providing web services and enabling access personal data irrespective of their location. Further, to save time and improve efficiency, there is a need for machine to machine communication, automation, smart computing and ubiquitous access to personal devices. This need gave birth to the phenomenon of Internet of Things (IoT) and further to the concept of Internet of Everything (IoE)

Reliability Analysis of the Hypercube Architecture.

This dissertation presents improved techniques for analyzing network-connected (NCF), 2-connected (2CF), task-based (TBF), and subcube (SF) functionality measures in a hypercube multiprocessor with faulty processing elements (PE) and/or communication elements (CE). These measures help study system-level fault tolerance issues and relate to various application modes in the hypercube. Solutions discussed in the text fall into probabilistic and deterministic models. The probabilistic measure assumes a stochastic graph of the hypercube where PE\u27s and/or CE\u27s may fail with certain probabilities, while the deterministic model considers that some system components are already failed and aims to determine the system functionality. For probabilistic model, MIL-HDBK-217F is used to predict PE and CE failure rates for an Intel iPSC system. First, a technique called CAREL is presented. A proof of its correctness is included in an appendix. Using the shelling ordering concept, CAREL is shown to solve the exact probabilistic NCF measure for a hypercube in time polynomial in the number of spanning trees. However, this number increases exponentially in the hypercube dimension. This dissertation, then, aims to more efficiently obtain lower and upper bounds on the measures. Algorithms, presented in the text, generate tighter bounds than had been obtained previously and run in time polynomial in the cube dimension. The proposed algorithms for probabilistic 2CF measure consider PE and/or CE failures. In attempting to evaluate deterministic measures, a hybrid method for fault tolerant broadcasting in the hypercube is proposed. This method combines the favorable features of redundant and non-redundant techniques. A generalized result on the deterministic TBF measure for the hypercube is then described. Two distributed algorithms are proposed to identify the largest operational subcubes in a hypercube C\sb{n} with faulty PE\u27s. Method 1, called LOS1, requires a list of faulty components and utilizes the CMB operator of CAREL to solve the problem. In case the number of unavailable nodes (faulty or busy) increases, an alternative distributed approach, called LOS2, processes m available nodes in O(mn) time. The proposed techniques are simple and efficient

Future benefits and applications of intelligent on-board processing to VSAT services

The trends and roles of VSAT services in the year 2010 time frame are examined based on an overall network and service model for that period. An estimate of the VSAT traffic is then made and the service and general network requirements are identified. In order to accommodate these traffic needs, four satellite VSAT architectures based on the use of fixed or scanning multibeam antennas in conjunction with IF switching or onboard regeneration and baseband processing are suggested. The performance of each of these architectures is assessed and the key enabling technologies are identified

Wireless sensor networks using network coding for structural health monitoring

Wireless Sensor Networks (WSNs) have been deployed for the purpose of structural health monitoring (SHM) of civil engineering structures, e.g. bridges. SHM applications can potentially produce a high volume of sensing data, which consumes much transmission power and thus decreases the lifetime of the battery-run networks. We employ the network coding technique to improve the network efficiency and prolong its lifetime. By increasing the transmission power, we change the node connectivity and control the number of nodes that can overhear transmitted messages so as to hopefully realize the capacity gain by use of network coding. In Chapter 1, we present the background, to enable the reader to understand the need for SHM, advantages and drawbacks of WSNs and potential the application of network coding techniques has. In Chapter 2 we provide a review of related research explaining how it relates to our work, and why it is not fully applicable in our case. In Chapter 3, we propose to control transmission power as a means to adjust the number of nodes that can overhear a message transmission by a neighbouring node. However, too much of the overhearing by high power transmission consumes aggressively limited battery energy. We investigate the interplay between transmission power and network coding operations in Chapter 4. We show that our solution reduces the overall volume of data transfer, thus leading to significant energy savings and prolonged network lifetime. We present the mathematical analysis of our proposed algorithm. By simulation, we also study the trade-offs between overhearing and power consumption for the network coding scheme. In Chapter 5, we propose a methodology for the optimal placement of sensor nodes in linear network topologies (e.g., along the length of a bridge), that aims to minimise the link connectivity problems and maximise the lifetime of the network. Both simple packet relay and network coding are considered for the routing of the collected data packets towards two sink nodes positioned at both ends of the bridge. Our mathematical analysis, verified by simulation results, shows that the proposed methodology can lead to significant energy saving and prolong the lifetime of the underlying wireless sensor network. Chapter 6 is dedicated to the delay analysis. We analytically calculate the gains in terms of packet delay obtained by the use of network coding in linear multi-hop wireless sensor network topologies. Moreover, we calculate the exact packet delay (from the packet generation time to the time it is delivered to the sink nodes) as a function of the location of the source sensor node within the linear network. The derived packet delay distribution formulas have been verified by simulations and can provide a benchmark for the delay performance of linear sensor networks. In the Chapter 7, we propose an adaptive version of network coding based algorithm. In the case of packet loss, nodes do not necessary retransmit messages as they are able to internally decide how to cope with the situation. The goal of this algorithm is to reduce the power consumption, and decrease delays whenever it can. This algorithm achieves the delay similar to that of three-hop direct-connectivity version of the deterministic algorithm, and consumes power almost like one-hop direct-connectivity version of deterministic algorithm. In very poor channel conditions, this protocol outperforms the deterministic algorithm both in terms of delay and power consumption. In Chapter 8, we explain the direction of our future work. Particularly, we are interested in the application of combined TDMA/FDMA technique to our algorithm.Open Acces

Performance analysis of communication model on position based routing protocol: Review analysis

Research on the Vanet system has its own challenges and obstacles with the communication system between nodes being the main issue. Four categories in the Vanet system topology, namely position based routing protocols, broadcast based routing protocols, cluster based routing protocols and multicast/geocast routing protocols, have fundamental differences, especially in the concept of sending data and information between nodes. For this reason, in this study, the selection of standardization and integration of data delivery between nodes is of particular relevance. The ability to send data properly in busy and fast traffic conditions is another challenge. For this, there are many variables that must be considered to improve communication between nodes

Advanced information processing system: The Army fault tolerant architecture conceptual study. Volume 2: Army fault tolerant architecture design and analysis

Described here is the Army Fault Tolerant Architecture (AFTA) hardware architecture and components and the operating system. The architectural and operational theory of the AFTA Fault Tolerant Data Bus is discussed. The test and maintenance strategy developed for use in fielded AFTA installations is presented. An approach to be used in reducing the probability of AFTA failure due to common mode faults is described. Analytical models for AFTA performance, reliability, availability, life cycle cost, weight, power, and volume are developed. An approach is presented for using VHSIC Hardware Description Language (VHDL) to describe and design AFTA's developmental hardware. A plan is described for verifying and validating key AFTA concepts during the Dem/Val phase. Analytical models and partial mission requirements are used to generate AFTA configurations for the TF/TA/NOE and Ground Vehicle missions

A co-design-based reliable low-latency and energy-efficient transmission protocol for uwsns

Recently, underwater wireless sensor networks (UWSNs) have been considered as a powerful technique for many applications. However, acoustic communications in UWSNs bring in huge QoS issues for time-critical applications. Additionally, excessive control packets and multiple copies during the data transmission process exacerbate this challenge. Faced with these problems, we propose a reliable low-latency and energy-efficient transmission protocol for dense 3D underwater wireless sensor networks to improve the QoS of UWSNs. The proposed protocol exploits fewer control packets and reduces data-packet copies effectively through the co-design of routing and media access control (MAC) protocols. The co-design method is divided into two steps. First, the number of handshakes in the MAC process will be greatly reduced via our forwarding-set routing strategy under the guarantee of reliability. Second, with the help of information from the MAC process, network-update messages can be used to replace control packages through mobility prediction when choosing a route. Simulation results show that the proposed protocol has a considerably higher reliability, and lower latency and energy consumption in comparison with existing transmission protocols for a dense underwater wireless sensor network.This work was supported by the National Natural Science Foundation of China (NSFC) (Grant Nos. U19A2061, 61772228 and 61902143), National key research and development program of China (Grant No. 2017YFC1502306)