USRE40985E1 - Method and device for prompt and efficient service discovery in wireless networks - Google Patents

Method and device for prompt and efficient service discovery in wireless networks Download PDF

Info

Publication number
USRE40985E1
USRE40985E1 US11981507 US98150707A USRE40985E1 US RE40985 E1 USRE40985 E1 US RE40985E1 US 11981507 US11981507 US 11981507 US 98150707 A US98150707 A US 98150707A US RE40985 E1 USRE40985 E1 US RE40985E1
Authority
US
Grant status
Grant
Patent type
Prior art keywords
service
device
message
devices
description
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
US11981507
Inventor
Reto Hermann
Dirk Husemann
Michael Moser
Michael Elton Nidd
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wistron Corp
Original Assignee
Wistron Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/16Service discovery or service management, e.g. service location protocol [SLP] or Web services

Abstract

Methods, system and apparatus are provided for advertising service offerings in a communication system. An example embodiment comprises at least one device. A first device broadcasts a message of a first type, chooses a value for a time limit and listens for a message sent by a second device. If no message has been received before time limit, elapse, it again broadcasts a message of a first type. Otherwise, the message received from said second device is analyzed and if said message includes valid information about said first device chooses a value for the time limit. However, if said message received does not include valid service description about said first device, a message of a second type is broadcast. This reduces useless broadcast of a complete service list. Broadcast may be initiated more often and, service discovery for new devices coming into proximity takes less time.

Description

FIELD OF THE INVENTION

This invention is directed to wireless local area networks and the communication between the devices forming such a network. More specifically, the present invention relates to a communication scheme which allows devices within the wireless local area network to announce their service and/or discover services provided by other devices.

BACKGROUND OF THE INVENTION

Computer terminals and peripherals have become dramatically smaller and more portable. Personal computers and peripherals are small enough to sit on the desk at work. Smaller still are lap top computers and notebook computers. There are computer terminals which are small enough to be mounted in a vehicle such as a delivery truck. Still smaller are the hand held terminals typically used for their portability features where the user can carry the terminal in one hand and operate it with the other. A physical connection of the above devices by means of cables or fibers might have drawbacks, such as configuration constraints because of the limited length of the cable, limited number of ports on the computer thus limiting the number of peripherals that can be attached, cumbersome reconfiguration of hardwired devices, etc. Note that there are some cable or fiber based communication systems where the limited number of ports on the computer does not really limit the number of peripherals Ethernet is one example of a communication system where the cable is used as a shared medium (other examples are token ring, FDDI (Fiber Distributed Data Interface), and DQDB (Distributed Queue Dual Bus)).

The smaller the devices get, the more important it becomes to replace fixed physical connections by wireless ad-hoc connections (e.g. body networks, radio frequency connections, or infrared connections), since physically connecting the computer terminals, peripherals, and other devices by means of cables or fibers severely reduces the efficiency gained by making the units smaller. Ad-hoc connections are required where devices move around, enter an area and exit the area. The term ad-hoc refers to the need for frequency network reorganization.

Local area communications are rapidly evolving into what can be called personal local area networks, which are networks for communication between local peers or sub-systems. These kind of networks will herein be referred to as local networks. Wireless communication is of particular importance in such local networks. There are different wireless communications approaches known that have been developed and designed with an eye on the communication between peers or subsystems of such local networks.

EP 1 022 876 A1 discloses an apparatus for exchanging service information with other devices. The presented apparatus comprises a transceiver, a processing unit, a memory for storing information about its local services and/or services provided by other devices, and a protocol resource manager. In an initial step the protocol resource manager triggers the transceiver to send service information, comprising information about itself and/or other known devices to other devices. Then it chooses a time-out value TA and ensures that the apparatus listens for up to a maximum time TA for service information received by said transceiver. If TA timed out without having received such service information by said transceiver, the resource manager triggers said transceiver to start with the initial step. If such service information was received by said transceiver prior to TA timing out, the resource manager checks whether said service information received comprises current and accurate information about itself. If yes, it chooses another time-out value TA and continues with the step of ensuring that the apparatus listens for up to a maximum time TA. If no, then the same behavior is observed, excepting that TA is chosen from an earlier time range than normal.

Furthermore, a scheme for advertising service offerings in a communications system is presented. The scheme comprising two devices, wherein a first of said two devices in an initial step sends service information, comprising current and accurate information about itself and/or other known devices. In a next step it choose a time-out value TA. Then it listens for up to maximum time TA for service information sent by another device. Subsequently, if TA has timed out it continues with the initial step, otherwise it checks whether or not service information sent by another device comprises information about itself (local services). If yes, then it continues with the step of choosing a time-out value. If no, then the same behavior is observed, excepting that TA is chosen from an earlier time range than normal.

SUMMARY OF THE INVENTION

