CN102143545A - Router and packet forwarding method thereof - Google Patents

Router and packet forwarding method thereof Download PDF

Info

Publication number
CN102143545A
CN102143545A CN2011100511893A CN201110051189A CN102143545A CN 102143545 A CN102143545 A CN 102143545A CN 2011100511893 A CN2011100511893 A CN 2011100511893A CN 201110051189 A CN201110051189 A CN 201110051189A CN 102143545 A CN102143545 A CN 102143545A
Authority
CN
China
Prior art keywords
node
neighbors
radius
module
forward node
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.)
Pending
Application number
CN2011100511893A
Other languages
Chinese (zh)
Inventor
赵国安
张波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SHANGHAI ZUOANXINHUI ELECTRONIC TECHNOLOGY Co Ltd
Original Assignee
SHANGHAI ZUOANXINHUI ELECTRONIC TECHNOLOGY Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by SHANGHAI ZUOANXINHUI ELECTRONIC TECHNOLOGY Co Ltd filed Critical SHANGHAI ZUOANXINHUI ELECTRONIC TECHNOLOGY Co Ltd
Priority to CN2011100511893A priority Critical patent/CN102143545A/en
Publication of CN102143545A publication Critical patent/CN102143545A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a router and a packet forwarding method thereof. The router comprises a node density calculating module, a transmission radius calculating module, an adjacent node detecting module, a forwarding node detecting module and a forwarding node selecting module, wherein the node density calculating module is used for calculating and storing network node density in a storage network; the transmission radius calculating module is used for calculating the maximum transmission radius of one node and storing the maximum transmission radius to the node; and the adjacent node detecting module is used for detecting the adjacent nodes in the maximum transmission radius of the node and storing the transmission distance from the adjacent nodes to the node. In the router and the packet forwarding method thereof, the forwarding node range is determined by adopting the optimum transmission radius and the maximum transmission radius, and the interruption and abnormality of communication caused by communication empty is effectively avoided by a surface traversal technology. Furthermore, in the invention, the utilization ratio of node energy is improved, so that the service lives of the node and the network are prolonged.

Description

