Results 251 to 260 of about 1,702,710 (310)

AODV with Lower Routing Overhead

2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, 2009
Compared with Table-Driven routing protocol, on-demand routing protocol lessens routing overhead dramatically. However, node unconditional broadcasting RREQ RERR may cause great routing overhead. In order to increase link lifetime and reduce routing overhead, an improved AODV method is proposed in this paper, in which RREQ RERR and routing table will ...
Dongru Chen, Xia Wang
openaire   +1 more source

Achieving Resilient and Performance-Guaranteed Routing in Space-Terrestrial Integrated Networks

IEEE Conference on Computer Communications, 2023
Satellite routers in emerging space-terrestrial integrated networks (STINs) are operated in a failure-prone, intermittent and resource-constrained space environment, making it very critical but challenging to cope with various network failures ...
Zeqi Lai, Hewu Li, Yikun Wang, Qian Wu, Yangtao Deng, Jun Liu, Yuanjie Li, Jianping Wu   +7 more
semanticscholar   +1 more source

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 Bhatti, Soren-Aksel Sorensen   +2 more
openaire   +1 more source

Overhead of Named Data Networking Routing Protocol

2018 12th International Conference on Telecommunication Systems, Services, and Applications (TSSA), 2018
Named Data Networking (NDN) as the future internet, shall have a good design routing for handling massive node connection with various behavior. Otherwise, the routing protocol will be burdened with an inefficient process that can degrade connection performance. One of inefficiency parameter is routing overhead, which usually a broadcast message.
Tody Ariefianto Wibowo, Nana Rachmana Syambas, Hendrawan Hendrawan   +2 more
openaire   +1 more source

LORP: Least Overhead Routing Protocol for MANET

2010 International Conference on Wireless Communication and Sensor Computing (ICWCSC), 2010
A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper proposes a new routing protocol, named Least Overhead Routing Protocol (LORP) for mobile ad hoc
Suparna DasGupta, Soumyabrata Saha, Souvick Ghosh, Prolay Ghosh, Saikat RoyChowdhury   +4 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 Hauser, Tony Przygienda, Gene Tsudik   +2 more
openaire   +1 more source

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

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