An aspect of the present invention is to provide an efficient method and device for service discovery in wireless networks. In an example embodiment, this aspect is achieved by a method and a device which provides for advertising service offerings in a communication system comprising at least one device. A first device broadcasts a message of a first type, chooses a value TA for a time limit and listens and waits for a message sent by a second device.

According to a particular embodiment of the present invention the message of the first type comprises a digest of the service description of the first device and/or a digest of the service description of other devices, the service description of which are stored in the first device. Furthermore, the message of the second type comprises the service description of the first device and/or the service description of other devices, the service description of which are stored in the first device.

According to another embodiment of the present invention, the first device maintains a counter for each service description and the counter is incremented for a service description whenever the service description is broadcast with a message. In addition, the counter values may be analyzed for deriving a value indicating the distance between the first device and any of the other known devices.

A further embodiment of a method and device according to the present invention employs a push-model to distribute service descriptions to an environment of nodes that can communicate with each other through some wireless communication technology. Thus, instead of asking for a particular service and then waiting for an answer, the information gets pushed into the environment.

Advantageously, the present invention limits or avoids useless broadcast of a complete service list, since the complete service list is not broadcast every time, even if no other node might be around and thus able to receive the broadcast. Furthermore, a redundant broadcast of the complete service list is advantageously omitted also in the case when a service is about to expire, i.e., its time-to-live will reach zero within the next few seconds. Other aspects, features and advantages of the present invention, will be apparent in the following detailed written description.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention aspects and advantages are best understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:

FIG. 1 shows a first exemplary scenario to illustrate the present invention;

FIG. 2 shows a second exemplary scenario to illustrate the present invention;

FIG. 3 shows a third exemplary scenario to illustrate the present invention;

FIG. 4 shows a forth exemplary scenario to illustrate the present invention; and

FIG. 5 shows a fifth exemplary scenario to illustrate the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention provides efficient methods, apparatus and systems for service discovery in wireless networks. In an example embodiment, this is achieved by a method and a device which provides for advertising service offerings in a communication system comprising at least one device. A first device broadcasts a message of a first type, chooses a value TA for a time limit and listens and waits for a message sent by a second device. If no message has been received before elapse of the chosen time limit, the method and the system continues with again broadcasting a message of a first type. Otherwise, the message received from the second device is analyzed and if the message includes valid information about the first device, the method and device continues with choosing a value TA for a time limit. However, if the message received from the second device does not include valid service description about the first device, a message of a second type is broadcast.

According to a particular embodiment of the present invention the message of the first type comprises a digest of the service description of the first device and/or a digest of the service description of other devices, the service description of which are stored in the first device. Furthermore, the message of the second type comprises the service description of the first device and/or the service description of other devices, the service description of which are stored in the first device. In some cases, only a digest of the service description is sent for all devices for which the information received from the second device is valid, whereby the information received by the second device is formed by either the service description or a digest of it.

According to another embodiment of the present invention, the first device maintains a counter for each service description and the counter is incremented for a service descriptions whenever the service description is broadcast with a message. In addition, the counter values may be analyzed for deriving a value indicating the distance between the first device and any of the other known devices. This is sometimes accomplished by filtering out devices having a counter value higher than a predetermined threshold and considering them as to be too far away. Furthermore, a service is sometimes marked as being too far away in response to a message indicating that such service is too far away, whereby the message originates from a service considered not too far away.

An embodiment of a method and device according to the present invention employs a push-model to distribute service description to an environment of nodes that can communicate with each other through some wireless communication technology. Thus, instead of asking for a particular service and then waiting for an answer, the information gets pushed into the environment. By having other nodes formed by the different devices repeat what they have received the information of available services gets distributed.

Advantageously, the present invention avoids useless broadcast of a complete service list, since the complete service list is not broadcast every time, even if no other node might be around and thus able to receive the broadcast. Furthermore, a redundant broadcast of the complete service list is advantageously omitted also in the case when a service is about to expire, i.e., its time-to-live will reach zero within the next few seconds.

Other art methods and devices tend to choose fairly large service expiry times to conserve power on battery-driven devices to delay the energy ‘expensive’ broadcast of the entire service list as long as possible. However, the present invention advantageously overcomes such drawback by broadcasting only a minimum amount of data. Hence, according to the present invention the broadcast may be initiated more often and, consequently, the service discovery for new devices coming into proximity will take less time.

The concept of the present invention reduce or prevent propagation of services of nodes that are announced via second or third hand but that are in fact not reachable. Another advantage is that in a method or device in accordance with the present invention it is possible to derive an indication of service invocation failure, i.e., a failure to invoke an advertised service. Other aspects, features and advantages of the present invention, will be apparent in the following detailed written description.

The method and device of the present invention operate in an environment as subsequently described. There are at least two nodes, also referred to as devices, whereby the nodes are formed by some communication unit that is meant to establish a wireless communication connection to another communication unit. Each node maintains a list of service descriptions and participates in advertising its services via a broadcast mechanism. Such a wireless communication may be established in any communication system, such as a local network.

