Mobile ad-hoc networks (MANETs) are pervasive autonomous networks that will play a vital role in future Industrial Internet-of-Things communication, where smart devices will be connected in a ...completely distributed manner. However, due to lack of infrastructure and absence of centralized administration, MANETs are shrouded with various security threats. Some internal mobile nodes in these resource constrained networks may compromise the routing mechanism in order to launch denial-of-service attacks to carry out distinct kinds of packet forwarding misbehaviors. In order to address this issue, in our previous paper, we devised a trusted routing scheme with pattern discovery (TRS-PD), which identifies packet dropping adversaries in advance by monitoring and analyzing their behavior during route discovery phase. In this paper, we perform sensitivity analysis of TRS-PD which is carried out by varying values of different parameters in distinct network scenarios in the existence of three distinct packet dropping attacks. In addition, this work summarizes the attack-pattern discovery mechanism, trust model, and routing mechanism adopted by TRS-PD in order to counter the adversaries which follow certain attack patterns along with other adversaries. Experiments conducted with network simulator-2 indicate the correct choices of parameter values for distinct network scenarios.
The MANET packet routing method of geographic greedy forwarding involves the selection of distance reducing intermediate relays towards a destination. The efficacy of the greedy methods differs and ...varies; nevertheless, the algorithms are similar and process the same data at a forwarding node. Their commonalities potentially allow the online assignment of different methods for more efficient progress forwarding in heterogeneous MANET environments. We define a multimethod multi-greedypacket forwarding approach in this paper. Using the IPFIX packet flow measures, we demonstrate the multi-greedy scheme for the performance of repetitive packet routing tasks that permit exploration-exploitation application. The flows report reveal the optimal efficiency of each base greedy method in each flow which aggregates to the multi-greedy design. In comparison to the base methods, the case multi-greedy methods show considerable performance improvement in PDR, hop-count, and delay measures.
High-performance multicast packet switching technologies are evolving to meet the growing demand for scalability on the Internet and datacenters, etc. Implementing a high-performance switch/router ...relies on a polynomial-time group membership query algorithm within the Packet Forwarding Engines (PFEs) to determine whether a packet is forwarded through an egress. Among these, Bloom filter (BF)-based and Residue Number System (RNS)-based are being considered as two representatives of the membership query algorithms. However, both approaches suffer from some fatal weaknesses such as false-positive probability and time inefficiencies, especially for a carrier-grade PFE with high port-density features. According to similar properties of the RNS, we propose a simplified forwarding algorithm in this paper, named Per-Port Prime Filter Array (P3FA). The simulation results indicate that the P3FA can significantly improve space efficiencies under specific lower egress-diversities conditions. Under the same space constraints, P3FA improves multicast and unicast time efficiency by 1 to 4 orders of magnitude in the port-density 16-1024 range compared to previous works. Although it comes at the expense of hardware cost, it is still acceptable compared to recently improved previous work.
High-performance multicast-enabled packet forwarding engines (PFEs), as an essential component of high-end switches, use a polynomial-time membership query algorithm to determine which port(s) the ...data packet should be forwarded. The currently widely used query algorithm is Bloom Filter (BF), which has been proven to have many fatal flaws. Another error-free membership query algorithm includes Scalar-pair Vectors Routing Forwarding (SVRF), Fractional- N Scalar-pair Vectors Routing Forwarding (Frac- N SVRF), and the Per-Port Prime Filter Array (P 3 FA) also have some shortcomings in space and time efficiencies. In this paper, we proposed a hybrid strategy: Divaricate Heterogeneous SVRF (DH-SVRF) scheme, which based on the P 3 FA and Frac- N SVRF, which randomly divides all member ships into N groups, and each group has the same structure and is independent of each other to obtain higher time efficiency and space utilization. Finally, we also discussed the selection of the optimal egress-diversity threshold. Through mathematical modeling and simulation, we validate that the proposed DH-SVRF scheme is superior to the SVRF/Frac -N SVRF and traditional BF in terms of scalability, space utilization, and time efficiency in specific conditions such as appropriate egress-diversity thresholds.
. We propose an optical router architecture with contention resolution unit. This router operates with asynchronous and variable length packets. FIFO technique is chosen for packet priority. The ...proposed router is implemented with SOA-MZI gates. The contention resolution unit is tested with two separate strategies, namely the deflection routing and the wavelength conversion. Error-free transmission up to 100 Gbps is guaranteed for both strategies with a penalty around 1 dB for wavelength conversion.
Named data networking is a new communication paradigm for the future networking architecture, which shifts the networking from a host-oriented architecture to an information-centric one. Its data ...transmission is realized via name-based routing and forwarding. This, however, brings severe challenges to the scalability of the forwarding information base (FIB) because the name space is infinite and can be several orders of magnitude larger than the IP counterpart. This letter tries to mitigate the FIB explosion problem and achieve high-speed forwarding by adding route cache to the FIB design. We proposed two approaches to tackle the cache hiding problem rooted from the longest prefix matching on names of arbitrary length: the atomic caching that groups multiple overlapping prefixes as a unit for cache operation, and the on-the-fly caching that caches only the most specific prefixes. Trace-driven simulation using an HTTP request trace from China Mobile demonstrated the feasibility and effectiveness of our design.
Characterizing the topology of MANETs provides the means for packet routing protocols to perform adaptively and efficiently in the particular environments. We show that the geographic routing’s ...greedy packet forwarding distance dissimilarity distributions in relation to node size characterizes MANET topologies and supports efficient multi-greedy forwarding. The models we described, based on the average greedy packet forwarding distance measures, showed distinct distribution patterns of the dissimilarity indices when applied to the example multi-greedy routing environment consisting of the ELLIPSOID and the GREEDY forwarding metrics. The scheme demonstrates the potential for adaptive forwarding performance to improve successful packets delivery in environments of high node-size variations such as VANETs.
In WSN, nodes collect the information from the surrounding environment and transferring to base station. Multiple data transmission in a WSN causes the nodes near the base station to get congested. ...Here we propose to develop a congestion avoidance and mitigation technique. For that, we select routes based on the distance between sender and receiver, relative success rate (RSR) value of node and buffer occupancy of a node. Based on these three parameters, we define a utility function to be applied to each neighbor of a transmitter node. Hence the transmitter node chooses the highest U-valued node as its next hop node among its neighbors in packet forwarding. Thus we avoid congestion by choosing non-congested nodes as its next hop node and then we mitigate congestion based on RSR values.
Recently, the new paradigm of Vehicular Social Networks (VSNs) has stimulated a lot of interest in the research community. The rationale behind this interest relies on the integration of social ...relations in the Internet of Vehicles, taking into account of the human component – in terms of preferences and interests of individuals – and then allowing to distinguish nodes based on social ties. This feature affects the content dissemination procedures in VSNs, so that the most social node within a transmission range is expected to be the most appropriate next-hop forwarder, for higher network performance achievement.
Leveraging on such premises, in this paper we propose a MemOry-based VEhicular Social forwarding approach, namely MOVES, that builds its packet forwarding logic by considering both the past and present “social” pattern of the nodes. MOVES is inspired by a previous forwarding mechanism, namely SCARF, that integrates the social components and physical features in its forwarding mechanism. MOVES has been compared to SCARF, and other existing forwarding approaches, in different scenarios and with real data in terms of delivery ratio, overhead and latency; results show its effectiveness of including the “social memory” in the selection of the next-hop forwarder.
PDF
