Results 211 to 220 of about 6,094 (253)
Some of the next articles are maybe not open access.
Proactive routing overhead in Mobile Ad-hoc Networks
Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014, 2014This 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.
Arek Dadej
exaly +2 more sources
A routing control overhead mitigation method for route setup in Cognitive Radio Networks
2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2016Cognitive Radio is promising technology to improve spectrum utilization. Routing in Cognitive Radio Networks (CRNs) is important because of efficient communication on the wireless multi-hop environment. In this paper, we present a reducing routing overhead method on CRNs.
Gyu-Min Lee +2 more
exaly +2 more sources
Low overhead anonymous routing
2013 Third International Conference on Communications and Information Technology (ICCIT), 2013Privacy 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 +4 more
openaire +1 more source
MANETs: Routing Overhead and Reliability
2006 IEEE 63rd Vehicular Technology Conference, 2006Node 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.
Roy C. Timo, Leif Hanlen
openaire +1 more source
Adaptive MANET Routing for Low Overhead
2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2007In 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 +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, 2003This 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 +2 more
openaire +1 more source
Lowering security overhead in link state routing
Computer Networks, 1999Security 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 +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, 2011Query 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), 2015Global 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 +2 more
openaire +1 more source
On the Overheads of Ad Hoc Routing Schemes
IEEE Systems Journal, 2015The “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