Search

Chane Fullmer Phones & Addresses

  • Port Orford, OR
  • Fresno, CA
  • Santa Cruz, CA
  • 3100 Hardin Way, Soquel, CA 95073 (831) 464-8456 (831) 479-7557
  • Coarsegold, CA
  • Felton, CA
  • 3100 Hardin Way, Soquel, CA 95073

Work

Company: Backdoor productions Jul 2009 Position: Independent research scientist

Education

Degree: Doctorates, Doctor of Philosophy School / High School: University of California, Santa Cruz 1992 to 1998 Specialities: Computer Engineering, Philosophy

Skills

Higher Education • Wireless Networking • Remote Sensing • Programming Languages • Prototype Design

Interests

Related Systems • Communication • Cypress Psoc Mcu • Texas Intruments Low Power Mcu • Prototype Design of Sensor • Arm Processors

Industries

Research

Resumes

Resumes

Chane Fullmer Photo 1

Independent Research Scientist

View page
Location:
P/O Box 1349, Port Orford, OR
Industry:
Research
Work:
Backdoor Productions
Independent Research Scientist

California State University, Fresno 2002 - 2003
Visiting Professor

Uc Santa Cruz 2001 - 2003
Lecturer
Education:
University of California, Santa Cruz 1992 - 1998
Doctorates, Doctor of Philosophy, Computer Engineering, Philosophy
Skills:
Higher Education
Wireless Networking
Remote Sensing
Programming Languages
Prototype Design
Interests:
Related Systems
Communication
Cypress Psoc Mcu
Texas Intruments Low Power Mcu
Prototype Design of Sensor
Arm Processors

Business Records

Name / Title
Company / Classification
Phones & Addresses
Chane L. Fullmer
President
SIERRA WHOLESALE SUPPLY
PO Box 12663, Fresno, CA 93778

Publications

Us Patents

Transmission-Scheduling Coordination Among Collocated Internet Radios

View page
US Patent:
6928061, Aug 9, 2005
Filed:
Oct 31, 2000
Appl. No.:
09/703075
Inventors:
Chane L. Fullmer - Santa Cruz CA, US
Assignee:
Nokia, Inc. - Irving TX
International Classification:
H04J003/17
US Classification:
370329, 370350, 3703954, 370458
Abstract:
A method for collocated nodes communicating over a first interface to agree on a conflict-free transmission schedule among themselves, which they can then use to collaborate with neighbors accessed through a second interface, for example through wireless links in order to obtain collision-free transfers of unicast, multicast and broadcast packets over wireless channels, and channel access delay guarantees. The collocated nodes behave as a single virtual node for the purpose of establishing a consistent transmission schedule throughout the nodes of a multihop wireless network.

Adaptive Communication Protocol For Wireless Networks

View page
US Patent:
7184413, Feb 27, 2007
Filed:
Feb 10, 1999
Appl. No.:
09/248738
Inventors:
David A. Beyer - Los Altos CA, US
Chane L. Fullmer - Santa Cruz CA, US
Assignee:
Nokia Inc. - Espoo
International Classification:
H04L 12/28
H04J 3/02
H04J 3/06
H04Q 7/24
US Classification:
370254, 370338, 370462, 370503
Abstract:
A communication protocol that provides link-level and media access control (MAC) level functions for wireless (e. g. , ad-hoc) networks and is robust to mobility or other dynamics, and for scaling to dense networks. In a mobile or otherwise dynamic network, any control-packet collisions will be only temporary and fair. In a dense network, the network performance degrades gracefully, ensuring that only a certain percentage of the common channel is consumed with control packets. The integrated protocol allows packets (e. g. , data scheduling control packets) to be scheduled in a collision-free and predictable manner (known to all neighbors), multicast packets can be reliably scheduled, as well as streams of delay- or delay-jitter-sensitive traffic. Further, using an optional network code, the scheduling of control packets can appear to observers to be randomized.

Protocol For Neighborhood-Established Transmission Scheduling

View page
US Patent:
6788702, Sep 7, 2004
Filed:
Oct 15, 1999
Appl. No.:
09/418899
Inventors:
David A. Beyer - Los Altos CA
Chane L. Fullmer - Santa Cruz CA
Assignee:
Nokia Wireless Routers, Inc. - Mountain View CA
International Classification:
H04L 1243
US Classification:
370458, 370431, 370337
Abstract:
Scheduling packets are exchanged among neighboring nodes of a computer network. These scheduling packets include descriptions of a transmitting nodes 2-hop neighborhood within the computer network, and nodes are able to determine transmission schedules from information received via said scheduling packets. Preferably, the computer network is a synchronized network in which time is dived into a number of frames, each of which are made up of a plurality of slots. In such cases, the exchange of scheduling packets should occur within a first number of the slots of each frame, preferably in a common communication channel. Transmission schedules may be determined, at least in part, because nodes advertise their availability using the scheduling packets. The above-mentioned descriptions may include an identification of received communication times and/or channels, an identification of requested communication times and/or channels and an identification of available communication times and/or channels. The requested communication times and/or channels should correspond to available times and/or channels advertised by one or more nodes of the computer network.
Chane L Fullmer from Port Orford, OR, age ~75 Get Report