Node Data Transmission Research Articles

Securing RF Communication Using AES-256 Symmetric Encryption: A Performance Evaluation

Radio Frequency (RF) communication plays a vital role for sensor node data transmission, which typically runs on top of lightweight protocol such as Constrained Application (CoAP) and Trivial File Transfer Protocol (TFTP). Introducing a cryptographic scheme to the process is known to be the common and most efficient method to protect RF communication. This paper presents the performance comparison of AES-encrypted data transmission over RF communication via Raspberry Pi boards, experimented on a client-server architecture. The performance analysis is measured based on throughput metric and the transmission time delay when sending three types of payload which are, a plaintext data, a ciphertext with padding and a ciphertext without padding. The result from the study indicates that there is a significant difference in data transmission time between the three types of data due to the data expansion factor. The result also showed that adding padding to the ciphertext has increased the data size slightly but not significant enough to affect transmission time of ciphertext.

Securing RF Communication Using AES-256 Symmetric Encryption: a Performance Evaluation

Radio Frequency (RF) communication plays a vital role for sensor node data transmission, which typically runs on top of lightweight protocol such as Constrained Application (CoAP) and Trivial File Transfer Protocol (TFTP). Introducing a cryptographic scheme to the process is known to be the common and most efficient method to protect RF communication. This paper presents the performance comparison of AES-encrypted data transmission over RF communication via Raspberry Pi boards, experimented on a client-server architecture. The performance analysis is measured based on throughput metric and the transmission time delay when sending three types of payload which are, a plaintext data, a ciphertext with padding and a ciphertext without padding. The result from the study indicates that there is a significant difference in data transmission time between the three types of data due to the data expansion factor. The result also showed that adding padding to the ciphertext has increased the data size slightly but not significant enough to affect transmission time of ciphertext.

Maximizing the Network Life Time Based on Energy Efficient Routing in Ad Hoc Networks

The maximization of a networks lifetime is an important part of research in the present scenario. In an ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper the data transfer from source to destination is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator. The simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.

Performance of Cognitive Radio Sensor Networks Using Hybrid Automatic Repeat ReQuest: Stop-and-Wait

The enormous developments in the field of wireless communication technologies have made the unlicensed spectrum bands crowded, resulting uncontrolled interference to the traditional wireless network applications. On the other hand, licensed spectrum bands are almost completely allocated to the licensed users also known as Primary users (PUs). This dilemma became a blackhole for the upcoming innovative wireless network applications. To mitigate this problem, the cognitive radio (CR) concept emerges as a promising solution for reducing the spectrum scarcity issue. The CR network is a low cost solution for efficient utilization of the spectrum by allowing secondary users (SUs) to exploit the unoccupied licensed spectrum. In this paper, we model the PU’s utilization activity by a two-state Discrete-Time-Markov Chain (DTMC) (i.e., Free and busy states), for identifying the temporarily unoccupied spectrum bands,. Furthermore, we propose a Cognitive Radio Sense-and-Wait assisted HARQ scheme, which enables the Cluster Head (CH) to perform sensing operation for the sake of determining the PU’s activity. Once the channel is found in free state, the CH advertise control signals to the member nodes for data transmission relying on Stop-and-Wait Hybrid- Automatic Repeat-Request (SW-HARQ). By contrast, when the channel is occupied by the PU, the CH waits and start sensing again. Additionally, the proposed CRSW assisted HARQ scheme is analytical modeled, based on which the closed-form expressions are derived both for average block delay and throughput. Finally, the correctness of the closed-form expressions are confirmed by the simulation results. It is also clear from the performance results that the level of PU utilization and the reliability of the PU channel have great influence on the delay and throughput of CRSW assisted HARQ model.

A trusted attestation mechanism for the sensing nodes of Internet of Things based on dynamic trusted measurement

