Route Data Packets Research Articles

A novel and Efficient Secured Routing Algorithm in Mobile Ad hoc Network

Currently the mobile wireless technology is experiencing rapid growth. However the major challenge for deployment of this technology with its special characteristics is securing the existing and future vulnerabilities. The lack of static infrastructure causes several issues in mobile Ad hoc network (MANET) environment, such as node authentication and secure routing. In this paper we propose a new approach for secure routing of data packets in MANET. This approach will reduce the computational overhead to a lot extent. The scheme is based on a specific criterion of the nodes called Index .Data packets are routed based on this fidelity index. Simulation results show our proposed scheme is simple yet robust under some scenarios.

Energy Conservation in MANET Using Variable Range Location Aided Routing Protocol

A Mobile Ad-Hoc Network (MANET) is a temporary, infrastructure-less and distributed network having mobile nodes. MANET has limited resources like bandwidth and energy. Due to limited battery power nodes die out early and affect the network lifetime. To make network energy efficient, we have modified position based Location Aided Routing (LAR1) for energy conservation in MANET. The proposed protocol is known as Variable Range Energy aware Location Aided Routing (ELAR1-VAR). The proposed scheme controls the transmission power of a node according to the distance between the nodes. It also includes energy information on route request packet and selects the energy efficient path to route data packets. The comparative analysis of proposed scheme and LAR1 is done by using the QualNet simulator. ELAR1-VAR protocol improves the network lifetime by reducing energy consumption by 20% for dense and mobile network while maintaining the packet delivery ratio above 90%.

LISISAP

For any communication (wired or wireless) such as control and data, the identity of source and destination is revealed in the header portion of the packet. Adversaries obtain sensitive in-formation such as the identity, location of a critical node, route, data, etc., during communication by using traffic analysis at-tacks, viz., similarity attack, data integrity attack, packet count-ing attack, latency attack, and clogging attack. Anonymous communication prevents adversaries from doing traffic analysis against the routing information embedded in the routing mes-sages and data packets. In order to thwart such traffic analysis, anonymous communication protocols were developed. In this paper, the existing anonymous communication protocols were analyzed in terms of techniques used, challenges, and applications. Anonymous Routing protocol with Multiple Routes (ARMR) is one of the existing protocols that achieves better route anonymity using fake routes and multiple paths. However, in ARMR, adversaries can modify the data with genuine user pseudonyms and send the modified data to the destination. In order to prevent data modification by adversary at link level, in this paper a Link level SIgnature based Secure Anonymous Protocol (LISISAP) protocol is proposed. In LISISAP, source node generates a signature for the data and sends the signature along with the encrypted data to the next node. Further, the next node verifies the signature. If signature matches, it generates its own signature and sends the encrypted data to its next node. Otherwise, it discards the packet. Verified data and signature are sent by each intermediate node until it reaches the destina-tion. In LISISAP, even if adversaries modify the data, every node in the route including the destination node verifies the data and discards the data if there is no match in the signature. Similarity attacks can be prevented by making the data look different on each hop which could be achieved by encrypting the data with link key. Proposed protocol, LISISAP is imple-mented and tested in Smart and Secure Network. From the ex-perimental results, it is evident that the data generated by source node is sent anonymously to the destination. Thus, in LISISAP protocol, communication is secure between nodes without revealing the node identities. Anonymous properties such as identity privacy, location privacy, route anonymity, and robustness against several attacks were achieved.

A Literature Review of Security Attack in Mobile Ad-hoc Networks

Security is a major concern for protected communication between mobile nodes in a hostile environment. In hostile environments adversaries can bunch active and passive attacks against intercept able routing in embed in routing message and data packets. In this paper, we focus on fundamental security attacks in Mobile adhoc networks. MANET has no clear line of defense, so, it is accessible to both legitimate network users and malicious attackers. In the presence of malicious nodes, one of the main challenges in MANET is to design the robust security solution that can protect MANET from various routing attacks. However, these solution are not suitable for MANET resource constraints, i.e., limited bandwidth and battery power, because they introduce heavy traffic load to exchange and verifying keys. MANET can operate in isolation or in coordination with a wired infrastructure, often through a gateway node participating in both networks for traffic relay. This flexibility, along with their selforganizing capabilities, are some of MANET's biggest strengths, as well as their biggest security weaknesses. In this paper different routing attacks, such as active(flooding, black hole, spoofing, wormhole) and passive(eavesdropping, traffic monitoring, traffic analysis) are described.

Elastic routing: a novel geographic routing for mobile sinks in wireless sensor networks

