CN102014456A - Method and system for searching node - Google Patents
Method and system for searching node Download PDFInfo
- Publication number
- CN102014456A CN102014456A CN201010228672XA CN201010228672A CN102014456A CN 102014456 A CN102014456 A CN 102014456A CN 201010228672X A CN201010228672X A CN 201010228672XA CN 201010228672 A CN201010228672 A CN 201010228672A CN 102014456 A CN102014456 A CN 102014456A
- Authority
- CN
- China
- Prior art keywords
- node
- query requests
- coding
- self
- message
- 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.)
- Granted
Links
Images
Abstract
The invention discloses a method and a system for searching a node, belonging to the field of communication of Internet of things. The method comprises the following steps that a client sends a search request which carries the search range and the position appointed by a user; a proxy node receives the search request and broadcasts the search request to the neighbor node of the proxy node, wherein the search request carries the coding, the message information, the position and the search range of the proxy node; the neighbor node receives the search request and judges whether the research request is received or not; if the research request is not received, the neighbor node judges whether the neighbor node per se is located within the search range or not according to the position and the search range; if the research request is received, a response message which carries the message time and the coding and the position of the neighbor node is sent to the proxy node, and the the search request is broadcasted to the neighbor node; the proxy node receives the respond message and sends the respond message to the client. The invention can accurately searches the nodes.
Description
Technical field
The present invention relates to the Internet of Things communications field, particularly a kind of method and system of search node.
Background technology
Internet of Things is defined as the communication protocol based on standard and interoperable, and it is the global network architecture with self-configuring ability and dynamic function.Each node in the Internet of Things all has attributes such as coding, and each node is realized by intelligence interface and the seamless integration of network.Many application of Internet of Things all relate to the search of node, and the search technique of node in the present Internet of Things comprises:
First kind, based on RFID (Radio Frequency Identification, radio-frequency (RF) identification) the entity search technology of technology, be specially: electronic labelling system provides unique, a discernible electronic tag for each node, and in the transfer website that various places are disposed, be provided for reading the recognizer of electronic tag, each intermediate transit point utilizes the RFID technology to read electronic tag and comes search node in the communication range of self.
Second kind, based on the searching method of earth surface, be specially: set up measuring equipment at the earth's surface, as the base station, analyze and estimate the position of node and node by the characteristic parameter of transmitting signal between detection node and the base station, so realize search node.
The third, satellite-based searching method, be specially: receiving equipment is set on node in advance, sharp receiving equipment receiving satellite signal, according to the satellite-signal that receives, determine the technology of some position by the range finding intersection, obtain the position of node, the position with this node sends to the user again, so realizes search node.Wherein, receiving equipment can be GPS (Global Positioning System, global positioning system).
In realizing process of the present invention, the inventor finds that there is following problem at least in prior art:
In above-mentioned first kind of technology, owing to be subjected to the restriction of the quantity and the density of recognizer, and can't accurately find node, in addition, recognizer all belongs to concrete mechanism, and the user outside the mechanism can't utilize recognizer to come search node, thereby this technology does not possess versatility.
In above-mentioned second kind of technology, measuring equipment is in the relatively poor area of coverage condition, also can't accurately search out node, in addition, each measuring equipment is set up by network operation, usually transmitting signal between underground node of Virtual network operator and the base station, therefore, the stranger also can't utilize this technology to come search node, thereby, do not possess versatility yet.
In above-mentioned the third technology, in places such as indoor, forest, skyscraper, mountain peak and bridges, by existing object to block satellite-signal, thereby the receiving equipment that makes also can't obtain the position of node accurately, so reduces the precision of search node.
Summary of the invention
For precision that can improve search node and the method that a kind of general ground search node is provided, the invention provides a kind of method and system of search node.Described technical scheme is as follows:
A kind of method of search node, described method comprises:
Client sends searching request, and described searching request is carried hunting zone and user's appointed positions;
Agent node receives described searching request, and to its neighbor node broadcast query request, described query requests is carried coding, message time, described position and the described hunting zone of described agent node;
Described neighbor node receives described query requests, judges whether to receive described query requests;
If not, described neighbor node is according to described position and described hunting zone, judge whether self is positioned at described hunting zone, if, send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node;
Described agent node receives described response message, and described response message is sent to described client.
Described agent node judges whether to receive described query requests, comprising:
Described neighbor node extracts the coding and the described message time of described agent node from described query requests, judge whether to store the coding and the described message time of described agent node, if, then judge and received described query requests, if not, then judge and do not receive described query requests.
Described neighbor node judges that according to described position and described hunting zone whether self is positioned at described hunting zone, comprising:
Described neighbor node is according to self position and described position, calculates the distance between self and the described position, whether judges described distance greater than described hunting zone, if not, then judges and self is positioned at described hunting zone.
If exist many response messages to carry the coding of same node, correspondingly,
Described agent node receives described response message, and described response message is sent to described client, comprising:
Described agent node selects the described message time near the response message of current time from described many response messages, abandons other response message, and the response message that does not abandon is sent to described client.
Described method also comprises:
Described agent node and/or described neighbor node are uploaded to the B server with described query requests after its neighbor node broadcast query request;
Described B server receives described query requests, coding according to the node of uploading described query requests, from the corresponding relation of the position of coding, the coding that reads node, message time and the uploading nodes of the uploading nodes of having stored, search the corresponding message time, read the coding of node and the position of uploading nodes;
Described B server sends response message to described agent node, and described response message is carried described message time, the described coding of node and the position of described uploading nodes of reading.
Described client sends after the searching request, also comprises:
The node that receives described searching request judges whether the coverage of self comprises the position that described searching request is carried;
If described node will self be arranged to the candidate agent node, and calculate the weights of self, send beacon message to its neighbor node, described beacon message carries described weights;
If described candidate agent node receives neighbor node and sends the beacon message carry self weights, relatively whether the weights of self are greater than the weights of neighbor node, if be agent node with self electing, if not, the node of election weights maximum is an agent node;
If described candidate agent node does not receive the beacon message that described neighbor node sends, then electing oneself is agent node.
Described query requests is also carried the anchor node sequence, correspondingly,
Described agent node and/or described neighbor node added the sign of self in the anchor point sequence of described query requests before the described query requests of broadcasting;
Correspondingly, described neighbor node receives described query requests, judges whether to receive described query requests, specifically comprises:
Described neighbor node receives described query requests, judges the sign that whether has self in the anchor point sequence of described query requests, if exist, then judges and has received described query requests, if there is no, then judges and does not receive described query requests.
A kind of system of search node, described system comprises client, agent node and neighbor node;
Described client is used to send searching request, and described searching request is carried hunting zone and user's appointed positions;
Described agent node is used to receive described searching request, and to its neighbor node broadcast query request, described query requests is carried coding, message time, described position and the described hunting zone of described agent node; Reception sends to described client from the response message of described neighbor node with described response message;
Described neighbor node is used to receive described query requests, judges whether to receive described query requests; If not, described neighbor node is according to described position and described hunting zone, judge whether self is positioned at described hunting zone, if, send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
Described neighbor node comprises:
Judge module is used to receive described query requests, extracts the coding and the described message time of described agent node from described query requests, judges whether to store the coding and the described message time of described agent node;
Responder module, if the result who is used for described judge module judgement is for denying, then judge and do not receive described query requests, according to described position and described hunting zone, judge that self is whether in described hunting zone, if send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
Described responder module comprises:
Judging unit is used for position and described position according to self, calculates the distance between self and the described position, whether judges described distance greater than described hunting zone, if not, then judges described neighbor node and is positioned at described hunting zone;
Transmitting element is used to send response message to described agent node, and described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
If exist many response messages to carry the coding of same node, correspondingly,
Described agent node comprises:
Broadcast module is used to receive described searching request, and to its neighbor node broadcast query request, described query requests is carried coding, message time, described position and the described hunting zone of described agent node;
Sending module is used for from described many response messages, selects the described message time near the response message of current time, abandons other response message, and the described response message that does not abandon is sent to described client.
Described system also comprises the B server;
Correspondingly, described agent node and/or described neighbor node also are used for described query requests is uploaded to the B server after its neighbor node broadcast query request;
Described B server, be used to receive described query requests, coding according to the node of uploading described query requests, from the corresponding relation of the position of coding, the coding that reads node, message time and the uploading nodes of the uploading nodes of having stored, search the corresponding message time, read the coding of node and the position of uploading nodes; Send response message to described agent node, described response message is carried described message time, the described coding of node and the position of described uploading nodes of reading.
Described agent node is elected acquisition in the following manner;
The node that receives described searching request judges whether the coverage of self comprises the position that described searching request is carried;
If described node will self be arranged to the candidate agent node, and calculate the weights of self, send beacon message to its neighbor node, described beacon message carries described weights;
If described candidate agent node receives neighbor node and sends the beacon message carry self weights, relatively whether the weights of self are greater than the weights of neighbor node, if be agent node with self electing, if not, the node of election weights maximum is an agent node;
If described candidate agent node does not receive the beacon message that described neighbor node sends, then electing oneself is agent node.
Described query requests is also carried the anchor node sequence,
Correspondingly, described agent node and/or described neighbor node also are used for the sign of self being added in the anchor point sequence of described query requests before the described query requests of broadcasting;
Correspondingly,
Described neighbor node receives described query requests, judge the sign that whether has self in the anchor point sequence of described query requests, if there is no, then judge and do not receive described query requests,, judge that self is whether in described hunting zone according to described position and described hunting zone, if, send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
After agent node reception searching request, to its neighbor node broadcast query request, after neighbor node receives query requests, judge whether to receive this query requests, if no, judge whether self is positioned at the hunting zone that query requests is carried, if be positioned at, then send to agent node and carry self-position and coding and the response message of message time, agent node sends to client with response message again.Wherein, near appointed positions, select agent node, utilize agent node search node in the hunting zone, and agent node can be in a long time assigned address near, thereby improve the precision of search node; Coverage comprises that the node of appointed positions all might become agent node, is not subjected to condition restriction, thereby has versatility.
Description of drawings
Fig. 1 is the method flow diagram of a kind of search node of providing of the embodiment of the invention 1;
Fig. 2 is the method flow diagram of a kind of search node of providing of the embodiment of the invention 2;
Fig. 3 is the system schematic of a kind of search node of providing of the embodiment of the invention 3.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
Embodiment 1
As shown in Figure 1, the embodiment of the invention provides a kind of method of search node, comprising:
Step 101: client sends searching request, and wherein, this searching request is carried hunting zone and user's appointed positions;
Step 102: agent node receives this searching request, and to its neighbor node broadcast query request, wherein, this query requests is carried position and the hunting zone that coding, message time, the searching request of agent node are carried;
Step 103: neighbor node receives this query requests, judges whether to receive this query requests;
Step 104: if not, position and hunting zone that neighbor node carries according to query requests, judge whether self is positioned at this hunting zone, if, send response message to agent node, wherein, this response message is carried the coding and the position of message time, neighbor node, broadcasts this query requests to its neighbor node;
Step 105: agent node receives this response message, and this response message is sent to client.
In embodiments of the present invention, after agent node receives searching request, to its neighbor node broadcast query request, neighbor node judges whether to receive this query requests, if do not have after receiving query requests, judge whether self is positioned at the hunting zone that query requests is carried, if be positioned at, then send and carry self-position and coding and the response message of message time to agent node, agent node sends to client with response message again.Wherein, near appointed positions, select agent node, utilize agent node search node in the hunting zone, and agent node can be in a long time assigned address near, thereby improve the precision of search node; Coverage comprises that the node of appointed positions all might become agent node, is not subjected to condition restriction, thereby has versatility.
Embodiment 2
As shown in Figure 2, the embodiment of the invention provides a kind of method of search node, comprising:
Step 201: client is to the request of Internet of Things broadcast search, and this searching request is carried user's appointed positions and hunting zone;
Wherein, the user specifies a concrete position in advance in client, and this position can be a coordinate or concrete longitude and latitude, and the user can also import a hunting zone to client, and this hunting zone can be a search radius.Then, client generates the searching request of carrying user's appointed positions and hunting zone.In addition, the hunting zone of an acquiescence is set in advance also in client, if the user does not have to client inputted search scope, then client generates the searching request of the hunting zone of carrying appointed positions and acquiescence.For example, user's appointed positions be coordinate (x0, y0) and search radius be L0, then client generate carry coordinate (x0, y0) and the searching request of search radius L0.
Step 202: the node in the Internet of Things receives searching request, judges whether the communication range of self covers the position that searching request is carried, if will oneself be arranged to the candidate agent node;
For example, after each node in the Internet of Things received searching request, extracting position was that (x0, y0), all communication ranges cover coordinate, and (x0, node y0) are arranged to oneself the candidate agent node to coordinate from this searching request.
Wherein, if after other nodes in the Internet of Things receive searching request,, then directly this searching request is forwarded if when judging the communication range of self and can not cover the position that searching request carries.
Step 203: each candidate agent node calculates the weights of self, sends beacon message to its neighbor node, and this beacon message carries the weights of node self;
Wherein, each candidate agent node calculates the weights Wi of self according to following formula (1).
Alpha+beta+γ+χ+ε=1 wherein, i ∈ 2 ..., and K}, K 〉=2, K is the number of candidate's agent node that can intercom mutually.α, beta, gamma, χ, ε is arranged on coefficient in each candidate node in advance by the technical staff, and the technical staff can be provided with the value of each coefficient according to the demand of active service, and α＞χ＞β＞γ usually, if the candidate agent node becomes agent node voluntarily, PRE=1 then, otherwise, PRE=0.
Wherein,
Wherein, d
iBe the Euclidean distance between candidate's agent node and the appointed positions, the candidate agent node calculates the Euclidean distance between candidate's agent node and the assigned address according to the position and the appointed positions at self place.
Wherein,
Wherein, v
iBe the movement velocity scalar of candidate's agent node, the candidate agent node can be measured the movement velocity scalar of self.
Wherein,
Wherein, a
iBe the acceleration scalar of both candidate nodes, the candidate agent node can be measured the acceleration scalar of self.
Step 204:, then from this beacon message, extract the weights of each neighbours' candidate agent node if the candidate agent node receives the beacon message that its neighbours' candidate agent node sends;
Wherein, if non-candidate agent node receives the beacon message that its neighbours' candidate agent node sends, then directly abandon the beacon message of reception.
Step 205: this candidate agent node compares the weights of self and the weights of each neighbours' candidate agent node, if the weights of self are greater than each neighbours' candidate agent node, then electing oneself is agent node, otherwise the candidate agent node that will elect the weights maximum from neighbours' candidate agent node is an agent node;
Step 206: if the candidate agent node does not receive beacon message, then this candidate agent node is agent node with self electing;
Wherein, in the present embodiment, many-sided factors such as distance, node communication radius, node speed, node acceleration and voluntary of candidate agent node and appointed positions when selecting agent node, have been taken all factors into consideration, guaranteed agent node can be positioned in a long time assigned address near, can not leave the hunting zone in short time, thereby improve the precision of search node.
Wherein, in the present embodiment, the user can import the coding and the hunting zone of a node to client, user side generates the searching request of carrying the hunting zone, coding according to the node of user input, searching request is sent to corresponding node, if this node has the ability that receives and send message, then this node is agent node with oneself electing; If this node does not have the ability that receives and send message, then the user imports a concrete position and hunting zone to client again, and begins to carry out from step 201.
Wherein, at an agent node, carry out following step 207 satisfies search condition in the hunting zone to 211 search node.
Step 207: the request of agent node generated query, wherein, this query requests is carried the coding of agent node, position and hunting zone that message time, anchor point sequence, searching request are carried, wherein, the sign of this agent node of storage in the anchor point sequence is again to its neighbor node broadcast query request;
Particularly, agent node obtains the current time, with current time of obtaining as the message time, the generated query request, in query requests, add the coding of self, position that message time, searching request are carried and hunting zone, and the sign of self is added to the anchor point sequence of searching request.
Wherein, the sign of agent node can be the current location or the network address of agent node.
Further, if this agent node also is connected with the B server of its institutional affiliation, then send query requests simultaneously to the B server.
Correspondingly, the B server receives this query requests, the coding that extracts the node of uploading this query requests from this query requests is the coding and the message time of agent node, according to the coding and the message time of the uploading nodes of extracting, judge whether to receive this query requests, if, then abandon this query requests, if not, then store the coding and the message time of uploading nodes, coding according to uploading nodes, from the coding of the uploading nodes of self having stored, read the coding of node, in the corresponding relation of the position of time for reading and uploading nodes, search the corresponding coding that reads node, the position of message time and uploading nodes, send response message to agent node, and this response message is carried the coding that reads node, the position of message time and uploading nodes.
Wherein, the B server judges whether to store the coding and the message time of the uploading nodes of extraction, if, then judge and received this query requests, if not, do not receive this query requests before then.
Wherein, each node in the network is all disposed by different mechanism, so each node all is under the jurisdiction of different mechanisms, and all there is the B server of oneself in each mechanism.
Wherein, when certain node in the network reads the information of other nodes, if this node also is connected with the B server of its institutional affiliation, then this node is the coding of self, the coding of the node that reads, and message time and the position of self are uploaded to the B server, the B server is with the coding of this node, the coding of the node that reads, the location storage of message time and this node be at the coding of uploading nodes, reads in the corresponding relation of position of coding, message time and uploading nodes of node.Wherein, each node of other in the network is also carried out identical operations with this node when reading other nodes.
Wherein, if agent node is the agent node of the direct appointment of user, then agent node obtains current time and the position of self, should the current time as the message time, the generated query request, and this query requests is carried the coding of agent node, the hunting zone that message time, anchor point sequence, the position that obtains and searching request are carried.
Step 208: when neighbor node receives query requests, from query requests, extract the coding and the message time of agent node, judge whether to receive this query requests according to the coding and message time of the agent node that extracts; If, directly abandon this query requests, otherwise, execution in step 209;
Wherein, when neighbor node whenever receives new query requests, the coding of the agent node that the storing queries request is carried and message time.So when neighbor node extracts the coding of agent node and message after the time from this query requests, judge the coding and the message time of the agent node that self whether has stored extraction, if not, then judge neighbor node and do not receive this query requests, if then judge neighbor node and received this query requests.
In addition, neighbor node can also extract the anchor point sequence from this query requests, judges the sign that whether has self in the anchor point sequence of extracting, if exist, then judges and has received this query requests, if there is no, then judges and does not receive this query requests.
Step 209: this neighbor node is extracting position and hunting zone from query requests, according to the position of self and the position of extraction, judges self whether within the hunting zone, if execution in step 210, if not, end operation;
Particularly, this neighbor node is extracting position and hunting zone from query requests, according to position of extracting and the position of self, calculate self to the distance between the position of extracting, judge whether this distance is less than or equal to the hunting zone, if show that then this neighbor node is positioned at the hunting zone, if not, show that then this neighbor node is located at outside the hunting zone.
Step 210: this neighbor node sends response message to this agent node, this response message is carried the coding of self, self positional information and current time, the sign of self is added in the anchor point sequence of searching request, again the searching request of adding to its neighbor node broadcasting;
Further, if this neighbor node also links to each other with the B server of its institutional affiliation, then this neighbor node is uploaded to the B server with this query requests;
Correspondingly, the B server receives this query requests, the coding that extracts the node upload this query requests from this query requests i.e. the coding and the message time of this neighbor node, according to the coding and the message time of the uploading nodes of extracting, judge whether to receive this query requests, if, then abandon this query requests, if not, then store the coding and the message time of uploading nodes, coding according to uploading nodes, from the coding of the uploading nodes of self having stored, read the coding of node, in the corresponding relation of the position of message time and uploading nodes, search the corresponding coding that reads node, the position of message time and uploading nodes, send response message to agent node, and this response message is carried the coding of searching that reads node, the position of message time and uploading nodes.
Wherein, each node in the network after receiving query requests, the same identical operations of carrying out with this neighbor node.
Step 211: when acting on behalf of node and receive first response message, beginning receives response message in the default time, after the response message packing that receives, sends to client.
Further, carry the coding of same node if there are many response messages, then agent node message time of carrying, from these many response messages, select the message time from nearest response message of current time, and abandon other response messages according to every response message.Correspondingly, the response message packing that agent node will not abandon, and send to client.
Wherein, other agent nodes in the network, the same identical operations of carrying out with this agent node.
Wherein, in the present embodiment, the user specifies a concrete position and hunting zone, selects agent node then, utilizes agent node to carry out search node near appointed positions, thereby improves the precision of search node.
Wherein, exist in the network and do not have the node that receives and send message capability, if this category node receives query requests, can not do any operation, but the type node can be read by near other nodes it, when if other nodes read the information of this node, the coding of this node and the positional information of self are uploaded to the B server.In the present embodiment, each node is uploaded to the B server with query requests, and the information such as coding of the node that can this node be read from the B server send to agent node, and the node that read comprises not having the node that receives and send message capability.So, improved the accuracy of search node.
In embodiments of the present invention, after agent node receives searching request, to its neighbor node broadcast query request, neighbor node judges whether to receive this query requests, if do not have after receiving query requests, judge whether self is positioned at the hunting zone that query requests is carried, if be positioned at, then send and carry self-position and coding and the response message of message time to agent node, agent node sends to client with response message again.Wherein, near appointed positions, select agent node, utilize agent node search node in the hunting zone, and many-sided factors such as communication radius, node speed, node acceleration, upload ability and voluntary have been taken all factors into consideration in the selection of agent node, thereby guaranteed agent node can be in a long time appointed positions near, thereby improve the precision of search node; Coverage comprises that the node of appointed positions all might become agent node, is not subjected to condition restriction, thereby has versatility.
Embodiment 3
As shown in Figure 3, the embodiment of the invention provides a kind of system of search node, comprises client 301, agent node 302 and neighbor node 303;
Wherein, neighbor node 303 comprises:
Judge module is used to receive this query requests, extracts the coding and the message time of agent node 302 from this query requests, judges whether the coding and the message time of storage agent node 302;
Responder module, if the result who is used for the judge module judgement is for denying, then judge and do not receive this query requests, according to position and the hunting zone that this query requests is carried, judge self whether in this hunting zone, if, send response message to agent node 302, wherein, this response message is carried the coding and the position of message time, neighbor node 302, broadcasts this query requests to its neighbor node;
Wherein, responder module comprises:
Judging unit, be used for position and this query requests position of carrying, calculate the distance between the position that self and this query requests carry, judge that whether this distance is greater than this hunting zone according to self, if not, then judge neighbor node 303 and be positioned at the hunting zone;
Transmitting element is used to send response message to agent node 302, and wherein, this response message is carried the coding and the position of message time, neighbor node 303, broadcasts this query requests to its neighbor node;
Wherein, if exist many response messages to carry the coding of same node, correspondingly,
Broadcast module is used to receive this searching request, and to its neighbor node broadcast query request, wherein, this query requests is carried position and the hunting zone that coding, message time, this searching request of agent node 301 are carried;
Sending module is used for from many response messages, selects the message time near the response message of current time, abandons other response message, and the response message that does not abandon is sent to client;
Further, this system also comprises the B server;
Correspondingly, agent node 302 and/or neighbor node 303 also are used for this query requests is uploaded to the B server after its neighbor node broadcast query request;
The B server, be used to receive query requests, coding according to the node of uploading this query requests, from the corresponding relation of the position of coding, the coding that reads node, message time and the uploading nodes of the uploading nodes of having stored, search the corresponding message time, read the coding of node and the position of uploading nodes; Send response message to agent node 302, wherein, this response message is carried the message time, is read the coding of node and the position of uploading nodes;
Wherein, agent node 302 is elected acquisition in the following manner;
The node that receives searching request judges whether the coverage of self comprises the position that this searching request is carried;
If node will self be arranged to the candidate agent node, and calculate the weights of self, send beacon message to its neighbor node, wherein, this beacon message carries weights;
If the candidate agent node receives neighbor node and sends the beacon message carry self weights, relatively whether the weights of self greater than the weights of neighbor node, if, be agent node with self electing, if not, the node of electing the weights maximum is an agent node;
If the candidate agent node does not receive the beacon message that neighbor node sends, then electing oneself is agent node;
Further, query requests is also carried the anchor node sequence,
Correspondingly, agent node 302 and/or neighbor node 303 also are used for the sign of self being added in the anchor point sequence of this query requests before this query requests of broadcasting;
Correspondingly,
Wherein, neighbor node 303 receives these query requests, judges the sign that whether has self in the anchor point sequence of this query requests, if there is no, then judge and do not receive this query requests, according to position and the hunting zone that this query requests is carried, judge self whether in this hunting zone, if, send response message to agent node 302, wherein, response message is carried the coding and the position of message time, neighbor node 303, broadcasts this query requests to its neighbor node.
In embodiments of the present invention, after agent node receives searching request, to its neighbor node broadcast query request, neighbor node judges whether to receive this query requests, if do not have after receiving query requests, judge whether self is positioned at the hunting zone that query requests is carried, if be positioned at, then send and carry self-position and coding and the response message of message time to agent node, agent node sends to client with response message again.Wherein, near appointed positions, select agent node, utilize agent node search node in the hunting zone, and agent node can be in a long time assigned address near, thereby improve the precision of search node; Coverage comprises that the node of appointed positions all might become agent node, is not subjected to condition restriction, thereby has versatility.
All or part of content in the technical scheme that above embodiment provides can realize that its software program is stored in the storage medium that can read by software programming, storage medium for example: the hard disk in the computer, CD or floppy disk.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (14)
1. the method for a search node is characterized in that, described method comprises:
Client sends searching request, and described searching request is carried hunting zone and user's appointed positions;
Agent node receives described searching request, and to its neighbor node broadcast query request, described query requests is carried coding, message time, described position and the described hunting zone of described agent node;
Described neighbor node receives described query requests, judges whether to receive described query requests;
If not, described neighbor node is according to described position and described hunting zone, judge whether self is positioned at described hunting zone, if, send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node;
Described agent node receives described response message, and described response message is sent to described client.
2. the method for claim 1 is characterized in that, described agent node judges whether to receive described query requests, comprising:
Described neighbor node extracts the coding and the described message time of described agent node from described query requests, judge whether to store the coding and the described message time of described agent node, if, then judge and received described query requests, if not, then judge and do not receive described query requests.
3. the method for claim 1 is characterized in that, described neighbor node judges that according to described position and described hunting zone whether self is positioned at described hunting zone, comprising:
Described neighbor node is according to self position and described position, calculates the distance between self and the described position, whether judges described distance greater than described hunting zone, if not, then judges and self is positioned at described hunting zone.
4. the method for claim 1 is characterized in that, if exist many response messages to carry the coding of same node, correspondingly,
Described agent node receives described response message, and described response message is sent to described client, comprising:
Described agent node selects the described message time near the response message of current time from described many response messages, abandons other response message, and the response message that does not abandon is sent to described client.
5. the method for claim 1 is characterized in that, described method also comprises:
Described agent node and/or described neighbor node are uploaded to the B server with described query requests after its neighbor node broadcast query request;
Described B server receives described query requests, coding according to the node of uploading described query requests, from the corresponding relation of the position of coding, the coding that reads node, message time and the uploading nodes of the uploading nodes of having stored, search the corresponding message time, read the coding of node and the position of uploading nodes;
Described B server sends response message to described agent node, and described response message is carried described message time, the described coding of node and the position of described uploading nodes of reading.
6. the method for claim 1 is characterized in that, described client sends after the searching request, also comprises:
The node that receives described searching request judges whether the coverage of self comprises the position that described searching request is carried;
If described node will self be arranged to the candidate agent node, and calculate the weights of self, send beacon message to its neighbor node, described beacon message carries described weights;
If described candidate agent node receives neighbor node and sends the beacon message carry self weights, relatively whether the weights of self are greater than the weights of neighbor node, if be agent node with self electing, if not, the node of election weights maximum is an agent node;
If described candidate agent node does not receive the beacon message that described neighbor node sends, then electing oneself is agent node.
7. the method for claim 1 is characterized in that, described query requests is also carried the anchor node sequence, correspondingly,
Described agent node and/or described neighbor node added the sign of self in the anchor point sequence of described query requests before the described query requests of broadcasting;
Correspondingly, described neighbor node receives described query requests, judges whether to receive described query requests, specifically comprises:
Described neighbor node receives described query requests, judges the sign that whether has self in the anchor point sequence of described query requests, if exist, then judges and has received described query requests, if there is no, then judges and does not receive described query requests.
8. the system of a search node is characterized in that, described system comprises client, agent node and neighbor node;
Described client is used to send searching request, and described searching request is carried hunting zone and user's appointed positions;
Described agent node is used to receive described searching request, and to its neighbor node broadcast query request, described query requests is carried coding, message time, described position and the described hunting zone of described agent node; Reception sends to described client from the response message of described neighbor node with described response message;
Described neighbor node is used to receive described query requests, judges whether to receive described query requests; If not, according to described position and described hunting zone, judge whether self is positioned at described hunting zone, if, send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
9. system as claimed in claim 8 is characterized in that, described neighbor node comprises:
Judge module is used to receive described query requests, extracts the coding and the described message time of described agent node from described query requests, judges whether to store the coding and the described message time of described agent node;
Responder module, if the result who is used for described judge module judgement is for denying, then judge and do not receive described query requests, according to described position and described hunting zone, judge that self is whether in described hunting zone, if send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
10. system as claimed in claim 9 is characterized in that, described responder module comprises:
Judging unit is used for position and described position according to self, calculates the distance between self and the described position, whether judges described distance greater than described hunting zone, if not, then judges described neighbor node and is positioned at described hunting zone;
Transmitting element is used to send response message to described agent node, and described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
11. system as claimed in claim 8 is characterized in that, if exist many response messages to carry the coding of same node, correspondingly,
Described agent node comprises:
Broadcast module is used to receive described searching request, and to its neighbor node broadcast query request, described query requests is carried coding, message time, described position and the described hunting zone of described agent node;
Sending module is used for from described many response messages, selects the described message time near the response message of current time, abandons other response message, and the described response message that does not abandon is sent to described client.
12. system as claimed in claim 8 is characterized in that, described system also comprises the B server;
Correspondingly, described agent node and/or described neighbor node also are used for described query requests is uploaded to the B server after its neighbor node broadcast query request;
Described B server, be used to receive described query requests, coding according to the node of uploading described query requests, from the corresponding relation of the position of coding, the coding that reads node, message time and the uploading nodes of the uploading nodes of having stored, search the corresponding message time, read the coding of node and the position of uploading nodes; Send response message to described agent node, described response message is carried described message time, the described coding of node and the position of described uploading nodes of reading.
13. system as claimed in claim 8 is characterized in that, described agent node is elected acquisition in the following manner;
The node that receives described searching request judges whether the coverage of self comprises the position that described searching request is carried;
If described node will self be arranged to the candidate agent node, and calculate the weights of self, send beacon message to its neighbor node, described beacon message carries described weights;
If described candidate agent node receives neighbor node and sends the beacon message carry self weights, relatively whether the weights of self are greater than the weights of neighbor node, if be agent node with self electing, if not, the node of election weights maximum is an agent node;
If described candidate agent node does not receive the beacon message that described neighbor node sends, then electing oneself is agent node.
14. system as claimed in claim 8 is characterized in that, described query requests is also carried the anchor node sequence,
Correspondingly, described agent node and/or described neighbor node also are used for the sign of self being added in the anchor point sequence of described query requests before the described query requests of broadcasting;
Correspondingly,
Described neighbor node receives described query requests, judge the sign that whether has self in the anchor point sequence of described query requests, if there is no, then judge and do not receive described query requests,, judge that self is whether in described hunting zone according to described position and described hunting zone, if, send response message to described agent node, described response message is carried the coding and the position of message time, described neighbor node, broadcasts described query requests to its neighbor node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010228672 CN102014456B (en) | 2010-07-09 | 2010-07-09 | Method and system for searching node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010228672 CN102014456B (en) | 2010-07-09 | 2010-07-09 | Method and system for searching node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102014456A true CN102014456A (en) | 2011-04-13 |
| CN102014456B CN102014456B (en) | 2013-03-27 |
Family
ID=43844413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010228672 Active CN102014456B (en) | 2010-07-09 | 2010-07-09 | Method and system for searching node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102014456B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102184191A (en) * | 2011-04-19 | 2011-09-14 | 中国联合网络通信集团有限公司 | Method and system for inquiring peripheral environment information based on Internet of things, and Internet of things platform |
| CN105682033A (en) * | 2016-01-19 | 2016-06-15 | 福建师范大学 | Near neighbour detection method based on mobile AP |
| CN106507286A (en) * | 2016-11-22 | 2017-03-15 | 北京三快在线科技有限公司 | A kind of document transmission method, source device and non-source device |
| WO2017113663A1 (en) * | 2015-12-28 | 2017-07-06 | 小米科技有限责任公司 | Method and apparatus for acquiring user information, terminal device and server |
| CN112668998A (en) * | 2020-12-23 | 2021-04-16 | 树根互联技术有限公司 | Flow implementation method, device, system, electronic equipment and readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005074229A1 (en) * | 2004-01-23 | 2005-08-11 | Tiversa Inc. | Method for optimally utilizing a peer to peer network |
| CN101039321A (en) * | 2007-02-02 | 2007-09-19 | 南京邮电大学 | Mixed mobile agent-based wireless sensor network data transmission method |
| CN101420337A (en) * | 2007-10-26 | 2009-04-29 | 北大方正集团有限公司 | Method, device and indexing server for resource positioning |
-
2010
- 2010-07-09 CN CN 201010228672 patent/CN102014456B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005074229A1 (en) * | 2004-01-23 | 2005-08-11 | Tiversa Inc. | Method for optimally utilizing a peer to peer network |
| CN101039321A (en) * | 2007-02-02 | 2007-09-19 | 南京邮电大学 | Mixed mobile agent-based wireless sensor network data transmission method |
| CN101420337A (en) * | 2007-10-26 | 2009-04-29 | 北大方正集团有限公司 | Method, device and indexing server for resource positioning |
Non-Patent Citations (1)
| Title |
|---|
| 杨圣洪等: "传感器网络中分布式最优小波压缩算法", 《计算机工程与应用》, vol. 45, no. 10, 31 October 2009 (2009-10-31), pages 4 - 6 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102184191A (en) * | 2011-04-19 | 2011-09-14 | 中国联合网络通信集团有限公司 | Method and system for inquiring peripheral environment information based on Internet of things, and Internet of things platform |
| WO2017113663A1 (en) * | 2015-12-28 | 2017-07-06 | 小米科技有限责任公司 | Method and apparatus for acquiring user information, terminal device and server |
| CN105682033A (en) * | 2016-01-19 | 2016-06-15 | 福建师范大学 | Near neighbour detection method based on mobile AP |
| CN105682033B (en) * | 2016-01-19 | 2019-01-25 | 福建师范大学 | A kind of neighbour's detection method based on mobile AP |
| CN106507286A (en) * | 2016-11-22 | 2017-03-15 | 北京三快在线科技有限公司 | A kind of document transmission method, source device and non-source device |
| CN112668998A (en) * | 2020-12-23 | 2021-04-16 | 树根互联技术有限公司 | Flow implementation method, device, system, electronic equipment and readable storage medium |
| CN112668998B (en) * | 2020-12-23 | 2023-12-19 | 树根互联股份有限公司 | Flow implementation method, device, system, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102014456B (en) | 2013-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101940055B (en) | Location tracking based on proximity-based ad hoc network | |
| US20020095486A1 (en) | Systems and methods for locating mobile computer users in a wireless network | |
| CN101600151B (en) | Radio-wave propagation characteristic prediction assisting system and radio-wave propagation characteristic prediction assisting method | |
| US11966424B2 (en) | Method and apparatus for dividing region, storage medium, and electronic device | |
| KR20060068518A (en) | The context aware system and its method with ubiquitous sensor network | |
| CN102014456B (en) | Method and system for searching node | |
| CN101175292A (en) | Wireless micro-power network positioning system and locating method thereof | |
| Myllymaki et al. | Location aggregation from multiple sources | |
| Ning et al. | Design of accurate vehicle location system using RFID | |
| CN105282844A (en) | Positioning method and system, terminal, and positioning server | |
| CN102263800A (en) | Geographic information internet of things system constructed based on cloud computing, and application | |
| CN111935820A (en) | Positioning implementation method based on wireless network and related equipment | |
| JP2007170956A (en) | Positioning method and system | |
| CN101795466A (en) | Wireless micropower network positioning system and positioning method thereof | |
| CN104583726A (en) | Providing location assistance information using data from smart meters | |
| US11803580B2 (en) | Apparatus and method for machine-learning-based positioning database creation and positioning of uncollected points using matching feature with wireless communication infrastructure | |
| CN202120314U (en) | Floor/door plate management system based on radio frequency identification device (RFID) | |
| CN108668218A (en) | A kind of method of locating terminal and device | |
| CN111782980B (en) | Mining method, device, equipment and storage medium for map interest points | |
| KR101831250B1 (en) | System for operating location based service using fixed terminal-mobile terminal and method therefor | |
| Callaghan et al. | Internal location based services using wireless sensor networks and RFID technology | |
| CN109379695B (en) | Method and machine-readable storage medium for indoor positioning of LoRa network | |
| CN111736196B (en) | Method for meeting application positioning requirement and user equipment | |
| Veenendaal et al. | Geolocating for web based geospatial applications | |
| Wang et al. | The Design and Development of FM Localization Algorithm Based on KNN Model |
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 |