Results 251 to 260 of about 89,828 (281)
Some of the next articles are maybe not open access.
Optimization on OLSR Protocol for Lower Routing Overhead
2008The 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 0006, Hui Hu
openaire +1 more source
A review and a new approach to reduce routing overhead in MANETs
Wireless Networks, 2014Mobile Ad hoc networks are characterized by a frequently changing in the network topology and the need of an efficient dynamic routing protocol. In this work, we have compared the performance of five ad hoc routing protocols against three different mobility models using NS-2 simulations, the simulated protocols are: AODV, OLSR, DSR, DSDV and ZRP ...
Nabil Nissar +2 more
openaire +1 more source
Overhead-Controlled Routing in WSNs with Reinforcement Learning
2012The use of wireless sensor networks in industry has been increased past few years, bringing multiple benefits compared to wired systems, like network flexibility and manageability. Such networks consist of a possibly large number of small and autonomous sensor and actuator devices with wireless communication capabilities.
Leonardo R. S. Campos +3 more
openaire +1 more source
NEIGHBOUR-AWARE ROUTING PROTOCOL IN MANET TO MINIMIZE ROUTING OVERHEAD
Multidisciplinary Journal of Research in Engineering and Technology, 2016Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes, constructed dynamically without the use of any existing network infrastructure or centralized administration. Due to the limited transmission range of wireless network interfaces, multiple hops may be needed for one node to exchange data with another one across the network ...
Akshay Shah +3 more
openaire +1 more source
Joint Optimization of Complexity and Overhead for the Routing in Hierarchical Networks
IEEE Transactions on Parallel and Distributed Systems, 2011The hierarchical network structure was proposed in the early 80s and becomes popular nowadays. The routing complexity and the routing table size are the two primary performance measures in a dynamic route guidance system. Although various algorithms exist for finding the best routing policy in a hierarchical network, hardly exists any work in studying ...
Shih Yu Chang +2 more
openaire +1 more source
Minimizing recovery overhead in geographic ad hoc routing
Computer Communications, 2010Geographic 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 +2 more
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, 1991Policy 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).
Deborah Estrin, Katia Obraczka
openaire +1 more source
Traffic-Aware and Low-Overhead Routing Protocol for MANETs
2008 1st IFIP Wireless Days, 2008In this paper, a new routing protocol, called traffic-aware and low-overhead routing protocol (TALORP) is proposed. The TALORP protocol, which is an enhancements of the low-overhead routing protocol (LORP), uses backup routes to mitigate the flooding problem that is frequently used to repair link failures.
Mohammad S. Alsheakhali, Fahed Awad
openaire +1 more source
A study on routing overhead in dense MANET
2011 IEEE 10th Malaysia International Conference on Communications, 2011MANET 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.
openaire +1 more source
Impact of Node Clustering on Routing Overhead in Wireless Networks
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Node clustering is an effective approach to improve scalability of network protocols in wireless communications. In this paper, we analyze the effect of the cluster structure on the average routing overhead for a wireless ad hoc network where nodes are distributed along a line.
Khadige Abboud, Weihua Zhuang
openaire +1 more source