Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

An Efficient Hybrid Data Gathering Algorithm Based On Multihop And Mobile Elements In Wsns, Mukhtar Ghaleb, Shamala Subramaniam, Mohamed Othman, Zuriati Zukarnain Jan 2017

An Efficient Hybrid Data Gathering Algorithm Based On Multihop And Mobile Elements In Wsns, Mukhtar Ghaleb, Shamala Subramaniam, Mohamed Othman, Zuriati Zukarnain

Turkish Journal of Electrical Engineering and Computer Sciences

Data gathering is a focal task in wireless sensor networks (WSNs) that expends most of the sensor nodes' energy. Two factors that are considered essential in data gathering are latency and power consumption. The multihop data gathering approach proves that latency is minimized due to the speed of forwarding data to the base station. However, this may lead to increased power consumption and increased possibility of an emerging hotspot area. In contrast, data gathering based on a mobile element (ME) proves that power consumption is minimized due to avoiding relay data in extreme schemes. However, this may increase the latency …


Low Delay Marking For Tcp In Wireless Ad Hoc Networks, Choong-Soo Lee, Mingzhe Li, Emmanuel Agu, Mark Claypool, Robert Kinicki Dec 2015

Low Delay Marking For Tcp In Wireless Ad Hoc Networks, Choong-Soo Lee, Mingzhe Li, Emmanuel Agu, Mark Claypool, Robert Kinicki

Emmanuel O. Agu

End-hosts on wireless ad hoc networks typically use TCP as their transport layer protocol. Being designed for wired networks, TCP can perform poorly over wireless networks. Work that has proposed ways to improve TCP performance over wireless networks has concentrated primarily on improving TCP throughput only. Emerging applications, such as interactive multimedia and network games, require reduced delay at least as much as increased throughput. In this paper, we propose LDM1, an IP layer queue marking mechanism that estimates the number of hops and flows at each wireless node to computes the optimal marking probability. We present simulation results and …


Performance Enhancement Of Tfrc In Wireless Networks, Mingzhe Li, Emmanuel Agu, Mark Claypool, Robert Kinicki Dec 2015

Performance Enhancement Of Tfrc In Wireless Networks, Mingzhe Li, Emmanuel Agu, Mark Claypool, Robert Kinicki

Emmanuel O. Agu

The TCP-Friendly Rate Control (TFRC) is used as a streaming media transport protocol. Using the TCP congestion response function and current network conditions, TFRC adjusts its transmission rate to yield the maximum TCP-Friendly throughput when sharing capacity with TCP flows. Since TFRC was designed for wired networks, it does not achieve the maximum TCP-Friendly throughput in multihop ad hoc wireless networks. The reduced wireless spatial channel reuse due to hidden terminals in multihop wireless networks induces TFRC throughput reductions. Specifically, TFRC is unaware of MAC layer transmission delays due to collisions, retransmissions and MAC layer congestion. This paper illustrates that …


Cross-Layer Schemes For Reducing Delay In Multihop Wireless Networks, Maggie Xiaoyan Cheng, Quanmin Ye, Lin Cai Dec 2012

Cross-Layer Schemes For Reducing Delay In Multihop Wireless Networks, Maggie Xiaoyan Cheng, Quanmin Ye, Lin Cai

Computer Science Faculty Research & Creative Works

End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. End-to-end delay is defined as the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference level along the path. in this paper we address how to minimize end-to-end delay jointly through optimizing routing and link layer scheduling. We present two cross-layer schemes, a loosely coupled cross-layer scheme and a tightly coupled cross-layer scheme. in the loosely coupled cross-layer scheme, routing is computed first …


A Combinatorial Solution For Scheduling Spatial Multiplexing In Mimo-Based Ad Hoc Networks, Maggie Cheng, Quanmin Ye Dec 2012

A Combinatorial Solution For Scheduling Spatial Multiplexing In Mimo-Based Ad Hoc Networks, Maggie Cheng, Quanmin Ye

Computer Science Faculty Research & Creative Works

In a MIMO-Based ad hoc network, the conflict relation between transmissions is fundamentally changed due to the multiple packet reception capability of MIMO nodes. a MIMO node can receive from multiple data streams at the same time, which significantly increases data throughput. to fully utilize the additional spectrum capacity enabled by the MIMO technology, it is important that transmissions from different nodes are coordinated. the coordination scheme needs to consider both data stream multiplexing and transmission time scheduling for a maximum performance gain. in this paper, we use an optimization framework to jointly consider MIMO link spatial multiplexing and scheduling …