The Bus Goes Wireless: Routing-Free Data Collection with QoS Guarantees in Sensor Networks

Abstract—We present the low-power wireless bus (LWB), a new communication paradigm for QoS-aware data collection in lowpower sensor networks. The LWB maps all communication onto network floods by using Glossy, an efficient flooding architecture for wireless sensor networks. Therefore, unlike current solutions, the LWB requires no information of the network topology, and inherently supports networks with mobile nodes and multiple data sinks. A LWB prototype implemented in Contiki guarantees bounded end-to-end communication delay and duplicate-free, inorder packet delivery—key QoS requirements in many control and mission-critical applications. Experiments on two testbeds demonstrate that the LWB prototype outperforms state-of-theart data collection and link layer protocols, in terms of reliability and energy efficiency. For instance, we measure an average radio duty cycle of 1.69 % and an overall data yield of 99.97 % in a typical data collection scenario with 85 sensor nodes on Twist. I

Impact Analysis of Different Scheduling and Retransmission Techniques on an Underwater Routing Protocol

Despite many advances in the area of Underwater Wireless Sensor Networks (UWSN) during the last years, still many challenges need to be successfully tackled before large-scale deployment of underwater sensor networks becomes a reality. UWSNs usually employ acoustic channels for communications, which compared with radio-frequency channels, allow much lower bandwidths and have longer propagation delays. In the past, different methods have been proposed to define how a node must acquire the channel in order to start a transmission. Given the large propagation delays of underwater communication channels, a TDMA-based approach may need big time-guards. On the other hand, the very same large propagation delay increases the occurrence of the hidden terminal problem in a CSMA-based approach. In this paper, impacts of utilization of different scheduling and retransmission techniques on an underwater routing protocol will be analyzed. This analysis, in which energy consumption, packet delay, number of duplicate packets, and packet loss are considered, will be carried out by means of simulation using the Network Simulator 3 and a subset of EDETA (Energy-efficient aDaptive hiErarchical and robusT Architecture) routing protocol recently adapted to UWSN

Low bandwidth, image transmission amateur microsatellites

Some recent amateur packet satellites carry open access digital store- and-forward transponders which implement common communication protocols known as PACSAT PROTOCOL SUITE. These standard protocols have improved a "friendly" interaction of different users of packet satellites throughout the world, hence, making packet satellites a more realistic means of communication. Application developments using packet satellites have resulted in an interesting electronic-mail network for medical applications, the Health-Net, where medical professionals in developing countries exchange information with their counterparts. The introduction of a higher rate of data transmission at 9600 baud rate compared to the traditional 1200 baud rate has improved the performance of these satellites. However, this new rate demands some modifications to the existing standard radio receivers and transmitters widely used. In particular, in view of the fact that, digital image technology has transformed microcomputers into powerful visual communication tools, this type of networks can be used for visual communications. Unfortunately, due to the orbit mechanics of satellites involved, the nature of communication protocols and the speed of data transmission currently available, transmission of image data through such networks is difficult in terms of transmission time. This thesis describes the application development of still-continuous tone image transmissions for visual communications, through such networks. It focuses on how to start a packet satellite transmission ground-station, and minimising the transmission time required for image data uploading and downloading, by compressing image data to remove visually insignificant data in the images. Image compression techniques, the internationally recognised JPEG compression technique and a novel compression technique based on FRACTAL, which are known to achieve higher compression ratios are used and compared in this work. Although expensive, FRACTAL compression technique has many advantages over the JPEG compression technique. However, owing to the cost effectiveness of the JPEG compression technique, it is recommended in this thesis for image compression application through Health-Net communication network

Smart detection and prevention procedure for DoS attack in MANET

