Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 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.
 电子与信息学报 , 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.
 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.
 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}.
 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.
 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.