Router and packet-forwarding method thereof
Technical field
The present invention relates to a kind of router and packet-forwarding method thereof, particularly relate to a kind of router and packet-forwarding method thereof that is used for wireless sensing network.
Background technology
The transducer of numerous types that wireless sensor network had, diversified phenomenon in the detectable surrounding enviroment such as size, speed and direction that comprise earthquake, electromagnetism, temperature, humidity, noise, luminous intensity, pressure, soil constituent, mobile object.Micro sensing technology and Wireless Networking technology based on MEMS (MEMS (micro electro mechanical system)) are that wireless sensor network has been given wide application prospect.These potential applications can reduce: field such as military affairs, aviation, anti-terrorism, explosion-proof, the disaster relief, environment, medical treatment, health care, household, industry, commerce.
In the communication process of existing wireless sensor network, greedy pass-through mode is based on very important a kind of pass-through mode in the data forwarding of the route in geographical position in the wireless sensor network, but this pass-through mode suffers from route cavity problem easily, thereby cause communication interruption and unusual, the geographical position that utilizes sensing node of this external wireless sensor network is come in the process of packet forward data, because the selection strategy of the next-hop node of greedy pass-through mode is too simple, though though the nearest node of chosen distance destination node can reduce jumping figure, reduce time delay, but this pass-through mode has also increased the energy consumption of node, has reduced node and network life.
Summary of the invention
The technical problem to be solved in the present invention is in order to overcome the big defective of energy consumption of the node that selection strategy that greedy pass-through mode of the prior art meets with communication cavity and next-hop node easily too simply causes, a kind of router and packet-forwarding method thereof are provided, thereby when effectively evading the communication cavity, improve energy utilization ratio.
The present invention solves above-mentioned technical problem by following technical proposals:
A kind of router, its characteristics are that described router comprises:
One node density computing module is used for calculating the also network node density of storage networking;
One transmission radius calculation module is used to calculate the maximum transmitted radius of a node and is stored to described node, and calculates the optimal transmission radius of described node and be stored to described node according to described network node density;
One neighbors detection module is used to detect the neighbors in the maximum transmitted radius of described node and stores the transmission range of described neighbors to described node;
One forward node detection module is used to detect the neighbors that whether has the transmission range minimum in the optimal transmission radius of described node;
One forward node is selected module, is used for the testing result according to described forward node detection module, and the neighbors of transmission range minimum is as forward node in the neighbors of the interior transmission range minimum of selection optimal transmission radius or the selection maximum transmitted radius.
Preferably, described forward node selects module also to cause the empty neighbors of communicating by letter by the eliminating of face traversal technology.
Preferably, described traversal technology is GPSR, CLDP or Bypass face traversal technology.
A kind of packet-forwarding method of described router may further comprise the steps:
S 101, the node density computing module calculate to obtain the network node density in the network, the maximum transmitted radius of transmission radius calculation module computing node also is stored to described node;
S 102, transmission radius calculation module is according to the optimal transmission radius of described network node density computing node and be stored to described node;
S 103, the neighbors detection module detects the neighbors in the maximum transmitted radius of described node and stores the transmission range of described neighbors to described node;
S 104, forward node detection module detection node the optimal transmission radius in whether have the neighbors of transmission range minimum, if testing result is for being then to enter step S 105, otherwise enter step S 106
S 105, to select module to select the neighbors of transmission range minimum in the optimal transmission radius be forward node to forward node;
S 106, forward node select module select transmission range minimum in the maximum transmitted radius neighbors as forward node.
Preferably, it is GPSR, CLDP or Bypass face traversal technology as forward node and described traversal technology that described forward node selects module also to select neighbors by the face traversal technology, and at step S 105In may further comprise the steps:
Forward node selection module detects by described GPSR, CLDP or Bypass face traversal technology and gets rid of in the optimal transmission radius and causes the empty neighbors of communicating by letter.
Preferably, it is GPSR, CLDP or Bypass face traversal technology as forward node and described traversal technology that described forward node selects module also to select neighbors by the face traversal technology, and at step S 106In may further comprise the steps:
Forward node selection module detects by described GPSR, CLDP or Bypass face traversal technology and gets rid of in the maximum transmitted radius and causes the empty neighbors of communicating by letter.
Positive progressive effect of the present invention is:
Router of the present invention and packet-forwarding method thereof, determine the forward node scope by adopting optimal transmission radius and maximum transmitted radius, and effectively evaded the empty communication disruption that causes of communication and unusual by the face traversal technology, the present invention has also further improved the utilance of node energy in addition, thereby has increased node and network life.
Description of drawings
Fig. 1 is the circuit structure block diagram of the preferred embodiment of router of the present invention.
Fig. 2 is the schematic diagram of network node in the optimal transmission radius calculation of the present invention.
Fig. 3 is transmission radius of the present invention and energy efficiency figure.
Fig. 4 is the flow chart of the preferred embodiment of packet-forwarding method of the present invention.
Embodiment
Provide preferred embodiment of the present invention below in conjunction with accompanying drawing, to describe technical scheme of the present invention in detail.
Figure 1 shows that the circuit structure block diagram of router of the present invention, comprising a node density computing module 1, a transmission radius calculation module 2, a neighbors detection module 3, a forward node detection module 4 and a forward node select module 5,
Wherein said node density computing module 1 is used for calculating the also network node density of storage networking.The method of known network node density is not just being given unnecessary details herein in the wireless network of the method employing prior art of wherein said computing network node density.
Described transmission radius calculation module 2 is used for the maximum transmitted radius of computing network node and is stored to described node, and calculates the optimal transmission radius of described node and be stored to described node according to described network node density.Known in the wireless network that wherein said maximum transmitted radius calculation is a prior art, just do not giving unnecessary details herein.Being calculated as follows of described in addition optimal transmission radius is described:
Network node as described in Figure 2, at first the mathematical expectation transmitted to destination node by neighbors of node is as shown in the formula shown in (1):
E ( P ) = 3 x 2 r - r 3 - 6 ∫ 0 r ∫ r x ve - ρ A 1 ( v - p , v , r ) dvdp 3 ( x 2 - 2 ∫ r x ve - ρ A SD ( v , r ) dv ) - - - ( 1 )
Wherein x is the maximum radius of network's coverage area, so x is a fixed value, and for example 200 meters etc.R is signal transmission radius, i.e. the node maximum transmitted radius of node.V is the distance of source node S to destination node D as shown in Figure 2.Z is the distance of the neighbors T of source node S selection apart from destination node D.ρ is the node coverage density in the network.As shown in Figure 2, A SDThe overlapping region of the maximum transmitted scope that constitutes for the maximum transmitted radius of source node S and destination node D, A 1For the transmission range of source node S maximum transmitted radius formation and with destination node D is that center of circle z is the overlapping region of the circle of radius, A 2Be regional A SDIn deduct regional A 1After remaining area.
Can obtain following formula (2) and (3) by calculating:
A SD ( v , r ) = r 2 cos - 1 ( r 2 v ) + v 2 cos - 1 ( 1 - r 2 2 v 2 ) - 1 2 r ( 2 v + r ) ( 2 v - r ) - - - ( 2 )
A 1 ( z , v , r ) = r 2 cos - 1 ( r 2 + v 2 - z 2 2 rv ) z 2 cos - 1 ( z 2 + v 2 - v 2 2 vz ) - 1 2 ( r + v + z ) ( v + z - r ) ( r + v - z ) ( r + z - v ) - - - ( 3 )
Aggregative formula (1), (2) and (3) can obtain the formula (4) of following transmission radius and energy efficiency:
e ( r ) 3 x 2 r - r 3 - 6 ∫ 0 r ∫ r x ve - ρ A 1 ( v - p , v , r ) dvdp 3 ( k 1 r ω + k 2 + E r ) ( x 2 - 2 ∫ r x ve - ρ A SD ( v , r ) dv ) - - - ( 4 )
Can obtain as shown in Figure 3 transmission radius and energy efficiency figure by aforesaid formula, and can determine that by described formula the optimal transmission radius of node is less, also can find the corresponding different optimal transmission radius of network of different densities in addition by Fig. 3, and the network that node density is high, the optimal transmission radius of node is less.
The transmission range that described neighbors detection module 3 is used to detect the neighbors in the maximum transmitted radius of described node and stores described neighbors is to described node; Described forward node detection module 4 is used to detect the neighbors that whether has the transmission range minimum in the optimal transmission radius of described node; Described forward node selection module 5 is used for the testing result according to described forward node detection module 4, selects the neighbors of transmission range minimum in the optimal transmission radius or the neighbors of the interior transmission range minimum of selection maximum transmitted radius.
In addition, forward node selection module 5 is also got rid of by the face traversal technology and is caused the empty neighbors of communicating by letter, thereby the problem that can effectively evade the communication cavity by the face traversal technology, what the traversal technology of face described in the present embodiment adopted is GPSR (greedy peripheral stateless route), CLDP (crosslinked detection protocol) or Bypass face traversal technology, can adopt the face traversal technology of other kinds or form in addition according to the actual needs of radio sensing network.Transmit radius and adopt above-mentioned traversal technology by enlarging in the present embodiment, thereby when in the optimal transmission radius, not having node or meeting with the communication cavity, can effectively change the selection of neighbors, thus the problem of having evaded the communication cavity and not had node.
The operation principle of the router of present embodiment is as described below:
At first node density computing module 1 calculates the network node density that obtains in the network, and the maximum transmitted radius of described transmission radius calculation module 2 computing nodes also calculates the optimal transmission radius by described network node density.
Neighbors that the maximum transmitted radius that described then neighbors detection module 3 detected and write down described node is interior and neighbors are to the transmission range of node.
After this forward node detection module 4 detects the neighbors that whether has the transmission range minimum in the optimal transmission radius of node.If testing result is for being, then forward node selects module 5 to cause the empty neighbors of communicating by letter by the eliminating of face traversal technology, the neighbors of selecting the transmission range minimum then is a forward node, thereby the transmitted in packets that is used for data, otherwise, forward node selects module 5 to enlarge the scope of selecting forward node, promptly detect the node of transmission range minimum in the maximum transmitted radius, and by the definite neighbors of selecting to cause empty problem of getting rid of of face traversal technology, the neighbors of selecting the transmission range minimum then is a forward node.
Figure 4 shows that the flow chart of packet-forwarding method of the present invention, comprising following steps:
Step 101, the node density computing module calculates the network node density that obtains in the network, and the maximum transmitted radius of transmission radius calculation module computing node also is stored to described node.
Step 102, transmission radius calculation module is according to the optimal transmission radius of described network node density computing node and be stored to described node.
Step 103, neighbors detection module detect the neighbors in the maximum transmitted radius of described node and store the transmission range of described neighbors to described node.
Whether step 104 exists the neighbors of transmission range minimum in the optimal transmission radius of forward node detection module detection node, if testing result is for being then to enter step 105, otherwise enter step 106.
It is forward node that step 105, forward node select module to select to cause the neighbors of empty problem and select the neighbors of transmission range minimum by GPSR, CLDP or the eliminating of Bypass face traversal technology in the optimal transmission radius, and flow process finishes.
It is forward node that step 106, forward node select module to select to cause the neighbors of empty problem and select the neighbors of transmission range minimum by GPSR, CLDP or the eliminating of Bypass face traversal technology in the maximum transmitted radius, and flow process finishes.
Though more than described the specific embodiment of the present invention, it will be understood by those of skill in the art that these only illustrate, protection scope of the present invention is limited by appended claims.Those skilled in the art can make numerous variations or modification to these execution modes under the prerequisite that does not deviate from principle of the present invention and essence, but these changes and modification all fall into protection scope of the present invention.