A self-organized wireless communication short-lived network containing collection of mobile nodes is mobile ad hoc network (MANET). The mobile nodes communicate with each other by wireless radio links without the use of any pre-established fixed communication network infrastructure or centralized administration, such as base stations or access points, and with no human intervention. In addition, this network has potential applications in conference, disaster relief, and battlefield scenario, and have received important attention in current years. There is some security concern that increases fear of attacks on the mobile ad-hoc network. The mobility of the NODE in a MANET poses many security problems and vulnerable to different types of security attacks than conventional wired and wireless networks. The causes of these issues are due to their open medium, dynamic network topology, absence of central administration, distributed cooperation, constrained capability, and lack of clear line of defense. Without proper security, mobile hosts are easily captured, compromised, and attacked by malicious nodes. Malicious nodes behavior may deliberately disrupt the network so that the whole network will be suffering from packet losses. One of the major concerns in mobile ad-hoc networks is a traffic DoS attack in which the traffic is choked by the malicious node which denied network services for the user. Mobile ad-hoc networks must have a safe path for transmission and correspondence which is a serious testing and indispensable issue. So as to provide secure communication and transmission, the scientist worked explicitly on the security issues in versatile impromptu organizations and many secure directing conventions and security measures within the networks were proposed. The goal of the work is to study DoS attacks and how it can be detected in the network. Existing methodologies for finding a malicious node that causes traffic jamming is based on node’s retains value. The proposed approach finds a malicious node using reliability value determined by the broadcast reliability packet (RL Packet). In this approach at the initial level, every node has zero reliability value, specific time slice, and transmission starts with a packet termed as reliability packet, node who responded properly in specific time, increases its reliability value and those nodes who do not respond in a specific time decreases their reliability value and if it goes to less than zero then announced that it’s a malicious node. Reliability approach makes service availability and retransmission time

Intelligent packet error prediction for enhanced radio network performance

In cellular communication systems, for example 4G and 5G, quite often data packets (in user-plane payload) fail to successfully deliver to the user equipment (UE). Because upon failure, a re-transmission of the data packet is required by the network, these failed data packets introduce latency to the network. In some applications, such latency might be tolerable by the UE, but in applications that require ultra reliable low latency communication (URLCC), time latency becomes a critical issue. In order to cope with this issue, typically wireless networks rely on re-transmissions upon receiver request or use naïve approach like packet duplication to transmit data packets more than once to ensure successful transmission of at least one data packet without any error. In this thesis, we explore the feasibility of designing an intelligent solution to this issue by using network data with machine learning and neural networks to predict if a data packet would fail to transmit in the next transmission time interval (TTI). Our research includes a detailed systematic study on which radio parameters to choose from the raw data (log files) and data preprocessing. From our experiments we also determine how many past values of these radio parameters can be useful to predict the packet failure in the next TTI. Moreover, we enlist the network parameters useful to make such a prediction and compare their contribution in the model. Finally, we show that an intelligent packet error prediction can be done using machine learning that forecasts the packet failure in the next TTI with sufficient accuracy. We compare the performance of different machine learning algorithms and show that boosted decision trees (XGBoost) perform the best on the given dataset. Compared to naïve approaches used in cellular communication to avoid packet failures, our solution based on intelligent packet error prediction indicates promising practical applications in cellular network for enhanced radio network performance, particularly in URLLC

An Efficient Communication Abstraction for Dense Wireless Networks

In this paper we study the problem of developing efficient distributed algorithms for dense wireless networks. For many problems in this setting, fast solutions must leverage the reality that radio signals fade with distance, which can be exploited to enable concurrent communication among multiple sender/receiver pairs. To simplify the development of these algorithms we describe a new communication abstraction called FadingMAC which exposes the benefits of this concurrent communication, but also hides the details of the underlying low-level radio signal behavior. This approach splits efforts between those who develop useful algorithms that run on the abstraction, and those who implement the abstraction in concrete low-level wireless models, or on real hardware. After defining FadingMAC, we describe and analyze an efficient implementation of the abstraction in a standard low-level SINR-style network model. We then describe solutions to the following problems that run on the abstraction: max, min, sum, and mean computed over input values; process renaming; consensus and leader election; and optimal packet scheduling. Combining our abstraction implementation with these applications that run on the abstraction, we obtain near-optimal solutions to these problems in our low-level SINR model - significantly advancing the known results for distributed algorithms in this setting. Of equal importance to these concrete bounds, however, is the general idea advanced by this paper: as wireless networks become more dense, both theoreticians and practitioners must explore new communication abstractions that can help tame this density

Future broadband access network challenges

Copyright @ 2010 IEEEThe optical and wireless communication systems convergence will activate the potential capacity of photonic technology for providing the expected growth in interactive video, voice communication and data traffic services that are cost effective and a green communication service. The last decade growth of the broadband internet projects the number of active users will grow to over 2 billion globally by the end of 2014. Enabling the abandoned capacity of photonic signal processing is the promising solution for seamless transportation of the future consumer traffic demand. In this paper, the future traffic growth of the internet, wireless worldwide subscribers, and the end-users during the last and next decades is investigated. The challenges of the traditional access networks and Radio over Fiber solution are presented