Results 231 to 240 of about 89,828 (281)
Some of the next articles are maybe not open access.
AODV with Lower Routing Overhead
2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, 2009Compared 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), 2015This 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 +2 more
exaly +2 more sources
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 +3 more sources
On the overhead of ad hoc routing protocols with finite buffers
2013 IEEE International Conference on Communications (ICC), 2013An 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
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, 2015This 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
Hierarchical routing overhead in mobile ad hoc networks
IEEE Transactions on Mobile Computing, 2004Hierarchical 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
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
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 +3 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