Claims (6)

1. a router is characterized in that, described router comprises:
One node density computing module is used for calculating the also network node density of storage networking;
One transmission radius calculation module is used to calculate the maximum transmitted radius of a node and is stored to described node, and calculates the optimal transmission radius of described node and be stored to described node according to described network node density;
One neighbors detection module is used to detect the neighbors in the maximum transmitted radius of described node and stores the transmission range of described neighbors to described node;
One forward node detection module is used to detect the neighbors that whether has the transmission range minimum in the optimal transmission radius of described node;
One forward node is selected module, is used for the testing result according to described forward node detection module, and the neighbors of transmission range minimum is as forward node in the neighbors of the interior transmission range minimum of selection optimal transmission radius or the selection maximum transmitted radius.
2. router as claimed in claim 1 is characterized in that, described forward node selects module also to cause the empty neighbors of communicating by letter by the eliminating of face traversal technology.
3. router as claimed in claim 2 is characterized in that, described traversal technology is GPSR, CLDP or Bypass face traversal technology.
4. the packet-forwarding method of a router as claimed in claim 1 is characterized in that may further comprise the steps:
S 101, the node density computing module calculate to obtain the network node density in the network, the maximum transmitted radius of transmission radius calculation module computing node also is stored to described node;
S 102, transmission radius calculation module is according to the optimal transmission radius of described network node density computing node and be stored to described node;
S 103, the neighbors detection module detects the neighbors in the maximum transmitted radius of described node and stores the transmission range of described neighbors to described node;
S 104, forward node detection module detection node the optimal transmission radius in whether have the neighbors of transmission range minimum, if testing result is for being then to enter step S 105, otherwise enter step S 106
S 105, to select module to select the neighbors of transmission range minimum in the optimal transmission radius be forward node to forward node;
S 106, forward node select module select transmission range minimum in the maximum transmitted radius neighbors as forward node.
5. packet-forwarding method as claimed in claim 4 is characterized in that, it is GPSR, CLDP or Bypass face traversal technology as forward node and described traversal technology that described forward node selects module also to select neighbors by the face traversal technology, and at step S 105In may further comprise the steps:
Forward node selection module detects by described GPSR, CLDP or Bypass face traversal technology and gets rid of in the optimal transmission radius and causes the empty neighbors of communicating by letter.
6. packet-forwarding method as claimed in claim 4 is characterized in that, it is GPSR, CLDP or Bypass face traversal technology as forward node and described traversal technology that described forward node selects module also to select neighbors by the face traversal technology, and at step S 106In may further comprise the steps:
Forward node selection module detects by described GPSR, CLDP or Bypass face traversal technology and gets rid of in the maximum transmitted radius and causes the empty neighbors of communicating by letter.
CN2011100511893A 2011-03-03 2011-03-03 Router and packet forwarding method thereof Pending CN102143545A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011100511893A CN102143545A (en) 2011-03-03 2011-03-03 Router and packet forwarding method thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011100511893A CN102143545A (en) 2011-03-03 2011-03-03 Router and packet forwarding method thereof

