Ryan Winfield Woodings
Cypress Semiconductor
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ryan Winfield Woodings.
wireless communications and networking conference | 2006
Ryan Winfield Woodings; Manoj Pandey
WirelessUSB is built upon the premise that a complex and heavy networking protocol is not necessary for simple point-to-point and multi point-to-point applications like PC mice, keyboards, and sensor networks. WirelessUSB is a standard that fills this gap between Zigbee, Bluetooth, and proprietary point-to-point 2.4 GHz wireless technologies by providing a lightweight, low-latency protocol with interference immunity. In this paper, we propose and evaluate the WirelessUSB protocol. We use ns-2 based simulations to demonstrate the effectiveness of WirelessUSB in various network scenarios. In order to show the interference immunity of WirelessUSB, we implement trace-based models of cordless phones and microwave ovens. Our performance results indicate that WirelessUSB outperforms Bluetooth in terms of packet delivery ratio, latency, power consumption, and interference immunity
wireless communications and networking conference | 2006
Ryan Winfield Woodings; Manoj Pandey
In this paper, we propose a unique set of pseudo noise (PN) codes, such that a large PN code can be split into two smaller PN codes. This allows a radio, to use both the large and the small PN codes, depending upon the desired code length if the large PN code is loaded into the radio. We refer to these codes as multiplicative PN codes. These codes would be especially useful in networks consisting of a master device connected to multiple slave devices. These codes enable slaves devices in the network to encode data with different PN codes of different lengths to trade off data rate and data integrity and yet be able to communicate with the master device. We first describe our motivation and methodology for generating multiplicative PN codes and then present an algorithm to span through the space of PN codes to provide a set with the maximum number of well-bounded multiplicative PN Codes. Our implementation results confirm the existence of a large number of such multiplicative PN codes
Archive | 2005
Ryan Winfield Woodings; Paul Beard
Archive | 2010
Ryan Winfield Woodings
Archive | 2011
Paul Beard; Ryan Winfield Woodings
Archive | 2006
Ryan Winfield Woodings; Manoj Pandey
Archive | 2005
Raymond Charles Asbury; James Burton Cahoon; Ryan Winfield Woodings
Archive | 2005
Paul Beard; Ryan Winfield Woodings
Archive | 2005
Ray Asbury; Ryan Winfield Woodings
Archive | 2005
Ryan Winfield Woodings