For the purpose of the present description, a local network is defined as being a network composed of at least two devices within mutual communication range of each other. Within such a local network the devices communicate with each other without the need for a wired network. The local network might be established by means of infrared (IR), radio-frequency (RF) or other means, such as the user's body. A local network does not need to have an access point for connection to a fixed network. The local network may be completely isolated from any other network, or it might comprise one or more access points which provide the (wireless) devices with access to the wired network.

A service is described by a service description, which includes a time-to-live indicator, i.e., a value representing a predetermined instant of time or time limit after its expiration the respective service is deemed to be unavailable. In case the service is still available a refresh of the indicator with a new value is required. The service description further includes the address of the node offering the service, whereby the address may be of a different format depending which communication technology or communication protocol is being used.

An underlying broadcast mechanism works as follows. Broadcasts are scheduled to occur within regularly recurring time windows, whereby only one node should broadcast in every window and the broadcasting node is determined by a race mechanism. That is a procedure in which all nodes schedule a broadcast at an individually chosen time in the future, then reschedule upon either receiving a broadcast from one of the other devices or reaching the chosen time (without having received a broadcast) and sending a broadcast themself. Nodes that detect their own service descriptions about to time out increase their chance to broadcast by choosing a shorter random back-off time.

Each node processes a newly received service list in the following way. Services that are already known to the local device, are offered by other devices, and have time-to-live values farther in the future than the locally held time-to-live values for those same services, have the local time-to-live values updated accordingly. Services that are not already known to the local device and are offered by other devices, are added to the set of services known to the local device. Services that are offered by the local device and either fail to appear in the received list of services, or appear but have time-to-live values insufficiently far in the future, are noted to signal the local device to schedule its next broadcast from an earlier than normal range.

Embodiments according to the present invention operate as described in the following in greater detail. Each device regularly broadcasts a message of a first type, referred to as “ping” to its environment. A ping is a broadcast to the environment including a service description digest Dd of known services. When a device X observes a ping by another device Y, that either does not include X's services or a version of one X's services that is outdated, it broadcasts a message of a second type, referred to as “pong”. A pong includes full service descriptions for those services that were missing or outdated in the ping. When device X did not know any of the services included in the ping, it responds with a pong where the service versions VS of the unknown services are set to nil. When the service description of one of the services offered by a device changes, the device will send a pong including a full service description for that service and an incremented service version VS.

When device U comes into reach of, for example, the three devices X, Y and Z there are two situations. First, device U send its ping broadcast first. In response, any of the devices X, Y and Z will answer with a pong including the full service descriptions and having U's service versions set to nil. U will then respond with a pong. Second, one of the devices X, Y, or Z sends a ping first. In response, device U will answer with a pong including its full service descriptions and the service versions of the ping set to nil. Then any of the devices X, Y, or Z will respond with a pong.

Depending on resources available, a node may choose to send a blast instead of a pong or just do so from time to time to establish a synchronized view of the environment, whereby a blast is a broadcast of the complete service description list Ld (including complete service descriptions) to the environment.

The present invention will now be explained with some exemplary scenarios as depicted in FIGS. 1 to 5. In all Figures there are three rectangular boxes marked by the addresses of the respective devices A 101, B 102 and C 103. The rectangular boxes represent internal lists of known services at each device. The lists comprise the description of their own service and about other services that they have previously received. For example, “A(1), expiry, detail”, wherein “A” represents the address of the device offering the respective service and “1” the version number of this description. The expression “expiry” illustrates the time limit, i.e., the useful lifetime for this advertisement that gets renewed for local services at each broadcast time. The word “detail” states whether or not a detailed description of the service being offered is available. A rounded box under a device description represents a broadcast advertisement being sent and a dotted line identifies a device that receives the related advertisement.

With reference now to FIG. 1, there are depicted two groups of devices. A first group includes of device A 101 and B 102, whereas a second group just includes of device C 103. All devices are in steady state, i.e., they have already received all detail service descriptions of other devices in reach. However, the first and second group are not in communication range of each other. Hence, the advertisement 112 sent by device C 103 is received neither by device A 101 nor device B 102. Similarly, the advertisement 111 sent by device A 101 is only received by device B 102, as indicated by the dotted line, but not by device C 103. Therefore, none of the devices start sending the details of their services offered.

Now with reference to FIG. 2, device C 203 has moved into communication range with devices A 201 and B 202. The next to broadcast of the three devices happens to be B 202. Now, C 203 receives the broadcast 211, as illustrated by the dotted line, and identifies two qualities. First, its local offerings are missing and, second, two unknown services are listed, since only compressed entries have been broadcast.