Internet of things has been widely applied to industrial control, smart city and environmental protection, in these application scenarios, sensing node needs to make real-time response to the feedback control of the application layer. Therefore, it is necessary to monitor whether or not awareness nodes are trusted in real time, but the existing mechanisms for trusted certification lack the real-time measurement and tracking of the sensing node. To solve the above problems, this paper proposes a dynamic metric based authentication mechanism for sensing nodes of Internet of things. Firstly, the dynamic trustworthiness measure of the sensing nodes is carried out by introducing the computational function such as the trust function, the trustworthiness risk assessment function, the feedback control function and the active function of the sensing node. The dynamic trustworthiness measure of sensing nodes from multiple dimensions can effectively describe the change of trusted value of sensing nodes. Then, on the basis of this, a trusted attestation based on node trusted measure is realized by using the revocable group signature mechanism of local verifier. The mechanism has anonymity, unforgeability and traceability, which is proved the security in the standard model. Simulation experiments show that the proposed trusted attestation mechanism is flexible, practical and efficient and has better attack resistance. It can effectively guarantee the reliable data transmission of nodes and realize the dynamic tracking of node reliability, which has a lower impact on system performance.

Physical-traffic attentive vigorous routing (P-TAVR) and hot-spot detection to reduce the bottleneck in WSN

Minimizing the duration of data transmission is one of the major challenges in the wireless sensor communication. The sensor nodes in the networks take certain duration for observing the nearby sensor devices. Prominent factors such as broadcast storms, low bandwidth, multicasting, artificial congestion, etc can cause the bottleneck, results in data loss. In order to reduce the bottleneck in the sensor networks, physical traffic attentive vigorous routing protocol (P-TAVR) is proposed. This protocol will reduce the bottleneck effect by detecting the hot-spots thus reducing the network traffic. The proposed method is presented with three different phases such as Run-up, Set-up, Routing and detection phases. With the use of physical knowledge in this protocol, the location as well as the energy of every other sensor node is known by all the sensor nodes in the stream. In addition, an efficient modified routing algorithm is presented to select the cluster head nearer to the sink next hop. So that, in case of the bottleneck, the nodes are capable of determining the best possible routes with higher energy nodes for data transmission. Since the protocols utilized by the WSNs are application oriented; three classes such as data-centric, hierarchical and location-based classes are investigated. The simulation tool used here is Network Simulator 2 and the comparison has been made with AODV, MintRoute and TADR. The parameters such as End to End Delay, Throughput, Energy Consumption and Packet delivery ratio have been investigated for two cases such as increasing simulation time and increasing density. The results show that P-TAVR provides higher efficiency and throughput among the existing methods.

An Energy-Aware and Void-Avoidable Routing Protocol for Underwater Sensor Networks

Underwater sensor networks are facing a great challenge in designing a routing protocol with longer network lifetime and higher packet delivery rate under the complex underwater environment. In this paper, we propose an energy-aware and void-avoidable routing protocol (EAVARP). EAVARP includes layering phase and data collection phase. During the layering phase, concentric shells are built around sink node, and sensor nodes are distributed on different shells. Sink node performs hierarchical tasks periodically to ensure the validity and real-time of the topology. It makes EAVARP apply to dynamic network environment. During the data collection phase, data packets are forwarded based on different concentric shells through opportunistic directional forwarding strategy (ODFS), even if there are voids. The ODFS takes into account the remaining energy and data transmission of nodes in the same shell, and avoids cyclic transmission, flooding, and voids. The verification and analysis of simulation results show the effectiveness of our proposed EAVARP in terms of selecting performance matrics in comparison to existing routing protocols.

Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable routing in ad hoc networks.

Best Communication Node Election for well-organized Path in Flat Topology

<p>There has been an increasing attentiveness in the uses of sensor networks. Because sensors are normally controlled in on-board power supply, proficient supervision of the network is essential in improving the life of the sensor.<strong> </strong>The majority research protocols objective at offering link breakage reducing and mitigating from the same. Yet, selecting the well-organized communication do all the beneficial to the transmission process thus demonstrating better improvement in the network performance. In this article, we propose Best Communication Node Election for well-organized Path in Flat Topology The main goal of this<strong> </strong>work is to choose the best data transmission node in flat topology for improve the multi hop routing. This scheme, the best communication node selection based on Path Metric and this Path Metric is measured by the packet obtained rate, dropped rate, latency rate and node energy. This scheme provide guarantees quality of Service in the network.</p>

Adaptive access mechanism with delta estimation algorithm of traffic loads for supporting weighted priority in IEEE 802.11e WLANs

