Results 201 to 210 of about 6,094 (253)

FedMIR: Multimodal Federated Learning with Missing Modality Imputation and Distribution-Aware Routing. [PDF]

Sensors (Basel)
Xiong H, Dai M.
europepmc   +1 more source

Multi-Probing Opportunistic Routing in Buffer-Constrained Wireless Sensor Networks. [PDF]

Sensors (Basel)
Sun N, Cao S, Liu X, Gao Y, Xu Y, Liu J.
europepmc   +1 more source

A novel optimized fuzzy neural network for enhanced topology control in k-connected mobile adhoc networks. [PDF]

Sci Rep
Agrawal SS, Rathi R, Siddiqui SA.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

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

Hierarchical routing overhead in mobile ad hoc networks

IEEE Transactions on Mobile Computing, 2004
Hierarchical techniques have long been known to afford scalability in networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. Extensive analysis of the memory requirements of hierarchical routing was undertaken in the 1970s.
John Sucec, Ivan Marsic
exaly   +2 more sources

Reactive Routing Overhead in Mobile Ad-hoc Networks

2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conference on Embedded Software and Systems, 2015
This paper presents an analytical model for quantifying the reactive routing overhead in Mobile Ad-hoc Networks (MANETs). The overhead is characterized as a function of network mobility and traffic load. Also, a numerical model for determining the optimal cached route Time-To-Live is derived to minimize the overhead depending on network mobility and ...
Arek Dadej
exaly   +2 more sources

On the overhead of ad hoc routing protocols with finite buffers

2013 IEEE International Conference on Communications (ICC), 2013
An analytical approach to quantifying the routing overhead in wireless ad hoc networks is presented in this paper. We find that in addition to the traditional control overhead and sub-optimal routing overhead, the retransmissions of discarded packets due to buffer overflow in receiver nodes on a route will consume extra bandwidth, which increasing the ...
Min Sheng
exaly   +2 more sources