Results 221 to 230 of about 6,094 (253)
Some of the next articles are maybe not open access.
A Low Overhead Ad Hoc Routing Protocol with Route Recovery
2005Many routing protocols have been designed for Ad Hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In the paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication.
Chang-Wu Yu 0001 +3 more
openaire +1 more source
Reducing Latency and Overhead of Route Repair with Controlled Flooding
Wireless Networks, 2004Ad hoc routing protocols that use broadcast for route discovery may be inefficient if the path between any source-destination pair is frequently broken. We propose and evaluate a simple mechanism that allows fast route repair in on demand ad hoc routing protocols.
Maciel Kosmalski Costa, Luís Henrique +2 more
openaire +2 more sources
Optimization on OLSR Protocol for Lower Routing Overhead
2008The optimized link state routing (OLSR) designed by the IETF's mobile ad hoc networks (MANET) working group is one of the four base routing protocols for ad hoc networks. This protocol is a table driven, proactive protocol. It is particularly suitable for large and dense mobile networks with less latency.
Yong Xue, Hong Jiang 0006, Hui Hu
openaire +1 more source
Reducing Routing Overhead in a Growing DDN
MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's, 1986The Defense Data Network (DDN), based on ARPANET technology, is expanding rapidly. One segment of the DDN, the MILNET, will include 250 packet switching nodes by the end of 1987 and as many as 700 by 1991. One obstacle that must be overcome to allow this growth is the overhead associated with the current ARPANET dynamic routing mechanism.
J. Seeger, A. Khanna
openaire +1 more source
Overhead-Controlled Routing in WSNs with Reinforcement Learning
2012The use of wireless sensor networks in industry has been increased past few years, bringing multiple benefits compared to wired systems, like network flexibility and manageability. Such networks consist of a possibly large number of small and autonomous sensor and actuator devices with wireless communication capabilities.
Leonardo R. S. Campos +3 more
openaire +1 more source
Forwarding database overhead for inter-domain routing
ACM SIGCOMM Computer Communication Review, 1993The network layer of the current Internet is built around the packet switched architecture. As the Internet grows both in size and diversity of services, providing mechanisms to contain the growth of information that is necessary to correctly perform packet switching becomes one of the crucial issues in the overall Internet architecture.
openaire +1 more source
Connectivity database overhead for inter-domain policy routing
IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings, 1991Policy routing protocols incorporate policy related constraints into the route computation and packet forwarding functions for inter-administrative domain (AD) communication. However, this functionally exacerbates the already critical problem of routing information distribution and storage overhead in very large internets (e.g., 100000 ADs).
Deborah Estrin, Katia Obraczka
openaire +1 more source
A review and a new approach to reduce routing overhead in MANETs
Wireless Networks, 2014Mobile Ad hoc networks are characterized by a frequently changing in the network topology and the need of an efficient dynamic routing protocol. In this work, we have compared the performance of five ad hoc routing protocols against three different mobility models using NS-2 simulations, the simulated protocols are: AODV, OLSR, DSR, DSDV and ZRP ...
Nabil Nissar +2 more
openaire +1 more source
Joint Optimization of Complexity and Overhead for the Routing in Hierarchical Networks
IEEE Transactions on Parallel and Distributed Systems, 2011The hierarchical network structure was proposed in the early 80s and becomes popular nowadays. The routing complexity and the routing table size are the two primary performance measures in a dynamic route guidance system. Although various algorithms exist for finding the best routing policy in a hierarchical network, hardly exists any work in studying ...
Shih Yu Chang +2 more
openaire +1 more source
Impact of Node Clustering on Routing Overhead in Wireless Networks
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Node clustering is an effective approach to improve scalability of network protocols in wireless communications. In this paper, we analyze the effect of the cluster structure on the average routing overhead for a wireless ad hoc network where nodes are distributed along a line.
Khadige Abboud, Weihua Zhuang
openaire +1 more source