Packet Routing

One of the popular wireless network architectures is mobile ad hoc network (MANET) which can be deployed easily in almost any environment, without any underlying backbone and infrastructure support. The MANET Nodes (Routers and Hosts) can move randomly and re-organize themselves into an arbitrary network. Because of the limited range of each hostpsilas wireless transmission, to communicate with hosts outside its transmission range, a host needs to forward the packets with the help of nearby hosts to the destination. In this paper, an Efficient DSDV (Eff-DSDV) routing protocol is proposed for ad hoc networks. Eff-DSDV overcomes the problem of stale routes, and thereby improves the performance of regular DSDV. The proposed protocol has been implemented in the NCTUns Simulator and performance comparison has been made with regular DSDV protocol using performance metrics packet-delivery ratio, end-end delay, dropped packets, routing overhead, route length by varying the number of nodes in the network and the mobility speed of the ad hoc hosts. It is observed from the simulation results that the performance of Eff-DSDV is superior to regular DSDV with respect to all the said metrics except the routing overhead. The routing overhead is bound to be higher for Eff-DSDV due to the extra route requests and route reply messages which otherwise is not present in regular DSDV. Lastly in the paper, we discuss the usefulness of Eff-DSDV as a routing protocol in the integration of the mobile network and the Internet.

– In future, more wireless devices are connecting to the Internet. These devices are mobile and move within the coverage area of any mobile network. There are two types of mobile network namely Mobile IP and Mobile ad hoc network. This paper will present indoor ...

In the current Internet, hosts are identified using IP addresses that depend on their topological location. In other words, the IP addresses are semantically overloaded since they identify both hosts and topological locations. The Host Identity Protocol (HIP) introduces a way of separating the location and host identity information. It introduces a new namespace, cryptographic in nature, for host identities.

The link layer routing protocols 6lowpan ad hoc on-demand distance vector routing (LOAD) and dynamic MANET on-demand for 6lowpan (DYMO-low) are integrated in 6lowpan stack. The stack is less complicated and it support IPv6 enabled packets route for biomedical data. Both routing protocols are modified and developed new approach for patient healthcare monitoring system. Thus, proposed integration method is more reliable speedily in healthcare monitoring system than existing protocol in 6lowpans. Mesh routing components are introduced to enable messages to deliver around the nodes. Itpsilas a new approach to monitor patients globally and analysis healthcare biomedical data, even though the doctors and patients both are fart in distance. During emergency cases, doctor able to monitor patient condition efficiently to reduce time consuming, thus is provider more effective healthcare system. For real-time testing, dummy biomedical data are used in IP-based ubiquitous sensor nodes and gateway. Real-time implementation results are show for the integration protocol and it is more reliable in compare to other 6lowpan protocols.

ABSTRACT Mesh networks are designed with the goal of providing Internet access service in locations with poor cable infrastructure and service offering free wireless networks. However, these networks have not been standardized and many problems are open or inefficient solution, as routing performance. This article proposes a mechanism, MAC-OLSR, to improve packet routing in a mesh network, using the decision support system, MACBETH, together with the pruning system, which improves the selection criterion of routing protocol OLSR (Optimized Link State Routing). To validate this proposal we developed a prototype in the Network Simulator (NS) tested on a scenario based on a real network..

Ahmed Hemani 1 , Axel Jantsch 2 , Shashi Kumar 5 , Adam Postula 6 , Johnny Öberg 3 , Mikael ... 1,2,3,4 ESDlab, Dept. of Electronics, Royal Institute of Technology, KTH, Electrum, 164 40 Kista, Sweden. ahmed@ele.kth.se ... 5 School of Engineering, Jönköping, Sweden ...

We consider the problem of determining the probability distribution on the queue sizes in ageneral oblivious packet-routing network. We assume packets continuously arrive at each nodeof the network according to a Poisson process with rate . We also assume that an edge maybe traversed by only one packet at a time, and the time to traverse an edge is an

A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time traffic such as voice and video. The most critical performance parameter to bound is the delay experienced by a packet as it travels from its source to its destination. We study dynamic routing in a connection-oriented packet-switching network. We consider a network with arbitrary topology on which a set of sessions is defined. For each session i, packets ...

The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the (ℓ, k)-routing problem, each node can send at most ℓ packets and receive at most k packets. Permutation routing is the particular case ℓ = k = 1. In the r-central routing problem, all nodes at distance at most r from a fixed node v want to send a packet to v. In this article we study the permutation routing, the r-central routing and the general (ℓ, k)-routing problems on plane grids, that is square grids, triangular grids and hexagonal grids. We use the store-and-forward Δ-port model, and we consider both full and half-duplex networks. We first survey the existing results in the literature about packet routing, with special emphasis on (ℓ, k)-routing on plane grids. Our main contributions are the following: 1. Tight permutation routing algorithms on full-duplex hexagonal grids, and half duple...

MPLS (Multi-Protocol Label Switching) has recently emerged to facilitate the engineering of network traffic. This can be achieved by directing packet flows over paths that satisfy multiple requirements. MPLS has been regarded as an enhancement to traditional IP routing, which has the following problems: (1) all packets with the same IP destination address have to follow the same path through

We study the general many-to-one packet routing problem in a grid-topology network, where the number of packets destined at a single node may be arbitrary (in contra st to the permutation and routing models), and the semantics of the packets is unknown (thus disallowing packet combining). The worst case time complexity of the problem may be very high, due to

ABSTRACT Mesh networks are designed with the goal of providing Internet access service in locations with poor cable infrastructure and service offering free wireless networks. However, these networks have not been standardized and many problems are open or inefficient solution, as routing performance. This article proposes a mechanism, MAC-OLSR, to improve packet routing in a mesh network, using the decision support system, MACBETH, together with the pruning system, which improves the selection criterion of routing protocol OLSR (Optimized Link State Routing). To validate this proposal we developed a prototype in the Network Simulator (NS) tested on a scenario based on a real network..

We propose a new routing strategy for controlling packet routing on complex networks. The delivery capability of each node is adopted as a piece of local information to be integrated with the load traffic dynamics to weight the next route. The efficiency of transport on complex network is measured by the network capacity, which is enhanced by distributing the traffic load over the whole network while nodes with high handling ability bear relative heavier traffic burden. By avoiding the packets through hubs and selecting next routes optimally, most travel times become shorter. The simulation results show that the new strategy is not only effective for scale-free networks but also for mixed networks in realistic networks.

Antnet is an agent based routing algorithm that is influenced from the unsophisticated and individual ant's emergent behaviour. Ants (software agents) are used in antnet to collect information and to update the probabilistic distance vector routing table entries. Modified antnet algorithm has been introduced, which improve the throughput and average delay. Results shows that by detecting and dropping 0.5% of packets routed through the non-optimal routes the average delay per packet decreased and network throughput can be increased. The effect of the traffic fluctuations has been limited with the boundaries introduced in this paper and the number of ants in the network has been limited with the current throughput of the network at any given time.