Routing Table Research Articles

Identification and eradication of attacker node in a mobile ad-hoc network environment using prediction model on delay factor

Mobile ad-hoc network (MANET) is a theoretical and experimental approach for achieving the applications to the best using VANETs. Given the mobility of nodes in the mobile ad-hoc networks, it is hard to depict the nature of the network or the structure of the network. With static nodes, it is easy to monitor a network. In a mobile environment, any node can come and join the network based on the distance covered by the entire network. A node that enters the region joins the network, while one that moves away leaves it and ceases participating in network communication. The routing table is updated, based on the movement of the nodes. Owing to the factors above, security fails to live up to expectations. Identifying a vulnerable node is a difficult proposition. This paper offers a prediction model based on the delay factor, which impacts the performance of the node and its network. The experimental results determine the malicious node. A malicious node is disconnected from the network.

Архітектура контролера вузла адаптивної мобільної мережі з аморфною топологією

The purpose of the article is to develop an adaptive mobile network node architecture with an amorphous topology. The article describes the host controller architecture. The concept of a mobile network is described. The mobile network is adaptive, self-organizing, and able to operate autonomously. The presented mobile network node controller architecture is the object swarm control system basis. A stack of mobile network protocols is presented, consisting of a control protocol, a data exchange protocol and a configuration protocol. The nodes of the network controllers interaction is carried out using several transceivers. The use of multiple transceivers made it possible to distribute data traffic, configuration traffic, and management traffic over different channels, which made it possible to carry out information exchange at the same time. The protocol stack is minimized. The functionality of the host and the network object (swarm) is completely separated. The topology of the mobile network is not deterministic, amorphous and changes when the network objects move in space. In this case, some connections are lost and others arise. The routing tables are constantly updated. The network in accordance with the laid down algorithm, is able to build the necessary topology and organize the necessary connections in order to complete the task with a swarm of objects. The network is capable of building packet retransmission chains for remote network objects. Thus, the implementation of a mobile network at its low cost allows solving a certain range of problems. The performer can be either a separate object associated with the operator through a swarm of repeaters, or a swarm of objects. In order to increase the efficiency of the formation of routing tables and minimize the cluster structures in a mobile network, it is advisable to use optimization algorithms based on set theory. The mobile network is designed to control a swarm of objects, which can be UAVs, robotic objects and control systems for various technological processes.

A Smart Real-Time Standalone Route Recognition System for Visually Impaired Persons

Visual Impairment is a common disability that results in poor or no eyesight, whose victims suffer inconveniences in performing their daily tasks. Visually impaired persons require some aids to interact with their environment safely. Existing navigation systems like electronic travel aids (ETAs) are mostly cloud-based and rely heavily on the internet and google map. This implies that systems deployment in locations with poor internet facilities and poorly structured environments is not feasible. This paper proposed a smart real-time standalone route recognition system for visually impaired persons. The proposed system makes use of a pedestrian route network, an interconnection of paths and their associated route tables, for providing directions of known locations in real-time for the user. Federal University of Technology (FUT), Minna, Gidan Kwanu campus was used as the case study. The result obtained from testing of the device search strategy on the field showed that the complexity of the algorithm used in searching for paths in the pedestrian network is , at worst-case scenario, where N is the number of paths available in the network. The accuracy of path recognition is 100%. This implies that the developed system is reliable and can be used in recognizing and navigating routes by the visual impaired in real-time.

Routing in Large-scale Dynamic Networks

The increasing volume of network-connected devices comprising Internet of Things and the variety of heterogeneous network architectures across these devices pose significant challenges to effective deployment and routing. In this article, we consider the adoption of probabilistic data structures to develop a novel Bloom Filter-based dual-layer inter-domain routing scheme. Our designed scheme implements internal and external routing layers in network gateways constructed upon the counting bloom filter and the original bloom filter. We first compare several representative structures in both theory and experimentation. We then propose our novel Bloom Filter-based dual-layer inter-domain routing scheme. In the design of the routing scheme, we consider issues related to the overall space cost and routing loop prevention, as well as present corresponding solutions. We also detail the principal structures and algorithms. Further, we conduct a theoretical analysis of the space efficiency of our proposed scheme compared to traditional routing with respect to the size of data packets and the size of routing tables, as well as in routing loop avoidance. Finally, via extensive performance evaluation, our experimental results demonstrate the effectiveness and efficiency of our proposed scheme.

Enhanced STR based geographic location in ZigBee wireless networks: a hybrid PSACO method

ABSTRACT In many resource-limited devices, ZigBee tree routing is widely utilised as it does not need any route discovery and routing table overhead through send a packet of destination. Therefore, packet follows a tree topology; thus, it may not give optimal routing path. This is fundamental limitation of ZigBee tree routing. This manuscript, establishes an enhanced shortcut tree routing-based geographic location (ESTRBGL) protocol, which implements close optimal routing path and obtain ZigBee tree routing benefits like less memory consumption as well as no discovery overhead route. The proposed routing algorithm is a combination of particle swarm optimisation (PSO) as well as ant colony optimisation (ACO) algorithm, named PSACO. Initially, for finding optimal routing path the ZTR has certain network issues like detour route as well as concentrated traffic impact, since rectify to establish ESTRBGL. Simulation outcomes display that established method extensively improves diverse network performance depend on throughput, packet delivery ratio, residual energy, delay as well as energy consumption. The results shows that proposed routing method has better throughput of 2.66%, 1.73%, 4.01%, 20.83%, 20.61%, and 95.71%, 95.88%, 95.89%, 95.88%, 95.90%, while comparing with Opportunistic Shortcut Tree Routing (OSTR) as well as Directional Opportunistic Shortcut Tree Routing (DOSTR).

A N ovel NOR Type TCAM Deploy D ual V T cell with OR Type Cascade Match Line Structure

We look over improvements in the schemes of large size content addressable memory (CAM). A CAM is a very important device that executes the routing table function within a single clock cycle in network router to transmit information over the network. CAMs are particularly popular in network switches to classify and sending information packets, they are also helpful in other different applications that require fast information retrieval from routing table. The primary CAM configuration challenge is to decrease power dissipation related with the lot of parallel activity in memory circuitry during search operation. As innovation going on in technology scaling, it continues minimizing the dynamic power dissipation of CAMs, however it also rises the leakage current of transistors. Thus, the static power is turning into a noteworthy bit of the whole power dissipation in CAMs. Here, we introduced a procedure which advantageous for high capacity Ternary Content Addressable Memory (TCAM) that minimize the static power dissipation in SRAM storage cell part and speed up activity in searching part of TCAM cell. We also divide whole memory into equivalent segments which improve performance of our design. We examine the different schemes and introduced the trade-offs of applying the techniques. Simulation and design have done by using Tanned EDA V.16 tool. For recreations of Low power TCAM structures we utilized predictive technology model (PTM) 45nm for high performance (HP) and low power (LP), which incorporate metal gate, high-k and stress effect of CMOS technology.

Geographical addressing strategy for space‐ground integrated network

SummaryTo provide a connection between low earth orbit (LEO) satellite network and terrestrial Internet, a geographical addressing strategy for LEO network is proposed in this paper. When the IP geo‐subnet is divided based on location, the terrestrial users inside and satellite routers above each subnet could be allocated and maintain IP addresses under the regulation of IP network. The addressing strategy is implemented in the first hop and last hop of packet transmission. This paper proves that the application of geo‐subnets could effectively reduce the route table size and generation time in large‐scale space‐ground integrated network as well as maintain the stability of route table when the user condition alters. The performance loss of abnormal addressing caused by the change of satellite coverage would decrease with the reduction of geo‐subnet area. However, the decrease rate would decline during the subnet subdivision and therefore has limited optimization for abnormal addressing. The routing broadcast strategy proposed in this paper could effectively reduce the system packet loss brought by abnormal user at the same geo‐subnet division. Simulation confirms that the geographical addressing strategy combined with routing broadcast optimization in this paper could achieve more than 90% network throughput while reducing 76% of the routing cost.

ARIOR: Adaptive Ranking Based Improved Opportunistic Routing in Wireless Sensor Networks

Adaptive ranking in opportunistic routings is known to significantly improve the performance over traditional opportunistic routing protocols in wireless networks using a volunteer node for energy efficiency. Wireless Sensor Networks (WSNs) mainly forward packets through neighbor nodes, which usually may go to sleep mode (when not in use) to improve the lifetime of the network. The sleep state of nodes is an infeasible mechanism because the nodes are awake continuously and are able to overhear other broadcasts. This paper presents a recently researched improved mechanism to determine the Cluster Head(CH) and set of nodes participating in routing. Node ranking resulted in the improved routing table for node selection to forward the packets towards the gateway was generated. By consistent performance modeling and network simulations, ARIOR algorithm exhibits improvements in terms of Message Success Rate(MSR), Packet Delivery Ratio(PDR) and Energy Consumption(CE) in comparison to existing Opportunistic Routing(OR) protocols.

