Results 281 to 290 of about 88,879 (305)

Reducing Routing Overhead using Off-Network Route Computation in Sensor Networks

MILCOM 2007 - IEEE Military Communications Conference, 2007
This paper presents an architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing protocols, both node-centric and data-centric, do not scale very well for large networks with potentially hundreds of thousands of embedded sensor devices.
Tao Wu, Fan Yu, Subir Biswas
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, Tung-Kuang Wu, Rei Heng Cheng, Po Tsang Chen   +3 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

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, 1991
Policy 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).
D. Estrin, K. Obraczka
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

Minimizing recovery overhead in geographic ad hoc routing

Computer Communications, 2010
Geographic routing has been studied as an attractive approach due to its simplicity and scalability properties in routing for wireless ad hoc networks. Greedy routing is an important component of many geographic routing protocols which use a combined routing approach; a kind of recovery routing is used in case that greedy routing is impossible. In this
Jongkeun Na, Young-Jin Kim, Ramesh Govindan   +2 more
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   +2 more
openaire   +1 more source

Reactive Routing Overhead in Mobile Ad-hoc Networks

2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conference on Embedded Software and Systems, 2015
This paper presents an analytical model for quantifying the reactive routing overhead in Mobile Ad-hoc Networks (MANETs). The overhead is characterized as a function of network mobility and traffic load. Also, a numerical model for determining the optimal cached route Time-To-Live is derived to minimize the overhead depending on network mobility and ...
Quang-My Tran, Arek Dadej, Thu-Loan Pham
openaire   +1 more source

Hierarchical routing overhead in mobile ad hoc networks

IEEE Transactions on Mobile Computing, 2004
Hierarchical techniques have long been known to afford scalability in networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. Extensive analysis of the memory requirements of hierarchical routing was undertaken in the 1970s.
J. Sucec, I. Marsic
openaire   +1 more source