Patents by Inventor Alaattin Caliskan

Alaattin Caliskan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9979635
    Abstract: Computer networks with multiple nodes are often required to deliver packets to all nodes in the network, commonly referred to as “flooding.” Flooding is used to deliver multicast and broadcast packets generated by application, network and other layers of the networking stack. Flooding can be done very reliably but less efficiently via node to node “unicast” transmissions, or very efficiently but less reliably via “broadcast” transmissions. In order to balance reliability with efficiency, this invention defines a threshold for the number of neighboring nodes as seen by a given node prior to a flooding operation to determine whether data should be unicast or broadcast. Below that threshold, unicast is used; at or above that threshold, broadcast is used. The invention also incorporates knowledge of nodes seen in turn by neighbor nodes as part of this decision.
    Type: Grant
    Filed: December 7, 2016
    Date of Patent: May 22, 2018
    Assignee: Rajant Corporation
    Inventors: Paul R. Hellhake, Martin A. Lamb, Alaattin Caliskan, David Acker, Joseph E. Parks
  • Publication number: 20170093697
    Abstract: Computer networks with multiple nodes are often required to deliver packets to all nodes in the network, commonly referred to as “flooding.” Flooding is used to deliver multicast and broadcast packets generated by application, network and other layers of the networking stack. Flooding can be done very reliably but less efficiently via node to node “unicast” transmissions, or very efficiently but less reliably via “broadcast” transmissions. In order to balance reliability with efficiency, this invention defines a threshold for the number of neighboring nodes as seen by a given node prior to a flooding operation to determine whether data should be unicast or broadcast. Below that threshold, unicast is used; at or above that threshold, broadcast is used. The invention also incorporates knowledge of nodes seen in turn by neighbor nodes as part of this decision.
    Type: Application
    Filed: December 7, 2016
    Publication date: March 30, 2017
    Inventors: Paul R. HELLHAKE, Martin A. LAMB, Alaattin CALISKAN, David ACKER, Joseph E. PARKS
  • Patent number: 9531632
    Abstract: Computer networks with multiple nodes are often required to deliver packets to all nodes in the network, commonly referred to as “flooding.” Flooding is used to deliver multicast and broadcast packets generated by application, network and other layers of the networking stack. Flooding can be done very reliably but less efficiently via node to node “unicast” transmissions, or very efficiently but less reliably via “broadcast” transmissions. In order to balance reliability with efficiency, this invention defines a threshold for the number of neighboring nodes as seen by a given node prior to a flooding operation to determine whether data should be unicast or broadcast. Below that threshold, unicast is used; at or above that threshold, broadcast is used. The invention also incorporates knowledge of nodes seen in turn by neighbor nodes as part of this decision.
    Type: Grant
    Filed: November 11, 2013
    Date of Patent: December 27, 2016
    Assignee: Rajant Corporation
    Inventors: Paul R. Hellhake, Martin A. Lamb, Alaattin Caliskan, David Acker, Joseph E. Parks
  • Publication number: 20140219091
    Abstract: Computer networks with multiple nodes are often required to deliver packets to all nodes in the network, commonly referred to as “flooding.” Flooding is used to deliver multicast and broadcast packets generated by application, network and other layers of the networking stack. Flooding can be done very reliably but less efficiently via node to node “unicast” transmissions, or very efficiently but less reliably via “broadcast” transmissions. In order to balance reliability with efficiency, this invention defines a threshold for the number of neighboring nodes as seen by a given node prior to a flooding operation to determine whether data should be unicast or broadcast. Below that threshold, unicast is used; at or above that threshold, broadcast is used. The invention also incorporates knowledge of nodes seen in turn by neighbor nodes as part of this decision.
    Type: Application
    Filed: November 11, 2013
    Publication date: August 7, 2014
    Applicant: Rajant Corporation
    Inventors: Paul R. Hellhake, Martin A. Lamb, Alaattin Caliskan, David Acker, Joseph E. Parks
  • Patent number: 7436789
    Abstract: A node is suitable for a wireless network. A wireless network comprises one or more sensor nodes and/or one or more control nodes. In the wireless network, the sensor node transmits in response to a sensed event and/or a request from a control node. A transmission/routing of data between a sensor node and/or a control node may be subject to a policy constraint and a resource constraint.
    Type: Grant
    Filed: July 27, 2004
    Date of Patent: October 14, 2008
    Assignee: Sarnoff Corporation
    Inventors: Alaattin Caliskan, Paul Hashfield, Indur Mandhyan, Robert J. Siracusa
  • Publication number: 20050078672
    Abstract: A node is suitable for a wireless network. A wireless network comprises one or more sensor nodes and/or one or more control nodes. In the wireless network, the sensor node transmits in response to a sensed event and/or a request from a control node. A transmission/routing of data between a sensor node and/or a control node may be subject to a policy constraint and a resource constraint.
    Type: Application
    Filed: July 27, 2004
    Publication date: April 14, 2005
    Inventors: Alaattin Caliskan, Paul Hashfield, Indur Mandhyan, Robert Siracusa
  • Publication number: 20040028023
    Abstract: A system, apparatus and method for providing an ad-hoc network of sensors. More specifically, the ad-hoc networked sensor system is based on novel network protocols that produce a self-organizing and self-healing network.
    Type: Application
    Filed: April 18, 2003
    Publication date: February 12, 2004
    Applicant: Sarnoff Corporation
    Inventors: Indur B. Mandhyan, Paul Hashfield, Alaattin Caliskan, Robert Siracusa