Data Retention-Based Low Leakage Power TCAM for Network Packet Routing

The ternary content addressable memory (TCAM) is widely used in the routing table due to its high lookup performance. However, a large number of transistors would cause the power consumption of TCAM to be considerable. In this brief, a new state-preserved technique, named data retention based TCAM (DR-TCAM), is proposed to reduce the leakage power dissipated in the TCAM memory. According to the continuous feature of mask data, the DR-TCAM can dynamically adapt the power source of mask cells so as to reduce the TCAM leakage power. Particularly, the mask data wouldn’t be destroyed in the DR-TCAM. Based on TSMC 40nm technology, the simulation results show that the DR-TCAM performs better than the state-of-the-art works. Compared to the traditional TCAM design, the DR-TCAM can deliver a TCAM leakage power reduction of 41% for a collection of real routing tables. Besides, the total power reduction is about 12%.

STUDY METHODS FOR MONITORING OF TELECOMMUNICATION SYSTEMS

The article describes main steps for centralizing routing table databases. Advantages and disadvantages of databases formed at different levels of centralization are described. Main methods of forming routing tables are described. The advantages and disadvantages of each method are indicated. There are also examples of network protocols that are used to implement a particular method for generating databases about the network state. Possible hybrid methods are identified by combining standard methods for creating databases describing the network state. To ensure optimal operation of the telecommunications network, the optimal monitoring method should be selected based on the degree of centralization and the method for creating a database of routing tables. Depending on the scale of the network and the degree of centralization of its resources, it is needed to choose the best method for monitoring the network.

Novel Cluster Rotating and Routing Strategy for software defined Wireless Sensor Networks

The biggest problems faced by the software defined wireless sensor network are energy conservation and load balancing techniques which impose a high level of constraint. In general clustering is used in a network in order to decrease the use of energy thereby enhancing lifetime of the network. Hot spot problems are a common issue caused due to drainage of battery when there are more multi-hop networks that are close to the base station. In order to overcome this restriction, we have proposed the use of multilayer clustering architecture that is used to choose the intra and inter-cluster communication, rotation of cluster head and forwarding node. Using the routing table, the proposed methodology will be able to efficiently handle the rotation of the forwarder node. The rotation takes place based on the residual energy’s threshold levels and also exploits the non-forwarder node, backup forwarder node, forwarder node and decision maker node to enhance the routing strategy of the WSN. Testing and evaluation of the proposed work is done using C programming language and results show that this methodology has better results than EADUC and TLPER as far as hop count, communication and energy consumption are taken into consideration in the cluster formation.

Approximate Single-Source Fault Tolerant Shortest Path

Let G=(V,E) be an n -vertices m -edges directed graph with edge weights in the range [1, W ] for some parameter W , and sϵ V be a designated source. In this article, we address several variants of the problem of maintaining the (1+ε)-approximate shortest path from s to each v ϵ V { s } in the presence of a failure of an edge or a vertex. From the graph theory perspective, we show that G has a subgraph H with Õ(ε -1 } n log W ) edges such that for any x,vϵ V , the graph H \ x contains a path whose length is a (1+ε)-approximation of the length of the shortest path from s to v in G \ x . We show that the size of the subgraph H is optimal (up to logarithmic factors) by proving a lower bound of Ω (ε -1 n log W ) edges. Demetrescu, Thorup, Chowdhury, and Ramachandran (SICOMP 2008) showed that the size of a fault tolerant exact shortest path subgraph in weighted directed/undirected graphs is Ω ( m ). Parter and Peleg (ESA 2013) showed that even in the restricted case of unweighted undirected graphs, the size of any subgraph for the exact shortest path is at least Ω ( n 1.5 ). Therefore, a (1+ε)-approximation is the best one can hope for. We consider also the data structure problem and show that there exists an ϕ(ε -1 n log W ) size oracle that for any vϵ V reports a (1+ε)-approximate distance of v from s on a failure of any xϵ V in O(log log 1+ε ( nW )) time. We show that the size of the oracle is optimal (up to logarithmic factors) by proving a lower bound of Ω (ε -1 n log W log -1 n ). Finally, we present two distributed algorithms . We present a single-source routing scheme that can route on a (1+ε)-approximation of the shortest path from a fixed source s to any destination t in the presence of a fault. Each vertex has a label and a routing table of ϕ(ε -1 log W ) bits. We present also a labeling scheme that assigns each vertex a label of ϕ(ε -1 log W ) bits. For any two vertices x,vϵ V , the labeling scheme outputs a (1+ε)-approximation of the distance from s to v in G \ x using only the labels of x and v .