Geographic routing has been considered as an efficient, simple and scalable routing protocol for wireless sensor networks, since it exploits pure location information instead of global topology information to route data packets towards a static sink. Recently, a number of research works have shown that mobile sinks can achieve high energy efficiency and load balance than static ones. In order to receive data packets continuously, a mobile sink must update its location to the source frequently. However, frequent location updates of mobile sinks may lead to both rapid energy consumption of the sensor nodes and increased collisions in wireless transmissions. The authors propose a novel geographic routing for mobile sinks to address this issue. The proposed scheme takes advantage of wireless broadcast transmission nature of wireless sensor nodes. When a sink moves, the new location information is propagated along the reverse geographic routing path to the source during data delivery. Analysis and simulation results indicate that elastic routing is superior to other protocols in terms of control overhead, data delivery delay and energy consumption.

Hierarchical Numbering Based Addressing and Stateless Routing Scheme for Wireless Sensor Networks

Due to energy and other relevant constraints, addressing of nodes and data routing techniques in sensor networks differ significantly from other networks. In this article, we present an energy-efficient addressing and stateless routing paradigm for wireless sensor networks. We propose a dynamic and globally unique address allocation scheme for sensors in such a way that these addresses can later be used for data routing. We build a tree like organization of sensors rooted by the sink node based on their transmission adjacency and then set labels on each sensor with a number according to the preorder traversal of the tree from the root. In this addressing process, each sensor keeps necessary information so that they can later route data packets to the destination depending on these addresses, without keeping the large routing table and running any no route discovery phase. Moreover, the scheme does not use location information as well (as done by geo-routing) and can be used in the indoor environment. We conduct simulations to measure the soundness of our approach and make a comparison with another similar technique TreeCast. Simulation results reveal that our approach performs better than its counterpart in several important performance metrics like address length and communication energy.

Hole modeling and detour scheme for geographic routing in wireless sensor networks

Geographic routing has been considered as an attractive approach in wireless sensor networks, since it routes data packets by using location information rather than global topology information. In geographic routing schemes, packets are usually sent along the boundary of a hole by face routing to detour the hole. As result, all data flows which need to detour the hole are concentrated on the boundary of the hole. This hole detour scheme results in much more energy consumption for nodes at the hole boundary, and the energy exhaustion of hole boundary nodes enlarges the holes. This is referred to as a hole diffusion problem. The perimeter mode may also lead to data collisions on the hole boundary nodes if multiple data flows need to bypass a hole simultaneously. In this paper, we propose a hole modeling and detour scheme for geographic routing in wireless sensor networks. Our hole modeling and detour scheme can efficiently prevent hole diffusion, avoid the local minimum problem faced by geographic routing protocols, and reduce data collisions on the hole boundary nodes. Simulation results show that the proposed scheme is superior to the other protocols in terms of control overhead, average delivery delay and energy consumption.

ARMR: Anonymous routing protocol with multiple routes for communications in mobile ad hoc networks

A mobile ad hoc network consists of mobile nodes that communicate in an open wireless medium. Adversaries can launch analysis against the routing information embedded in the routing message and data packets to detect the traffic pattern of the communications, thereby obtaining sensitive information of the system, such as the identity of a critical node. In order to thwart such attacks, anonymous routing protocols are developed. For the purposes of security and robustness, an ideal anonymous routing protocol should hide the identities of the nodes in the route, in particular, those of the source and the destination. Multiple routes should be established to increase the difficulty of traffic analysis and to avoid broken paths due to node mobility. Existing schemes either make the unrealistic and undesired assumption that certain topological information about the network is known to the nodes, or cannot achieve all the properties described in the above. In this paper, we propose an anonymous routing protocol with multiple routes called ARMR, which can satisfy all the required properties. In addition, the protocol has the flexibility of creating fake routes to confuse the adversaries, thus increasing the level of anonymity. In terms of communication efficiency, extensive simulation is carried out. Compared with AODV and MASK, our ARMR protocol gives a higher route request success rate under all situations and the delay of our protocol is comparable to the best of these two protocols.

Internet packet routing: Application of a K-quickest path algorithm

This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely its self-similar stochastic nature. Results concerning the average CPU times of the algorithm for the different sets of experiments will be presented and discussed.

TAP: Traffic-aware topology control in on-demand ad hoc networks

Energy efficiency is crucial to achieve satisfactory network lifetime in ad hoc networks. In order to reduce the energy consumption significantly, a node needs to turn off its transceiver. Many existing energy-saving algorithms are based on constructing a simplified routing backbone for global connectivity. In this paper some problems involved with node sleep in on-demand ad hoc networks are addressed firstly. Then we propose a distributed, cross-layer Traffic-Aware Participation (TAP) algorithm, where nodes make decisions on whether to sleep or not based on both the traffic pattern and local connectivity. Nodes get dynamic traffic characteristics as well as active neighbors within two hops via routing control and data packets periodically. We further present a lightweight algorithm to avoid network partition resulted from node sleeping. Simulation results show that, compared to current sleep-based topology control algorithms, TAP achieves better network service quality and lower delay while allowing comparable energy conservation.

