CN101179594B - Service distance based service discovering method in wireless self-organizing network environment - Google Patents
Service distance based service discovering method in wireless self-organizing network environment Download PDFInfo
- Publication number
- CN101179594B CN101179594B CN200710170790A CN200710170790A CN101179594B CN 101179594 B CN101179594 B CN 101179594B CN 200710170790 A CN200710170790 A CN 200710170790A CN 200710170790 A CN200710170790 A CN 200710170790A CN 101179594 B CN101179594 B CN 101179594B
- Authority
- CN
- China
- Prior art keywords
- service
- group
- remote
- cache
- entry
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention belongs to the technical field of the Ad Hoc network, specifically relates to a service discovery method in the wireless Ad Hoc network environment based on the service distance, which comprises a definition and generation algorithm for service advertisement datagram, a construction and update algorithm for service information cache and an efficient service discovery method based on the service distance. The method not only avoids the problems existing in the broadcasting type service discovery method that the scalability is bad, the network load is large and the broadcasting type service discovery method can not adapt to the Ad Hoc network environment, but also facilitate the user to quickly find more stable and reliable services by utilizing the service distance information, thus enhancing the efficiency of the service discovery.
Description
Technical field
The invention belongs to the self-organization network technology field, be specifically related to a kind of service discovery method based on the service distance that can adapt to wireless self-organizing network environment.
Background technology
Service discovery is position of serving in the requester network and the process of collecting relevant information.This technology is the necessary prerequisite basic technology of service combination, service execution, and therefore, it occupies important status in each link of service compute.
In being fixed with spider lines, typical Web service discovery method and agreement have: Jini, UPnP, Salutation/Salutation-lite, SLP (Service Location Protocol, positioning service agreement).Jini is a kind of distributed service discovery architecture by the exploitation of SUN company; Its target is to convert legacy network into a kind of flexible, manageable instrument; Make the user can find service easily; Its core is JLS (Jini Lookup Service, the Jini service of searching), safeguards the multidate information of available service.UPnP has expanded the model of Microsoft about the external equipment plug and play, supports the service discovery that different vendor's network equipment provides.UPnP adopts SSDP (Simple Service Discovery Protocol, SSDP) on IP network, to find service.Salutation be a kind of open standard, with the service discovery and the session management protocol of platform independence, its target is to solve in wide area or mobile environment, widely applies and finds with device service and the problem of utilization.Salutation-lite is for adapting to the simplification prototype of the Salutation that skinny device designs.SLP is a kind of and agreement language independent, on IP network, carries out automated service discovery, and three types agency (user agent, service broker and discovery agency) is arranged.
Above-mentioned agreement all needs the function that a service discovery Acting Center assists to accomplish service distribution and discovery, and this mechanism also is not suitable for the network of this type of self-organizing foundation-free structure.Characteristics such as Ninja is the service discovery system of Berkeley university research, is made up of user, service and SDS server, and that system has is scalable, fault-tolerant, safety is available are supported local or wide-area services; User, service adopt overall SDS Multicast Channel and SDS server to communicate.Bluetooth service discovery protocol (Bluetooth Service Discovery Protocol) is the simple services discovery mechanism in the P2P network; Realize the directory service of no center; Information on services be stored in each move/the service discovery server of this locality on the static device on; But this server does not indicate the access method to service, just answer be on this equipment, whether serve available.
Service discovery in the wireless self-organization network is to use in the wireless environment the indispensable link of available service on the nearby device, also is the necessary step of further serving combination.At present, the service discovery in wireless self-organization network mainly still adopts broadcasting to drive the method for (broadcast-driven).Though this service discovery method based on broadcasting is simple, scalability is not good.Particularly when network size increases, can directly cause offered load overweight, influence normal network communication based on the service discovery method of broadcasting.D.Chakraborty etc. have proposed service route and the service discovery protocol based on group, adopt based on the distributed agent method and realize the service combination.More than these methods all do not consider key characteristics such as the topological dynamic change of self-organizing network is fast, scalability is big.
Summary of the invention
The objective of the invention is to propose a kind of service discovery method of suitable wireless self-organizing network environment based on the service distance.
At first basic concepts is defined:
(1) ISP: the owner of service and concrete implementor are the direct providers of service.
(2) service requester: the party in request of service and requesting party, initiate service discovery process to obtain the information such as position of required service.
(3) service advertisement (Service_ADV_Msg): be by the service declaration information that periodically initiatively neighbor node sends around it of the node in the network; Declare that it has certain service or certain type of service, and its information on services that node had on every side of being known.
(4) information on services buffer memory: the memory space that node is opened up for information on services in the information on services of preserving self or the service advertisement.
(5) service distance (Service_Distance): the ISP's of the service of describing in advertisement of present node distance service or the information on services buffer memory (group) node jumping figure.
In wireless self-organization network, owing to receive the influence of factors such as node motion, finite energy, the topology of network can often change.In such network environment that constantly changes, it is generally acknowledged from the near more service of service requester reliable more, otherwise from service requester service far away more owing to receive Effect of Environmental more easily, therefore unreliable more, be unworthy more trusting.
The service discovery method that the present invention proposes does not re-use the mode of broadcasting discovery, but utilizes the network node service advertisement of transmission regularly, and in service advertisement, adds the mode assistant service discovery of service range information.On the one hand, service requester can be avoided adopting through group under the service of intermediate nodes cache and service range information and broadcast the mode of finding, dwindles the hunting zone greatly, reduces the quantity of service discovery request bag, alleviates network burden.On the other hand; This method makes full use of service range information helping service requestor and finds more reliable, more effective ISP; Owing to select the nearest node of service, therefore also reduced the time of delay of service discovery, and improved follow-up service execution efficient simultaneously.
The process of whole service discovery comprises service ontology structure, service advertisement, information on services buffer memory, service discovery four-stage.
Each step is specific as follows:
1, service ontology structure
At first use OWL-S language (Ontology Web Language, Web service ontology describing language) to combine concrete service application scenarios that semantic description is carried out in service, the function of description service, characteristic, applicable surface etc.According to function, the characteristic of service grouping is sorted out in service then, be divided into semantic close service groups (Service Group).Some service groups can continue to sort out and are grouped into higher level service groups, form the hierarchical structure of a service packet gradually.The semantic description and the grouping situation of service have finally constituted service ontology.For example, black and white and colored two kinds of copying services are arranged at the meeting scene, these two kinds of copying services all can classify as the copying service group, and copying service can be classified into the output service groups.The semantic description of these services can use the OWL-S language description to become service ontology with dividing into groups to describe.
2, service advertisement
The purpose of service advertisement (Service_ADV_Msg) is in order to propagate node oneself information on services that can provide or that it is known.And concrete information on services is exactly a service ontology.Node its service that can provide of neighbor node advertisement towards periphery on one's own initiative regularly in the method, and its available remote service group of knowing.
In order to limit the spread scope of service advertisement, avoid too much increasing the networking load, this method is made as 1 jumping with the propagation distance of service advertisement, and promptly the TTL of advertisement message (Time-To-Live, survival period) is 1.
The concrete message format of service advertisement defines as follows:
< advertisement message >: :=< < advertisement heading >, < advertisement message body>>
< advertisement heading >: :=< type of message, source node address >
Wherein:
(1) type of message (Packet Type) :=SERVICE_ADVERTISEMENT
(2) source node address (Source_Node_Address) :=node address of service advertisement sent
< advertisement message body >: :=< local service tabulation, remote service Groups List, advertisement survival period >
::＝<Local_Service_List，Remote_Service_Group_List，TTL>
Wherein:
(1)Local_Service_List::＝<Local_Service，……>
Local_Service::＝Service_Name(Service_Group，Service_Distance)
(2)Remote_Service_Group_List::＝<Remote_Service_Group，……>
Remote_Service_Group::＝(Service_Group，Service_Distance)
(3)TTL:＝1。
Can find out that according to above definition the range of scatter of a service advertisement is controlled in the 1 jumping scope.Wherein local service tabulation (Local_Service_List) is according to the actual conditions structure of present node.And remote service Groups List (Remote_Service_Group_List) need be according to information on services (be the information on services buffer memory, concrete definition please the be participated in concrete steps 3) structure of present node buffer memory.
The construction algorithm of the remote service Groups List (Remote_Service_Group_List) in the service advertisement is following:
(1) a local service Local_Service is taken out in the tabulation of traversal local service;
(2) check whether Remote_Service_Group_List has local service remote service group Remote_Service_Group on the same group, that is: Remote_Service_Group.Service_Group==Local_Service.Servic e_Group therewith.If no, then jumping to for (3) step adds this local service group in the remote service tabulation of service advertisement.If have then jump to (1) step circulation and get next local service.
(3) this local service group is added in the remote service tabulation of service advertisement, needs newly-increased remote service group Remote_Service_Group, and carry out following assignment:
Remote_Service_Group.Service_Group:＝Local_Service.Service_Group；
Remote_Service_Group.Service_Distance:＝1；
(4) circulation rebound (1) finishes until the local service list traversal, then continues for (5) step.
(5) traversal information on services buffer memory takes out a cache entry Cache_Entry.
(6) check whether Remote_Service_Group_List has the remote service group Remote_Service_Group of the same name with cache entry, that is: Remote_Service_Group.Service_Group==Cache_Entry.Remote_S ervice_Group.If not then jumped to for (8) step and add new remote service group.If have, then continue to judge whether Cache_Entry.Service_Distance＜Remote_Service_Group.Service_Distance.If then jumped to for (7) step this remote service group upgraded.If, then (5) step of rebound is not got the next item down cache entry.
(7) the long-range remote service group Remote_Service_Group in the service advertisement is upgraded:
Remote_Service_Group.Service_Distance:＝Cache_Entry.Service_Distance
(8) add new remote service group Remote_Service_Group to the tabulation of service advertisement medium-long range service groups, and assignment:
Remote_Service_Group.Service_Group:＝Cache_Entry.Remote_Service_Group
Remote_Service_Group.Service_Distance:＝Cache_Entry.Service_Distance
(9) circulation rebound (5) finishes until information on services buffer memory traversal.
The advertisement cycle of service advertisement can be confirmed that the scene that for example network topology change is slow and other environmental factors should not change just can be selected the long advertisement cycle, for example 1 hour even longer by the user according to different application scenes.And, then can select the short advertisement cycle for change of network environment scene rapidly, promptly improve advertising frequency.
3, information on services buffer memory
Node need be preserved other nodes information on services that have or that know to get off to put in the information on services buffer memory after receiving the service advertisement that other nodes send, so that matched and searched when receiving service discovery request future.
(A) information on services buffer memory definition
< information on services buffer memory >: :=< cache entry>...
< cache entry >: :=< remote service group, service distance, node address, the life termination time >
(<Cache_Entry>::＝<Remote_Service_Group，Service_Distance，Node_Address，Life_Time>)
Wherein:
(1) node address: the source node address the in=service advertisement message
(2) remote service group, service distance: according to existing information on services structure in remote service Groups List (Remote_Service_Group_List) in the advertisement message and the buffer memory.
Can find out from the definition of cache entry: each cache entry has comprised service groups that certain node had or that known and this service groups information such as jumping figure apart from present node.
(B) information on services buffer update strategy
The service advertisement that the information on services buffer memory is mainly received according to node is constructed and is upgraded; Specific practice is if spatial cache is enough; Then the information on services in the service advertisement is noted as much as possible, but record not service but the range information of service groups and service groups.If the service of the service groups of describing in service advertisement distance is shorter, then the update service information cache.
The structure and the update algorithm of information on services buffer memory are following:
(1) takes out a local service Local_Service from the local service tabulation (Local_Service_List) of service advertisement Service_ADV_Msg.
(2) if the existing cache entry Cache_Entry.Remote_Service_Group==Local_Service.Service_ Group of buffer memory; And Local_Service.Service_Distance＜Cache_Entry.Service_Distance; And buffer memory does not have unnecessary memory space; Then the service distance of this cache entry is updated to the service distance of this local service in the advertisement, prolongs the life termination time (Life_Time) of this cache entry simultaneously.
(3) local service has the cache entry of identical Service_Group if buffer memory does not exist therewith, and perhaps buffer memory still has redundant space, then this local service is added in the buffer memory as new cache entry (Cache_Entry), and wherein each assignment is following:
Cache_Entry.Remote_Service_Group:＝Local_Service.Service_Group
Cache_Entry.Service_Distance:＝Local_Service.Service_Distance
Cache_Entry.Node_Address:＝Service_ADV_Msg.Source_Node_Address
Cache_Entry.LifeTime:=node current time+self-defined life cycle
(4) be circulated to for (1) step, be sky until the local service tabulation.
(5) the remote service Groups List (Remote_Service_Group_List) from service advertisement Service_ADV_Msg takes out a remote service group Remote_Service_Group.
(6) if the existing cache entry Cache_Entry.Remote_Service_Group==Remote_Service_Group.S ervice_Group of buffer memory; And Remote_Service_Group.Service_Distance＜Cache_Entry.Service_Distance; And buffer memory does not have unnecessary memory space; Then the service distance of this cache entry is updated to the service distance of this remote service group in the service advertisement, prolongs the life termination time of this cache entry simultaneously.
(7) the remote service group has the cache entry of identical Service_Group if buffer memory does not exist therewith, and perhaps buffer memory still has redundant space, then this remote service group is added in the buffer memory as new cache entry (Cache_Entry), and wherein each assignment is following:
Cache_Entry.Remote_Service_Group:＝Remote_Service_Group.Service_Group
Cache_Entry.Service_Distance:＝Remote_Service_Group.Service_Distance
Cache_Entry.Node_Address:＝Service_ADV_Msg.Source_Node_Address
Cache_Entry.LifeTime:=node current time+self-defined life cycle
(8) being circulated to for (5) step, is empty until the remote service Groups List.
(9) scan each cache entry,, then remove this cache entry if the life termination time of certain cache entry arrives.
4, service discovery
Service requester is in the preceding positional information that needs to understand this ISP of certain service of use (like the color photocopying service), so need to initiate the process of a service discovery.Node is initiated service discovery process through sending the service discovery request message.
The message format of service discovery request defines as follows:
<Service_Discovery?Request>::＝<<SDR_Header>，<SDR_Payload>>
<SDR_Header>::＝<Packet_Type，Request_Node_Address，TTL>
<SDR_Payload>::＝<Service_Name，Service_Group>
Wherein:
●Packet_Type:＝SERVICE_DISCOVERY_REQUEST
● Request_Node_Address: the node address of service requester
● TTL: the survival jumping figure (life cycle) of service discovery request message
● Service_Name: requested service title
● Service_Group: the service groups under the requested service
Node is at first searched the service of coupling in the service list that oneself provides after receiving service discovery request.If find, explain then and oneself have the ability to provide this service that then respond service requester immediately, service discovery process finishes.If do not find explanation oneself ability that this service is not provided, so just need this service discovery request be transmitted to and know this service and, continue service discovery process from the nearest node of present node according to the information on services buffer memory.If also there is not the node of knowing this service in the information on services buffer memory, all nodes around then can only this service discovery request being broadcast to continue service discovery process.
The algorithm of node processing service discovery request is following:
(5) traversal local service tabulation if local service and service discovery request coupling are arranged, is then returned the service discovery result to service requester.If no, then continued for (2) step.
(6) traversal information on services buffer memory, all cache entry of searching eligible Cache_Entry.Remote_Service_Group==SDR.Service_Group.If lookup result is empty, then changed for (4) step over to.If lookup result is not empty, then changed for (3) step over to.
(7) in lookup result, select the minimum cache entry Cache_Entry of Cache_Entry.Service_Distance, and, continue service discovery process to directed this service discovery request bag of transmitting of node that Cache_Entry.Node_Address points to.
(8) this service discovery request bag of neighbor node broadcasting towards periphery continues service discovery process.
This method is through the service advertisement mode based on the service distance; Not only avoided broadcast type service discovery method problem, the problem includes: scalability is poor, offered load is heavy, can't adapt to the problem of wireless self-organizing network environment; And; Utilize the service range information to make the user can find more reliable and more stable service quickly, improved the efficient of service discovery.
Description of drawings
Fig. 1: conference applications scene.The network node formation has been described, and the role of node, information such as the service that provides.
Fig. 2: service advertisement and service information cache.Description is the transmission of service advertisement in the application of scene and the structure of service information cache with Fig. 1.
Fig. 3: service discovery process.Service discovery process has been described.
Embodiment
This copying service of sentencing in the conference applications scene is that example is introduced embodiment of the present invention, so that further set forth the object of the invention, feature and advantage.But protection scope of the present invention is not limited to following instance.
Application scenarios is as shown in Figure 1, and wherein SP1, SP2, SP3, SP4, SP5 are the ISPs, and color photocopying service S1 is provided respectively, black and white copying service S2, color photocopying service S3, colour print service S4, black and white print service S5.Node SR is a service requester, and it needs copying service.
Practical implementation step of the present invention is following:
1. according to concrete application, by the domain knowledge expert semantic description and the definition of dividing into groups are carried out in service, and utilized OWL-S language construct service ontology.Can color photocopying service and black and white copying service be classified as copying service group CSG (Copy Service Group) according to example, colour print service and black and white print service are classified as print service group PSG (Print Service Group).This service packet need obtain the consistent of all ISPs of network and approve.
2. each node, and initiatively sends to neighbor node according to algorithm construction service advertisement message according to some cycles.As shown in Figure 2.
3. each node is all opened up certain memory space as the information on services buffer memory, supposes that in this example spatial cache is infinitely great.Node carries out necessary renewal according to information on services buffer memory structure and update algorithm to buffer memory after receiving advertisement.The information on services buffer memory that structure is good in this example is as shown in Figure 2.
4. the user need send service discovery request with the identity of service requester before using certain service, and wait service is found the result.Each node need be handled receiving service discovery request according to service discovery request message Processing Algorithm, returns the discovery result, or continues to transmit services request.In example, node SR need use copying service, so initiate service discovery process, promptly sends the service discovery request message.Service discovery process is as shown in Figure 3.
Claims (3)
- In the wireless self-organizing network environment based on the service discovery method of service distance, it is characterized in that whole service discovery process is divided into service ontology structure, service advertisement, information on services buffer memory and 4 stages of service discovery; Wherein:Said service ontology structure; At first use the OWL-S language to combine concrete service application scenarios that semantic description is carried out in service; Describe function, characteristic, the applicable surface of service, according to function, the characteristic of service grouping is sorted out in service then, be divided into semantic close service groups; Some service groups continue classification and are grouped into higher level service groups, form the hierarchical structure of a service packet gradually; The semantic description and the grouping situation of service have finally constituted service ontology;Said service advertisement is propaganda node oneself information on services that can provide or that it is known;Said information on services buffer memory is after node is received the service advertisement that other nodes send, need other nodes information on services that have or that know preserved to get off to put in the information on services buffer memory, so that matched and searched when receiving service discovery request future;Said service discovery is a service requester before using certain service, initiates a service discovery process; Specifically, node is at first searched the service of coupling in the service list that oneself provides after receiving service discovery request, if find; Then respond service requester immediately, service discovery process finishes, if do not look for; So just this service discovery request is transmitted to and knows this service and, continue service discovery process from the nearest node of present node according to the information on services buffer memory; If also there is not the node of knowing this service in the information on services buffer memory, all nodes around then can only this service discovery request being broadcast to continue service discovery process; Node is initiated service discovery process through sending the service discovery request message;Wherein, the propagation distance of said service advertisement is made as a jumping, and the concrete message format of service advertisement defines as follows:< advertisement message >: :=< < advertisement heading >, < advertisement message body>>< advertisement heading >: :=< type of message, source node address >Wherein:(1) type of message (Packet Type) :=SERVICE_ADVERTISEMENT(2) source node address (Source_Node_Address) :=node address of service advertisement sent< advertisement message body >: :=< local service tabulation, remote service Groups List, advertisement survival period >::＝<Local_Service_List，Remote_Service_Group_List，TTL>Wherein:(1)Local_Service_List::＝<Local_Service，……>Local_Service::＝Service_Name(Service_Group，Service_Distance)(2)Remote_Service_Group_List::＝<Remote_Service_Group，……>Remote_Service_Group::＝(Service_Group，Service_Distance)(3)TTL：＝1；The definition of said information on services buffer memory is following:
Wherein:(1) node address: the source node address the in=service advertisement message(2) remote service group, service distance: according to existing information on services structure in remote service Groups List in the advertisement message and the buffer memory;The service advertisement that the information on services buffer memory is received according to node is constructed and is upgraded, and specific algorithm is following:(1) takes out a local service Local_Service from the local service tabulation of service advertisement Service_ADV_Msg;(2) if the existing cache entry Cache_Entry.Remote_Service_Group==Local_Service.Service_ Group of buffer memory; And Local_Service.Service_Distance＜Cache_Entry.Service_Distance; And buffer memory does not have unnecessary memory space; Then the service distance of this cache entry is updated to the service distance of this local service in the advertisement, prolongs the life termination time of this cache entry simultaneously;(3) local service has the cache entry of identical Service_Group if buffer memory does not exist therewith, and perhaps buffer memory still has redundant space, then this local service is added in the buffer memory as new cache entry, and wherein each assignment is following:Cache_Entry.Remote_Service_Group：＝Local_Service.Service_GroupCache_Entry.Service_Distance：＝Local_Service.Service_DistanceCache_Entry.Node_Address：＝Service_ADV_Msg.Source_Node_AddressCache_Entry.Life Time:=node current time+self-defined life cycle;(4) be circulated to for (1) step, be sky until the local service tabulation;(5) the remote service Groups List from service advertisement Service_ADV_Msg takes out a remote service group Remote_Service_Group;(6) if the existing cache entry Cache_Entry.Remote_Service_Group==Remote_Service_Group.Service_Group of buffer memory; And Remote_Service_Group.Service_Distance＜Cache_Entry.Service_Distance; And buffer memory does not have unnecessary memory space; Then the service distance of this cache entry is updated to the service distance of this remote service group in the service advertisement, prolongs the life termination time of this cache entry simultaneously;(7) the remote service group has the cache entry of identical Service_Group if buffer memory does not exist therewith, and perhaps buffer memory still has redundant space, then this remote service group is added in the buffer memory as new cache entry, and wherein each assignment is following:Cache_Entry.Remote_Service_Group：＝Remote_Service_Group.Service_GroupCache_Entry.Service_Distance：＝Remote_Service_Group.Service_DistanceCache_Entry.Node_Address：＝Service_ADV_Msg.Source_Node_AddressCache_Entry.LifeTime:=node current time+self-defined life cycle;(8) being circulated to for (5) step, is empty until the remote service Groups List;(9) scan each cache entry,, then remove this cache entry if the life termination time of certain cache entry arrives. - 2. service discovery method according to claim 1 is characterized in that the remote service Groups List in the service advertisementConstruction algorithm is following:(1) a local service Local_Service is taken out in the tabulation of traversal local service;(2) check whether Remote_Service_Group_List has local service remote service group Remote_Service_Group on the same group therewith; That is: Remote_Service_Group.Service_Group==Local_Service.Servic e_Group; If do not have; Then jumped to for (3) step this local service group is added in the remote service tabulation of service advertisement, if having then jump to the circulation of (1) step and get next local service(3) this local service group is added in the remote service tabulation of service advertisement, needs newly-increased remote service group Remote_Service_Group, and carry out following assignment:Remote_Service_Group.Service_Group：＝Local_Service.Service_Group；Remote_Service_Group.Service_Distance：＝1；(4) circulation rebound (1) finishes until the local service list traversal, then continues for (5) step;(5) traversal information on services buffer memory takes out a cache entry Cache_Entry;(6) check whether Remote_Service_Group_List has the remote service group Remote_Service_Group of the same name with cache entry, that is: Remote_Service_Group.Service_Group==Cache_Entry.Remote_S ervice_Group; If not then jumped to for (8) step and add new remote service group; If have, then continue to judge whether Cache_Entry.Service_Distance＜Remote_Service_Group.Service_Distance; If then jumped to for (7) step this remote service group upgraded; If, then (5) step of rebound is not got the next item down cache entry;(7) the long-range remote service group Remote_Service_Group in the service advertisement is upgraded:Remote_Service_Group.Service_Distance：＝Cache_Entry.Service_Distance(8) add new remote service group Remote_Service_Group to the tabulation of service advertisement medium-long range service groups, and assignment:Remote_Service_Group.Service_Group：＝Cache_Entry.Remote_Service_GroupRemote_Service_Group.Service_Distance：＝Cache_Entry.Service_Distance(9) circulation rebound (5) finishes until information on services buffer memory traversal.
- 3. service discovery method according to claim 1 is characterized in that said service discovery in the stage, and the algorithm of node processing service discovery request is following:(1) traversal local service tabulation if local service and service discovery request coupling are arranged, is then returned the service discovery result to service requester; If no, then continued for (2) step;(2) traversal information on services buffer memory, all cache entry of searching eligible Cache_Entry.Remote_Service_Group==SDR.Service_Group; If lookup result is empty, then changed for (4) step over to; If lookup result is not empty, then changed for (3) step over to;(3) in lookup result, select the minimum cache entry Cache_Entry of Cache_Entry.Service_Distance, and, continue service discovery process to directed this service discovery request bag of transmitting of node that Cache_Entry.Node_Address points to;(4) this service discovery request bag of neighbor node broadcasting towards periphery continues service discovery process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710170790A CN101179594B (en) | 2007-11-22 | 2007-11-22 | Service distance based service discovering method in wireless self-organizing network environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710170790A CN101179594B (en) | 2007-11-22 | 2007-11-22 | Service distance based service discovering method in wireless self-organizing network environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101179594A CN101179594A (en) | 2008-05-14 |
| CN101179594B true CN101179594B (en) | 2012-09-05 |
Family
ID=39405678
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710170790A Expired - Fee Related CN101179594B (en) | 2007-11-22 | 2007-11-22 | Service distance based service discovering method in wireless self-organizing network environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101179594B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109429301B (en) * | 2017-09-04 | 2022-03-25 | 中兴通讯股份有限公司 | Service search method, corresponding device and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1564544A (en) * | 2004-03-26 | 2005-01-12 | 清华大学 | Route searching of detgredd of node based on radio self-organizing network and maitenance method thereof |
| CN1633098A (en) * | 2005-01-28 | 2005-06-29 | 北京邮电大学 | Wireless sensor network system and method supporting task reconfiguration |
-
2007
- 2007-11-22 CN CN200710170790A patent/CN101179594B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1564544A (en) * | 2004-03-26 | 2005-01-12 | 清华大学 | Route searching of detgredd of node based on radio self-organizing network and maitenance method thereof |
| CN1633098A (en) * | 2005-01-28 | 2005-06-29 | 北京邮电大学 | Wireless sensor network system and method supporting task reconfiguration |
Non-Patent Citations (1)
| Title |
|---|
| 洪圆等.使用BroadcastDisks方法分布的空中位图索引.《计算机工程》.2006,第32卷(第2期),第53-55页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101179594A (en) | 2008-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Roy et al. | Application-aware end-to-end delay and message loss estimation in Internet of Things (IoT)—MQTT-SN protocols | |
| Ververidis et al. | Service discovery for mobile ad hoc networks: a survey of issues and techniques | |
| Su et al. | Haggle: Seamless networking for mobile applications | |
| Lee et al. | Konark: A system and protocols for device independent, peer-to-peer discovery and delivery of mobile services | |
| JP5048684B2 (en) | Selective service update method for communication network | |
| Tsai et al. | Design and development of a mobile peer-to-peer social networking application | |
| JP6302050B2 (en) | System and method for improved discovery | |
| Campo et al. | PDP: A lightweight discovery protocol for local-scope interactions in wireless ad hoc networks | |
| Alahari et al. | A survey on network routing protocols in internet of things (IOT) | |
| JP4607764B2 (en) | Mobile peer-to-peer network construction | |
| Li et al. | Efficient path-sense transmission based on IoT system in opportunistic social networks | |
| Cheng et al. | Service discovery and invocation for mobile ad hoc networked appliances | |
| Butt | Provision of adaptive and context-aware service discovery for the Internet of Things. | |
| Mahéo et al. | Service invocation over content-based communication in disconnected mobile ad hoc networks | |
| CN101179594B (en) | Service distance based service discovering method in wireless self-organizing network environment | |
| Seno et al. | Survey and new approach in service discovery and advertisement for mobile ad hoc networks | |
| Patel et al. | Data delivery techniques in content centric routing for IoT: a systematic review | |
| Nguyen et al. | Rpl border router redundancy in the internet of things | |
| Miller et al. | Scmesh: Solar-powered wireless smart camera mesh network | |
| Parvin et al. | Routing protocols for wireless sensor networks: a comparative study | |
| Zakarya et al. | A short overview of service discovery protocols for manets | |
| Mian et al. | Survey of service discovery protocols in mobile ad hoc networks | |
| Grigoras | Service-oriented naming scheme for wireless ad hoc networks | |
| Bosunia et al. | Machine-to-machine content retrieval in wireless networks | |
| Ndlovu et al. | A review of service discovery schemes in wireless mesh networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120905 Termination date: 20151122 |
|
| EXPY | Termination of patent right or utility model |