Improved Compact Routing Schemes for Random Interconnects

Random topology has been an increasingly favorable approach for designing interconnection networks, as it can provide a combination of low latency and incremental network growth that could not be provided by the traditional rigid topologies. However, the common shortest-path routing in a random interconnect poses a scalability problem, for it requires global network info to make routing decisions and so, the routing table size (RTS) can be very large. Therefore, this manuscript would aim to revisit the well-known research area of landmark-based compact routing and to improve the universal routing schemes for the specific case of random interconnects. It would propose new landmark-based compact routing schemes, using 2 heuristic techniques to select landmarks that are evenly spaced, which would reduce the RTS in the well-known Thorup and Zwick's scheme by up to 18% and produce a shorter average path length.

Energy-Efficient Precharge-Free Ternary Content Addressable Memory (TCAM) for High Search Rate Applications

Hardware search engines (HSEs) have been drawing significant attention in replacing software search algorithms in order to speed up location access and data association in modern systems. Content addressable memory (CAM) is one of the promising HSEs due to its parallel search accessibility. However, it is subjected to considerable dissipation which becomes severe while accessing many components including cells and associated matchlines (MLs) during every search. Ternary CAM (TCAM) based routing tables, especially employed in network systems for packet classification, has put a challenge to design energy-efficient architectures with high-performance and reliable look-up operation. Precharge-free CAM schemes are preferred solutions over precharge types to accomplish high-speed as well as low-power goals of associative memory design. In order to overcome the drawbacks of precharge based designs and also to improve performance during the search, we introduce a precharge-free ternary content addressable memory (PF-TCAM). The proposed searching approach enhances the rate of search by reducing half of the ML evaluation time as it eliminates precharge phase prior to every search by performing search in HALF clock cycle. A $32\times 16$ -bit proposed macro is designed using 45-nm CMOS technology and post-layout simulations at 1 V supply shows 56% and 63% energy efficiency improvements compared to conventional TCAM and compact TCAM respectively over 25 different search keys despite increasing evaluation speed by 50% with an area overhead of 1 transistor/cell over compact TCAM.

Implementation of a geographical routing scheme for low Earth orbiting satellite constellations using intersatellite links

SummaryA major problem for low Earth orbit (LEO) constellations with intersatellite links is the efficient routing of the data packets through such a highly dynamic network. In order to achieve a worldwide coverage even in remote areas and Internet access with a limited amount of gateway stations, intersatellite links are a promising approach. Since LEO constellations represent a distinct, highly dynamic routing environment, specific strategies are needed. To this end, a suitable geographical routing scheme is proposed and investigated in two Walker Star constellations. The proposed scheme targets reliable transmissions with low latency and high data rates. The approach is based on a geographical address identifier in Layer 2 of the communication stack. The globe is thus divided into geographical areas that determine this identifier in the MAC address of the terminals. As mobile terminals are considered, the MAC addressing scheme is flexible, whereas the IP addresses of the terminals remain static. This decoupling allows for flexibility in the choice of the address resolution scheme. Moreover, the geographical identifier in the MAC address enables fast routing table lookups and switching. The proposed routing scheme also takes possible overloads of the satellites due to traffic into account and applies a rerouting procedure. When a packet arrives in the geographical area of the destination terminal, a local rerouting scheme is applied if needed. The proposed approaches take handover events that possibly occur during a transmission into account. Furthermore, the scan angles of the satellites have been adapted to the constellations to provide full coverage and high elevation angles. So a robust and adaptable routing scheme is provided for a dynamic environment where satellites and terminals are constantly moving. The proposed definitions and procedures have been implemented in a system level simulator, which allows for comparisons with adjustable parameters in various scenarios. In this work, an Iridium‐like constellation and a megaconstellation are investigated and compared regarding the address resolution procedures, the average end‐to‐end transmission delay, and the dropping and rerouting rates. Additionally, the signaling overhead is compared with other approaches. The simulator and results of the simulations provide grounds for further research w.r.t. the routing in satellite constellations using intersatellite links.

