oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Code Aware Dynamic Source Routing for Distributed Sensor Network
M Abdul Rahiman,Nishanth Jain,Arun K. Dubey,G Manoj Kumar
International Journal of Network Security & Its Applications , 2013,
Abstract: Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They haveapplication in variety of fields such as military surposes,environment monitoring etc. Typical deploymentof sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces theefficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better fficiency.
Dynamic network routing based on the fuzzy knowledge exchange among multi-agents
一种基于多主体模糊知识交换的动态网络路由方法

Wang Minyi,Zhou Mingtian,Yao Shaowen,
王敏毅
,周明天,姚绍文

电子与信息学报 , 2003,
Abstract: Routing is an important topic in communication network research. But many existing routing mechanisms are awkward to highly dynamic network environment. With a proposed cooperative model of multi-agents based on fuzzy knowledge and a basic algorithm for routing computation, a multiple mobile agents cooperating system is applied to the problem of dynamic network routing. Some key factors of the system are discussed in the context. With the help of a simulative dynamic network and the experiments on it, the performance-overhead characteristic of the system is analyzed and the comparison among some cooperation strategies is made. The results show that the proposed theoretic model and algorithm are suitable to the routing of dynamic network and able to improve the responsibility of the routing system.
Congestion Control in ATM Network using Multi-Source Virtual Dynamic Routing
A. Subramani,A. Krishnan
Journal of Mobile Communication , 2012,
Abstract: The ATM forum has proposed the Private Network-Network Interface (PNNI) specification to facilitate routing in ATM networks, pre-path selection (or) routing algorithms that guarantee a user’s multiple Quality of Service (QoS) requirements remain an open issue. In this study, we consider Multi-Source Virtual dynamic QoS Routing in an integrated-services environment where some of the offered traffic streams are dynamic. While there has been work on routing performance in the presence of purely stationary traffic, the presence of dynamic traffic has received very little attention. We consider here two routing schemes: Multi-Source Virutal Dynamic Routing (MSVDR), Hierarchical Based Least Loaded Routing with Periodic update (HBLLR). Based on simulation, we have found that while MSVDR performs and adapts better than Backward Hierarchal Routing Algorithm (BHRA) in the case of no trunk reservation, it is other way around when there is moderately high trunk reservation (even for less frequent routing updates). Further, we found that dynamics of a traffic class can result in dynamic flow blocking behavior even on stationary traffic, especially at a low or no trunk reservation level. This proposed Algorithm (MSVDR) reduce the Reservation Time, Minimize the Queue length, Fast route recovery, Maximum link utilization and Good throughput compare to the other Routing Algorithms.
Dynamic vs Oblivious Routing in Network Design  [PDF]
Navin Goyal,Neil Olver,F. Bruce Shepherd
Computer Science , 2013,
Abstract: Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impact of different routing models in this robust setting: in particular, we compare \emph{oblivious} routing, where the routing between each terminal pair must be fixed in advance, to \emph{dynamic} routing, where routings may depend arbitrarily on the current demand. Our main result is a construction that shows that the optimal cost of such a network based on oblivious routing (fractional or integral) may be a factor of $\BigOmega(\log{n})$ more than the cost required when using dynamic routing. This is true even in the important special case of the asymmetric hose model. This answers a question in \cite{chekurisurvey07}, and is tight up to constant factors. Our proof technique builds on a connection between expander graphs and robust design for single-sink traffic patterns \cite{ChekuriHardness07}.
A DYNAMIC POSITION BASED ROUTING PROTOCOL TO OPTIMIZE PACKET DELIVERY IN MOBILE ADHOC NETWORK  [cached]
Saranya S
Journal of Global Research in Computer Science , 2013,
Abstract: Mobile Ad hoc networks (MANET) carried out multi-hop communication in an environment with no fixed infrastructure, by means of mobile nodes and changing network topology. In the earlier period, hundreds of new routing protocols were designed for the various scenarios of MANET. Most existing ad hoc routing protocols are liable to node mobility, especially for large-scale networks. Provoked by this issue, this paper presents the new approach a Dynamic Position Based Routing (DPBR) protocol which implemented in the distributed architecture and takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium dynamically. When a data packet is sent out, some of the neighbor nodes that have eavesdropped with the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not in a position to receive. By utilizing such uphill backup, this paper concentrate on how the new examine model supports to reduce the packet drop as well as increase delivery ratio dynamically. The additional latency earn by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. Both theoretical analysis and simulation results show that DPOR achieves excellent performance even under high node mobility with acceptable overhead. Keywords: Distributed architecture, High packet delivery, Geographical Routing.
EXTENDED DYNAMIC SOURCE ROUTING PROTOCOL FOR AD HOC NETWORK  [PDF]
Puja Kumari Sharma
Indian Journal of Computer Science and Engineering , 2012,
Abstract: MANET is a collection of self-configurable mobile nodes. Several routing protocols are proposed for ad hoc network among which DSR and AODV On demand routing protocols are mostly used. Existing Dynamic source routing protocol is not suitable for large network because packet size gets increased according to the number of nodes travelled by route discovery packet. In this paper, extended DSR routing protocol is proposed to eliminate the above limitation of existing DSR. Proposed protocol will be suitable for small and large both types of networks.
Lightweight Local Area Network Dynamic Routing Protocol for MANET  [cached]
Adam Macintosh 1,Mohammad Ghavami 2,Ming Fei Siyau 3
International Journal of Soft Computing and Software Engineering , 2012, DOI: 10.7321/jscse.v2.n7.2
Abstract: A Mobile Ad Hoc Network (MANET) comprises mobile nodes, equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the mobile nodes (MNs) also has significant impact on the MANET routing protocols. The issue of routing and maintaining packets between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local maximum problem under low node density. This requires an efficient design and development of a Lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, Local Area Network Dynamic routing (LANDY) uses a localized routing technique which combines an unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is much faster than with other location protocols which use mainly greedy algorithms, (such as GPRS), no signaling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. Simulation results show that LANDY`s performance improves upon other position based routing protocols.
Distributed and Adaptive Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment  [PDF]
Marco Pavone,Emilio Frazzoli,Francesco Bullo
Computer Science , 2009,
Abstract: In this paper we present distributed and adaptive algorithms for motion coordination of a group of m autonomous vehicles. The vehicles operate in a convex environment with bounded velocity and must service demands whose time of arrival, location and on-site service are stochastic; the objective is to minimize the expected system time (wait plus service) of the demands. The general problem is known as the m-vehicle Dynamic Traveling Repairman Problem (m-DTRP). The best previously known control algorithms rely on centralized a-priori task assignment and are not robust against changes in the environment, e.g. changes in load conditions; therefore, they are of limited applicability in scenarios involving ad-hoc networks of autonomous vehicles operating in a time-varying environment. First, we present a new class of policies for the 1-DTRP problem that: (i) are provably optimal both in light- and heavy-load condition, and (ii) are adaptive, in particular, they are robust against changes in load conditions. Second, we show that partitioning policies, whereby the environment is partitioned among the vehicles and each vehicle follows a certain set of rules in its own region, are optimal in heavy-load conditions. Finally, by combining the new class of algorithms for the 1-DTRP with suitable partitioning policies, we design distributed algorithms for the m-DTRP problem that (i) are spatially distributed, scalable to large networks, and adaptive to network changes, (ii) are within a constant-factor of optimal in heavy-load conditions and stabilize the system in any load condition. Simulation results are presented and discussed.
Performance Analysis and Comparison of Mobile Ad-Hoc Network Routing Protocols
S. Kannan,S. Karthik,V.P. Arunachalam
Research Journal of Applied Sciences , 2012, DOI: 10.3923/rjasci.2010.424.428
Abstract: Mobile Ad-hoc Networks (MANET) are self-organizing and self-configuring multihop wireless networks where the structure of the network changes dynamically. This is mainly due to the mobility of nodes. The nodes in the network not only acts as hosts but also as routers that route data to or from other nodes in network. In mobile ad-hoc networks a routing procedure is always needed to find a path so as to forward the packets appropriately between the source and the destination. The main aim of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an efficient communication path between any two nodes with minimum routing overhead and bandwidth consumption. The design problem of such a routing protocol is not simple since an ad-hoc environment introduces new challenges that are not present in fixed networks. A number of routing protocols have been proposed for this purpose like Ad-Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination Sequenced Distance Vector (DSDV). In this study, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV.
Reliable Point to Multipoint Hierarchical Routing in Scatternet Sensor Network
R.Dhaya,Dr.V.Sadasivam,,Dr.R.Kanthavel
International Journal of Advanced Networking and Applications , 2011,
Abstract: In the recent development of communication, Bluetooth Scatternet wireless is a technology developed for wideband local accesses. Bluetooth technology is very popular because of its low cost and easy deployment which is based on IEEE 802.11standards. On the other hand Wireless Sensor Network (WSN) consists of large number of sensor nodes distributed to monitor an environment and each node in a WSN consists of a small CPU, a sensing device and battery. Mostly, the sensor networks are distributed in an inconvenient location and it is difficult to recharge often. So routing in WSN is an important issue to consume energy and as well as to increase the life of the network, since a routing protocol finds the path between sources and sink. Moreover it is a challenging task to schedule the data between nodes in a scatternet in a congestive environment. Here this paper presents a new scheduling method for point to multi- point routing in Scatternet sensor network and the new dynamic routing method designed is cluster-based with hierarchical routing. The efficiency of this method is also compared in terms of energy consumption and the results show that the proposed routing is an energy efficient one which simultaneously increases the lifetime of the network.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.