Publications (1)

Publication Number Publication Date
CN102143545A true CN102143545A (en) 2011-08-03

Family

ID=44410700

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011100511893A Pending CN102143545A (en) 2011-03-03 2011-03-03 Router and packet forwarding method thereof

Country Status (1)

Country Link
CN (1) CN102143545A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102711207A (en) * 2012-05-29 2012-10-03 重庆大学 Route selection method used for transoccanic aeronautical communication
WO2020168506A1 (en) * 2019-02-21 2020-08-27 北京大学深圳研究生院 Coordinate mapping-based multi-mode identifier network paging method and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101409940A (en) * 2008-08-26 2009-04-15 中国人民解放军海军工程大学 Route selection method for wireless sensor network facing to target tracking application
CN101925122A (en) * 2009-06-12 2010-12-22 株式会社日立制作所 The apparatus and method that are used for the valid data transmission of vehicle wireless communication network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101409940A (en) * 2008-08-26 2009-04-15 中国人民解放军海军工程大学 Route selection method for wireless sensor network facing to target tracking application
CN101925122A (en) * 2009-06-12 2010-12-22 株式会社日立制作所 The apparatus and method that are used for the valid data transmission of vehicle wireless communication network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
JING DENG等: "Optimum Transmission Ranger for Wireless Ad Hoc Networks", 《ELECTRICAL ENGINEERING AND COMPUTER SCIENCE》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102711207A (en) * 2012-05-29 2012-10-03 重庆大学 Route selection method used for transoccanic aeronautical communication
CN102711207B (en) * 2012-05-29 2015-02-11 重庆大学 Route selection method used for transoccanic aeronautical communication
WO2020168506A1 (en) * 2019-02-21 2020-08-27 北京大学深圳研究生院 Coordinate mapping-based multi-mode identifier network paging method and system

