Protocol for wireless multi-hop ad-hoc networks

• US 20050128958A1
• Filed: 12/09/2004
• Published: 06/16/2005
• Est. Priority Date: 12/10/2003
• Status: Abandoned Application

• Current Assignee: Sony Deutschland GmbH (Sony Group Corp.)
• Original Assignee: Sony Deutschland GmbH (Sony Group Corp.)
• Inventors: Hamdan, Amen
• Application Number:
  US11/008,558
• Publication Number:
  US 20050128958A1
• Time in Patent Office: Days
• US Class Current: 370/254
• CPC Class Codes: H04L 67/04 specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04W 4/00 Services specially adapted for wireless communication networks; Facilities therefor
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 92/18 between terminal devices

Abstract

The invention relates to the field of service provisioning in wireless peer-to-peer networks organized according to the store-and-forward messaging principle, in particular to a service discovery protocol for providing low-profile, low-overhead service discovery information needed for determining the availability of requested remote services in a wireless multi-hop ad-hoc network.

Claims

1. A method for providing service discovery information and other data for determining the availability of requested remote services in a peer-to-peer-based wireless multi-hop ad-hoc network,

said method being characterized by the step of

delivering received service announcement messages referring to remote services offered by service providers within said network to neighboring peers and

discarding outdated and irrelevant messages.

2. A method according to claim 1,

characterized by said peer executing the following steps:

receiving said service announcement messages,

discarding messages which are identical with old service announcement messages that have already been received by this peer and accumulating new service announcement messages in a local message pool assigned to said peer,

tagging each service announcement message received by this peer with a relevance value,

adding the relevance values of all service announcement messages stored in said local message pool, thus yielding a cumulative relevance value, and,

once this cumulative relevance value exceeds a predefined relevance threshold value, aggregating all service announcement messages stored in said local message pool and sending them to all neighboring peers of said peer.

3. A method according to claim 2,

characterized by the step of

setting the relevance threshold values of local message pools assigned to mobile peers to a higher value than the threshold values of local message pools assigned to stationary peers.

4. A method according to claim 3,

characterized by the step of

dynamically changing said relevance threshold value according to external conditions.

5. A method according to claim 4,

characterized in that a first peer announcing available services within said network executes the steps of

determining whether a neighboring second peer is running low on energy and/or other information concerning varying resource availability within said network and/or changing link characteristics between said peers and,

if this is the case, increasing the relevance threshold value of the according local message pool of said first peer to avoid sending unnecessary service announcement messages to said second peer.

6. A method according to claim 5,

characterized by said first peer executing the step of sending received and aggregated service announcement messages to all neighboring peers in case the number of stored service announcement messages in the local message pool assigned to said first peer exceeds a certain number threshold.

7. A method according to claim 5,

characterized by said first peer executing the step of sending received and aggregated service announcement messages to all neighboring peers in case the time passed since the reception of the last service announcement message exceeds a predefined time period threshold.

8. A method according to claim 1,

characterized by said first peer executing the step of recalculating the relevance values of received service announcement messages by subtracting a percentage of degeneration given by a relevance degeneration rate from the respective relevance value, said degeneration rate being the greater the number of hops a service announcement messages has been propagated such that service announcement messages are quickly spread to near-by peers but only slowly propagated to peers farther away from said first peer.

9. A method according to claim 1,

characterized by said first peer executing the steps of

monitoring the availability of neighboring peers within said network and,

in case a peer is no longer present in the network and thus services hosted on that peer are lost, propagating the loss of these service throughout the entire network.

10. A method according to claim 1,

characterized in that said first peer,

in case the content of the local message pool assigned to said first peer is sent to anyone of its neighboring peers or to a multiplicity of them, supplies said neighboring peers with a short outline of service announcement messages to be propagated, said outline including at least a service identifier, the address of a peer hosting the service and a message identifier, such that a neighboring peer receiving these data can decide whether said message is of particular interest to it or not.

11. A method according to claim 1,

characterized by said first peer executing the steps of

proactively querying a local service table containing information on the availability of specific services of interest from a peer hosting these services,

in case locally none is available, executing a service discovery protocol for providing service discovery information needed for determining the availability of the requested services within said multi-hop ad-hoc network, and,

once some services of interest are known, retrieving more detailed information on these services and forwarding this information to all neighboring peers.

12. A software program product

designed to implement a method according to claim 1.