Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Roar: A Multi-Rate Opportunistic Aodv Routing Protocol For Wireless Ad-Hoc Networks, Kwan-Wu Chin, Darryn Lowe
Roar: A Multi-Rate Opportunistic Aodv Routing Protocol For Wireless Ad-Hoc Networks, Kwan-Wu Chin, Darryn Lowe
Associate Professor Kwan-Wu Chin
In this paper, we outline a simple approach, called ROAR, that enables the Ad-Hoc On-Demand Distance Vector (AODV) routing protocol to strengthen its routes by recruiting neighbors of nodes on the least cost path as support nodes during the route construction process, and working closely with the medium access control (MAC) to employ an opportunistic forwarding scheme that takes advantage of the node diversity at each hop. We have implemented ROAR in the ns-2 simulator over the IEEE 802.11a physical layer. From our simulation studies conducted using various network topologies and realistic radio propagation model, we find that ROAR increases …
A Unified Study Of Epidemic Routing Protocols And Their Enhancements, Zuyong Feng, Kwan-Wu Chin
A Unified Study Of Epidemic Routing Protocols And Their Enhancements, Zuyong Feng, Kwan-Wu Chin
Associate Professor Kwan-Wu Chin
Epidemic protocols belong to a class of routing paradigm that have wide ranging applications in Delay Tolerant Networks (DTNs) due to their simplicity, low delays, and little to no reliance on special nodes. To this end, a comprehensive study of their performance will serve as an important guide to future protocol designers. Unfortunately, to date, there is no work that studies epidemic routing protocols using a common framework that evaluates their performance objectively using the same mobility model and parameters. To this end, we study four categories of epidemic routing protocols. Namely, P-Q epidemic, epidemic with Time-To-Live (TTL), epidemic with …
Heterogeneity-Aware And Energy-Aware Scheduling And Routing In Wireless Sensor Networks, Mahesh Kumar Vasanthu Somashekar
Heterogeneity-Aware And Energy-Aware Scheduling And Routing In Wireless Sensor Networks, Mahesh Kumar Vasanthu Somashekar
Theses
A Wireless Sensor Network (WSN) is a group of specialized transducers, called sensor nodes, with a communication infrastructure intended to monitor and record conditions at diverse locations. Since WSN applications are usually deployed in an open environment, the network is exposed to rough weather conditions, such as rain and snow. Another problem that WSN applications need to deal with is the energy constraints of sensor nodes. Both problems adversely affect the lifetime of WSN applications. A lot of research has been conducted to prolong the lifetime of WSN applications considering energy constraints of sensor nodes, but not much research has …
A Joint Replication-Migration-Based Routing In Delay Tolerant Networks, Yunsheng Wang, Jie Wu, Zhen Jiang, Feng Li
A Joint Replication-Migration-Based Routing In Delay Tolerant Networks, Yunsheng Wang, Jie Wu, Zhen Jiang, Feng Li
Computer Science Faculty Publications
No abstract provided.
A Unified Study Of Epidemic Routing Protocols And Their Enhancements, Zuyong Feng, Kwan-Wu Chin
A Unified Study Of Epidemic Routing Protocols And Their Enhancements, Zuyong Feng, Kwan-Wu Chin
Faculty of Informatics - Papers (Archive)
Epidemic protocols belong to a class of routing paradigm that have wide ranging applications in Delay Tolerant Networks (DTNs) due to their simplicity, low delays, and little to no reliance on special nodes. To this end, a comprehensive study of their performance will serve as an important guide to future protocol designers. Unfortunately, to date, there is no work that studies epidemic routing protocols using a common framework that evaluates their performance objectively using the same mobility model and parameters. To this end, we study four categories of epidemic routing protocols. Namely, P-Q epidemic, epidemic with Time-To-Live (TTL), epidemic with …
Effects Of Routing Algorithms On Novel Throughput Improvement Of Mobile Ad Hoc Networks, Barbaros Preveze, Aysel Şafak
Effects Of Routing Algorithms On Novel Throughput Improvement Of Mobile Ad Hoc Networks, Barbaros Preveze, Aysel Şafak
Turkish Journal of Electrical Engineering and Computer Sciences
A cognitive method called most congested access first (MCAF), minimizing the packet loss ratio and improving the throughput of a multihop mobile WiMAX network, is proposed. MCAF combines both the time division multiple access and the orthogonal frequency division multiple access methods. MCAF additionally uses spectral aid and buffer management methods, which are proposed in this paper, to manage both spectrum access and packets in the buffers. By using these novel methods, real-time video and voice packet transmission is achieved, data packet loss rate is minimized, and the system throughput per node is improved. Effects of fastest path and ant …
Opportunistic Lookahead Routing Procedure For Delay Tolerant Networks, Priyanka Rotti
Opportunistic Lookahead Routing Procedure For Delay Tolerant Networks, Priyanka Rotti
LSU Master's Theses
Delay Tolerant Networks are wireless networks that have sporadic network connectivity, thus rendering the existence of instantaneous end-to-end paths from a source to a destination difficult or impossible. Hence, in such networks, message delivery relies heavily on the store-and-forward paradigm to route messages. However, limited knowledge of the contact times between the nodes poses a big challenge to effective forwarding of messages. In this thesis, we discuss several aspects of routing in DTNs and present one algorithm and three variants for addressing the routing problem in DTNs: (i) the Look-ahead Protocol, in which the forwarding decision at each node to …