نتایج جستجو برای: route balancing

تعداد نتایج: 101410  

2006
Yuwei Li Michael J. Cassidy

An algorithm is presented for transit passenger OD estimation. The algorithm, like some other existing OD estimation techniques, generates estimates based upon passenger boarding and alighting counts at each stop along the route. The algorithm is distinct in that it does not only estimate an OD matrix for the vehicle trip from which the boarding and alighting counts were taken. Rather, it furth...

2005
Gautam Chakrabarti Sandeep Kulkarni

To ensure uninterrupted communication in a mobile ad-hoc network, efficient route discovery is crucial when nodes move and/or fail. Hence, protocols such as Dynamic Source Routing (DSR) precompute alternate routes before a node moves and/or fails. In this paper, we modify the way these alternate routes are maintained and used in DSR, and show that these modifications permit more efficient route...

2012
A. AYYASAMY

In recent years, on-demand routing protocols have attained more attention in mobile ad hoc networks as compared to other routing schemes due to their abilities and efficiency. There exist many ondemand routing protocols for Mobile Ad hoc Networks (MANETS). Most of the protocols, however, use a single route and do not utilize multiple alternate paths. Multi path routing allows the establishment ...

2004
Kai Zheng Chengchen Hu Hongbin Lu Bin Liu

Using Ternary Content Addressable Memory (TCAM) for high speed IP address lookup has been gaining popularity due to TCAM's deterministic performance and fast lookup performance. However, restricted by the slow improvement of memory accessing speed, the route lookup engines for next-generation terabit routers demand exploiting parallelism among multiple TCAM chips. Traditional parallel methods a...

2005
Stefano Basagni Alessio Carosi Emanuel Melachrinoudis Chiara Petrioli Maria Wang

This research concerns the definition of an analytical model and protocols for determining the routes of a mobile data collector (sink) traveling through the nodes of a wireless sensor network (WSN). The routes are determined with the overall aim of maximizing the network lifetime. The contribution of our work is twofold. First, we introduce a novel mixed integer linear programming formulation ...

Journal: :Ad Hoc Networks 2017
Ansuman Bhattacharya Koushik Sinha

In this paper, we propose a new routing protocol called the Least Common Multiple based Routing (LCMR) for load-balanced multipath routing inMobile Ad hoc NETworks (MANET s). First, we find multiple paths between a source to a destination, when those exist, along with the estimates of the time to route a packet along each of these paths. The data packets originating from the source to the desti...

2011
M. J. Lee R. Zhang J. Zheng G. - S. Ahn C. Zhu T. R. Park S. R. Cho J. S. Ryu J. Teng W. Jia S. Zhu Z. Ding S. Maranò A. G. Kanatas G. P. Efthymoglou K. S. J. Pister W. Heinzelman I. Stojmenovic K. Römer

This paper introduces a new IEEE standard, IEEE 802.15.5,which provides mesh capability for wireless personal area network (WPAN) devices. The standard provides an architectural framework enabling WPAN devices to promote interoperable, stable, and scalable wireless mesh topologies. It is composed of two parts: low-rate WPAN mesh and high-rate WPAN mesh. In this paper, we present only low-rate W...

Journal: :Comput. Manag. Science 2010
Enrique Benavent Ángel Corberán José María Sanchis

Journal: :CoRR 2014
Mingming Chen Jichang Zhao Xiao Liang Ke Xu

Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been found and widely accepted that a packet in Internet is usually not transmitted along the unweighted shortest path between its source and destination. To better...

2016
Viji Vinod

WirelessHART is an emerging wireless sensor network protocol. As a crucial technique for wireless networks, energy consumption is an important role especially in WirelessHART networks. The graph routing technology can be provided abundant redundant path to improve the reliability of the wirelessHart network communication. Based on graph routing network topology in this paper we propose Joint Gr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید