CN102075974A - Method for searching high contiguity resources in wireless sensor network - Google Patents
Method for searching high contiguity resources in wireless sensor network Download PDFInfo
- Publication number
- CN102075974A CN102075974A CN2011100032776A CN201110003277A CN102075974A CN 102075974 A CN102075974 A CN 102075974A CN 2011100032776 A CN2011100032776 A CN 2011100032776A CN 201110003277 A CN201110003277 A CN 201110003277A CN 102075974 A CN102075974 A CN 102075974A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- degree
- resource
- searching
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a method for searching high contiguity resources in a wireless sensor network. In the method, an adjacency list and a database are arranged for network nodes contained in the wireless sensor network, wherein the adjacency list comprises node identifiers (ID) and node contiguity; and the node contiguity refers to the number of adjacent nodes capable of directly communicating with the node currently. Through message delivery as little as possible among the nodes, a search request provided by a resource search node is transmitted to a node with the maximum neighbor number. The algorithm provided by the invention transmits the resource search request to a node as far as possible away the resource search node through the message delivery as little as possible.
Description
Technical field
The invention belongs to networking technology area, be specifically related to the high adjacent degree resource search method of a kind of wireless sensor network.
Background technology
Wireless sensor network (WSNs) comprises a large amount of network node (network node can be the equipment with wireless communication module: as be used for environment monitoring sensor, car-mounted computer, mobile phone, PDA etc.), and the resource distribution in the wireless sensor network is stored on each node.Application based on wireless sensor network often needs and can respond the resource searching request.Propose the resource searching request at any node in the wireless sensor network, each node of network needs and can the resource searching request be communicated to the node that has searched resource according to certain message transmission policy.For solving the problem of transmission of resource searching request between individual network node, need a kind of good resource searching transmission policy, make it possible to internodal message transmission at the least possible number of times, the resource searching request is delivered on as much as possible the node that has searched resource, thereby returns resource matched successful response as much as possible for the node that proposes the resource searching request.At present simple and direct resource searching request is the method broadcast resource searching request that the resource searching request proposes node neighbor node use towards periphery inundation, the broadcasting method of this inundation can be so that all contain the node that is requested resource in the fastest speed fixer network, but the size of message maximum that consumes.Another kind of route unicast method at random is to select a node to carry out the transmission of message at random from neighbor node at every turn, knows on the node that is requested resource address up to the resource searching request is delivered to one.This method can reduce the message transmission significantly with respect to the inundation method, but it is less successfully to locate the probability that is requested resource.
Summary of the invention
The present invention has overcome the deficiencies in the prior art, has proposed the high adjacent degree resource search method of a kind of wireless sensor network, and this method has designed a kind of clean culture strategy, has realized the resource searching strategy.
Technical scheme of the present invention is: the high adjacent degree resource search method of wireless sensor network, the network node that described searching method comprises for wireless sensor network is provided with adjacency list and database, described adjacency list comprises node ID and node adjacency degree, described node adjacency degree be the minute book node current can with the adjacent node number of own direct communication, the resource searching step of described searching method is:
1) node (source node) that resource searching is inquired about is proposed
At first whether query node its data storehouse stores by query resource, returns resource address if having then to proposing the resource searching requesting users; Whether the adjacency list of source node inspection oneself is empty then, if be not empty, then the set with node identification (ID) of oneself and all node ID compositions in the adjacency list is designated as T
Id, will gather T
IdAdd resource searching message; Last source node selects to have the node of largest contiguous degree and maximum ID number (establish not have for ID number and repeat) from its adjacency list, send a resource searching message to it, and described resource searching message comprises set T
Id
2) suppose that node Y sends resource searching message from nodes X, whether node Y at first inquires about its data storehouse and stores by query resource, returns resource address if having then to proposing the resource searching requesting users;
3) node Y is with the T of the last hop node (X) that comprises in the resource searching message of receiving
IdValue is X.T
Id, node Y creates the next-hop node collection T of oneself
Next=T
Id-X.T
Id);
4) node Y checks the next-hop node collection T of oneself
NextEmpty set whether, if, then abandon this resource searching message, stop the resource searching process; Otherwise node Y is with the T of oneself
IdAdd resource searching message, node Y is according to the adjacency list of oneself, from T
NextIn select to have the node of largest contiguous degree and maximum ID number, comprise set Y.T to its transmission
IdResource searching message;
5) all processes of receiving that the node of resource searching message all begins according to the 2nd step are carried out corresponding actions.
Described node adjacency table can initialization, the steps include:
1) each node sends " Hello " message to neighbor node;
2) node of receiving " Hello " message increases 1 with self adjacent degree;
3) after each node obtains the adjacent degree value, send " degree-info " message, inform the adjacent degree value that neighbours oneself are current to its neighbor node;
4) after node is received " degree-info " message, node ID and the corresponding adjacent degree that is comprised in the message of receiving added in the adjacency list of oneself.
Described node adjacency table is provided with two processing methods:
1) processing of new node adding
At first, newly added node (establish it and be x) sends " Hello " message to neighbor node;
Secondly, the node (establish it and be y) of receiving " Hello " message increases 1 with self adjacent degree, then, sends " degree-info " message (ID and the corresponding adjacent degree record that comprise node y) to its neighbor node;
At last, receive that the node of " degree-info " message searches adjacency list according to the node ID in the message (y), if not having node ID in the adjacency list is that the record of y then adds the record that node ID is y according to " degree-info " message content, be that the record of y then upgrades corresponding adjacent degree value according to " degree-info " message content if there is node ID.
2) old node withdraws from processing
At first, old node sends " Quit " message to neighbor node;
Secondly, the node of receiving " Quit " message subtracts 1 with self adjacent degree, simultaneously the respective entries of own adjacency list is deleted.
The present invention has following beneficial effect:
1) the present invention can begin by any node in wireless sensor network WSNs, and the message transmission with the least possible searches resource as much as possible.
2) the present invention is with the least possible internodal message transmission, and the searching request that the resource searching node is proposed is delivered on the maximum node of neighbours' number.
3) deep search algorithm: use the least possible message transmission, the resource searching request is delivered to apart from the resource searching node node far away as far as possible.
Description of drawings
Fig. 1 represents the schematic diagram of the first resource searching route that the present invention carries out according to the method for the invention from source node.
Among the figure, the 1. general node in the network; 2. expression searching route.
Embodiment
Further specify below in conjunction with embodiment.
Referring to shown in Figure 1, the present invention comprises general node 1 in the network and the searching route 2 of this algorithm.Each node must be safeguarded following variable before carrying out resource searching:
Adjacent degree: the minute book node current can with the neighbor node number of own direct communication, initial value is " 0 "
Adjacency list: the adjacency list pattern is＜neighbor node ID adjacent degree 〉, be used for current all the neighbor node ID of minute book node and the value of corresponding adjacent degree, initial value is an empty set
This method is made up of following three kinds of operations:
One, adjacency list initialization operation
1, each node sends " Hello " message to neighbor node;
2, the node of receiving " Hello " message increases 1 with self adjacent degree.
3, after each node obtains the adjacent degree value, send " degree-info " message, inform the adjacent degree value that neighbours oneself are current to its neighbor node;
4, after node is received " degree-info " message, node ID and the corresponding adjacent degree that is comprised in the message of receiving added in the adjacency list of oneself.
Two, adjacency list maintenance process
1, new node adds processing
1) newly added node (establish it and be x) sends " Hello " message to neighbor node;
2) node (establish its for y) of receiving " Hello " message increases 1 with self adjacent degree, then, sends " degree-info " message (ID and the corresponding adjacent degree record that comprise node y) to its neighbor node;
3) receive that the node of " degree-info " message searches adjacency list according to the node ID in the message (y), if not having node ID in the adjacency list is that the record of y then adds the record that node ID is y according to " degree-info " message content, be that the record of y then upgrades corresponding adjacent degree value according to " degree-info " message content if there is node ID.
2, old node withdraws from processing
1) old node sends " Quit " message to neighbor node;
2) node of receiving " Quit " message subtracts 1 with self adjacent degree, simultaneously with oneself the respective entries deletion of adjacency list.
Three, distributed resource search procedure
1) whether the node (source node) that proposes the resource searching inquiry is at first inquired about its data storehouse and is stored by query resource, returns resource address if having then to proposing the resource searching requesting users; Whether the adjacency list of source node inspection oneself is empty then, if be not empty, then the set with ID of oneself and all node ID compositions in the adjacency list is designated as T
Id, will gather T
IdAdd resource searching message; Last source node selects to have the node of largest contiguous degree and maximum ID number (establish not have for ID number and repeat) from its adjacency list, send resource searching message to it and (comprise set T
Id);
2) suppose the resource searching message that node Y sends from nodes X, whether node Y at first inquires about its data storehouse and stores by query resource, returns resource address if having then to proposing the resource searching requesting users;
3) node Y is designated as T with the set of ID of oneself and all node ID compositions in the adjacency list
Id, node Y is with the T of the last hop node (X) that comprises in the resource searching message of receiving
IdValue is X.T
Id, node Y creates the next-hop node collection T of oneself
Next(=T
Id-X.T
Id);
4) node Y checks the next-hop node collection T of oneself
NextEmpty set whether, if, then abandon this resource searching message, stop the resource searching process; Otherwise node Y is with the T of oneself
IdAdd resource searching message, node Y is according to the adjacency list of oneself, from T
NextIn select to have the node of largest contiguous degree and maximum ID number, send resource searching message to it and (note: comprise set Y.T in this message
Id);
5) from now on, all processes of receiving that the node of resource searching message all begins according to the 2nd step are carried out corresponding actions.
Searching method of the present invention is delivered on the maximum node of neighbours' number with the least possible internodal message transmission, the searching request that the resource searching node is proposed; Use the least possible message transmission, the resource searching request is delivered to apart from the resource searching node node far away as far as possible.
Claims (3)
1. the high adjacent degree resource search method of wireless sensor network, the network node that described searching method comprises for wireless sensor network is provided with adjacency list and database, described adjacency list comprises node identification (ID) and node adjacency degree, described node adjacency degree be the minute book node current can with the adjacent node number of own direct communication, the resource searching step of described searching method is:
1) node (source node) that resource searching is inquired about is proposed
At first whether query node its data storehouse stores by query resource, returns resource address if having then to proposing the resource searching requesting users; Whether the adjacency list of source node inspection oneself is empty then, if be not empty, then the node identification (ID) of oneself and the set of the composition of all node identifications (ID) in the adjacency list is designated as T
Id, will gather Tid and add resource searching message; Last source node selects to have the node of largest contiguous degree and maximum ID number (establish not have for ID number and repeat) from its adjacency list, send a resource searching message to it, and described resource searching message comprises set T
Id
2) suppose that node Y sends resource searching message from nodes X, whether node Y at first inquires about its data storehouse and stores by query resource, returns resource address if having then to proposing the resource searching requesting users;
3) node Y is with the T of the last hop node (X) that comprises in the resource searching message of receiving
IdValue is X.T
Id, node Y creates the next-hop node collection T of oneself
Next=T
Id-X.T
Id);
4) node Y checks the next-hop node collection T of oneself
NextEmpty set whether, if, then abandon this resource searching message, stop the resource searching process; Otherwise node Y is with the T of oneself
IdAdd resource searching message, node Y is according to the adjacency list of oneself, from T
NextIn select to have the node of largest contiguous degree and maximum ID number, comprise set Y.T to its transmission
IdResource searching message;
5) all processes of receiving that the node of resource searching message all begins according to the 2nd step are carried out corresponding actions.
2. the high adjacent degree resource search method of wireless sensor network according to claim 1 is characterized in that: described node adjacency table can initialization, the steps include:
1) each node sends " Hello " message to neighbor node;
2) node of receiving " Hello " message increases 1 with self adjacent degree;
3) after each node obtains the adjacent degree value, send " degree-info " message, inform the adjacent degree value that neighbours oneself are current to its neighbor node;
4) after node is received " degree-info " message, node ID and the corresponding adjacent degree that is comprised in the message of receiving added in the adjacency list of oneself.
3. the high adjacent degree resource search method of wireless sensor network according to claim 1 is characterized in that: described node adjacency table is provided with two processing methods:
1) processing of new node adding
At first, newly added node (establish it and be x) sends " Hello " message to neighbor node;
Secondly, the node (establish it and be y) of receiving " Hello " message increases 1 with self adjacent degree, then, sends " degree-info " message (ID and the corresponding adjacent degree record that comprise node y) to its neighbor node;
At last, receive that the node of " degree-info " message searches adjacency list according to the node ID in the message (y), if not having node ID in the adjacency list is that the record of y then adds the record that node ID is y according to " degree-info " message content, be that the record of y then upgrades corresponding adjacent degree value according to " degree-info " message content if there is node ID;
2) old node withdraws from processing
At first, old node sends " Quit " message to neighbor node;
Secondly, the node of receiving " Quit " message subtracts 1 with self adjacent degree, simultaneously the respective entries of own adjacency list is deleted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110003277 CN102075974B (en) | 2011-01-10 | 2011-01-10 | Method for searching high contiguity resources in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110003277 CN102075974B (en) | 2011-01-10 | 2011-01-10 | Method for searching high contiguity resources in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102075974A true CN102075974A (en) | 2011-05-25 |
| CN102075974B CN102075974B (en) | 2013-12-18 |
Family
ID=44034283
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110003277 Expired - Fee Related CN102075974B (en) | 2011-01-10 | 2011-01-10 | Method for searching high contiguity resources in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102075974B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103260194A (en) * | 2013-05-06 | 2013-08-21 | 西安邮电大学 | Wireless sensor distributary system based on cloud computing |
| CN109063072A (en) * | 2018-07-24 | 2018-12-21 | 西安科技大学 | The querying method and device of information in a kind of engineering management |
| CN110083603A (en) * | 2019-04-17 | 2019-08-02 | 武汉初心科技有限公司 | A kind of querying method and system for realizing node path based on adjacency list |
| CN110932980A (en) * | 2019-11-27 | 2020-03-27 | 达闼科技成都有限公司 | Communication method, terminal, and computer-readable storage medium |
| CN111177486A (en) * | 2019-12-19 | 2020-05-19 | 四川蜀天梦图数据科技有限公司 | Message transmission method and device in distributed graph calculation process |
| WO2022088140A1 (en) * | 2020-10-31 | 2022-05-05 | 华为技术有限公司 | Ai chip and adjacency list sampling method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101657030A (en) * | 2008-12-19 | 2010-02-24 | 重庆邮电大学 | Three-way handshaking method in Mesh network based on IEEE802.16 |
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
-
2011
- 2011-01-10 CN CN 201110003277 patent/CN102075974B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101657030A (en) * | 2008-12-19 | 2010-02-24 | 重庆邮电大学 | Three-way handshaking method in Mesh network based on IEEE802.16 |
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
Non-Patent Citations (2)
| Title |
|---|
| 江海峰: "无线传感器网络能量优化路由算法研究", 《中国博士论文全文数据库》 * |
| 潘霞: "能量有效的无线传感器网络分群路由协议的研究与实现", 《中国硕士论文全文数据库》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103260194A (en) * | 2013-05-06 | 2013-08-21 | 西安邮电大学 | Wireless sensor distributary system based on cloud computing |
| CN103260194B (en) * | 2013-05-06 | 2016-02-17 | 西安邮电大学 | Based on the wireless senser separate system of cloud computing |
| CN109063072A (en) * | 2018-07-24 | 2018-12-21 | 西安科技大学 | The querying method and device of information in a kind of engineering management |
| CN110083603A (en) * | 2019-04-17 | 2019-08-02 | 武汉初心科技有限公司 | A kind of querying method and system for realizing node path based on adjacency list |
| CN110932980A (en) * | 2019-11-27 | 2020-03-27 | 达闼科技成都有限公司 | Communication method, terminal, and computer-readable storage medium |
| CN110932980B (en) * | 2019-11-27 | 2022-09-20 | 达闼机器人股份有限公司 | Communication method, terminal, and computer-readable storage medium |
| CN111177486A (en) * | 2019-12-19 | 2020-05-19 | 四川蜀天梦图数据科技有限公司 | Message transmission method and device in distributed graph calculation process |
| WO2022088140A1 (en) * | 2020-10-31 | 2022-05-05 | 华为技术有限公司 | Ai chip and adjacency list sampling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102075974B (en) | 2013-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102075974B (en) | Method for searching high contiguity resources in wireless sensor network | |
| Dhanaraj et al. | Hybrid and dynamic clustering based data aggregation and routing for wireless sensor networks | |
| CN110113264B (en) | Method for realizing cache and route of named data network | |
| CN108848032B (en) | Named object network implementation method supporting multi-interest type processing | |
| CN103491590B (en) | A kind of implementation method of wireless sensor network route of future generation | |
| CN101521926B (en) | Cooperative routing method for large-scale wireless distribution network | |
| CN107948073B (en) | Wireless data transmission method, device and system based on NDN architecture | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN104506537B (en) | P2P system node selection method | |
| CN101127714A (en) | A route management method and device for wireless mesh network | |
| CN103326925B (en) | A kind of information push method and device | |
| Aboud et al. | Geographic interest forwarding in NDN-based wireless sensor networks | |
| CN103841621A (en) | Redundancy routing method based on 6LoWPAN tree type network | |
| CN105188104B (en) | A kind of implementation method of wireless communication | |
| CN109474896A (en) | A kind of block chain implementation method, system and the storage medium of decentralization | |
| CN105072658A (en) | Network data collection control system and wireless routing method | |
| CN105763607A (en) | Subscription content acquisition method, equipment and system | |
| CN101282353B (en) | Method for implementing efficiency route protocol for wireless sensor network based on cost function | |
| CN102916891B (en) | Routing method of communication network and routing node | |
| CN115865844B (en) | Virtual-real combined dynamic flow scheduling method and device based on SDN (software defined network) and NDN (non-dynamic network) | |
| CN103259883A (en) | Self-organizing low-power-consumption wireless network IP address administration method | |
| CN103686807A (en) | CCN subnet mobile data transmission method | |
| CN102404235B (en) | Packet transfer method and field programmable gate array | |
| CN103619064A (en) | Wireless network-based methods for requiring and locating nodes and transferring data |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: QINGDAO UNIVERSITY OF SCIENCE + TECHNOLOGY Free format text: FORMER OWNER: ZHANG JUNHU Effective date: 20140611 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20140611 Address after: 266061 Shandong Province, Qingdao city Laoshan District Songling Road No. 99 Patentee after: Qingdao University of Science & Technology Address before: Yunling road Laoshan District Qingdao city Shandong province 266061 No. 16 No. 5 Building 1 unit 401 room Patentee before: Zhang Junhu |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131218 Termination date: 20190110 |