With reference now to FIG. 3, because of these unusual events, device C 303 selects its next broadcast time from a shorter range than usual, ensuring that it will advertise 311 before either device A 301 or device B 302. Since neither device A 301 nor device B 302 have seen any unusual information in the previous round, their time limit before sending another message will stay the same. When device C 303 sends its broadcast 311, it has responded to the two qualities of the round shown in FIG. 2 above as follows. First, it includes a fully qualified version of its own services in the message and, second, it explicitly requires details about the unknown compressed entries, as illustrated by the question marks at the respective positions in the list (In a physical embodiment, this query might be represented by nil version numbers). Both devices A 301 and B 302 receive this advertisement, and notice one unusual quality. Namely, explicit requests have been made to expand service offerings for which they know the details.

Referring now to FIG. 4, both devices A 401 and B 402 have received the advertisement from C 403 and, having identified a need to transmit further information. Therefore, they select their next broadcast time from a shorter range than usual, just as C 403 did in the round shown in FIG. 3. Either A 401 or B 402 could win this race. In the example shown in FIG. 4, however, it is device A 401 that wins. Device A 401 creates an advertisement 411 with fully qualified descriptions of both of the requested services, and sends it.

Both devices B 402 and C 403 receive the broadcast. Device B 402 has now seen the description request satisfied, therefore, it schedules its next broadcast from the usual range. Device C 403 now knows the full description of all services that it has heard of, and also sees its own services are known about, so it also schedules its next advertisement from the usual range.

All three devices 501, 502, 503 are now in steady state, as shown in FIG. 5, taking turns to renew their own services and advertise just as in the basic algorithm.

In another embodiment the present invention includes a hop count HS with each service description—both in the short service description dS and the full service description DS. Each node N will increment HS when including it in its service description digest Dd (or its service description list Ld). Low hop counts might imply a close distance to the service providing node, high hop counts might hint at a large distance. Using the hop count a node may filter out those service descriptions that it considers too far away, a configurable threshold value is used to distinguish devices of different distance.

A further embodiment of the present invention introduces the possibility to signal service invocation failures to the environment. A node can broadcast a service description digest Dd including a short service description dS with a reserved value for service expiry time of let say “−1” to indicate that it failed to invoke the service. Other nodes that receive the broadcast can choose to heed the advice and expire the service in their internal service list. Alternatively, they can ignore the advice, for example, when their hop count HS of the service concerned is far less than the hop count announced in the service digest, as in this case the service invocation failure might be due to invoking and invoked nodes being out of reach.

According to another embodiment of the present invention each node uses some averaging function to obtain a smoothed version hS of the hop counts it receives. One example of such an averaging function is h s = h s · H s a 1 · H s + a 2 · h s
with h′S representing the revised (new) value for hS and, e.g., a1=0.8 and a2=0.2. This averaging function favors small hop counts over large hop counts. Other functions are of course possible.

The present invention can be realized in hardware, software, or a combination of hardware and software. Any kind of computer system—or other apparatus adapted for carrying out the methods described herein—is suited. A typical combination of hardware and software could be a general purpose computer system with a computer program embodied as an article of manufacture and comprising a computer usable medium having computer readable program code means embodied therein that, when being loaded and executed, controls the computer system such that it carries out the methods described herein. The present invention can also be embedded in a computer program product stored on a computer usable medium and including computer readable program means for causing a computer to perform a method, and which comprises all the features enabling the implementation of the methods described herein. Moreover, the present invention can also include a program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps, and which—when loaded in a computer system—is able to carry out these methods described herein.

Computer program means or computer program in the present context mean any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following a) conversion to another language, code or notation; b) reproduction in a different material form.

It is noted that the foregoing has outlined some of the more pertinent objects and embodiments of the present invention. This invention may be used for many applications. Thus, although the description is made for particular arrangements and methods, the intent and concept of the invention is suitable and applicable to other arrangements and applications. It will be clear to those skilled in the art that other modifications to the disclosed embodiments can be effected without departing from the spirit and scope of the invention. The described embodiments ought to be construed to be merely illustrative of some of the more prominent features and applications of the invention. Other beneficial results can be realized by applying the disclosed invention in a different manner or modifying the invention in ways known to those familiar with the art.

Claims (40)

