Decentralized network system

• US 6,671,737 B1
• Filed: 09/24/1999
• Issued: 12/30/2003
• Est. Priority Date: 09/24/1999
• Status: Expired due to Term

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Xerox Corporation (Xerox Holdings Corp.)
• Inventors: Glance, Natalie S., Snowdon, Dave
• Primary Examiner(s): DONAGHUE, LARRY D
• Application Number:
  US09/404,175
• Time in Patent Office: 1,558 Days
• Field of Search: 709/243, 709/219, 709/229, 709/227, 709/213, 710/62, 344/463, 340/539
• US Class Current: 709/243
• CPC Class Codes: H04W 28/14 using intermediate storage
• CPC Class Codes: H04W 4/12 Messaging; Mailboxes; Announcements
• CPC Class Codes: H04W 8/24 Transfer of terminal data
• CPC Class Codes: H04W 88/04 adapted for relaying to or from another terminal or user

Abstract

A decentralized network system provides for the distribution and collection of information (or messages) without the constraints of a large physical infrastructure. A decentralized network system includes a plurality of first nodes, each first node having a memory for storing messages, a processor for processing messages in accordance with a predetermined relationship and a communications port for transmitting and receiving messages. The first nodes are attached to some physical device or to a location. A plurality of mobile second nodes is also provided. Each second node includes a memory for storing messages, a processor for creating messages in response to user input and for processing messages in accordance with a predetermined relationship and a communications port for transmitting and receiving messages. Preferably, each second node is a personal digital assistant (PDA). The mobile second nodes are moved by users, who provide the means for transmitting messages from one first node to another first node. Transmission of a message from one node to another node is accomplished through a sequence of message exchanges between pairs of first nodes and second nodes.

Claims

1. A decentralized network system, comprising:

a plurality of nodes including a plurality of fixed nodes and a plurality of mobile nodes;

wherein each fixed node includes a memory for storing pollen and a communications port for transmitting and receiving pollen and wherein each fixed node is associated with a device or location;

wherein each mobile node includes a memory for storing pollen, a processor for processing pollen in accordance with a predetermined relationship for creating, storing and handling pollen and a communications port for transmitting and receiving pollen, wherein the processor, responsive to a user input, generates a pollen;

wherein pollen is transmitted node by node across the network from a source node to a destination node, in the absence of a connection between the source node and the destination node, through a sequence of pollen exchanges between nodes resulting from relative random movement of mobile nodes and relative random interactions of mobile nodes with fixed nodes and other mobile nodes; and

wherein pollen comprises content and information having a state representing the pollen'"'"'s transmission status.

2. The system of claim 1, wherein each device is selected from the group of printer, facsimile, telephone, PicTel, MFD and book.

3. The system of claim 1, wherein each location is selected from the group of office, meeting room, reception area, library and building.

4. The system of claim 1, wherein a pollen'"'"'s state is selected from the group of new, in transit, delivered and expired.

5. The system of claim 1, wherein each fixed node further comprises a processor for processing pollen in accordance with a predetermined relationship and wherein the predetermined relationship for processing pollen in each fixed node comprises rules for storing, retaining and discarding pollen based on relevance to the device or location associated with the fixed node.

6. The system of claim 1, wherein each fixed node further comprises a pollen state machine for modifying the state of the pollen, wherein each time pollen is transmitted to a subsequent node the state of the pollen is changed.

7. The system of claim 1, wherein each mobile node further comprises a pollen state machine for modifying the state of the pollen, wherein each time pollen is transmitted to a subsequent node the state of the pollen is changed.

8. The system of claim 1, wherein each pollen further comprises a unique identifier.

9. The system of claim 1, wherein each pollen further comprises information pertaining to a destination node.

10. The system of claim 1, wherein each pollen further comprises an expiration time.

11. The system of claim 1, wherein each first node comprises a programmable, miniature computer.

12. The system of claim 1, wherein each first node comprises an iButton.

13. The system of claim 1, wherein each second node comprises personal digital assistant.

14. The system of claim 1, further comprising a third node having a memory for storing pollen, a processor for processing pollen in accordance with a predetermined relationship and a communications port for transmitting and receiving pollen with the second nodes, wherein the processor, upon communicating with a second node, updates the status of any pollen stored in the second node'"'"'s memory.

15. The system of claim 14, wherein the third node processor processes information pertaining to exchanges between pairs of fixed nodes and mobile nodes to obtain information pertaining to traffic patterns among the mobile nodes.

16. A decentralized network system, comprising:

a plurality of nodes including a plurality of fixed nodes and a plurality of mobile nodes;

wherein each fixed node includes a memory for storing messages, a processor for processing messages in accordance with a predetermined relationship based on relevance to a device or location associated with the fixed node and a communications port for transmitting and receiving messages;

wherein each mobile node includes a memory for storing messages, a processor for processing messages in accordance with a predetermined relationship for creating, storing and handling messages and a communications port for transmitting and receiving messages, wherein the processor, responsive to a user input, generates a message;

wherein a message is transmitted node by node across the network from a source node to a destination node, in the absence of a connection between the source node and the destination node, through a sequence of message exchanges between nodes resulting from relative random movement of mobile nodes and relative random interactions of mobile nodes with fixed nodes and other mobile nodes; and

wherein a message comprises information having a state representing a transmission status of the message.

17. The system of claim 16, wherein a message'"'"'s state is selected from the group of new, in transit, delivered and expired.

18. The system of claim 16, wherein the predetermined relationship for processing messages in each first node comprises rules for storing, retaining and discarding messages.

19. The system of claim 16, wherein each first node and each second node further comprises a message state machine for modifying the state of the message.

20. The system of claim 16, wherein each message further comprises information pertaining to a destination node.

21. The system of claim 16, wherein each message further comprises an expiration time.

22. The system of claim 16, further comprising a third node having a memory for storing messages, a processor for processing messages in accordance with a predetermined relationship, and a communications port for transmitting and receiving messages with the second nodes, wherein the processor, upon communicating with a second node, updates the status of any messages stored in the second node'"'"'s memory.

23. The system of claim 22, wherein the third node processor processes information pertaining to exchanges between pairs of first nodes and second nodes to obtain information to traffic patterns among the second nodes.

24. A method for managing exchanges of messages in a decentralized network system, comprising:

a plurality of nodes including a plurality of first nodes and a plurality of mobile second nodes;

wherein each first node is associated with a device or location and wherein each first node includes a memory for storing messages and a processor for processing messages in accordance with a predetermined relationship based on relevance to a device or location associated with the first node;

wherein each second node is associated with a user and wherein each second node includes a memory for storing messages and a processor for generating and processing messages in accordance with a predetermined relationship for creating, storing and handling messages;

coupling a first node with a second node, said coupling resulting from relative random movement of second nodes and relative random interactions of second nodes with first nodes and other second nodes;

exchanging messages between the first node and the second node in accordance with each node'"'"'s predetermined relationship;

wherein, when a messages is exchanged, the state of the message is changed.