Focusing on weighted throughput fairness that nodes get throughput proportions according to priority levels in IEEE 802.11e WLANs, we propose an adaptive and full-distributed access mechanism with delta estimation algorithm of traffic loads. We deduce a linear adjustment rule of Contention Window (CW) about traffic loads, which connects parameters of access mechanism with dynamic network conditions. To support weighted priority levels (WPLs) of throughput proportions, we introduce a priority index to restrict number of successful data transmission of nodes with different priority levels for accurate calculation of channel status information. And then, we give a delta estimation algorithm of traffic loads, which can reduce fluctuations of estimated results around true values. By setting different thresholds corresponding to the WPLs, each node can obtain suitable sizes of CW for better aggregated throughput even as the variations of traffic loads in networks. The selected sizes of CW determine the attempt probability of channel access, which guarantees the weighted fairness of throughput proportions corresponding to WPLs. The simulation results confirm the validity and good scalability of the proposed access mechanism with different ratios of node number between multiple priority levels.

Trust attestation mechanism for the sensing layer nodes of Internet of Things

The main function of Internet of Things is to collect and transmit data. At present, the data transmission in Internet of Things lacks effective trust attestation mechanism and trust traceability mechanism of data source. To solve the above problems, a trust attestation mechanism for sensing layer nodes is presented. First a trusted group is established, and the node which is going to join the group needs to attest its identity and key attributes to the higher level node. Then the dynamic trust measurement value of the node can be obtained by measuring the node data transmission behavior. Finally the node encapsulates the key attributes and trust measurement value to use short message group signature to attest its trust to the challenger. This mechanism can measure the data sending and receiving behaviors of sensing nodes and track the data source, and it does not expose the privacy information of nodes and the sensing nodes can be traced effectively. The trust measurement for sensing nodes and verification is applicable to Internet of Things and the simulation experiment shows the trust attestation mechanism is flexible, practical and efficient. Besides, it can accurately and quickly identify the malicious nodes at the same time. The impact on the system performance is negligible.

Improving the Network Life Time Based on Energy Efficient Routing in Ad Hoc Networks

<p align="justify">The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks. </p>

Cross Layer Analysis of P2MP Hybrid FSO/RF Network

This paper presents and analyzes a point-tomultipoint (P2MP) network that uses a number of freespace optical (FSO) links for data transmission from the central node to the different remote nodes of the network. A common backup radio frequency (RF) link can be used by the central node for data transmission to any remote node in case any one of the FSO links fails. Each remote node is assigned a transmit buffer at the central node. Considering the transmission link from the central node to a tagged remote node, we study various performance metrics. Specifically,we study the throughput from the central node to the tagged node, the average transmit buffer size, the symbol queuing delay in the transmit buffer, the efficiency of the queuing system, the symbol loss probability, and the RF link utilization. Numerical examples are presented to compare the performance of the proposed P2MP hybrid FSO/RF network with that of a P2MP FSO-only network and show that the P2MP hybrid FSO/RF network achieves considerable performance improvement over the P2MP FSO-only network.

Self Organized Quantum Key Authentication Technique for Secure Data Communication in Mobile Ad Hoc Network

Background /Objectives: To improve the security in Mobile Ad Hoc network (MANET) by means of a Self Organized Quantum Key Authentication (SO-QKA). Methods/Statistical Analysis: The key objective of SO-QKA technique is to improve data security and mobile node authentication in MANET. Initially, SO-QKA technique generates quantum key for mobile node data transmission along the route path in MANET. Next, SO-QKA technique formulates self organized key for every mobile node with its quantum key for corresponding data transmission at specific instances. With the help of generated self organized key, SO-QKA technique finds secure route for transmitting the data in MANET. Finally, SOQKA technique is performs key matching at the destination node where the verification of the mobile node is checked with the mobile node id of self organized key and data authentication is verified with quantum key and destination id. Findings: Experimental evaluation of SO-QKA technique is done with the performance metrics such as data loss rate, data transmission rate, security, execution time. Experimental analysis shows that the SO-QKA technique is able to improve the security and also improves the data transmission rate comparable to the state-of-the-art works. Applications/ Improvements: It can be further enlarged with implementation of new algorithm model with different parameters which improves high authentication and confidentiality.

无线传感器网络中基于模糊分簇的入侵检测算法