Similar Documents

Publication Publication Date Title
Hawbani et al. LORA: Load-balanced opportunistic routing for asynchronous duty-cycled WSN
Stojmenović et al. Data‐centric protocols for wireless sensor networks
Zhang et al. Dynamic proxy tree-based data dissemination schemes for wireless sensor networks
CN101959218B (en) Method for detecting event region based on splay tree
Wenning et al. Environmental monitoring aware routing: making environmental sensor networks more robust
Kulshrestha et al. An adaptive energy balanced and energy efficient approach for data gathering in wireless sensor networks
Jumira et al. Energy‐efficient beaconless geographic routing in energy harvested wireless sensor networks
Benzerbadj et al. Cross-layer greedy position-based routing for multihop wireless sensor networks in a real environment
Cardone et al. Effective collaborative monitoring in smart cities: Converging MANET and WSN for fast data collection
Valada et al. Design and development of a wireless sensor network system for precision agriculture
Ratnaraj et al. OEDSR: Optimized energy-delay sub-network routing in wireless sensor network
CN102143545A (en) Router and packet forwarding method thereof
Akbar et al. Evaluation of AODV and DSR routing protocols of wireless sensor networks for monitoring applications
Das et al. Computational geometry based coverage hole-detection and hole-area estimation in wireless sensor network
Wenning et al. Environmental monitoring aware routing in wireless sensor networks
CN104519543B (en) The selection method and system of wireless sense network Sink node
Saad et al. Ellipse routing: A geographic routing protocol for mobile sensor networks with uncertain positions
Chatterjee et al. Variety event detection in Wireless Sensor Networks through single hop cluster topology
Al-kahtani et al. ODCR: energy efficient and reliable density clustered-based routing protocol for emergency sensor applications
JP6217174B2 (en) Wireless communication system, wireless terminal, and failure detection method
Lee et al. An adaptive data reporting scheme considering node contexts in wireless sensor networks
Yang Reliable and time-constrained communication in wireless sensor networks
Dhananandhini et al. Detecting sensor node failure and node scheduling scheme for wsn
Pinto et al. Decentralized power aware approach for data fusion in IEEE 802.15. 4 wireless sensor networks
CN102075975B (en) Data monitoring method for wireless sensor network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20110803