1
|
Unfairness of Random Access with Collision Avoidance in Industrial Internet of Things Networks. SENSORS 2021; 21:s21217135. [PMID: 34770441 PMCID: PMC8587720 DOI: 10.3390/s21217135] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/18/2021] [Revised: 10/19/2021] [Accepted: 10/23/2021] [Indexed: 11/25/2022]
Abstract
This paper is focused on the analysis of unfairness of random media access in Local Operating Networks (LON), which is one of the commercial platforms of the Industrial Internet of Things (IIoT). The unfairness in accessing the LON channel is introduced by a collision avoidance mechanism in the predictive p-persistent CSMA protocol adopted at the media access control layer. The study on the bandwidth share in predictive p-persistent CSMA calls for the analysis of multiple memoryless backoff. In this paper, it is shown that the channel access in LON systems is unfair in the short term for medium traffic load conditions, and in the long term for heavy loaded networks. Furthermore, it is explained that the average bandwidth allocated to a particular node is determined implicitly by the load scenario, while an actual node bandwidth fluctuates in time according to stochastic dynamics of the predictive p-persistent CSMA. Next, it is formally proven that the average bandwidth available to a node is a linear function of its backoff state and does not depend on backoff states of the other stations. Finally, it is demonstrated that possibly unfair bandwidth share in LON networks determined implicitly by load scenario is stable because, with lowering a fraction of actual network bandwidth accessible by a given station, the probability to decrease it in the future also drops.
Collapse
|
2
|
CSNOMA: Carrier Sense Non-Orthogonal Multiple Access. SENSORS 2020; 20:s20185024. [PMID: 32899639 PMCID: PMC7571147 DOI: 10.3390/s20185024] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 08/08/2020] [Revised: 09/01/2020] [Accepted: 09/02/2020] [Indexed: 12/02/2022]
Abstract
In this paper, we investigate the possibility of the cross-layer design of a distributed random access scheme with considering physical (PHY) and multiple access control (MAC) layers, which utilizes the interference cancellation technique. In this regard, we propose a new multiple access protocol, named carrier sense non-orthogonal multiple access (CSNOMA). We consider the spatially randomly distributed interferers to realistically capture the effect of interference. The proposed protocol shows better area spectral efficiency than carrier sense multiple access (CSMA), as the node density increases. We also present a practical signaling design compatible with IEEE 802.11 DCF mode.
Collapse
|
3
|
Del-Valle-Soto C, Mex-Perera C, Monroy R, Nolazco-Flores JA. MPH-M, AODV-M and DSR-M Performance Evaluation under Jamming Attacks. SENSORS 2017; 17:s17071573. [PMID: 28678180 PMCID: PMC5539809 DOI: 10.3390/s17071573] [Citation(s) in RCA: 11] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/29/2017] [Revised: 06/14/2017] [Accepted: 06/23/2017] [Indexed: 11/24/2022]
Abstract
In this work, we present the design of a mitigation scheme for jamming attacks integrated to the routing protocols MPH, AODV, and DSR. The resulting protocols are named MPH-M (Multi-Parent Hierarchical - Modified), AODV-M (Ad hoc On Demand Distance Vector - Modified), and DSR-M (Dynamic Source Routing - Modified). For the mitigation algorithm, if the detection algorithm running locally in each node produces a positive result then the node is isolated; second, the routing protocol adapts their paths avoiding the isolated nodes. We evaluated how jamming attacks affect different metrics for all these modified protocols. The metrics we employ to detect jamming attack are number of packet retransmissions, number of CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) retries while waiting for an idle channel and the energy wasted by the node. The metrics to evaluate the performance of the modified routing protocols are the throughput and resilience of the system and the energy used by the nodes. We evaluated all the modified protocols when the attacker position was set near, middle and far of the collector node. The results of our evaluation show that performance for MPH-M is much better than AODV-M and DSR-M. For example, the node energy for MPH-M is 138.13% better than AODV-M and 126.07% better than DSR-M. Moreover, we also find that MPH-M benefits much more of the mitigation scheme than AODV-M and DSR-M. For example, the node energy consumption is 34.61% lower for MPH-M and only 3.92% and 3.42% for AODV-M and DSR-M, respectively. On throughput, the MPH protocol presents a packet reception efficiency at the collector node of 16.4% on to AODV and DSR when there is no mitigation mechanism. Moreover, MPH-M has an efficiency greater than 7.7% with respect to AODV-M and DSR-M when there is a mitigation scheme. In addition, we have that with the mitigation mechanism AODV-M and DSR-M do not present noticeable modification. However, MPH-M improves its efficiency by 8.4%. We also measure the resilience of these algorithms from the average packet re-transmissions perspective, and we find that MPH-M has around a 15% lower change rate than AODV-M and DSR-M. The MPH-M recovery time is 5 s faster than AODV-M and 2 s faster than DSR-M.
Collapse
Affiliation(s)
- Carolina Del-Valle-Soto
- Universidad Panamericana. Facultad de Ingeniería. Prolongación Calzada Circunvalación Poniente 49, Zapopan, Jalisco 45010, Mexico.
| | - Carlos Mex-Perera
- Telemática Telemetría y Radiofrecuencia, Francia 1717, Col. Moderna, Guadalajara 44190, Mexico.
| | - Raul Monroy
- Escuela de Ingeniería y Ciencias, Tecnologico de Monterrey, Campus Estado de México, Carretera al lago de Guadalupe Km 3.5, Col. Margarita M. de Juárez, Atizapán 52926, Mexico.
| | - Juan A Nolazco-Flores
- Department of Electrical and Computer Engineering, Tecnológico de Monterrey, Ave. Eugenio Garza Sada #2501 Sur, Monterrey 64849, Mexico.
| |
Collapse
|
4
|
Fang W, Zhang W, Xiao J, Yang Y, Chen W. A Source Anonymity-Based Lightweight Secure AODV Protocol for Fog-Based MANET. SENSORS 2017. [PMID: 28629142 PMCID: PMC5492458 DOI: 10.3390/s17061421] [Citation(s) in RCA: 21] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
Abstract
Fog-based MANET (Mobile Ad hoc networks) is a novel paradigm of a mobile ad hoc network with the advantages of both mobility and fog computing. Meanwhile, as traditional routing protocol, ad hoc on-demand distance vector (AODV) routing protocol has been applied widely in fog-based MANET. Currently, how to improve the transmission performance and enhance security are the two major aspects in AODV’s research field. However, the researches on joint energy efficiency and security seem to be seldom considered. In this paper, we propose a source anonymity-based lightweight secure AODV (SAL-SAODV) routing protocol to meet the above requirements. In SAL-SAODV protocol, source anonymous and secure transmitting schemes are proposed and applied. The scheme involves the following three parts: the source anonymity algorithm is employed to achieve the source node, without being tracked and located; the improved secure scheme based on the polynomial of CRC-4 is applied to substitute the RSA digital signature of SAODV and guarantee the data integrity, in addition to reducing the computation and energy consumption; the random delayed transmitting scheme (RDTM) is implemented to separate the check code and transmitted data, and achieve tamper-proof results. The simulation results show that the comprehensive performance of the proposed SAL-SAODV is a trade-off of the transmission performance, energy efficiency, and security, and better than AODV and SAODV.
Collapse
Affiliation(s)
- Weidong Fang
- Key Laboratory of Wireless Sensor Network & Communication, Shanghai Institute of Micro-system and Information Technology, Chinese Academy of Sciences, Shanghai 201800, China.
- Shanghai Research Center for Wireless Communication, Shanghai 201210, China.
| | - Wuxiong Zhang
- Key Laboratory of Wireless Sensor Network & Communication, Shanghai Institute of Micro-system and Information Technology, Chinese Academy of Sciences, Shanghai 201800, China.
- Shanghai Research Center for Wireless Communication, Shanghai 201210, China.
| | - Jinchao Xiao
- Guangzhou Shenyang Institute of Automation, Chinese Academy of Sciences, Guangzhou 511458, China.
| | - Yang Yang
- Key Laboratory of Wireless Sensor Network & Communication, Shanghai Institute of Micro-system and Information Technology, Chinese Academy of Sciences, Shanghai 201800, China.
- Shanghai Research Center for Wireless Communication, Shanghai 201210, China.
| | - Wei Chen
- School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China.
| |
Collapse
|
5
|
An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks. SENSORS 2015; 15:20316-54. [PMID: 26295236 PMCID: PMC4570424 DOI: 10.3390/s150820316] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 06/16/2015] [Revised: 08/07/2015] [Accepted: 08/10/2015] [Indexed: 11/21/2022]
Abstract
We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network.
Collapse
|
6
|
Zhang J, Jiang H, Huang Z, Chen C, Jiang H. Study of multi-armed bandits for energy conservation in cognitive radio sensor networks. SENSORS 2015; 15:9360-87. [PMID: 25905702 PMCID: PMC4431283 DOI: 10.3390/s150409360] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/09/2015] [Accepted: 04/15/2015] [Indexed: 11/16/2022]
Abstract
Technological advances have led to the emergence of wireless sensor nodes in wireless networks. Sensor nodes are usually battery powered and hence have strict energy constraints. As a result, energy conservation is very important in the wireless sensor network protocol design and the limited power resources are the biggest challenge in wireless network channels. Link adaptation techniques improve the link quality by adjusting medium access control (MAC) parameters such as frame size, data rate, and sleep time, thereby improving energy efficiency. In this paper we present an adaptive packet size strategy for energy efficient wireless sensor networks. The main goal is to reduce power consumption and extend the whole network life. In order to achieve this goal, the paper introduces the concept of a bounded MAB to find the optimal packet size to transfer by formulating different packet sizes for different arms under the channel condition. At the same time, in achieve fast convergence, we consider the bandwidth evaluation according to ACK. The experiment shows that the packet size is adaptive when the channel quality changes and our algorithm can obtain the optimal packet size. We observe that the MAB packet size adaptation scheme achieves the best energy efficiency across the whole simulation duration in comparison with the fixed frame size scheme, the random packet size and the extended Kalman filter (EKF).
Collapse
Affiliation(s)
- Juan Zhang
- Open Fund of Robot Technology Used for Special Environment Key Laboratory of Sichuan, Mianyang 621010, China.
- School of Information Engineering, Southwest University of Science and Technology, Mianyang 621010, China.
| | - Hong Jiang
- Open Fund of Robot Technology Used for Special Environment Key Laboratory of Sichuan, Mianyang 621010, China.
- School of Information Engineering, Southwest University of Science and Technology, Mianyang 621010, China.
| | - Zhenhua Huang
- School of Electronics and Information, Tongji University, Shanghai 201804, China.
| | - Chunmei Chen
- Open Fund of Robot Technology Used for Special Environment Key Laboratory of Sichuan, Mianyang 621010, China.
- School of Information Engineering, Southwest University of Science and Technology, Mianyang 621010, China.
| | - Hesong Jiang
- Open Fund of Robot Technology Used for Special Environment Key Laboratory of Sichuan, Mianyang 621010, China.
- School of Information Engineering, Southwest University of Science and Technology, Mianyang 621010, China.
| |
Collapse
|
7
|
On the routing protocol influence on the resilience of wireless sensor networks to jamming attacks. SENSORS 2015; 15:7619-49. [PMID: 25825979 PMCID: PMC4431270 DOI: 10.3390/s150407619] [Citation(s) in RCA: 15] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 11/30/2014] [Revised: 03/19/2015] [Accepted: 03/20/2015] [Indexed: 11/17/2022]
Abstract
In this work, we compare a recently proposed routing protocol, the multi-parent hierarchical (MPH) protocol, with two well-known protocols, the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). For this purpose, we have developed a simulator, which faithfully reifies the workings of a given protocol, considering a fixed, reconfigurable ad hoc network given by the number and location of participants, and general network conditions. We consider a scenario that can be found in a large number of wireless sensor network applications, a single sink node that collects all of the information generated by the sensors. The metrics used to compare the protocols were the number of packet retransmissions, carrier sense multiple access (CSMA) inner loop retries, the number of nodes answering the queries from the coordinator (sink) node and the energy consumption. We tested the network under ordinary (without attacks) conditions (and combinations thereof) and when it is subject to different types of jamming attacks (in particular, random and reactive jamming attacks), considering several positions for the jammer. Our results report that MPH has a greater ability to tolerate such attacks than DSR and AODV, since it minimizes and encapsulates the network segment under attack. The self-configuring capabilities of MPH derived from a combination of a proactive routes update, on a periodic-time basis, and a reactive behavior provide higher resilience while offering a better performance (overhead and energy consumption) than AODV and DSR, as shown in our simulation results.
Collapse
|