Results 271 to 280 of about 88,879 (305)

MANETs: Routing Overhead and Reliability

2006 IEEE 63rd Vehicular Technology Conference, 2006
Node mobility and physical channel effects cause the quality of links in wireless networks to fluctuate randomly. At the network layer, these changes are accommodated by the control information (overhead) of routing protocols. We provide lower bounds on the minimum average control overhead of deterministic routing protocols.
R.C. Timo, L.W. Hanlen
openaire   +3 more sources

Low overhead anonymous routing

2013 Third International Conference on Communications and Information Technology (ICCIT), 2013
Privacy is one of the main concerns for Internet users. In many situations, users would like to conceal their identities when accessing the Internet. Some would want to hide their identities when accessing specific services, and others may even want to be anonymous to other hosts they are communicating with.
Alaa Atassi, Imad Sarji, Ayman Kayssi, Ali Chehab, Imad Elhaj   +4 more
openaire   +1 more source

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

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

Proactive routing overhead in Mobile Ad-hoc Networks

Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014, 2014
This paper presents an analytical model for quantifying the control overhead of proactive routing protocols in Mobile Ad-hoc Networks (MANETs). In particular, the lower bound on the routing overhead of a generic proactive routing protocol for MANETs with a flat structure is introduced.
Quang-My Tran, Arek Dadej
openaire   +2 more sources

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

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

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

Routing overhead optimization in smart grid networks

2015 IEEE International Symposium on Power Line Communications and Its Applications (ISPLC), 2015
This paper presents a routing overhead optimization algorithm called Staggered Link Quality algorithm to reduce routing overhead in large scale smart grid networks that use reactive routing protocols. A reduction in routing overhead will result in higher channel utilization and improved throughput.
Owais Khan, Kumaran Vijayasankar, Ramanuja Vedantham   +2 more
openaire   +1 more source