Field-based Routing Research Articles

Fine-Grained Boundary Conditions in Field-Based Routing

In the realm of industrial wireless mesh networks, an efficient routing protocol is highly demanded to play a crucial role in ensuring that packets are efficiently directed along shorter and congestion-free routes toward gateways. Field-based routing has emerged as a promising solution to tackle these network challenges. This routing approach draws inspiration from physics and employs a differential equation to model its behavior in finding efficient routes. Given the fundamental significance of boundary conditions in physics, where they play an essential role in shaping the solutions to the equation, exploring the impact of boundary conditions on field-based routing behavior within network domains becomes highly significant. However, despite their influence, the impact of boundary conditions has remained unexplored in existing studies on field-based routing. In this context, our work explores the boundary condition problem and introduces new advanced fine-grained boundary conditions for field-based routing. We demonstrate the superior performance of our proposed scheme, highlighting the substantial role of boundary conditions in network behavior. Our work holds significant value in that it explores the boundary condition problem, an aspect largely overlooked in previous research, and provides a viable solution, underscoring its crucial importance in routing enhancement.

Traffic aware field-based routing for wireless sensor networks

Route estimation process often involves significant message exchanges among wireless sensor nodes while selecting the least cost path. Nodes along this path handle more traffic that leads to death of battery powered nodes and shortening network life. Thus, routing mechanisms for wireless sensor network (WSN) must be traffic aware and at the same time, the alternate route(s) incur less delay overhead. This paper considers a query-driven application scenario in WSN where the sink diffuses query over the network to fetch information. A novel field-based routing (FBR) mechanism is proposed that inherits the physical properties of Coulomb’s law for point charges in free space. It defines a distance field parameter corresponding to each sensor node with respect to the sink. The sink being the negatively charged particle the packets from sensor nodes (positively charged particle) flow towards the field generating sink. The algorithm considers energy depletion rate for estimating the virtual potential field at nodes so as to avoid the nodes having less remaining energy. Further, the gradient updation is based on the local information which results in less message complexity (O(n)) and low computation overhead, which is comparable to the best available approaches. NS-2 based simulation demonstrates a significant enhancement in network lifetime, increased packet reception ratio and reduction in energy dissipation rate making the FBR mechanism suitable for WSN.

MAPLE: Mobility support using asymmetric transmit power in low-power and lossy networks

With the proliferation of emerging Internet of Things (IoT) devices and applications, mobility is becoming an integral part of low-power and lossy networks (LLNs). However, most LLN protocols have not yet focused on the support for mobility with an excuse of resource constraints. Some work that do provide mobility support fail to consider radio duty-cycling, control overhead, or memory usage, which are critical on resource-limited lowpower devices. In this paper, we introduce MAPLE, an asymmetric transmit power-based routing architecture that leverages a single resource-rich LLN border router. MAPLE supports mobility in duty-cycled LLNs using received signal strength indicator (RSSI) gradient field-based routing. High-power transmission of the gateway not only allows LLN endpoints to be synchronized for low duty-cycle operation, but also establishes an RSSI gradient field which can be exploited for opportunistic routing without a need for any neighbor or routing table. This eliminates the scalability problem due to memory limitation, and provides a responsive routing metric without control overhead. MAPLE also addresses the RSSI local maximum problem through local adaptation. We implement MAPLE on a low-power embedded platform, and evaluate through experimental measurements on a real multihop LLN testbed consisting of 31 low-power ZigBee nodes and 1 high-power gateway. We show that MAPLE improves the performance of mobile devices in LLN by 27.2%/55.7% and 17.9% in terms of both uplink/downlink reliability and energy efficiency, respectively.

Security of electrostatic field persistent routing: Attacks and defense mechanisms

Electrostatic field-based routing (EFR) is a form of geographical multi-path routing where packets are routed along (a collection of) paths corresponding to electrostatic field lines defined by the charges associated with source and sink nodes. Ideally, EFR provides an efficient and scalable solution to the workload balancing problem, thereby promoting a more even depletion of the energy resources among the participating sensors. However, in addition to not being adaptable to the realistic settings that consider the actual nodes’ locations, it also assumes that nodes behave in a cooperative manner. This, in turn, renders it vulnerable to various attacks.In this article, we investigate the security aspects of EFR-based routing protocols, focusing on an instance of EFR called multi-pole field persistent routing (MP-FPR). While advancing the naïve EFR in terms of the better location-awareness energy balancing, MP-FPR is still susceptible to the same family of attacks. We provide systematic identification of the attacks that can target different components of the protocol, and propose an extended variant, secure multi-pole field persistent routing (SMP-FPR) which incorporates a collection of defense mechanisms. We present extensive experimental evaluations of the impact of the different attacks and the effectiveness of the proposed defense mechanisms.

English

Wireless Mesh Networks (WMNs) are the hybrid networks having fixed infrastructure of gateways to provide the Internet connectivity to its fixed or mobile clients. It has redundant links to provide reliable communication. Anycast is an important service for the group communication. Field based routing is getting popularity due to its robustness and simplicity. In this paper, we have studies on the security issues for the anycast service based upon the field based routing. The scheme has been studied to eliminate the effects of the external intruders and also against the internal selfish nodes. The modified secure field based routing strategies have been proposed to safeguard the legitimate traffic from these external and internal intruders. The simulation results in OMNet++ simulator shows that the proposed techniques outperform the normal routing mechanisms. Key words: Anycast, field base routing, security.

Secure Routing and Scheduling in Ad-Hoc Cognitive Radio Networks for Public Safety

Public safety communication is a critical component of day-to-day life. The authors propose a flexible and resilient communication system using an ad-hoc cognitive radio network that fully utilizes the available spectrum resources. Two main components of the network are addressed: route discovery, i.e., identifying multiple paths from the source to the destination, and scheduling for these paths, i.e., efficiently allocating available resources to achieve an optimal transmission. Field-based routing is adopted. The authors also introduce a secure authentication and routing mechanism for this network. The authentication component leverages the social aspect of public safety communications and mitigates most basic wireless attacks. A hybrid novel reputation scheme is then proposed to allow for efficient routing in the presence of adversaries. The authors show through simulations that the proposed secure framework can efficiently reduce the transmission delay, be robust to the dynamics of channel availability, and mitigate routing attacks in a cognitive radio network.

On Optimization and Security of Multimedia Communication in Wireless Mesh Networks

Wireless mesh networks (WMNs) are new type of networks in which every node can communicates to all neighboring nodes to enhance network reliability and performance. Network traffic cost optimization and its security in wireless mesh network is a challenging task. The concept of field based routing (FBR) is gaining popularity because it uses a little information to route the packets. These routing algorithms are robust, inexpensive and scalable. Authors believe that the FBR is the better choice for the multimedia communication in wireless mesh networks. Because FBR exchanges little information for building and maintenance of the routing tables. Regardless of robustness and scalability of the FBR it is also prone to different active and passive attacks. In this paper we first study that how multimedia communication can be done using FBR (optimization) and then take some security measures to eliminate the risk of intruder intervention in such communication. Multimedia FBR and its security has been extensively studied using Omnet++ network simulator to identify and isolate the malicious node and to prevent the traffic flows from various active and passive attacks.