A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks

The major contribution of the paper is a comprehensive survey of existing state-of-the-art Nature inspired routing protocols for fixed telecommunication networks developed by researchers who are trained in novel and different design doctrines and practices. Nature inspired routing protocols have been becoming the focus of research because they achieve the complex task of routing through simple agents which traverse the network and collect the routing information in an asynchronous fashion. Each node in the network has a limited information about the state of the network, and it routes data packets to their destination based on this local information. The agent-based routing algorithms provide adaptive and efficient utilization of network resources in response to changes in the network catering for load balancing and fault management. The paper describes the important features of stigmergic routing algorithms, evolutionary routing algorithms and artificial intelligence routing algorithms for fixed telecommunication networks. We also provide a summary of the protocols developed by the networking community. We believe that the survey will be instrumental in bridging the gap among different communities involved in research of telecommunication networks.

New power-aware routing protocol for mobile ad hoc networks

Since devices used in wireless mobile ad hoc networks are generally supplied with limited autonomous resources, energy conservation is one of the most significant aspects in these networks. Recent studies show that the energy consumed for routing data-packets in mobile ad hoc networks can be significantly reduced compared with the min-hop full-power routing protocols. One of the promising mechanisms proposed in literature to reduce the energy consumption is the transmission power control. In this paper, we define new routing metrics to strike a balance between the required power minimisation and batteries freshness consideration. We also define a new technique which allows the distribution of the routing task over nodes. Using these metrics and techniques we derive from DSR [2] a new power-aware and power-efficient routing protocol, whose performance is analysed by simulation in different situations of mobility and network load.

Scalability of routing methods in ad hoc networks

In an ad hoc network each host (node) participates in routing packets. Ad hoc networks based on 802.11 WLAN technology have been the focus of several prior studies. These investigations were mainly based on simulations of scenarios involving up to 100 nodes (usually 50 nodes) and relaxed (too unrealistic) data traffic conditions. Many routing protocols in such setting offer the same performance, and many potential problems stay undetected. At the same time, an ad hoc network may not want (or be able) to limit the number of hosts involved in the network. As more nodes join an ad hoc network or the data traffic grows, the potential for collisions and contention increases, and protocols face the challenging task to route data packets without creating high administrative load. The investigation of protocol behavior in large scenarios exposes many hidden problems. The understanding of these problems helps not only in improving protocol scalability to large scenarios but also in increasing the throughput and other QoS metrics in small ones. This paper studies on the example of AODV and DSR protocols the influence of the network size (up to 550 nodes), nodes mobility, nodes density, suggested data traffic on protocols performance. In this paper we identify and analyze the reasons for poor absolute performance that both protocols demonstrate in the majority of studied scenarios. We also propose and evaluate restructured protocol stack that helps to improve the performance and scalability of any routing protocol in wireless ad hoc networks.

Split agent‐based routing in interconnected networks