1. A method comprising advertising service offerings in a wireless communication system including at least one device wherein a first device performs the steps of:
broadcasting a message of a first type,
choosing a value for a time limit,
listening and waiting for a message from a second device,
if no message has been received until elapse of said time limit, continuing with the step of broadcasting a message of a first type, otherwise
analyzing the message received from said second device and if message includes valid information about said first device, continuing with the step of choosing a value for a time limit, and
broadcasting a message of a second type, if said message received from said second device does not include valid service description about said first device,
wherein the first device maintains a counter for each service description, and further comprising the step of incrementing the counter for service descriptions broadcast with a message, and further comprising the step of analyzing counter values and deriving a value indicating a distance between the first device and any of the other known devices.
2. The method according to claim 1, wherein said message of the first type comprises a digest of a service description of the first device.
3. The method according to claim 2, wherein said message of the first type comprises a digest of service descriptions of other devices, the service descriptions being stored in said first device.
4. The method according to claim 1, wherein said message of the second type comprises the service description of the first device.
5. The method according to claim 1, wherein said message of the second type comprises the service descriptions of other devices, the service description of which are stored in said first device.
6. The method according to claim 4, wherein only a digest of the service description is sent for all devices, for which information received from the second device is valid.
7. The method according to claim 1, wherein the information received by the second device is formed by one of the service description, a service description digest.
8. The method according to claim 1, wherein the step of analyzing counter values includes the step of filtering out devices having a counter value higher than a predetermined threshold.
9. The method according to claim 1, wherein the step of marking a service to be too far away in response to a message indicating such service is too far away, whereby the message originates from a service considered not too far away.
10. The method according to claim 1, wherein messages of the first and second type include counter values related to the service descriptions.
11. A system for advertising service offerings in a communication system comprising at least one device, the device comprising means adapted to perform the method according to claim 1.
12. A computer program product stored on a computer usable medium, comprising computer readable program means for causing a computer to perform a method according to claim 1.
13. An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing advertisement of service offering in a wireless communication system including at least one device, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of:
a first device performs the steps of:
broadcasting a message of a first type,
choosing a value for a time limit,
listening and waiting for a message from a second device,
if no message has been received until elapse of said time limit, continuing with the step of broadcasting a message of a first type, otherwise
analyzing the message received from said second device and if message includes valid information about said first device, continuing with the step of choosing a value for a time limit, and
broadcasting a message of a second type, if said message received from said second device does not include valid service description about said first device,
wherein the first device maintains a counter for each service description, and further comprising the step of incrementing the counter for service descriptions broadcast with a message, and
further comprising the step of analyzing counter values and deriving a value indicating a distance between the first device and any of the other known devices.
14. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for advertising service offerings, said method steps comprising the steps of:
a first device performs the steps of:
broadcasting a message of a first type,
choosing a value for a time limit,
listening and waiting for a message from a second device,
if no message has been received until elapse of said time limit, continuing with the step of broadcasting a message of a first type, otherwise
analyzing the message received from said second device and if said message includes valid information about said first device, continuing with the step of choosing a value for a time limit, and
broadcasting a message of a second type, if said message received from said second device does not include valid service description about said first device,
wherein the first device maintains a counter for each service description, and further comprising the step of incrementing the counter for service descriptions broadcast with a message, and
further comprising the step of analyzing counter values and deriving a value indicating a distance between the first device and any of the other known devices.
15. A method of discovering service information of a plurality of devices in a wireless communications system performed by a first device of said plurality of devices, the method comprising:
providing a first time limit for transmitting messages;
broadcasting a first message of a first type after expiration of the first time limit;
receiving a corresponding message from a second device;
providing a second time limit for transmitting messages; and
transmitting a second message of the first or a second type by the first device after expiration of a second time limit,
wherein the second message is of the first type if the corresponding message includes valid information of the first device,
wherein the second message is of the second type if the corresponding message does not include valid information of the first device,
wherein the first, second, and corresponding message carry service descriptions and counters associated with the service descriptions.
16. The method of claim 15, wherein the first and the second time limits are the same if the corresponding message includes valid information about the first device.
17. The method of claim 15, wherein the second time limit is shorter than the first time limit if the corresponding message does not includes valid information about the first device.
18. The method of claim 15, wherein the message of the first type comprises a digest of service descriptions of the first device.
19. The method of claim 15, wherein the messages of the first type comprises a digest of service descriptions of other devices, the service descriptions being stored in the first device.
20. The method of claim 15, wherein the message of the second type comprises the service descriptions of the first device.
21. The method of claim 15, wherein the message of the second type comprises the service descriptions of other devices, the service description of which are stored in the first device.
22. The method of claim 18, wherein service descriptions of the first device are sent to the rest of the devices in the wireless communication environment if the corresponding message includes valid information about the first device.
23. The method of claim 15, wherein the information received by the second device is formed by at least one service description and at least a service description digest.
24. The method of claim 15, wherein the counter values related to the service descriptions are updated every time a message of the first type is broadcasted.
25. The method of claim 24, wherein the counter values are compared with a predetermined threshold.
26. The method of claim 25, wherein the counter values are analyzed to determine a distance between the first and the second device.
27. The method of claim 26, wherein the distance between the first and the second device determines the availability of a service.
28. A method of discovering service information of a plurality of devices in a wireless communications system performed by a first device of said plurality of devices, the method comprising:
providing a first time limit for transmitting messages;
receiving a first message of a first type from a second device;
providing a second time limit for transmitting messages;
transmitting a corresponding message after expiration of the second time limit, and
receiving a second message of the first or a second type from the second device;
wherein the second message is of the first type if the corresponding message includes valid information of the second device,
wherein the second message is a message of the second type if the corresponding message does not include valid information of the second device, and
wherein the first, second, and corresponding message carry service descriptions and counters associated with the service descriptions.
29. The method of claim 28, wherein the first and the second time limits are the same if the corresponding message includes valid information about the first device.
30. The method of claim 28, wherein the second time limit is shorter than the first one if the corresponding message does not includes valid information about the first device.
31. The method of claim 28, wherein the message of the first type comprises a digest of service descriptions of the first device.
32. The method of claim 28, wherein the message of the first type comprises a digest of service descriptions of other devices, the service descriptions being stored in the first device.
33. The method of claim 28, wherein the message of the second type comprises the service descriptions of the first device.
34. The method of claim 28, wherein the message of the second type comprises the service descriptions of other devices, the service description of which are stored in the first device.
35. The method of claim 34, wherein service descriptions of the first device are sent to the rest of the devices in the wireless communication environment if the corresponding message includes valid information about the first device.
36. The method of claim 28, wherein the information received by the second device is formed by at least one service description and at least a service description digest.
37. The method of claim 28, wherein the counters values associated with service descriptions are updated every time a message of the first type is broadcasted.
38. The method of claim 28, wherein the counter values are compared with a predetermined threshold.
39. The method of claim 28, wherein the counter values are analyzed to determine a distance between the first and the second device.
40. The method of claim 39, wherein the distance between the first and the second device determines the availability of a service.
US11981507 2001-05-23 2007-10-31 Method and device for prompt and efficient service discovery in wireless networks Active USRE40985E1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP01112542 2001-05-23
US10141050 US6961560B2 (en) 2001-05-23 2002-05-07 Method and device for prompt and efficient service discovery in wireless networks
US11981507 USRE40985E1 (en) 2001-05-23 2007-10-31 Method and device for prompt and efficient service discovery in wireless networks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11981507 USRE40985E1 (en) 2001-05-23 2007-10-31 Method and device for prompt and efficient service discovery in wireless networks

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10141050 Reissue US6961560B2 (en) 2001-05-23 2002-05-07 Method and device for prompt and efficient service discovery in wireless networks

