Results 241 to 250 of about 89,828 (281)

Adaptive MANET Routing for Low Overhead

2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2007
In wireless mission-critical systems, systems may be resource-constrained including limited bandwidth, so minimising protocol overhead, whilst maintaining performance, is important. Proactive MANET routing protocols tend to provide smaller route discovery latency than on-demand protocols because they maintain route information to all the nodes in the ...
Yangcheng Huang, Saleem N. Bhatti, Søren-Aksel Sørensen   +2 more
openaire   +1 more source

Lowering security overhead in link state routing

Computer Networks, 1999
Security services in routing protocols are at the same time very important and very costly. This paper examines the cost of security in link state routing and develops techniques for efficient and secure processing of link state updates. Different approaches are recommended for stable and volatile network environments.
Ralf C. Hauser, Tony Przygienda, Gene Tsudik   +2 more
openaire   +1 more source

Reactive routing overhead in networks with unreliable nodes

Proceedings of the 9th annual international conference on Mobile computing and networking, 2003
This paper presents a new mathematical and simulative framework for quantifying the overhead of a broad class of reactive routing protocols, such as DSR and AODV, in wireless variable topology (ad-hoc) networks. We focus on situations where the nodes are stationary but unreliable, as is common in the case of sensor networks.
Nianjun Zhou, Huaming Wu, Alhussein A. Abouzeid   +2 more
openaire   +1 more source

Overhead analysis of query localization optimization and routing

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011
Query localization is an improved extension of on-demand routing protocols for ad hoc networks. It makes use of prior routing histories to localize the query flood to a limited region of a network. However, the lifetime of the found route by two existing query localization approaches tends to be much shorter than that of network-wide flooding.
Wenzheng Xu, Yongmin Zhang, Weifa Liang
openaire   +1 more source

Overhead for independent net approach for Global Routing

2015 IEEE 6th Latin American Symposium on Circuits & Systems (LASCAS), 2015
Global Routing is one of the major Electronic Design Automation steps and it is classified as an NP-hard problem. We verified that 61% of the nets in ISPD 2008's benchmarks are shorter than 128 length units. We propose a method to cluster these nets using an independent net approach to perform global routing in massively parallel systems.
Diego Tumelero, Guilherme Bontorin, Ricardo Reis 0001   +2 more
openaire   +1 more source

On the Overheads of Ad Hoc Routing Schemes

IEEE Systems Journal, 2015
The “first wave” of wireless ad hoc routing protocols was heavily influenced by the routing algorithms used in wired networks. However, their overheads due to topology changes and the implicit restriction to point-to-point control messages meant that extensive effort had to be expended in “fixing” them to fit the intricacies and opportunities offered ...
openaire   +1 more source

Reducing Latency and Overhead of Route Repair with Controlled Flooding

Wireless Networks, 2004
Ad 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, Dias de Amorim, Marcelo, Fdida, Serge   +2 more
openaire   +2 more sources

Reducing Routing Overhead in a Growing DDN

MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's, 1986
The 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

A Low Overhead Ad Hoc Routing Protocol with Route Recovery

2005
Many 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, Tung-Kuang Wu, Rei-Heng Cheng, Po Tsang Chen   +3 more
openaire   +1 more source

Forwarding database overhead for inter-domain routing

ACM SIGCOMM Computer Communication Review, 1993
The 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