Results 241 to 250 of about 1,702,710 (310)

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   +2 more sources

Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing

IEEE Transactions on Mobile Computing, 2011
We study routing overhead due to location information collection and retrieval in mobile ad-hoc networks employing geographic routing with no hierarchy. We first provide a new framework for quantifying overhead due to control messages generated to exchange location information.
Richard J. La, Eunyoung Seo
openaire   +2 more sources

Optimization on OLSR Protocol for Lower Routing Overhead

Rough Sets and Knowledge Technology, 2008
The optimized link state routing (OLSR) designed by the IETF's mobile ad hoc networks (MANET) working group is one of the four base routing protocols for ad hoc networks. This protocol is a table driven, proactive protocol. It is particularly suitable for large and dense mobile networks with less latency.
Yong Xue, Hong Jiang, Hui Hu
openaire   +2 more sources

A study on routing overhead in dense MANET

2011 IEEE 10th Malaysia International Conference on Communications, 2011
MANET is formed by mobile nodes that have limited battery and CPU power. Since there are no dedicated routers, every mobile node is expected to route (or relay) packets on behalf of other nodes. This is true irrespective of the routing protocols they use in the network.
P. Veeraraghavan
openaire   +2 more sources

Routing overhead analysis for reactive routing protocols in wireless ad hoc networks

WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005., 2006
Although several routing protocols have been proposed that can be used in mobile ad hoc networks, there is very little formal analysis that considers the communication overhead or in other word routing overhead for these procedures. This paper provides a new mathematical framework for quantifying the overhead of reactive routing protocols such as ...
M. Naserian, K.E. Tepe, M. Tarique
openaire   +2 more sources

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

Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models

North American Chapter of the Association for Computational Linguistics, 2023
The complementary potential of Large Language Models (LLM) assumes off-the-shelf LLMs have heterogeneous expertise in a wide range of domains and tasks so that an ensemble of LLMs can achieve consistently better performance. Existing ensemble methods for
Keming Lu, Hongyi Yuan, Runji Lin, Junyang Lin, Zheng Yuan, Chang Zhou, Jingren Zhou   +6 more
semanticscholar   +1 more source

Neighbor Knowledge-based Rebroadcast algorithm for minimizing the routing overhead in Mobile Ad-hoc Networks

Ad hoc networks, 2019
Mobile Ad-hoc Networks are constructed without any administration, providing the quality of service in spite of routing overhead. In MANET, it is impossible for a mobile host to contact with other hosts in a single-hop fashion.
Y. H. Robinson, R. Krishnan, E. G. Julie, Raghvendra Kumar, Le Hoang Son, Pham Huy Thong   +5 more
semanticscholar   +1 more source

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

An Energy-efficient Ferry-based Routing Algorithm for Scattered FANET Networks

2023 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES), 2023
Flying ad hoc networks (FANETs), have a wide range of applications in both civilian and military settings. Although, prevailing routing protocols are effective in well-connected networks, they struggle in sparse networks. To address this issue in FANETs,
Ashish Saini, Sanjeev Kumar, Ajay Kumar, Satender Kumar, Amrita Kumari, Amit Kumar   +5 more
semanticscholar   +1 more source