当无线传感器节点被应用到输电线路检测等领域时，由于其自身的计算能力有限、传输环境的开放性等因素，通常容易遭受到攻击。攻击节点通过捕获无线传感器网中的正常节点来获得节点中的有用信息(包括节点位置、密钥、节点身份)并加以复制构成一个能发起各种内部攻击的克隆节点，从而获取网络内部更为机密的信息。为了解决这类问题，我们提出了基于探测克隆节点存在的入侵检测算法(IDA)。在这种算法中，首先，我们提出基于加权变异系数的模糊均值分簇算法并对监测网络进行分簇。然后，我们选择功耗较小的节点作为监测节点(Witness node)，这些监测节点在簇内全覆盖地监测数据传输节点和簇头节点是否被克隆。在监测数据传输节点时，通过分析错失探测概率和有效吞吐量来确定簇内的数据传输节点是否被克隆。在检测簇头节点时，通过设置合适的报警阈值来确定簇头节点是否被克隆。仿真结果表明所提出的入侵检测算法在选择合适的编码函数时，错误探测概率会减小50%以上，网络平均能耗降低20%。 When wireless sensor nodes are applied to the transmission line testing or other areas, they are often easily attacked due to the limited computation capability and the open data transmission environment. Attack nodes can obtain the useful information of nodes (including node location, secret key, and node identity) by capturing the normal nodes in the network, and then copy the information to become clone nodes that can take various internal attacks so that they can obtain more secure information. To solve the problem, we propose an intrusion detection algorithm (IDA) based on detecting the existence of clone nodes. In this algorithm, firstly, we propose the weighted variation coefficient based fuzzy mean clustering algorithm and cluster the networks by the proposed clustering algorithm. Secondly, we choose some nodes with less energy consumption as witness nodes. The witness nodes will monitor the whole network to determine whether the data transmission nodes and the cluster head nodes are replicated. Then, when the witness nodes monitor the data transmission nodes, IDA algorithm will determine whether the data transmission nodes are cloned within the cluster by analyzing the miss detection probability and the effective throughput. In the monitoring of cluster head nodes, IDA algorithm will determine whether the cluster head nodes are replicated by setting the alarm threshold. The simulation results show that our IDA algorithm will decrease the miss detection probability greatly to 50% and reduce the average energy consumption to 20% by choosing appropriate coding function.

LRP: Link quality‐aware queue‐based spectral clustering routing protocol for underwater acoustic sensor networks

SummaryRecently, underwater acoustic sensor networks (UASNs) have been considered as a promising approach for monitoring and exploring the oceans in lieu of traditional underwater wireline instruments. As a result, a broad range of applications exists ranging from oil industry to aquaculture and includes oceanographic data collection, disaster prevention, offshore exploration, assisted navigation, tactical surveillance, and pollution monitoring. However, the unique characteristics of underwater acoustic communication channels, such as high bit error rate, limited bandwidth, and variable delay, lead to a large number of packet drops, low throughput, and significant waste of energy because of packets retransmission in these applications. Hence, designing an efficient and reliable data communication protocol between sensor nodes and the sink is crucial for successful data transmission in underwater applications. Accordingly, this paper is intended to introduce a novel nature‐inspired evolutionary link quality‐aware queue‐based spectral clustering routing protocol for UASN‐based underwater applications. Because of its distributed nature, link quality‐aware queue‐based spectral clustering routing protocol successfully distributes network data traffic load evenly in harsh underwater environments and avoids hotspot problems that occur near the sink. In addition, because of its double check mechanism for signal to noise ratio and Euclidean distance, it adopts opportunistically and provides reliable dynamic cluster‐based routing architecture in the entire network. To sum up, the proposed approach successfully finds the best forwarding relay node for data transmission and avoids path loops and packet losses in both sparse and densely deployed UASNs. Our experimental results obtained in a set of extensive simulation studies verify that the proposed protocol performs better than the existing routing protocols in terms of data delivery ratio, overall network throughput, end‐to‐end delay, and energy efficiency.

High-responsivity 40 Gbit/s InGaAs/InP PIN photodetectors integrated on silicon-on-insulator waveguide circuits**Project supported by the High-Tech Research and Development Program of China (Nos. 2015AA016904, 2015AA012302), the National Basic Research Program of China (Nos. 2012CB933503, 2013CB932904), and the National Natural Foundation of China (Nos. 61274069, 61176053, 61021003, 61435002).

