Low-cost Communication Networks Research Articles

Neighbor Discovery Optimization for Big Data Analysis in Low-Power, Low-Cost Communication Networks

Big data analysis generally consists of the gathering and processing of raw data and producing meaningful information from this data. These days, large collections of sensors, smart phones, and electronic devices are all connected in the network. One of the primary features of these devices is low-power consumption and low cost. Power consumption is one of the important research concerns in low-power, low-cost communication networks such as sensor networks. A primary feature of sensor networks is a distributed and autonomous system. Therefore, all network devices in this type of network maintain the network connectivity by themselves using limited energy resources. When they are deployed in the area of interest, the first step for neighbor discovery involves the identification of neighboring nodes for connection and communication. Most wireless sensors utilize a power-saving mechanism by powering on the system if it is off, and vice versa. The neighbor discovery process becomes a power-consuming task if two neighboring nodes do not know when their partner wakes up and sleeps. In this paper, we consider the optimization of the neighbor discovery to reduce the power consumption in wireless sensor networks and propose an energy-efficient neighbor discovery scheme by adapting symmetric block designs, combining block designs, and utilizing the concept of activating nodes based on the multiples of a specific number. The performance evaluation demonstrates that the proposed neighbor discovery algorithm outperforms other competitive approaches by analyzing the wasted awakening slots numerically.

The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks

It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objective is to minimize the costs of transmission routes and the disconnected monetary or informational profits. Initially, we note that the PCSTP is MAX SNP-hard. Then, we propose some post-processing techniques to improve suboptimal solutions to PCSTP. Based on these techniques, we propose two fast heuristic algorithms: the first one is a quasilinear time heuristic algorithm that is faster and consumes less memory than other algorithms; and the second one is an improvement of a stateof-the-art polynomial time heuristic algorithm that can find high-quality solutions at a speed that is only inferior to the first one. We demonstrate the competitiveness of our heuristic algorithms by comparing them with the state-of-the-art ones on the largest existing benchmark instances (169 800 vertices and 338 551 edges). Moreover, we generate new instances that are even larger (1 000 000 vertices and 10 000 000 edges) to further demonstrate their advantages in large networks. The state-ofthe-art algorithms are too slow to find high-quality solutions for instances of this size, whereas our new heuristic algorithms can do this in around 6 to 45s on a personal computer. Ultimately, we apply our post-processing techniques to update the bestknown solution for a notoriously difficult benchmark instance to show that they can improve near-optimal solutions to PCSTP. In conclusion, we demonstrate the usefulness of our heuristic algorithms and post-processing techniques for designing large and low-cost communication networks.

A new architecture for application-aware cognitive multihop wireless networks

In this article, we propose a new architecture for AC-MWN. Cognitive radio is a technique to adaptively use the spectrum so that the resource can be used more efficiently in a low-cost way. A multihop wireless network can be deployed quickly and flexibly without fixed infrastructure. In our proposed new architecture, we study backbone routing schemes with network cognition, and a routing scheme with network coding and spectrum adaptation. A testbed is implemented to test the proposed schemes for AC-MWN. In addition to basic measurements, we implement a video streaming application based on the proposed AC-MWN architecture using cognitive radios. Preliminary results demonstrate that the proposed AC-MWN is applicable, and is valuable for future low-cost and flexible communication networks.

Thin Watts-Strogatz networks

A modified version of the Watts-Strogatz (WS) network model is proposed, in which the number of shortcuts scales with the network size N as Nalpha, with alpha < 1. In these networks, the ratio of the number of shortcuts to the network size approaches zero as N --> infinity, whereas in the original WS model, this ratio is constant. We call such networks "thin Watts-Strogatz networks." We show that even though the fraction of shortcuts becomes vanishingly small for large networks, they still cause a kind of small-world effect, in the sense that the length L of the network increases sublinearly with the size. We develop a mean-field theory for these networks, which predicts that the length scales as N1-alpha ln N for large N. We also study how a search using only local information works in thin WS networks. We find that the search performance is enhanced compared to the regular network, and we predict that the search time tau scales as N1-alpha/2. These theoretical results are tested using numerical simulations. We comment on the possible relevance of thin WS networks for the design of high-performance low-cost communication networks.

Dependable communication synthesis for distributed embedded systems

Embedded control applications such as drive-by-wire in cars require dependable interaction between various sensors, processors, and actuators. This paper addresses the design of low-cost communication networks guaranteeing to meet both the performance and fault-tolerance requirements of such distributed applications. We develop a fault-tolerant allocation and scheduling method, which maps messages onto a low-cost multiple-bus system to ensure predictable inter-processor communication. The proposed method targets time-division multiple access (TDMA) communication protocols, and is applicable to protocols such as FlexRay and TTP which have recently emerged as possible networking standards for embedded systems such as automobile controllers. Finally, we present a case study involving some advanced automotive control applications to show that our approach uses the available network bandwidth efficiently to guarantee message deadlines.

The critical satellite technical issues of future pervasive broadband low-cost communication networks

Using a baseline design for a 30/20 GHz system, this paper addresses the critical technical issues of signal waveform design, projected spacecraft technology, satellite launch options and satellite cost. With DPCM (differential pulse-coded modulation) video signal encoding, 32 Mb/s user-to-user data rate per channel, 10% overhead, two orthogonal polarizations, and crosstalk loss limited to 1 dB, TFM (tamed frequency modulation—a type of QPSK) permits about 75 channels/GHz of frequency allocation, i.e. about twice the capacity possible with MSK or SFSK (types of QPSK). The BOM (beginning of mission) weight and power of a baseline 400-channel multi-beam satellite is about 1800 kg and 5000 W. Each 35 Mb/s channel can support 1–10 video channels depending on the signal processing at the ground terminals. These weight and power estimates assume hardened digital logic, composite material for a multibeam antenna structure, high-efficiency solar cells (45 W/kg), NiH 2 batteries and 10W/20 GHz power amplifiers. If more speculative late-1980s solar cell technology is assumed, then the BOM weight decreases about 10–15%. Using the Space Transportation System being developed by NASA, geosynchronous deployment options are shown as a function of communications capacity. Based on a cost model for large communication satellites, the total space segment cost of two active satellites and one spare would be about $485M. This system would have a peak capacity of 14 Gb/s or 400-35 Mb/s simultaneous one-way channels. Demonstration and/or initial system (ground plus space) costs would be significantly less. It is concluded that the above baseline satellite appears to be technically feasible in the late-1980s.