Publications (1)

Publication Number Publication Date
USRE40985E1 true USRE40985E1 (en) 2009-11-17

Family

ID=8177515

Family Applications (2)

Application Number Title Priority Date Filing Date
US10141050 Active 2023-12-19 US6961560B2 (en) 2001-05-23 2002-05-07 Method and device for prompt and efficient service discovery in wireless networks
US11981507 Active USRE40985E1 (en) 2001-05-23 2007-10-31 Method and device for prompt and efficient service discovery in wireless networks

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US10141050 Active 2023-12-19 US6961560B2 (en) 2001-05-23 2002-05-07 Method and device for prompt and efficient service discovery in wireless networks

Country Status (1)

Country Link
US (2) US6961560B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8327178B2 (en) 2009-12-23 2012-12-04 Apple Inc. Efficient service advertisement and discovery in a networking environment

Families Citing this family (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6766456B1 (en) * 2000-02-23 2004-07-20 Micron Technology, Inc. Method and system for authenticating a user of a computer system
GB0126649D0 (en) * 2001-11-06 2002-01-02 Mitel Knowledge Corp System and method for facilitating the selection of electronic services using infrared and a network address identification
US7532862B2 (en) * 2002-03-19 2009-05-12 Apple Inc. Method and apparatus for configuring a wireless device through reverse advertising
US20040121792A1 (en) * 2002-12-18 2004-06-24 Allen Vernon A. Multi-protocol network and method of switching protocols
DE10259546A1 (en) * 2002-12-19 2004-07-01 Robert Bosch Gmbh Device for wireless transmission of a triggering signal
GB0307763D0 (en) * 2003-04-04 2003-05-07 Zap Corp Uk The Ltd System and method of broadcasting advertisements
US8959187B2 (en) * 2004-02-23 2015-02-17 Apple Inc. Method and system for proximity-based information retrieval and exchange in ad hoc networks
US8144595B1 (en) * 2004-03-25 2012-03-27 Verizon Corporate Services Group Inc. Variable translucency no-sight routing for AD-HOC networks
WO2006063321A1 (en) * 2004-12-09 2006-06-15 Qualcomm Incorporated Methods and apparatus for creation and transport of multimedia content flows to a distribution network
US7912457B2 (en) * 2004-04-21 2011-03-22 Qualcomm Incorporated Methods and apparatus for creation and transport of multimedia content flows
US20050276253A1 (en) * 2004-06-14 2005-12-15 Samsung Electronics Co., Ltd. Method and system for transmitting image data in ad-hoc mode of a wireless communication network
US8544043B2 (en) * 2004-07-21 2013-09-24 Qualcomm Incorporated Methods and apparatus for providing content information to content servers
GB0417101D0 (en) * 2004-07-30 2004-09-01 Canon Kk Apparatus for and a method of facilitating the carrying out of a task
US7406520B2 (en) * 2004-07-30 2008-07-29 Sap Aktiengesellschaft Identifying interfaces related to a service
EP1626597A1 (en) * 2004-08-13 2006-02-15 Research In Motion Limited Apparatus, and associated method, for identifying radio network service availability
US8023451B2 (en) 2004-08-13 2011-09-20 Research In Motion Limited Apparatus, and associated method, for identifying radio network service availability
US20060094456A1 (en) * 2004-10-29 2006-05-04 Rittle Loren J Device and method for service discovery in adhoc networks using beacon signalling
JP4421517B2 (en) * 2005-06-07 2010-02-24 株式会社東芝 The information processing server, a remote control system and a remote operation method
US7613426B2 (en) * 2005-12-20 2009-11-03 Microsoft Corporation Proximity service discovery in wireless networks
US8478300B2 (en) 2005-12-20 2013-07-02 Microsoft Corporation Proximity service discovery in wireless networks
US8559350B2 (en) 2005-12-20 2013-10-15 Microsoft Corporation Mechanism to convey discovery information in a wireless network
JP4585479B2 (en) * 2006-03-30 2010-11-24 株式会社東芝 Server apparatus and a video delivery method
US7986652B1 (en) 2006-04-25 2011-07-26 Cisco Technology, Inc. System and method for adjusting power used in transmission in a wireless packet network
US8681671B1 (en) 2006-04-25 2014-03-25 Cisco Technology, Inc. System and method for reducing power used for radio transmission and reception
US8175073B1 (en) 2006-04-25 2012-05-08 Cisco Technology, Inc. System and method for adjusting power used in reception in a wireless packet network
US7515556B2 (en) * 2006-04-25 2009-04-07 Arch Rock Corporation System and method for low power radio operation in a wireless packet network
US20070264991A1 (en) * 2006-05-15 2007-11-15 Microsoft Corporation Services near me: discovering and connecting to available wireless services utilizing proximity discovery
US7613156B2 (en) 2006-06-08 2009-11-03 Motorola, Inc. Method for energy efficient prospective peer discovery in an ad hoc network
US20070286100A1 (en) * 2006-06-09 2007-12-13 Mika Juhani Saaranen Local discovery of mobile network services
US7953392B2 (en) * 2006-12-19 2011-05-31 International Business Machines Corporation Method for controlling and calibrating access to a wireless access point
US8752006B1 (en) 2007-07-02 2014-06-10 Cisco Technology, Inc. System and method and apparatus for automatically generating computer code for remote procedure calls
US7974574B2 (en) * 2007-07-25 2011-07-05 Microsoft Corporation Base station initiated proximity service discovery and connection establishment
US8681691B2 (en) * 2007-07-25 2014-03-25 Microsoft Corporation Base station initiated proximity service discovery and connection establishment
US20090063686A1 (en) * 2007-08-30 2009-03-05 Schmidt Brian K Automated service discovery and dynamic connection management
US8150792B1 (en) 2007-11-01 2012-04-03 Cisco Technology, Inc. System and method for performing activities based on proximity
US9182961B1 (en) 2007-12-17 2015-11-10 Cisco Technology, Inc. System and method for providing computer code to obtain data from devices optionally using a web services interface
JP4946902B2 (en) * 2008-02-08 2012-06-06 富士通株式会社 Communication control apparatus, communication control method, a communication control program
US9105031B2 (en) 2008-02-22 2015-08-11 Microsoft Technology Licensing, Llc Authentication mechanisms for wireless networks
US9854505B2 (en) 2009-02-06 2017-12-26 Avago Technologies General Ip (Singapore) Pte. Ltd. Service advertisement in a communication device
US8819219B2 (en) * 2009-12-23 2014-08-26 Apple Inc. Efficient service advertisement and discovery in multiple wireless networks
US9565622B2 (en) 2012-07-05 2017-02-07 Qualcomm Incorporated Detecting services provided by a wireless node before device discovery and connection establishment

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5555266A (en) * 1993-10-04 1996-09-10 Motorola, Inc. Method for reducing transmission delays in a packet transmission system
US5873043A (en) * 1996-12-18 1999-02-16 Cellemetry Llc System for communicating messages via a forward overhead control channel
US6026297A (en) * 1997-09-17 2000-02-15 Telefonaktiebolaget Lm Ericsson Contemporaneous connectivity to multiple piconets
EP1022876A1 (en) * 1999-01-25 2000-07-26 International Business Machines Corporation Service advertisements in wireless local networks
US6154745A (en) * 1996-12-31 2000-11-28 Nokia Mobile Phones Ltd. Method for transmission of information to the user
US6233430B1 (en) * 1997-09-19 2001-05-15 Richard J. Helferich Paging transceivers and methods for selectively retrieving messages
US6484033B2 (en) * 2000-12-04 2002-11-19 Motorola, Inc. Wireless communication system for location based schedule management and method therefor
US20030046100A1 (en) * 2001-08-29 2003-03-06 Fujitsu Limited View restriction method, view restriction setting method, receiver, and device and programs for setting view restriction
US6577849B1 (en) * 1999-02-03 2003-06-10 Motorola, Inc. Method and apparatus for providing additional information about a broadcast
US20030112804A1 (en) * 2001-12-19 2003-06-19 Jouni Kamarainen Method, system and architecture for service broadcasting over orthogonal frequency division multiplexing using an internet protocol cellular network & session initiated protocol
US6691173B2 (en) * 1999-07-06 2004-02-10 Widcomm, Inc. Distributed management of an extended network containing short-range wireless links

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5555266A (en) * 1993-10-04 1996-09-10 Motorola, Inc. Method for reducing transmission delays in a packet transmission system
US5873043A (en) * 1996-12-18 1999-02-16 Cellemetry Llc System for communicating messages via a forward overhead control channel
US6154745A (en) * 1996-12-31 2000-11-28 Nokia Mobile Phones Ltd. Method for transmission of information to the user
US6026297A (en) * 1997-09-17 2000-02-15 Telefonaktiebolaget Lm Ericsson Contemporaneous connectivity to multiple piconets
US6233430B1 (en) * 1997-09-19 2001-05-15 Richard J. Helferich Paging transceivers and methods for selectively retrieving messages
EP1022876A1 (en) * 1999-01-25 2000-07-26 International Business Machines Corporation Service advertisements in wireless local networks
US6532368B1 (en) * 1999-01-25 2003-03-11 International Business Machines Corporation Service advertisements in wireless local networks
US6577849B1 (en) * 1999-02-03 2003-06-10 Motorola, Inc. Method and apparatus for providing additional information about a broadcast
US6691173B2 (en) * 1999-07-06 2004-02-10 Widcomm, Inc. Distributed management of an extended network containing short-range wireless links
US6484033B2 (en) * 2000-12-04 2002-11-19 Motorola, Inc. Wireless communication system for location based schedule management and method therefor
US20030046100A1 (en) * 2001-08-29 2003-03-06 Fujitsu Limited View restriction method, view restriction setting method, receiver, and device and programs for setting view restriction
US20030112804A1 (en) * 2001-12-19 2003-06-19 Jouni Kamarainen Method, system and architecture for service broadcasting over orthogonal frequency division multiplexing using an internet protocol cellular network & session initiated protocol

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8327178B2 (en) 2009-12-23 2012-12-04 Apple Inc. Efficient service advertisement and discovery in a networking environment
US9306813B2 (en) 2009-12-23 2016-04-05 Apple Inc. Efficient service advertisement and discovery in a peer-to-peer networking environment with cooperative advertisement
US9391853B2 (en) 2009-12-23 2016-07-12 Apple Inc. Efficient service advertisement and discovery in a peer-to-peer networking environment with dynamic advertisement and discovery periods based on operating conditions

Also Published As

Publication number Publication date Type
US6961560B2 (en) 2005-11-01 grant
US20020176391A1 (en) 2002-11-28 application

Similar Documents

Publication Publication Date Title
US20030231621A1 (en) Dynamic communication channel switching for computer networks
US20050044430A1 (en) Method and apparatus for implementing a sleep proxy for services on a network
US20070019594A1 (en) Neighbor based TDMA slot assignment
US6504834B1 (en) Wireless network
US20060189359A1 (en) Power-conserving intuitive device discovery technique in a Bluetooth environment
US20110314163A1 (en) Wireless communication network for smart appliances
US20090017858A1 (en) Method and system for peer-to-peer communication in a communication system
US6845090B1 (en) Radio communication system and radio terminal device using faster and slower radio networks cooperatively
US20140357269A1 (en) Server-assisted device-to-device discovery and connection
US6532368B1 (en) Service advertisements in wireless local networks
US20080304408A1 (en) System and Method for Improving Service and Device Discovery in a Upnp-Based Wireless Communication Network
US20060166683A1 (en) Method and system for use of the same time slot of the same channel by multiple pairs of devices via a direct link protocol
US20080123558A1 (en) Simplified auto-configuration and service discovery in ad-hoc networks
US6728244B1 (en) Communication node for enabling interworking of network using request/response based data transfer and network using non-request/response based data transfer
EP1006740A2 (en) Method for realizing multicast service in mobile communication system
US20020147926A1 (en) Method and apparatus for authentication using remote multiple access SIM technology
US20020106985A1 (en) Multicast service providing system, multicast service providing method, information distributor, radio terminal, and radio base station
US6876643B1 (en) Clustering in wireless ad hoc networks
US20120071188A1 (en) Dynamic spectrum allocation method and device
US20060218419A1 (en) Power-save control for network master device
US20080171552A1 (en) Communication method and apparatus for distributed network system where cognitive radio technology is applied
US20010005368A1 (en) Method and communication system in wireless AD HOC networks
EP1548985A1 (en) Electronic device having communication function
US20120290731A1 (en) Network setup via short-range communication
US20030012219A1 (en) Method for setting up a link between bluetooth devices in a bluetooth system

Legal Events

Date Code Title Description
FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12