Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.

Performance Analysis of MANET Routing Protocols in the Presence of Self-Similar Traffic

Abstract: A number of measurement studies have convincingly demonstrated that network traffic can exhibit a noticeable self-similar nature, which has a considerable impact on queuing performance. However, many routing protocols developed for MANETs over the past few years have been primarily designed and analyzed under the assumptions of either CBR or Poisson traffic models, which are inherently unable to capture traffic self-similarity. It is crucial to re-examine the performance properties of MANETs in the context of more realistic traffic models before practical implementation show their potential performance limitations. In an effort towards this end, this paper evaluates the performance of three well-known and widely investigated MANET routing protocols, notably DSR, AODV and OLSR, in the presence of the bursty self-similar traffic. Different performance aspects are investigated including, delivery ratio, routing overhead, throughput and end-to-end delay. Our simulation results indicate that DSR routing protocol performs well with bursty traffic models compared to AODV and OLSR in terms of delivery ratio, throughput and end-to-end delay. On the other hand, OLSR performed poorly in the presence of self-similar traffic at high mobility especially in terms of data packet delivery ratio, routing overhead and delay. As for AODV routing protocol, the results show an average performance, yet a remarkably low and stable end-to-end delay.

Systems and methods for adaptive routing in mobile ad-hoc networks and disruption tolerant networks

Abstract: The systems and methods described herein include adaptive routing processes for packet-based wireless communication networks. This routing approach works both in MANETs (when a contemporaneous end-to-end path is available) and in DTNs (when a contemporaneous end to end path is not available, but one of formed over space and time). In particular, the methods include adaptively selecting a routing process for transmitting a packet through a node in the network based on available information on the network topology and/or the contents of the packet.

Wormhole attacks detection in wireless ad hoc networks: a statistical analysis approach

Abstract: Various routing attacks for single-path routing have been identified for wireless ad hoc networks and the corresponding counter measures have been proposed in the literature. However, the effects of routing attacks on multi-path routing have not been addressed. In this paper, the performance of multi-path routing under wormhole attack is studied in detail. The results show that multi-path routing is vulnerable to wormhole attacks. A simple scheme based on statistical analysis (called SAM) is proposed to detect such attacks and to identify malicious nodes. Comparing to the previous approaches (for example, using packet leash), no special requirements (such as time synchronization or GPS) are needed in the proposed scheme. Simulation results demonstrate that SAM successfully detects wormhole attacks and locates the malicious nodes in networks with different topologies and with different node transmission range. Moreover, SAM may act as a module in local detection agents in an intrusion detection system (IDS) for wireless ad hoc networks.

Ant routing algorithm for mobile ad-hoc networks (ARAMA)

Abstract: Routing algorithms in mobile ad-hoc networks (MANETs) should match the special characteristics of MANETs. It should be A self-configured, self-built and distributed routing algorithm. In addition, it should be able to optimize more than one quality of service parameter to achieve good network performance. The remaining energy in each node across the network should be fairly distributed. We are propose the ant routing algorithm for Mobile Ad-hoc networks (ARAMA), which is a biological based routing algorithm. This algorithm is inspired from the ant colonies' life. Forward packets are used to collect information about the network and backward packets are used to update the routing information in the nodes. The paper provides a description of the algorithm. Simulation results show the ability of the algorithm to fairly distribute the remaining energy across the network nodes and solve the MANETs routing problem under different dynamic conditions.

Multihop cognitive radio networks: to route or not to route

Abstract: Routing is a fundamental issue to consider when dealing with multihop cognitive radio networks. We investigate in this work, the potential routing approaches that can be employed in such adaptive wireless networks. We argue that in multihop cognitive radio environments no general routing solution can be proposed, but cognitive environments can be classified into three separate categories, each requiring specific routing solutions. Basically, this classification is imposed by the activity of the users on the licensed bands that cognitive radios try to access. First, over a relatively static primary band, where primary nodes idleness largely exceeds cognitive users communication durations, static mesh routing solutions can be reused, whereas second, over dynamically available spectrum bands new specific routing solutions have to be proposed, we give some guidelines and insights about designing such solutions. Third, if cognitive radios try to access over highly active and rarely available primary bands, opportunistic forwarding without preestablished routing is to be explored.