Patents by Inventor Avinash Joshi

Avinash Joshi 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).

  • Publication number: 20070274320
    Abstract: In a network comprising a source, a destination, and intermediate nodes along a route between the source and the destination, techniques are provided for allocating one or more time slots to transmit a particular data stream along the route based on the QoS requirements to transmit the particular data stream. In one implementation, a Scout Request message (SRM) is sent from the source to the destination to allocate time slots along the route to transmit a particular data stream to the destination. The SRM can include QoS requirements to transmit the particular data stream. Each intermediate node along the route can allocate one or more time slots to transmit the particular data stream based on the QoS requirements needed to transmit the particular data stream along the route.
    Type: Application
    Filed: May 25, 2006
    Publication date: November 29, 2007
    Applicant: MOTOROLA, INC.
    Inventors: Avinash Joshi, Manish Shukla
  • Publication number: 20070274272
    Abstract: In a network comprising a source, a destination, and intermediate nodes along a route between the source and the destination, techniques are provided for allocating one or more time slots to transmit a particular data stream along the route based on the QoS requirements to transmit the particular data stream. In one implementation, a Scout Request message (SRM) is sent from the source to the destination to allocate time slots along the route to transmit a particular data stream to the destination. The SRM can include QoS requirements to transmit the particular data stream. Each intermediate node along the route can allocate one or more time slots to transmit the particular data stream based on the QoS requirements needed to transmit the particular data stream along the route.
    Type: Application
    Filed: May 25, 2006
    Publication date: November 29, 2007
    Applicant: MOTOROLA, INC.
    Inventors: Avinash Joshi, Manish Shukla
  • Publication number: 20070266143
    Abstract: A system and method for distributing proxying error information in wireless networks is provided. The includes associating a proxy node with a non-routable node; sending a data packet from an initiator node to the proxy node for delivery to the non-routable node; determining by the proxy node that the non-routable device has disassociated from the proxy node; sending a proxy error message from the proxy node to the initiator node to inform the initiator node that the non-routable node is no longer proxied by the proxy node; and starting a route discovery process for the non-routable device by the initiator node.
    Type: Application
    Filed: May 12, 2006
    Publication date: November 15, 2007
    Applicant: MOTOROLA, INC.
    Inventors: Surong Zeng, Keith Goldberg, Avinash Joshi
  • Patent number: 7280483
    Abstract: A system and method for calculating an optimal route at a node by making use of routing metrics which if carefully chosen, can provide stability to the network and also provide features like Self Healing and Load Balancing. A Routing metric is calculated as a scalar number based upon a number of factors, such as number of hops, data rate, link quality and device type. Each factor can be determined by evaluation of Hello messages, or other routing messages as required.
    Type: Grant
    Filed: June 7, 2004
    Date of Patent: October 9, 2007
    Assignee: MeshNetworks, Inc.
    Inventor: Avinash Joshi
  • Publication number: 20070211686
    Abstract: Techniques are provided for reliably distributing network management information in and ad hoc multi-hop wireless network which includes a number of existing nodes. A first node selects a particular timeslot in a dedicated channel based on the network management information received from the neighbor nodes and determines, via a contention channel, if the particular timeslot is being used by any neighbor nodes of the first node. If the particular timeslot is determined to be unused, then it is assigned to the first node for periodically transmitting network management information.
    Type: Application
    Filed: February 6, 2006
    Publication date: September 13, 2007
    Inventors: John Belcea, Pertti Alapuranen, Michael Johnson, Avinash Joshi, Robin Roberts
  • Patent number: 7269155
    Abstract: A system and method for enabling an ad-hoc communication network to maintain connectivity with the mobile nodes in the network in an effective and efficient manner with minimal overhead. The system and method enables an ad-hoc communication network to maintain connectivity between intelligent access points of the network and mobile nodes in the network while performing an on-demand protocol. The system and method further uses an improved distance vector routing algorithm and unicast messages, to thus avoid an increase routing advertisement frequency in the network while keeping network overhead at a minimum. The system and method also modifies the Ad Hoc On-Demand Distance Vector Routing (AODV) protocol to facilitate smooth handoff of subscriber devices in an ad-hoc communication network while also eliminating unidirectional links between nodes in the network.
    Type: Grant
    Filed: January 10, 2006
    Date of Patent: September 11, 2007
    Assignee: Meshnetworks, Inc.
    Inventor: Avinash Joshi
  • Publication number: 20070183344
    Abstract: Techniques are provided for determining mobility of a first node in an ad hoc network. A particular node generates a fixed neighbor node table comprising second nodes in the area of the particular node which are not mobile. The particular node can monitor changes between the first node and the second nodes, and then determine if the first node is mobile based on the changes.
    Type: Application
    Filed: February 3, 2006
    Publication date: August 9, 2007
    Inventor: Avinash Joshi
  • Patent number: 7251238
    Abstract: A method and system for routing data in a wireless network (400) that enables all nodes (106, 402, 404, 406, 408) to find routes to each other even if the nodes are incapable of operating as a router to route packets received from other nodes (106, 402, 404, 406, 408). The meshed nodes (106, 402) which are capable of performing packet routing act as proxy nodes for their associated non-meshed nodes (STA 13-STA 15) to route packets from their associated non-meshed nodes (STA 13-STA 15) to destination nodes. Some of the meshed nodes further operate as intelligent access points (106) to provide the non-meshed nodes and other meshed nodes with access to other networks, such as the Internet (402).
    Type: Grant
    Filed: September 7, 2005
    Date of Patent: July 31, 2007
    Assignee: Meshnetworks, Inc.
    Inventors: Avinash Joshi, Surong Zeng, William Vann Hasty, Jr., Charles R. Barker, Jr., Robin U. Roberts, Keith J. Goldberg
  • Publication number: 20070165592
    Abstract: The present invention provides a system and method for multihop packet forwarding within a multihop wireless communication network. The method uses a data frame format including at least the four address fields to forward packets in a multihop wireless network. The method includes generating a route request packet at a routable device in response to receiving a packet destined for an unknown destination. The route request packet includes an originating device field including an address of an originating device, wherein the originating device generated the packet originally; and a source field, wherein the source field includes an address of the first routable device which generated the route request packet.
    Type: Application
    Filed: January 12, 2007
    Publication date: July 19, 2007
    Applicant: MOTOROLA, INC.
    Inventors: Hrishikesh Gossain, Pankaj Aggarwal, Charles Barker, Keith Goldberg, William Hasty, Avinash Joshi, Shyamal Ramachandran, Surong Zeng, Heyun Zheng, Sebnem Ozer
  • Publication number: 20070160009
    Abstract: Techniques are provided for determining mobility of a first node in an ad hoc network. A particular node generates a fixed neighbor node table comprising second nodes in the area of the particular node which are not mobile. The particular node can monitor changes between the first node and the second nodes, and then determine if the first node is mobile based on the changes.
    Type: Application
    Filed: January 10, 2006
    Publication date: July 12, 2007
    Inventor: Avinash Joshi
  • Publication number: 20070153789
    Abstract: Techniques are provided for providing information to a group of nodes over a medium. Before transmitting information to the group of nodes, a source can analyze factors to determine transmission reliability of a first transmission technique and a second transmission technique and generate an analysis result. Based on the result of this analysis, the source can select one of the first transmission technique and the second transmission technique for providing the information to the group of nodes over the medium.
    Type: Application
    Filed: January 3, 2006
    Publication date: July 5, 2007
    Inventors: Charles Barker, Avinash Joshi
  • Publication number: 20070133488
    Abstract: A node (200) includes a processor (201) for determining neighbor nodes in a routing path to a destination based on a routing table associated with the node (200). The node (200) includes a memory for storing a first authenticated tokens. The node includes a transmitter (203) for transmitting a first request-to-route (RTR) message including an indication specifying information units (IUs) from the first node to the neighbor nodes in a routing path from the first node to the destination. The node (200) includes a receiver (205) for receiving a neighbor reply message from one of the neighbor nodes to the first node which indicates that the neighbor node will route the information units (IUs). The transmitter (203) transmits a second authenticated tokens from the first node to one of the neighbor nodes. The second authenticated tokens are converted into a tradable entity and provide compensation to the neighbor node selected.
    Type: Application
    Filed: December 14, 2005
    Publication date: June 14, 2007
    Inventors: Sivakumar Muthuswamy, Rajeev Agrawal, Yogesh Bhatt, Avinash Joshi, Surender Kumar
  • Publication number: 20070127386
    Abstract: A system and method for increasing the capacity of a wireless network (100, 300) including a plurality of access points (APs) (106, 305) and a plurality of nodes (200), at least one of said nodes (200) and at least one of said APs (106, 305) including multiple radios (310), the method comprising: (i) determining the routing metrics to one of said APs through each radio interface that is common between one of the nodes and that AP; (ii) selecting the radio interface whose routing metrics meet a desired criteria for packet stream transmission between the at least one node and the AP; and (iii) transmitting at least one packet stream from the node to the AP through the selected radio interface.
    Type: Application
    Filed: December 7, 2005
    Publication date: June 7, 2007
    Inventors: Avinash Joshi, Shyamal Ramachandran
  • Publication number: 20070127379
    Abstract: A system and method for improving a current wireless communication route, between a source node and a destination node in an on-demand wireless communication network, enables the current communication route to be improved even when the current route has not failed. The method includes analyzing at a local node a packet transmission from the source node, the packet transmission comprising a current route metric (step 705). The local node then determines that it can provide an improved wireless communication route, between the source node and the destination node, having a better route metric than the current route metric (step 710). A route improvement message is then transmitted from the local node to the source node (step 740).
    Type: Application
    Filed: December 7, 2005
    Publication date: June 7, 2007
    Inventors: Hrishikesh Gossain, Avinash Joshi
  • Publication number: 20070127421
    Abstract: A method and apparatus for electing broadcast relay nodes (520B, H, M) in an ad hoc network (500). Each node (520A-520O) generates an attribute message including associated parameters. Each node (520A-520O) generates a weighted value (WV) based on the parameters. The WV can be included in the attribute message for that node, can provide a metric for ranking that node to be nominated to be a broadcast relay node, can alternatively provide a probability measure for that node to probabilistically elect itself as a broadcast relay node. The broadcast manager node (520C) receives the attribute messages and elects at least one nominated node as a broadcast relay node (520B, H, M) based on the attribute messages. Each node (520A-520O) can also initiate election of an intermediate broadcast relay node if that node fails to receive a test message within a predetermined time.
    Type: Application
    Filed: December 7, 2005
    Publication date: June 7, 2007
    Inventors: Thomas D'Amico, Jeffrey Bonta, Randy Ekl, Avinash Joshi, Michael Kotzin, Surender Kumar, Whay Lee, Peggy Matson
  • Publication number: 20070121521
    Abstract: Techniques are provided for allowing a node (300) in an ad hoc network to deterministically decide whether to relay broadcast information to another node in the ad hoc network. The node (300) receives broadcast information and measures received signal strength (RSS) of the broadcast information. The node (300) may determine if the measured RSS is below a low threshold, and if so, can relay the broadcast information to neighbor nodes. Otherwise, the node (300) can also determine if the measured RSS is above a high threshold, and if not, wait for a waiting period before relaying the broadcast information to the neighbor nodes. The node (300) may dynamically adjust the low threshold by decreasing the low threshold as the number of neighbor nodes increases and may dynamically adjust the high threshold by increasing the high threshold as the number of neighbor nodes decreases.
    Type: Application
    Filed: November 30, 2005
    Publication date: May 31, 2007
    Inventors: Thomas D'Amico, Avinash Joshi, Michael Kotzin, Sivakumar Muthuswamy
  • Patent number: 7215966
    Abstract: A system and method for message exchanges in a wireless communication network which minimize network overhead and offers fast determination of Coordinates of a device. A system and method controls a node to exchange small, structured messages with one or more reference nodes requesting the Coordinates of the reference node, which are then used in a periodic evaluation of time of flight messages from that reference node for determination of Coordinates of the node.
    Type: Grant
    Filed: June 7, 2004
    Date of Patent: May 8, 2007
    Assignee: MeshNetworks, Inc.
    Inventor: Avinash Joshi
  • Publication number: 20070087696
    Abstract: A system and method for using an ad hoc surrogate device (103, 103?) for reporting a service abnormality where the surrogate mobile device operates on a second communications system, such as a cellular telephone system, to collect and deliver diagnostic or other service abnormality information from a first communications system using Bluetooth, WiFi or the like. Any device utilizing Bluetooth or WiFi can be modified to fulfill the need for reporting service problems without the use of telemetry or other continuous monitoring systems.
    Type: Application
    Filed: October 17, 2005
    Publication date: April 19, 2007
    Inventors: Jeffrey D. Bonta, Benedito J. Fonseca, Avinash Joshi
  • Publication number: 20070076673
    Abstract: An improved system and method for discovering and maintaining multiple routes in a wireless communication network (100), in particular, a wireless multi-hopping ad-hoc peer-to-peer communication network (100). The system and method use a combination of proactive and reactive routing protocols to effectively and efficiently discover and maintain multiple routes between nodes (106, 107).
    Type: Application
    Filed: September 30, 2005
    Publication date: April 5, 2007
    Inventor: Avinash Joshi
  • Publication number: 20070076640
    Abstract: A method and system for indicating wireless interconnectivity between at least two electronic devices is useful for configuring wireless networks. The method includes activating at each device a wireless networking communication interface (step 305). At least one other device is then identified at each device (step 310). It is then determined at each device whether a wireless communication channel is operative with an identified at least one other device (step 315). An alarm is then triggered at each device that does not have a wireless communication channel operative with an identified at least one other device (step 320).
    Type: Application
    Filed: September 30, 2005
    Publication date: April 5, 2007
    Inventors: Jeffery Bonta, Avinash Joshi, Peggy Matson, Sivakumar Muthuswamy