CN102510580B - Storage communication method in wireless sensor network - Google Patents
Storage communication method in wireless sensor network Download PDFInfo
- Publication number
- CN102510580B CN102510580B CN201110447558.0A CN201110447558A CN102510580B CN 102510580 B CN102510580 B CN 102510580B CN 201110447558 A CN201110447558 A CN 201110447558A CN 102510580 B CN102510580 B CN 102510580B
- Authority
- CN
- China
- Prior art keywords
- frame
- node
- oneself
- identify label
- label number
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000006854 communication Effects 0.000 title claims abstract description 35
- 238000004891 communication Methods 0.000 title claims abstract description 34
- 238000000034 method Methods 0.000 title claims abstract description 14
- 230000005540 biological transmission Effects 0.000 claims abstract description 7
- 239000000284 extract Substances 0.000 claims description 10
- 208000034423 Delivery Diseases 0.000 claims description 2
- 238000012384 transportation and delivery Methods 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 description 6
- 230000008447 perception Effects 0.000 description 5
- 238000013461 design Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention relates to a storage communication method in a wireless sensor network, wherein an efficient and reliable communication mechanism is proposed through the combination of a communication mechanism and a storage mode, and a method for solving the problems in the communication of the wireless sensor network is also proposed. According to the storage communication method, in order to improve the communication efficiency in the sensor network, a sensing data transmission path from a source node to a destination node is established by depending on intensively arranged nodes of the wireless sensor network, thereby ensuring that sensing data and common sensing data can reach the destination node timely and reliably. The reliability and efficiency of communication are the vital technical requirements in the wireless sensor network, and the two requirements can be met by combining the storage mode, thereby ensuring the integrity of the data.
Description
Technical field
The present invention relates to the storing communication mechanism in a kind of wireless sensor network.The method be sensing data in time, accurately and efficiently transmission provide safeguard, belong to the crossing domain of sensor network technique and wireless communication technology.
Background technology
The development that wireless sensor network technology is accompanied by the technology such as the communication technology, microsystems technology, computing technique produces, in its perception collaboratively, acquisition and processing network's coverage area, the information of monitoring target, has broad application prospects in fields such as traffic, military affairs, medical treatment.But wireless sensor network has the deficiency of self, for conventional wireless network, be mainly manifested in several aspects such as finite energy, disposal ability, memory capacity and communication bandwidth of node.Because sensor node is battery-powered, the problem of finite energy is particularly outstanding.In wireless sensor network, radio communication is the main consumer of energy.
Inventor finds under study for action, communication between node in wireless sensor network is catabiotic major way, how to design efficient communication mechanism, guarantee that Non-redundant data transmission is very important, the data of node collection may be large numbers of simultaneously, need certain storage mode that data are stored.
Summary of the invention
technical problem:the object of this invention is to provide the storing communication mechanism in a kind of wireless sensor network, it is support that the method be take the wireless sensor network node of intensive deployment, the communication efficiency improving in sensor network of take is target, the sensing data transmission path of structure from source node to destination node, has guaranteed that sensing data and common sensing data arrive destination node in time, reliably.
technical scheme:the present invention has set up the storing communication mechanism in a kind of wireless sensor network, and its basic system forms and comprises:
Ordinary node: the wireless sensor network node of the environmental information such as temperature that can its surrounding space of perception, humidity, illuminance, gas concentration.Ordinary node has a blocks of data memory block, for storing the data of own perception.Ordinary node possesses package forward ability simultaneously, and the sensing data of the sensing data that himself can be produced or other node receiving sends to any node that its communication capacity can reach, and ordinary node has own unique ID(identify label number);
Via node: the node that possesses data retransmission ability.In the present invention, in define grid, any ordinary node can become via node.The data storage area of via node, the data that arrive for storing received, once these data are disposed by via node, its memory block taking will be released;
Base station: the node that sensing data is finally transferred to;
The step that a kind of chaining method of wireless sensor network comprises is:
Step 1) in network environment, random, a plurality of general sensor nodes with identical primary power, same communication ability and sensing ability of uniform broadcasting, each general sensor nodes is known oneself unique coordinate.The sensor node sum of spreading is known, and the coordinate of all nodes is known in base station;
Step 2) coordinate of each node and the coordinate of oneself are broadcasted with the communication radius of covering sensor network in base station;
The common sensor node of step 3) receives the broadcast data of base station, and choose base station direction from own nearest node the via node as down hop;
Step 4) ordinary node starts to gather data around, and stores in the memory block of oneself;
Step 5) ordinary node sends REQ frame (claim frame) to its via node, contains the ID of oneself, for establishing a communications link in frame;
Step 6) via node receives after REQ frame, and the ID in REQ frame is extracted, and writes in ACK frame (acknowledgement frame), then sends ACK frame to this ID;
After step 7) ordinary node is received ACK frame, ID is extracted with the ID of oneself and is contrasted, confirm errorless after;
Step 8) ordinary node extracts data from the memory block of oneself, write the Frame of oneself, and start Frame numbering, since 0 until byte of 255(is 8 bits, 0 to 255 be binary without sign bit 00000000 to binary without sign bit 11111111);
Step 9) via node receives after Frame, and ID is extracted, and sees it is whether the Frame of the node oneself wanted, confirm errorless after, the ACK frame to this Frame is sent to this ordinary node, and in ACK frame, writes the numbering of this Frame;
Step 10) ordinary node receives after this ACK frame, extract the numbering of Frame, and contrast with the numbering of the Frame of an own upper transmission, confirm errorless after, just from the memory block of oneself, extract next group data, in data writing frame, send, constantly repeating step 5) to the process of step 10).
beneficial effect:as the storing communication mechanism in a kind of wireless sensor network, the present invention has following useful achievements:
1. the data volume in wireless sensor network may be larger, and the memory space of node may be not enough, and the memory module of the present invention's design has solved this problem;
2. the connection of the communication in wireless sensor network is stable not, easily occurs the situation of lost data frames, and the effect of the ACK frame in the present invention is exactly the loss that prevents Frame;
3. the initial communication in wireless sensor network is insecure often, and the REQ frame in the present invention can guarantee the reliability of communicating by letter with ACK frame;
4. if in wireless sensor network, perception data does not send in time, will cause the loss of information, the present invention stores in memory block by perception data and carries out orderly data and extract, and has guaranteed the integrality of data.
Accompanying drawing explanation
Fig. 1 be the present invention towards wireless sensor network structure.
Fig. 2 is REQ frame of the present invention.
Fig. 3 is ACK frame of the present invention.
Fig. 4 is Frame of the present invention.
Embodiment
The present invention is directed to the communication process in wireless sensor network, proposed efficient, reliable communication mode, and combined storage means, guaranteed the integrality of data.Its embodiment is:
1) in network environment, random, a plurality of general sensor nodes with identical primary power, same communication ability and sensing ability of uniform broadcasting, each general sensor nodes is known own unique coordinate, and can regulate the transmitted power of oneself.The sensor node sum of spreading is known, and the coordinate of all nodes is known in base station;
2) coordinate of each node and the coordinate of oneself are broadcasted with the communication radius of covering sensor network in base station;
3) common sensor node receives the broadcast data of base station, and choose base station direction from own nearest node the via node as down hop;
4) ordinary node starts to gather data around, and stores in the memory block of oneself, and the data in memory block can not cover mutually;
5) ordinary node sends REQ frame to its via node can arrive the minimum power of the via node of oneself, and the ID that contains oneself in this REQ frame, for establishing a communications link;
6) via node receives after REQ frame, and the ID in REQ frame is extracted, and judges whether it is the ID of own desired node, if, this ID is write in ACK frame, then with minimum power, send ACK frame to this ID, if not, abandon;
7) after ordinary node is received ACK frame, ID is extracted with the ID of oneself and contrasted, if the ID of oneself carries out next step, if not abandoning this ACK frame;
8) ordinary node extracts data from the memory block of oneself, writes the Frame of oneself, and starts Frame to number, first Frame be numbered 0, later just since 1 until 255, by oneself ID with number in data writing frame, with minimum power, send to via node;
9) via node receives after Frame, and ID is extracted, and sees it is whether the Frame of the node oneself wanted, confirm errorless after, the ACK frame to this Frame is sent to this ordinary node, and in ACK frame, writes the numbering of this Frame;
10) ordinary node receives after this ACK frame, extract the numbering of Frame, and contrast with the numbering of the Frame of an own upper transmission, confirm errorless after, just from the memory block of oneself, extract next and organize data, in data writing frame, numbering is added to 1 then to 255 deliverys, be written in Frame, then in the ID data writing frame of oneself, then with minimum power, send, constantly repeating step 5) to the process of step 10).
Claims (1)
1. the storing communication method in wireless sensor network, is characterized in that steps of the method are:
1) in network environment, a plurality of general sensor nodes with identical primary power, same communication ability and sensing ability of uniform broadcasting at random,, each general sensor nodes is known own unique coordinate, and can regulate the transmitted power of oneself, the sensor node sum of spreading is known, and the coordinate of all nodes is known in base station;
2) coordinate of each node and the coordinate of oneself are broadcasted with the communication radius of covering sensor network in base station;
3) common sensor node receives the broadcast data of base station, and choose base station direction from own nearest node the via node as down hop;
4) ordinary node starts to gather the data of node around, and stores in the memory block of oneself, and the data in memory block can not cover mutually;
5) ordinary node sends request frame REQ to its via node can arrive the minimum power of the via node of oneself, and the identify label number ID that contains oneself in this claim frame REQ, for establishing a communications link;
6) via node receives after claim frame REQ, identify label number ID in claim frame REQ is extracted, judge whether it is the identify label number ID of own desired node, if words, this identify label number ID is write in acknowledgement frame ACK, then with minimum power, send acknowledgement frame ACK to this identify label number ID, if not, abandon;
7) after ordinary node is received acknowledgement frame ACK, identify label number ID is extracted with the identify label number ID of oneself and contrasted, if the identify label number ID of oneself carries out next step, if not abandoning this acknowledgement frame ACK;
8) ordinary node extracts data from the memory block of oneself, write the Frame of oneself, and start Frame to number, first Frame be numbered 0, later just since 1 until 255, by in the identify label number ID of oneself and numbering data writing frame, with minimum power, send to via node;
9) via node receives after Frame, identify label number ID is extracted, sees it is whether the Frame of the node oneself wanted, confirm errorless after, acknowledgement frame ACK to this Frame is sent to this ordinary node, and in acknowledgement frame ACK, write the numbering of this Frame;
10) ordinary node receives after this acknowledgement frame ACK, extract the numbering of Frame, and contrast with the numbering of the Frame of an own upper transmission, confirm errorless after, just from the memory block of oneself, extract next group data, in data writing frame, numbering is added to 1 then to 255 deliverys, be written in Frame, then
In the identify label number ID data writing frame of oneself, then with minimum power, send, constantly repeating step 5) to the process of step 10).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110447558.0A CN102510580B (en) | 2011-12-28 | 2011-12-28 | Storage communication method in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110447558.0A CN102510580B (en) | 2011-12-28 | 2011-12-28 | Storage communication method in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102510580A CN102510580A (en) | 2012-06-20 |
| CN102510580B true CN102510580B (en) | 2014-09-10 |
Family
ID=46222623
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110447558.0A Active CN102510580B (en) | 2011-12-28 | 2011-12-28 | Storage communication method in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102510580B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107705523A (en) * | 2017-07-19 | 2018-02-16 | 大连工业大学 | A kind of distributed illumination synchronized measurement system |
| CN112131299B (en) * | 2020-11-24 | 2021-02-26 | 山东富通信息科技有限公司 | Network-based data center equipment information acquisition system and method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267433A (en) * | 2008-04-30 | 2008-09-17 | 华中科技大学 | A central control source routing protocol adapted to isomerous network environment |
| CN101945460A (en) * | 2010-08-26 | 2011-01-12 | 湘潭大学 | Energy-saving AODV routing method used in Ad Hoc network environment |
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
-
2011
- 2011-12-28 CN CN201110447558.0A patent/CN102510580B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267433A (en) * | 2008-04-30 | 2008-09-17 | 华中科技大学 | A central control source routing protocol adapted to isomerous network environment |
| CN101945460A (en) * | 2010-08-26 | 2011-01-12 | 湘潭大学 | Energy-saving AODV routing method used in Ad Hoc network environment |
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102510580A (en) | 2012-06-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yick et al. | Wireless sensor network survey | |
| Ko et al. | DualMOP-RPL: Supporting multiple modes of downward routing in a single RPL network | |
| KR101838412B1 (en) | Cross-layer and cross-application acknowledgment for data transmission | |
| MX2007001385A (en) | Ad-hoc network and method employing globally optimized routes for packets. | |
| Liu et al. | APMD: A fast data transmission protocol with reliability guarantee for pervasive sensing data communication | |
| IN2014CN02866A (en) | ||
| CN105072657A (en) | Data naming-centered wireless sensor network asynchronous sleep scheduling method | |
| Yilmaz et al. | Localization-free and energy-efficient hole bypassing techniques for fault-tolerant sensor networks | |
| CN101577668A (en) | Wireless sensor network opportunistic routing protocol based on grid clustering | |
| CN103929377A (en) | Wired network and wireless network combined dispatching method and system and related devices | |
| CN107579915B (en) | Ad hoc network method, node, gateway and communication system based on tree network | |
| CN102510580B (en) | Storage communication method in wireless sensor network | |
| CN104219632A (en) | Cellphone ad-Hoc network location information collecting method for emergency rescue | |
| CN103476081A (en) | Method for routing in wireless sensor network | |
| KR101663994B1 (en) | METHOD FOR PROVIDING AN LIGHT-WEIGHT ROUTING PROTOCOL IN A IoT CAPABLE INFRA-LESS WIRELESS NETWORKS, RECORDING MEDIUM AND DEVICE FOR PERFORMING THE METHOD | |
| Bawa et al. | An efficient novel key management scheme for enhancing user authentication in a WSN | |
| CN102695192A (en) | Routing scheme for IPv6 wireless sensor network | |
| Kim et al. | ASRQ: Automatic segment repeat request for IEEE 802.15. 4-based WBAN | |
| Zhang et al. | Performance analysis of reliable flooding in duty‐cycle wireless sensor networks | |
| Ismail et al. | Security topology in wireless sensor networks with routing optimisation | |
| CN101577667A (en) | Wireless sensor network XY routing protocol based on grid clustering | |
| CN103607746A (en) | Method for realizing routing through wireless sensing nodes | |
| CN103476088A (en) | Method for achieving routing communication of next-generation wireless sensor network | |
| Tariq et al. | Evaluation of a sensor network node communication using formal verification | |
| Brzozowski et al. | A cross-layer approach for data replication and gathering in decentralized long-living wireless sensor 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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20120620 Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: Nanjing Post & Telecommunication Univ. Contract record no.: 2016320000217 Denomination of invention: Storage communication method in wireless sensor network Granted publication date: 20140910 License type: Common License Record date: 20161118 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: Nanjing Post & Telecommunication Univ. Contract record no.: 2016320000217 Date of cancellation: 20180116 |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180802 Address after: 100013 11, 1 anding Gate Street, Chaoyang District, Beijing (anzhen incubator C218) Patentee after: Beijing Jiangjiang science and Technology Center (limited partnership) Address before: 210003 new model road, Nanjing, Nanjing, Jiangsu Patentee before: Nanjing Post & Telecommunication Univ. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190108 Address after: No. 9, Wen Yuan Road, Qixia District, Nanjing, Jiangsu Patentee after: Nanjing Post & Telecommunication Univ. Address before: 100013 11, 1 anding Gate Street, Chaoyang District, Beijing (anzhen incubator C218) Patentee before: Beijing Jiangjiang science and Technology Center (limited partnership) |