AbstractAdaptive behaviour of swarm‐based agents (BT Technol. J. 1994; 12:104–113; AAMAS Conference '02, Melbourne, Australia, Month 1–2, 2002; Softcomput. J. 2001; 5(4):313–317.) is being studied in this paper with respect to network throughput for a certain amount of data traffic. Algorithmically complex problems like routing data packets in a network need to be faced with a dynamically adaptive approach such as agent‐based scheme. Particularly in interconnected networks where multiple networks are participating in order to figure a large‐scale network with different QoS levels and heterogeneity in the service of delay sensitive packets, routing algorithm must adopt in frequent network changes to anticipate such situations. Split agent‐based routing technique (SART) is a variant of swarm‐based routing (Adapt. Behav. 1997; 5:169–207; Proceedings of 2003 International Symposium on Performance Evaluation of Computer and Telecommunication Systems—SPECTS, Montreal, Canada, July 20–24, 2003; 240–247.) where agents are split after their departure to the next node on a hop‐by‐hop basis. Packets that are delay sensitive are marked as prioritized which agents recognize‐as being a part of a packet‐ and try to influence the two‐way routing tables. Thorough examination is made, for the performance of the proposed algorithm in the network and the QoS offered, taking into account a number of metrics. It is shown that the split agent routing scheme applied to interconnected networks offers a decentralized control in the network and an efficient way to increase overall performance and packet control reducing at the same time the packet loss concept. Copyright © 2004 John Wiley & Sons, Ltd.

A Genetic Algorithm for the Weight Setting Problem in OSPF Routing

With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Internet routing protocol (IRP). Traffic flow is routed along shortest paths, splitting flow at nodes with several outgoing links on a shortest path to the destination IP address. Link weights are assigned by the network operator. A path length is the sum of the weights of the links in the path. The OSPF weight setting (OSPFWS) problem seeks a set of weights that optimizes network performance. We study the problem of optimizing OSPF weights, given a set of projected demands, with the objective of minimizing network congestion. The weight assignment problem is NP-hard. We present a genetic algorithm (GA) to solve the OSPFWS problem. We compare our results with the best known and commonly used heuristics for OSPF weight setting, as well as with a lower bound of the optimal multi-commodity flow routing, which is a linear programming relaxation of the OSPFWS problem. Computational experiments are made on the AT&T Worldnet backbone with projected demands, and on twelve instances of synthetic networks.

Control monitoring of routing bits and data packets in WDM networks using wavelength-to-time mapping

We demonstrate a wavelength-to-time technique for control monitoring bits, data packets, and channel powers in a wavelength-division-multiplexed network. We recover the routing header bits across parallel wavelengths as well as determine the existence of data packets for switching purposes. We show results for a routing-bit monitor of multiple channels with a speed of 2.5 Gb/s and a packet/frame monitor for multiple channels with a speed of 100 MHz.

Throughput evaluation of a satellite-switched CDMA (SS/CDMA) demand assignment system

This paper presents throughput evaluation of a satellite-switched code-division multiple-access (SS/CDMA) system which operates under demand assignment control. SS/CDMA provides both multiple access and switching to a geostationary multibeam satellite. Multiple access is resolved by space, frequency, and code division. Space division is introduced by the multibeam antennas that provide frequency reuse in each beam. The spectrum is then channelized into frequency bands where each band is accessed by code division for both the uplink and downlink. The satellite on-board performs the switching function, which is also based on compatible code-multiplexed switching. The switch may route both circuit calls and data packets which are assigned upon request. The on-board code-division switch operates under the control of a channel assignment algorithm. We provide channel assignment algorithms for optimum, suboptimum, and random switch operation. The system throughput has been evaluated for each case and compared. Performance analysis has been carried out for the case of the optimum switch scheduling. The analysis is based on a discrete-time Markovian model, and provides the call-blocking probabilities and data packet delays. Computer simulations have been used to evaluate the performance of the optimum, suboptimum, and random cases. It is shown that the circuit call-blocking probabilities achieved for these cases are almost the same. The optimum algorithm achieves the minimum data packet delay, while the performance of the suboptimum algorithm is slightly better than the random one. Furthermore, data packets may be routed via the switch with limited delays, even with a heavy load of circuit calls.

A pipelined, multiprocessor architecture for a connectionless server for broadband ISDN

The direct provision of connectionless service in BISDN calls for servers that are connected to or are part of an ATM network to provide the routing function at input speeds up to 622 Mb/s. Routing is achieved in such a server by changing the VCI/VPI headers in the ATM cells; actual switching is done by existing switches in the ATM network. The paper presents an architecture capable of executing all the functions of a server at input speeds up to 622 Mb/s, scalable to multiple inputs at that speed, making use of processors and special hardware that are available today. To avoid storing large quantities of data, the architecture routes data packets by examining routing information in the initial cell of the packet and routing subsequent cells as they arrive rather than waiting until the complete packet has arrived. It is capable of handling packets that have been multiplexed at the SAR sublayer using AAL Type 3/4 and, with minor modifications, could also handle Type 5 traffic. Arguments are also presented for the use of AAL Type 5 for the direct connectionless service. >

Sharp approximate models of deflection routing in mesh networks

Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. The focus of this work is on deflection routing in the Manhattan street network (a two-dimensional directed mesh), although the analytic approach should apply to any regular network. Two approximate performance models that give sharp estimates of the steady-state throughput and the average packet delay for packets admitted to the network are presented. The results of extensive simulation experiments are reported, which corroborate the models' predictions. The results show that deflection routing is very effective. Two measures of the merit of a network for deflection routing are its diameter and its deflection index. Networks are presented whose diameter and deflection index are near the optimal values.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

An optimal time bound for oblivious routing

The problem of routing data packets in a constant-degree network is considered. A routing scheme is calledoblivious if the route taken by each packet is uniquely determined by its source and destination. The time required for the oblivious routing ofn packets onn processors is known to be Θ(√n). It is demonstrated that the presence of extra processors can expedite oblivious routing. More specifically, the time required for the oblivious routing ofn packets onp processors is Θ(n/√p + logn).