CN101247339B - Method for centralized resource reservation management in mobile wireless sensor network - Google Patents
Method for centralized resource reservation management in mobile wireless sensor network Download PDFInfo
- Publication number
- CN101247339B CN101247339B CN2008100599510A CN200810059951A CN101247339B CN 101247339 B CN101247339 B CN 101247339B CN 2008100599510 A CN2008100599510 A CN 2008100599510A CN 200810059951 A CN200810059951 A CN 200810059951A CN 101247339 B CN101247339 B CN 101247339B
- Authority
- CN
- China
- Prior art keywords
- node
- grouping
- bunch
- route
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Abstract
The present invention relates to a method of centralized resource management in the mobile wireless sensor network, used in the multi-jump mobile wireless sensor network and mobile Ad Hoc network. When the network initialize, the preassigned first cluster node are used for accomplishing the time in-phase of the other nodes around. All the in-phase nodes constitute the virtual cluster. In the process of synchronization, the node can get the route information of reaching the cluster first nod. When virtual cluster member node produces Qos service flow, first the access can be got, then tell theuseful route information and service kind information to the cluster first nod, which distributes and manages all the resources used for Qos service flow in the cluster. The invention can realize theresource reservation when need the multi-jump transferring among the cluster members.
Description
Technical field
The present invention relates to mobile wireless sensor network and mobile ad-hoc network, specifically a kind of method of in mobile wireless sensor network, carrying out the centralized resources reservation management.
Background technology
Mobile wireless sensor network is the complicated distributed network system, is self-organizing, self-healing network, is made up of wireless mobile node; Wireless mobile node can be free and dynamically organize themselves into any provisional network topology, thereby allow people's device seamlessly to interconnect in the environment of the communications infrastructure that is not pre-existing in.Radio propagation conditions between any two mobile nodes is limited by the transmitting power between these two nodes.
In mobile wireless sensor network, the most normal use is the MAC agreement of competition class and routing mode as required.This is two-layer to hold an important position in whole mobile ad-hoc network protocol architecture.
The most used in the MAC agreement of competition class then is carrier sense multiple access agreement (CSMA) and multiple access and collision elimination (MACA) agreement.CSMA draws by near the signal strength signal intensity the test receiver to make great efforts to avoid collision, but it is not in transmit leg one side that collision takes place, but in recipient's one side, therefore carrier sense does not provide and avoids colliding necessary all information, this has just caused the main cause of an inefficacy in the multi-hop CSMA network, i.e. " concealed terminal " problem.Use CSMA medium access technology also can cause that unnecessary postponement message sends problem, i.e. " exposed terminal " problem simultaneously owing to manifesting terminal.MACA uses the control grouping handshake mechanism of RTS-CTS, alleviated concealed terminal and exposed terminal problem, but hidden terminal problem can take place on certain intermediate node of multi-hop relay transmission still.
On-demand routing protocol generally uses distance vector routing protocol (AODV) as required.This is for the frequent network node that moves designs, and is equally applicable to wireless sensor network.This agreement provides quick self-adapted to dynamic link, and the pathfinding expense is low, can be used for searching dynamic between the mobile node, self-starting, the route of multi-hop, and do not need regular route maintenance.
Under the multi-hop wireless sensor network environment, guarantee the service quality of Business Stream, need to consider each link of process and the situation of node.Because the dynamic of mobile wireless sensor network, providing Qos to ensure is a very difficult thing.Single angle from each layer solves the Qos requirement that Qos problem and phase-split network performance are not well positioned to meet application layer, must use a kind of notion of Qos system, associated treatment between the multilayer.Consider from the MAC layer, will avoid collision exactly, solve concealed terminal and exposed terminal problem, realize the resources effective reservation.Consider that from the route layer will select best Qos route exactly, path fast connects.The Qos route calculation can be used the shortest spanning tree algorithm of improved Dijkstra.Promptly select an important service characteristic (as time delay or bandwidth) to calculate the shortest generation tree route, and other service request can be used as the restrictive condition of selecting route as cost function.In addition, can also use the method for route stand-by to reduce and search the required time of available route after route lost efficacy, the method that adopts route as required or be similar to the sequence number of DSDV is avoided the appearance of route loop.On network configuration, can carry out certain adjustment to the composition of network, strengthen the function of some nodes, realize effective management to available resources.
Transfer of data in the prior wireless network all adopts open broadcast mode, and each node in the network inevitably collision phenomenon can occur when adopting competition class MAC agreement to send packet.This will have a strong impact on the continuity of data packet transmission.Each packet all need be initiated connection procedure before sending again, and this has also strengthened the propagation delay time and the transmission success rate of packet undoubtedly.When needing in the network to transmit the Business Stream that Qos is had relatively high expectations, will adopt certain method to avoid this collision, and reduce time delay, guarantee the reliability of Business Stream transmission.
Summary of the invention
The objective of the invention is to design a kind of method of in mobile wireless sensor network, carrying out the centralized resources reservation management.
The present invention finishes resource reservation in the route querying process, use the mode of concentrating, and the whole network resource is carried out unified management.Whole network comprises a plurality of mobile sensor network nodes in preassigned bunch of first node and the preset range, use existing synchronized algorithm that whole network is carried out time synchronized, in synchronous process, each node learns that self arrives the path of bunch first node in the network.The route aspect is improved on existing routing algorithm as required basis, adds extra territory on original control messages packet by packet basis, is used to carry extra Business Stream relevant information, and record through the information in path.
The present invention includes following steps:
Step 1: after node produced and to need Business Stream that Qos ensures, node became sending node, at first judged the address information that whether contains destination node in self routing table.If any, then sending node forms the resource reservation request frame, sends to a bunch first node, waits for the resource reservation notice of bunch first node, enters step 4; If do not have, then form route requests grouping (RREQ), jump to step 2.Should add the kind of carrying the Business Stream that will transmit in this RREQ grouping, the destination address of Business Stream, and limit the maximum hop count of this grouping.
Step 2: sending node adopts the form of broadcasting to send the RREQ grouping, and the node that receives this grouping judges according to the relevant information in the grouping which kind of processing method this grouping is taked.
Step 3: sending node writes down available routing information, and begins a wait process immediately after receiving route replies grouping (RREP), waits for a bunch first node down distributing resource reservation notice.
Step 4: sending node begins the transmission of Business Stream along the path of determining in the route querying process immediately after receiving the resource reservation notice of bunch first node.If do not receive for a long time at its other resources reservation notice, then jump to step 1.
Node self never received under the prerequisite of this RREQ grouping determining after receiving a RREQ, adopt following steps judge self the processing method that should take:
Steps A: whether the destination address of checking this RREQ is oneself, if then jump to step C; If not, then jump to step B.
Step B: check whether this grouping reaches maximum hop count, if then be left intact; If not, then the hop count of grouping is added one, and the address information of self is added in this grouping, adopt the form of broadcasting to send, jump to step 2.
Step C: according to the routing information that comprises in the RREQ grouping that receives, destination node forms a route replies grouping (RREP), and this grouping is pressed the original route loopback and given sending node; Destination node forms the resource reservation request frame according to relevant information in the RREQ grouping simultaneously, sends to a bunch first node, and waits for a bunch first node loopback ACK grouping.Should carry the type of Business Stream and institute in this resource reservation request frame through path information, wherein institute should comprise the node address that Business Stream will pass through in the information of path, the information such as timestamp when passing through this address.
Step D: bunch first node clean culture loopback ACK after receiving the resource reservation request frame give destination node, simultaneously according to the resource operating position in the virtual cluster, gives the suitable resource of imminent traffic flow assignment, and all nodes in the broadcast announcement virtual cluster.
The present invention has the following beneficial effect that has:
1) centralized resource allocation is controlled, and makes Internet resources can obtain best distribution, effectively utilizes Internet resources.
2) by a bunch first node centralized periodic down distributing resource distribution condition, make all nodes in the network can both learn the operating position of current resource, avoided modes such as concealed terminal and exposed terminal to use wireless channel fully, realize that the Qos of Business Stream ensures.
3) each node learns that in advance self arrives the path of bunch first node, helps shortening the employed time of reservation process in the network.
4) use the mode pathfinding of route as required in the reservation process, reduce the expense of regular maintenance route, adapt to the often situation of change of network topology.
Description of drawings
Fig. 1 is a centralized resources reserve requests flow chart.
Fig. 2 is the forward and backward superframe structure of reservation.
Fig. 3 is the resource reservation request frame format.
Fig. 4 is the RREQ packet format.
Fig. 5 is the RREP packet format.
Fig. 6 is the network construction schematic diagram.
Fig. 7 be bunch in adjacent node reservation schematic diagram.
Fig. 8 be bunch in nonneighbor node reservation schematic diagram.
Embodiment
The present invention is further illustrated below in conjunction with drawings and Examples.
Network requires all nodes to have a pre-set ID before setting up.Bunch first node ID of appointment is 1.All the other node ID are greater than 2.The maximum radio frequency transmission power level of setting bunch first node is the twice of ordinary node.Available resources in the network enough support the transmission that at least two pairs of nodes carry out Business Stream.Suppose that network radius promptly is the maximum propagation distance of bunch first node signal, then the node in the network should maximum can link to each other with a bunch first node by double bounce.
Network struction is on the notion of superframe, the superframe structure that uses among the embodiment is fixing division a period of time to carry out the transmission of beacon frame, all the other times are the CSMA competition time, and each node all has the right to compete control grouping or the packet that transmits self in the network in during this period of time.Superframe structure is referring to Fig. 2 a before the reservation.The resource of preengaging is meant the suitable time period that marks off from the afterbody of CSMA, and these time periods can only use for specific node, and other nodes must be in silent status in these time periods.We managed the time period, made this time period of preengaging always at the afterbody of superframe, and this time period is continuous.Reservation back superframe structure is referring to Fig. 2 b.
There are two kinds of beacon frames in whole network: networking beacon frame and reservation beacon frame.The networking beacon frame is finished the establishment of network, uses the common power emission; The operating position of reservation beacon frame announcement the whole network resource is used maximum power transmission.
The strategy that beacon frame sends: the networking beacon frame sent once every the regular period, helped the node change of awareness network topology again in the network; The reservation beacon frame only sends when needs are arranged.
Bunch first node is realized the establishment of whole network by broadcast transmission networking beacon frame, referring to Fig. 6.The ordinary node power levels is used in the transmission of networking beacon frame, and only allows to transmit once, and the node in bunch monic jumping scope all can be received this networking beacon frame smoothly.
The information that comprises in the networking beacon frame has:
1) synchronizing information: the time synchronized of finishing all nodes in the whole network
2) networking information: according to the time of delay that all nodes in bunch member node ID planning network are transmitted the networking beacon frame, the serious collision that brings when avoiding transmitting the networking beacon frame simultaneously.
Be in the interior node of bunch first node one jumping scope after receiving the networking beacon frame, will by the time of delay of reserving in advance, transmit successively according to the networking information of carrying in the networking beacon frame.
Hypothetical network is symmetrical, and in the networking process, the node in the virtual cluster all is in intercepts channel status, and the neighbor information that then listens to can record in the routing table, thinks that it can reach.Any node that receives beacon frame all has been equivalent to obtain arrive the routing information of bunch first node.After a super frame period, network is promptly finished establishment.
After network entered the operation phase, the node in the virtual cluster can adopt irregularly or intercept all the time channel status, adopted when irregularly intercepting mode, prove conclusively the beacon frame broadcasting stage in each super frame period, and all nodes all are in the state of intercepting in bunch.Node can be revised the routing table information of self according to intercepted result in intercepting the process of channel.
When bunch in certain node produce Qos ensured the Business Stream of requirement is arranged after, promptly initiate a resource reservation request process: node is checked self routing table at first according to the destination address of this Business Stream,
1) if relevant routing iinformation is arranged, then directly form a resource reservation request frame and send to a bunch first node, this resource reservation request frame format is referring to Fig. 3, the information of carrying comprises that this Business Stream is about to the path of using, the kind of Business Stream, node begins promptly to wait for that a bunch first node uses the reservation beacon frame to announce the resource division result after the ACK that receives bunch first node responds.
2) if there is not relevant routing iinformation, then send RREQ, initiate the pathfinding process.This RREQ form is referring to Fig. 4, and the information of carrying comprises the kind of Business Stream, and notes the routing information of self process.The transmission of RREQ grouping only limits to the CSMA time period of superframe, uses the mechanism that floods.After destination node receives this RREQ, extract the routing information under the storage among this RREQ, according to RREP of this information former road loopback.This RREP form is referring to Fig. 5, and and then node sends a resource reservation request frame immediately to a bunch first node, after the ACK that receives bunch first node responds, begins the wait process.
Bunch first node is after receiving the resource reservation request frame, can high-power immediately clean culture reply an ACK to requesting node, bunch first node will at first be checked the Business Stream kind class field in the resource reservation request frame then, institute is through node address territory and timestamp territory, to current business flow the time that should distribute make calculating, in conjunction with current Internet resources behaviour in service, whether judgement has enough resources to support the current business flow request then.If time enough section resource is arranged, promptly the afterbody in superframe CSMA section marks off the reasonable time section to this Business Stream use.The concrete again refinement of this time period distribute to this Business Stream the node of process, the size of the time period that each node is assigned to and sequencing will be by timestamps, the Business Stream kind determines jointly.
After resource division is finished, bunch first node will send the reservation beacon frame that comprises Resource Allocation in Networks in the back to back beacon frame period, bulletin the whole network.After all relevant nodes receive this frame, will in next super frame period, begin the transmission of the Business Stream of self according to the resource division situation.
Claims (1)
1. method of carrying out the centralized resources reservation management in mobile wireless sensor network is characterized in that following steps:
Step 1: after node produces the Business Stream that needs the Qos guarantee, node becomes sending node, at first judge the address information that whether contains destination node in self routing table, if any, then sending node forms the resource reservation request frame, send to a bunch first node, wait for the resource reservation notice of bunch first node, enter step 4; If do not have, then form the route requests grouping, jump to step 2; Should add the kind of carrying the Business Stream that will transmit in this route requests grouping, the destination address of Business Stream, and limit the maximum hop count of this grouping;
Step 2: sending node adopts the form of broadcasting to send the route requests grouping, after node receives a route requests grouping, self never received under the prerequisite of this route requests grouping determining, adopt following steps judge self the processing method that should take:
Steps A: whether the destination address of checking this route requests grouping is oneself, if then jump to step C; If not, then jump to step B;
Step B: check whether the route requests grouping reaches maximum hop count, if then be left intact; If not, then the hop count of grouping is added one, and the address information of self is added in this grouping, adopt the form of broadcasting to send, jump to step 2;
Step C: according to the routing information that comprises in the route requests grouping that receives, destination node forms a route replies grouping, and the route replies grouping is pressed the original route loopback and given sending node; Destination node forms the resource reservation request frame according to relevant information in the route requests grouping simultaneously, sends to a bunch first node, and waits for a bunch first node loopback ACK grouping; Should carry the type of Business Stream and institute in this resource reservation request frame through path information, wherein institute should comprise the node address that Business Stream will pass through in the information of path, the timestamp information when passing through this address;
Step D: bunch first node clean culture loopback ACK after receiving the resource reservation request frame give destination node, simultaneously according to the resource operating position in the virtual cluster, gives the suitable resource of imminent traffic flow assignment, and all nodes in the broadcast announcement virtual cluster;
Step 3: sending node writes down available routing information, and begins a wait process immediately after receiving the route replies grouping, waits for a bunch first node down distributing resource reservation notice;
Step 4: sending node begins the transmission of Business Stream along the path of determining in the route querying process immediately after receiving the resource reservation notice of bunch first node; If do not receive for a long time at its other resources reservation notice, then jump to step 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100599510A CN101247339B (en) | 2008-03-05 | 2008-03-05 | Method for centralized resource reservation management in mobile wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100599510A CN101247339B (en) | 2008-03-05 | 2008-03-05 | Method for centralized resource reservation management in mobile wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101247339A CN101247339A (en) | 2008-08-20 |
| CN101247339B true CN101247339B (en) | 2010-12-29 |
Family
ID=39947549
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100599510A Expired - Fee Related CN101247339B (en) | 2008-03-05 | 2008-03-05 | Method for centralized resource reservation management in mobile wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101247339B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364951B (en) * | 2008-09-26 | 2010-12-08 | 北京邮电大学 | QoS guarantee system for wireless sensor network |
| CN101808418B (en) * | 2009-09-25 | 2012-07-25 | 南京邮电大学 | Distributed processing method for introducing non-competitive transmission cycle in network |
| CN102510578A (en) * | 2011-11-22 | 2012-06-20 | 浪潮电子信息产业股份有限公司 | Embedded wireless alarm communication method |
| CN102724728B (en) * | 2012-05-15 | 2014-09-03 | 苏州博联科技有限公司 | Expanding ring synchronization-based regional route establishment method in wireless network |
| CN104105216A (en) * | 2013-04-09 | 2014-10-15 | 华为终端有限公司 | Resource reservation method and device |
| CN105992352B (en) * | 2015-02-02 | 2019-06-21 | 北京信威通信技术股份有限公司 | A kind of resource allocation methods of sub-clustering Ad Hoc network |
| CN105554812A (en) * | 2016-01-28 | 2016-05-04 | 中山市倍能照明科技有限公司 | Two-way transmission control system and method based on application of radio frequency module |
| CN106658355B (en) * | 2016-09-26 | 2019-11-12 | 珠海格力电器股份有限公司 | A kind of method and system forwarding broadcast packet in bluetooth BLE networking |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794687A (en) * | 2006-01-06 | 2006-06-28 | 中国人民解放军理工大学 | Adaptive dormancy method of network data chain circuit layer of cluster structured radio sensor |
| CN101056230A (en) * | 2006-04-14 | 2007-10-17 | 北京大学 | Multi-center radio dynamic distributed network information collision prevention communication method |
-
2008
- 2008-03-05 CN CN2008100599510A patent/CN101247339B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794687A (en) * | 2006-01-06 | 2006-06-28 | 中国人民解放军理工大学 | Adaptive dormancy method of network data chain circuit layer of cluster structured radio sensor |
| CN101056230A (en) * | 2006-04-14 | 2007-10-17 | 北京大学 | Multi-center radio dynamic distributed network information collision prevention communication method |
Non-Patent Citations (2)
| Title |
|---|
| 姜华,等.无线传感器网络中信道接入分簇算法的研究.计算机工程与应用.2006,22-28. |
| 姜华等.无线传感器网络中信道接入分簇算法的研究.计算机工程与应用.2006,22-28. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101247339A (en) | 2008-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101247339B (en) | Method for centralized resource reservation management in mobile wireless sensor network | |
| Cuomo et al. | Routing in ZigBee: benefits from exploiting the IEEE 802.15. 4 association tree | |
| Liu et al. | DELAR: A device-energy-load aware relaying framework for heterogeneous mobile ad hoc networks | |
| US8050196B2 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| CN102340838B (en) | Medium access control method for prolonging network lifetime in wireless body area network | |
| Pavkovic et al. | Efficient topology construction for RPL over IEEE 802.15. 4 in wireless sensor networks | |
| US9380513B2 (en) | Reducing broadcast duplication in hybrid wireless mesh protocol routing | |
| CN101197748A (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| EkbataniFard et al. | A detailed review of multi-channel medium access control protocols for wireless sensor networks | |
| CN109510769B (en) | Converged routing system suitable for wide-narrow combined network and method thereof | |
| Hui | A novel qos routing algorithm in wireless mesh networks | |
| Kim et al. | Cluster-based mobility supporting WMN for IoT networks | |
| Tsao et al. | An end‐to‐end channel allocation scheme for a wireless mesh network | |
| Yang et al. | Admission control for wireless mesh networks based on active neighbor bandwidth reservations | |
| Zhou et al. | A new multi-metric QoS routing protocol in wireless mesh network | |
| EkbataniFard | Multi-channel medium access control protocols for wireless sensor networks: A survey | |
| Finke | SEREMA: Self-organized routing in heterogeneous mobile ad hoc networks | |
| Jin et al. | On a joint temporal–spatial multi-channel assignment and routing scheme in resource-constrained wireless mesh networks | |
| Qassem et al. | Review of network routing in ieee 802.16 wimax mesh networks | |
| Suresh et al. | MAC and routing layer supports for QoS in MANET: a survey | |
| Minh et al. | An Improved Multi-Channel Multi-Interface Routing Protocol for Wireless Mesh Networks. | |
| So | Design and evaluation of multi-channel multi-hop wireless networks | |
| Seo et al. | Distributed TDMA MAC Protocol with Source-Driven Combined Resource Allocation in Ad Hoc Networks | |
| Patil et al. | Cross layer AODV with position based forwarding routing for mobile adhoc network | |
| Jung et al. | Channel time allocation and routing algorithm for multi-hop communications in IEEE 802.15. 3 high-rate WPAN mesh networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CAS JIAXING WIRELESS SENSOR NETWORK ENGINEERING CE Free format text: FORMER OWNER: CAS JIAXING CENTER MICROSYSTEMS INTITUTE BRANCH CENTER Effective date: 20100205 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20100205 Address after: 2, building 1, No. 778 Asia Pacific Road, Nanhu District, Zhejiang, Jiaxing Province, China: 314000 Applicant after: Jiaxing Wireless Sensor Network Engineering Center, Chinese Academy of Sciences Address before: A, building four, block JRC, Asia Pacific Road, Nanhu District, Zhejiang City, Jiaxing Province, China: 314000 Applicant before: Microsystem Inst. Branch Center, Jiaxing Center, CAS |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20101229 Termination date: 20180305 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |