Method of Improving Communication Between Mobile Nodes

• US 20080247310A1
• Filed: 01/17/2005
• Published: 10/09/2008
• Est. Priority Date: 01/29/2004
• Status: Abandoned Application

• Current Assignee: Koninklijke Philips Electronics N.V. (Koninklijke Philips N.V.)
• Original Assignee: Koninklijke Philips N.V.
• Inventors: Van Wageningen, Andries, Ruffini, Marco, Reumerman, Hans-Jurgen, Roggero, Marco
• Application Number:
  US10/597,522
• Publication Number:
  US 20080247310A1
• Time in Patent Office: Days
• US Class Current: 370/230
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04W 4/06 Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

To improve a method of improving communication between mobile nodes in an ad-hoc wireless network and in particular to reduce the amount of data to be transmitted, all the nodes are organized into application-specific clusters and the information that is relevant to each application is stored in the head element of the cluster.

Claims

1. A method of improving communication between mobile nodes in an ad-hoc wireless network, characterized in that all the nodes are organized into application-specific clusters and the information relevant to each application is stored in the head element of the cluster.

2. A method as claimed in claim 1, characterized in that each node becomes part of one or more clusters.

3. A method as claimed in claim 1, characterized in that each node in the cluster passes on the application-specific information to the head element or receives said information there from.

4. A method as claimed in claim 1, characterized in that the head element is selected at random or in accordance with given rules.

5. A method as claimed in claim 1, characterized in that mobile and quasi-stationary clusters are formed.

6. A method as claimed in claim 1, characterized in that, before leaving the cluster, a head element notifies the nodes of this and the data stored in the head element is transmitted to a new head element.

7. A method as claimed in claim 1, characterized in that the head element collects and filters the data from all the nodes.

8. A method as claimed in claim 7, characterized in that the filtered information that is important to the application is passed on to all the nodes and stored in them.

9. Use of a method as claimed in claim 1 for controlling a flow of traffic.