A Learning-Based Approach to Intra-Domain QoS Routing

In traditional networks, routing table is essential for packet transmission due to the lack of the direction information about destination in the head of packet. However, it is feasible to make the address of device encode the routing information with the application of data technology. In this article, we propose new identities for networking routers -vectors, and a new routing principle based on these vectors is designed accordingly. These vectors encode the device distance information and serve as a pattern of the network topology. Then, routing decisions could be made by these vector calculations and only requirement of table query on the destination vector following the proposed routing principle. The proposed method is not limited in calculating the shortest path routing, but extend to solve the constrain routing problem. Besides, multi-paths routing is also available as long as multi-paths exist between the origin-destination pairs. The simulation results show that our proposed method works reliable and stable in routing tasks, and can achieve a remarkable performance when compared with the state-of-the-art work on the delay constrained least cost path (DCLC) problem.

Optimizing Routing Path Selection Method Particle Swarm Optimization

In view of the two shortcomings of the AODV routing protocol, they do not consider the bandwidth, delay and cost in the actual network, and the routing table has only one path from the basic node to the target node. This paper attempts to improve the AODV protocol by using particle swarm optimization. Through simulation experiments, this paper compares four improved particle swarm optimization algorithms, inertia weight, linear decline, shrinkage factor and chaos, and finds that ACPSO can find the optimal path faster and transmit data quickly. So, this paper uses chaotic particle swarm optimization (CACPSO) to improve AODV protocol. Finally, based on NS2 simulation platform, the improved AODV protocol is simulated and experimented. Different network environments are set up to test packet delivery rate, network delay and routing discovery frequency. The experimental results show that in the process of data transmission, the improved protocol has higher routing performance than AODV protocol, and can transmit data faster and more stably.

Seamless clustering multi-hop routing protocol based on improved artificial bee colony algorithm

An important issue in the mobile sink wireless sensor networks (MSWSNs) is sensor energy optimization. In order to alleviate the problem of unbalanced network load and high energy consumption in MSWSNs, we proposed a new data collection protocol in this paper: seamless clustering multi-hop routing protocol based on improved artificial bee colony algorithm (IABCP). Because of limited by the communication sensing range and intelligence of ordinary nodes, routing paths can only be constructed by crude methods. And the movement of the sink node will generate a large amount of energy consumption for locating the sink node. In order to solve this problem, we assign the task of routing table generation to the sink node, which will generate the routing table through the improved artificial bee colony algorithm. In addition, we adopt a new method to select cluster head (CH) nodes; node uses the average energy of the surrounding nodes and its own residual energy to calculate the claimed cluster head time. Moreover, we added a sub cluster head CH-β node. When the CH node reaches the number of replacement rounds, the CH-β node becomes CH directly. The simulation results show that our routing protocol is more robust compared with three other protocols.

Probability-based path discovery protocol for electromagnetic nano-networks

One of the major challenges for nano-network is the forfeit of communication protocols to exploit the potential communication between nano-machines forming fully operational nano-network. Because nano-machines face some restrictions such as limited processing power and confined computing capabilities, up-to-date nano-machines cannot perceive partial or full routing tables, which are the main decision-makers for data routing in legacy communication networks. The reason is that creating and updating routing tables continuously require adequate processing power with sufficient memory and computing capabilities, which is not the case of nano-nodes. So, new innovative routing schemes have to be proposed for nano-networks to deal with such extremely low resources. This paper focuses on decoupling the routing intelligence from nano-network towards a computational architecture using Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies by externalizing routing decisions and complex computations from nano-nodes to be fully compiled externally. Moreover, the paper proposes a probability-based path discovery protocol denoted by (PBPD) for electromagnetic nano-nodes suitable for dynamic nano-network applications. The performance of the proposed protocol is evaluated and compared with other routing protocols discussed in the literature. The proposed scheme provides low energy consumption inside nano-nodes and low computational complexity thanks to SDN/NFV system.

A multidimensional index for range queries over Cayley‐based DHT

AbstractThis paper studies indexing multidimensional data based on the Borel Cayley graph. In order to provide the scalable query method, a special distributed hash table based on Borel Cayley graph is applied to key‐value–based data‐storing system. By taking advantage of the two different representations for the same one Borel Cayley graph, we present an efficient way for distributed multidimensional queries. Compared with other ring‐like indexing method, experimental results demonstrate that Borel Cayley–based index method reduces the routing table length and improves the index maintenance efficiency.