This paper presents a high-responsivity and high-speed InGaAs/InP PIN photodetector integrated onto the silicon waveguide substrate utilizing the divinyltetramethyldisiloxane-benzocyclobutene (DVS-BCB) adhesive bonding method. A grating coupler is adopted to couple light from the fiber to the silicon waveguide. Light in the silicon photonic waveguide is evanescently coupled into the photodetector. The integrated photodetector structure is first simulated using the FDTD (finite difference time domain) solutions software and the simulation results show a detection efficiency of 95%. According to the simulation result, the integrated photodetector is fabricated. The measured responsivity of the fabricated integrated photodetector with a detection length of 30 μm is 0.89 A/W excluding the coupling loss between the fiber and the grating coupler and the silicon propagation loss at the wavelength of 1550 nm with a reverse bias voltage of 3 V. Measured 3-dB bandwidth is 27 GHz using the Lightwave Component Analyzer (LCA). The eye diagram signal test results indicate that the photodetector can operate at a high speed of 40 Gbit/s. The integrated photodetector is of great significance in the silicon-based optoelectronic integrated chip which can be applied to the optical communication and the super node data transmission chip of the high-performance computer.

IMPROVED EAACK FOR INTRUSION DETECTION SYSTEM

Today Mobile Ad-hoc networks (MANETs) are preferred in many applications because of its self-configuring nature and dynamic topology. Sending node in MANETs rely on intermediate nodes for data transmission to remote nodes. This poses serious security threats. There is a necessity of an intrusion detection system to ensure secure message transmission in MANETs. Many Intrusion Detection Systems (IDS) like Watchdog, TWO ACKnowledgement (TWOACK), Adaptive ACKnowledgement (AACK) and Enhanced Adaptive ACKnowledgement (EAACK) have been proposed for this purpose. Of these IDS, EAACK is found to perform better. EAACK is purely acknowledgement based. Hence there should be a mechanism to validate the acknowledgements. This paper aims at improving performance of EAACK by using hybrid cryptography to validate the sending and receiving nodes in place of Digital Signature Algorithm (DSA) and Rivest Shamir and Adelman algorithm (RSA) that is used in existing EAACK. In hybrid cryptographic key exchange algorithm, a combination of symmetric and asymmetric key cryptographic algorithm (AES and RSA) is used. When compared with its contemporary EAACK, Improved EAACK (IEAACK) achieves smaller network overhead.To simulate the IEAACK environment, NS2 simulator is used. IEAACKovercomes the problems of existing IDS.

Analysis of Existing Trust Based Routing Schemes Used in Wireless Network

Wireless networks are vulnerable to many security attacks as they use wireless media and a node has to depend on unknown intermediate nodes for data transmission. Cryptographic algorithms used for wired network cannot work efficiently in wireless network, as in wireless network nodes are mobile and battery operated. Nodes may also have limited resources available. So, to detect malicious activities on node and improve stability of route while routing in mobile ad hoc network, trust-based routing is used. Communication parameters used in calculating trust value in most of existing trust based protocol (wireless network) are number of successful session or packet forwarded between two nodes, number of packet dropped or delayed, response time, battery life, mobility of node etc. This paper provides analysis of existing trust based routing by surveying current “sate of the art” work in this area. This paper also proposed a new parameter (number of route error message sent by a node) of a wireless node which can affect the network performance and can be used to calculate trust value.

Relay-Assisted Primary and Secondary Transmissions in Cognitive Radio Networks

We assume a set of cognitive relay nodes that assists both primary and secondary transmissions in a time-slotted cognitive radio networks. To regulate the channel access of the various nodes in the network, we propose an overlapped spectrum sensing strategy for channel sensing, where the secondary source node senses the channel from the beginning of the time slot and the cognitive relay nodes sense the channel for double the sensing time used by the secondary source node to detect the activities of both the primary and secondary source nodes. Hence, the secondary source node has an intrinsic priority over the relay nodes. The relay nodes help both the primary user and the secondary user to deliver their unsuccessfully decoded packets at their destinations. In a given time slot, the scheduled relay node for data transmission starts its transmission when both the primary and secondary users are sensed to be inactive (i.e. have no data to transmit). We propose two optimization-based formulations with quality-of-service (QoS) constraints involving average queueing delay and average service rate requirements.We investigate both cases of perfect and imperfect spectrum sensing. To further enhance the usersʼ QoS requirements, we propose three packet decoding strategies at the relay nodes and compare their performance. We derive an upper bound on the secondary queue average service rate to determine which decoding strategy can achieve that bound. Our numerical results show the benefits of relaying and its ability to enhance the performance of both the primary and secondary users. Moreover, the performance of the proposed schemes is close to the derived upper bound.