CN103501530A - Energy-saving method for wireless self-organizing network based on naming data - Google Patents
Energy-saving method for wireless self-organizing network based on naming data Download PDFInfo
- Publication number
- CN103501530A CN103501530A CN201310505663.4A CN201310505663A CN103501530A CN 103501530 A CN103501530 A CN 103501530A CN 201310505663 A CN201310505663 A CN 201310505663A CN 103501530 A CN103501530 A CN 103501530A
- Authority
- CN
- China
- Prior art keywords
- node
- request
- energy
- wireless self
- required list
- 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
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses an energy-saving method for a wireless self-organizing network based on naming data. In the method, the naming data are introduced into the wireless self-organizing network, and a certain improvement is made on the problem of node response, so that higher energy-saving performance and efficiency are achieved for the network. The improvement is made by introducing a brand new energy evaluation parameter E on the basis of the naming data and the wireless self-organizing network and setting a reject Interest Table (RIT). The parameter E is used for judging whether nodes respond to a request or not so as to protect low-energy nodes effectively. According to the method, a part of nodes are effectively controlled from dying out due to frequent use; due to the adoption of the naming data, the problem of difficulty in IP (Internet Protocol) positioning is avoided; a node cache is set, so that the problem of low efficiency caused by frequent acquisition of the same data from a source node is avoided.
Description
Technical field
The present invention relates to radio self organizing network technology, the particularly efficient energy-saving application of named data concept in wireless self-organization network.
Background technology
Along with the explosive growth of network application, nowadays traditional TCP/IP architecture network can not well meet people for network real-time, ambulant requirement, also is faced with the IPv4 address depletion and the IPv6 technology is difficult to promote the hard case come simultaneously.
In order to solve all deficiencies of TCP/IP framework, the framework of various next generation networks is stepping up in the middle of research and development, and the named data network is one of framework that wherein prospect is comparatively bright and clear.The named data network is abandoned the concept of TCP/IP, no longer pays close attention to and carries out the mutual main body of the network information, but pay close attention to network, carries out mutual content itself.The named data network is named for each packet in mutual, and each node can be both that the requestor of content can be also the supplier of content.In the named data network, each node maintains a route forwarding table (FIB), a pending required list (PIT) and data pack buffer piece.
Wireless self-organization network (Mobile Ad Hoc Network) is a kind of any fixation means that do not rely on, and each mobile node is equal, can realize that network opens up the multi-hop wireless network of mending structural self-organizing, as shown in Figure 1.Due to wireless self-organization network, to have a networking convenient rapidly, and the characteristics such as capability to resist destruction is strong are widely used under the special screnes such as various accidents and war or the disaster relief.But, in wireless self-organization network, user terminal mostly is mobile phone, handheld PC and PDA homenergic and supplies limited equipment, how the use wireless self-organization network of efficient energy-saving becomes urgent problem.
The named data network is only paid close attention to content mutual in network and is ignored the entity in mutual, and but these characteristics extremely are applicable to the network topology structure dynamic change but require the wireless self-organization network of communication real-time high-efficiency.In wireless self-organization network, any one node all likely breaks away from network because of the variation of network topology structure or exhausting of energy, can cause like this data of originally transmitting to interrupt even losing.In the named data network architecture, any one node all meaningful cache module can provide corresponding data for all the other nodes, and it is name rather than the IP address by data that network carries out request of data, even therefore provide the source node of content to wither away in the process of topologies change, also can replace content source node to continue to provide corresponding packet by intermediate node.
For the wireless self-organization network under named data, thereby energy-conservation research work the energy consumption that provides more effective routing forwarding strategy to reduce the single transfer of data mainly is provided and realizes that whole net is energy-conservation at present.But consider that wireless self-organization network is multiplex in extreme environment, the existence of any one node has great meaning, therefore, also should pay close attention in energy-conservation and extend whole net life cycle.The present invention is a kind of energy-saving scheme that extends whole net life cycle of considering.
Summary of the invention
The purpose of this invention is to provide a kind of energy-saving scheme for the wireless self-organization network under the named data concept.
The present invention adopts following scheme to realize for achieving the above object: a kind of power-economizing method of the wireless self-organization network based on named data is characterized in that comprising the steps:
Step S01: the primary power and the existing energy that obtain node;
Step S02: for each node is set converting route (FIB), pending required list (PIT) and refusal required list (RIT);
Step S03: be each Node configuration data pack buffer (Content Store);
Step S04: for node creates energy evaluate parameter E,
; Wherein α is the parameter of asking weighting to be averaging, and span is between 0.0 to 1.0, in order to control the weight of number of tasks in node energy and PIT; N is the pending request items number in PIT;
After request wraps in the success of certain node matching data, if this node as calculated after the parameter E of gained be greater than 0.5 responded, return to asked packet; If the parameter E of gained is less than or equal to 0.5 after calculating, just in refusal required list (RIT), this node is inquired about, if this request has been recorded in refusal required list (RIT), responded, if not just refusal response in refusal required list (RIT), abandon this request bag.
In an embodiment of the present invention, described α is made as 0.2.
In an embodiment of the present invention, step S01 records primary power by each Node configuration variable Initial_energy.
In an embodiment of the present invention, after the requesting party sends the request bag, each node of request bag process all possesses the ability that the matched data bag is provided.
In an embodiment of the present invention, when a request arrives certain node N, if do not meet the corresponding packet of this request bag in node N, just this request bag is recorded in pending required list (PIT), and this request bag is forwarded; If there are a plurality of identical datas to arrive, this node can be recorded the interface that sends this request in pending required list (PIT), but only first request is forwarded.
Core of the present invention is: protect low-yield node, make low-yield node do the least possible data transmit-receive work, thereby extend whole net life cycle.
The accompanying drawing explanation
Fig. 1 is based on the wireless self-organization network schematic diagram of named data; In figure, 1 represents that requestor (Requester) sends request bag (Interest); 2,3 represent the process that intermediate node is forwarded request owing to self can't meeting request; 4, the packet of the satisfied request of 5,6 representative returns to the requestor, and the node of process can copy and be stored in data pack buffer by packet on the way; 7 represent that another requestor sends same request; 8 representatives, due to the packet that can meet request that is cached with in intermediate node, so needn't obtain data again from source node (Source), are directly returned to the corresponding data bag by intermediate node and are got final product;
Fig. 2 is power-economizing method concrete steps figure.
Embodiment
Below in conjunction with drawings and Examples, the present invention will be further described.
The power-economizing method of the wireless self-organization network based on named data that the present invention proposes, by reference to the accompanying drawings 1,2 and implement sample and be described as follows:
Suppose to have a wireless self-organization network based on named data (as Fig. 1) that comprises n node, can describe with Euclidean figure G=(V, E).Wherein V represents the set of nodes, and E represents the link set in network.The link table that node u and V form is shown e=(u, v), wherein linkage length d
uvmean.The link of implementing to consider in sample is two-way link.
Communication strategy is driven by the requesting party, and the requesting party to broadcast request (Interest) bag in network, obtains packet by the numerical nomenclature mode by converting route (FIB).In network, each node retains converting route (FIB), pending required list (PIT), refusal required list (RIT) and data buffer storage.The packet of named data network is independently, and it comes wherefrom and will be forwarded where all it doesn't matter, and the link that does not rely on TCP is controlled.
When a request arrives certain node N, if do not meet the corresponding packet of this request bag in node N, just this request bag is recorded in pending required list (PIT), and this request bag is forwarded.If there are a plurality of identical datas to arrive, this node can be recorded the interface that sends this request in pending required list (PIT), but only first request is forwarded.
When a request arrives certain node N, and node N has when meeting this request and wrapping corresponding packet, can not select immediately to send packet to request interface, but whether energy evaluate parameter E that should first decision node N is greater than 0.5.Energy evaluate parameter E wherein,
; Wherein α is the parameter of asking weighting to be averaging, and span is between 0.0 to 1.0, in order to control the weight of number of tasks in node energy and PIT; N is the pending request items number in PIT;
If parameter E is greater than 0.5 responded, return to corresponding packet.
If parameter E is less than 0.5, in the refusal required list (RIT) of node N, inquired about, if this request has been recorded in refusal required list (RIT), illustrate that node N had refused this request before this, but why again receive that this request is because in network, other node can't meet this request, now, node just must respond and this request record is deleted from refusal required list (RIT).If do not record this request in the refusal required list (RIT) of node N, abandon this request, do not do response.
In above step, the present invention proposes a kind of brand-new performance index: node energy evaluate parameter E, its height of energy for a node of quantitative description, thus judge whether request is processed.
The foregoing is only preferred embodiment of the present invention, all equalizations of doing according to the present patent application the scope of the claims change and modify, and all should belong to covering scope of the present invention.
Claims (5)
1. the power-economizing method of the wireless self-organization network based on named data, is characterized in that comprising the steps:
Step S01: the primary power and the existing energy that obtain node;
Step S02: for each node is set converting route (FIB), pending required list (PIT) and refusal required list (RIT);
Step S03: be each Node configuration data pack buffer (Content Store);
Step S04: for node creates energy evaluate parameter E,
; Wherein α is the parameter of asking weighting to be averaging, and span is between 0.0 to 1.0, in order to control the weight of number of tasks in node energy and PIT; N is the pending request items number in PIT;
After request wraps in the success of certain node matching data, if this node as calculated after the parameter E of gained be greater than 0.5 responded, return to asked packet; If the parameter E of gained is less than or equal to 0.5 after calculating, just in refusal required list (RIT), this node is inquired about, if this request has been recorded in refusal required list (RIT), responded, if not just refusal response in refusal required list (RIT), abandon this request bag.
2. the power-economizing method of the wireless self-organization network based on named data according to claim 1, it is characterized in that: described α is made as 0.2.
3. the power-economizing method of the wireless self-organization network based on named data according to claim 1, it is characterized in that: step S01 records primary power by each Node configuration variable Initial_energy.
4. the power-economizing method of the wireless self-organization network based on named data according to claim 1, is characterized in that: after the requesting party sends the request bag, ask each node of bag process all to possess the ability that the matched data bag is provided.
5. the power-economizing method of the wireless self-organization network based on named data according to claim 1, it is characterized in that: when a request arrives certain node N, if do not meet the corresponding packet of this request bag in node N, just this request bag is recorded in pending required list (PIT), and this request bag is forwarded; If there are a plurality of identical datas to arrive, this node can be recorded the interface that sends this request in pending required list (PIT), but only first request is forwarded.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310505663.4A CN103501530B (en) | 2013-10-24 | 2013-10-24 | A kind of power-economizing method of the wireless self-organization network based on name data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310505663.4A CN103501530B (en) | 2013-10-24 | 2013-10-24 | A kind of power-economizing method of the wireless self-organization network based on name data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103501530A true CN103501530A (en) | 2014-01-08 |
| CN103501530B CN103501530B (en) | 2016-06-29 |
Family
ID=49866679
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310505663.4A Expired - Fee Related CN103501530B (en) | 2013-10-24 | 2013-10-24 | A kind of power-economizing method of the wireless self-organization network based on name data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103501530B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104836737A (en) * | 2015-03-27 | 2015-08-12 | 北京邮电大学 | Internet of things communication method taking named data as center |
| CN105682046A (en) * | 2016-03-10 | 2016-06-15 | 重庆邮电大学 | Interest packet forwarding method based on data attributes in vehicle-mounted named data networking |
| CN107396422A (en) * | 2017-07-18 | 2017-11-24 | 中国科学院信息工程研究所 | The CCN communication means and equipment of a kind of mobile ad-hoc network |
| CN108574690A (en) * | 2018-02-12 | 2018-09-25 | 东南大学 | A method of alleviating content in name data network and poisons attack |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6771700B1 (en) * | 1999-10-09 | 2004-08-03 | Qualcomm Incorporated | Method and apparatus for minimizing total transmission energy in a communication system employing retransmission of frame received in error |
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN101335717A (en) * | 2008-07-18 | 2008-12-31 | 西安交通大学 | Energy equalizing routing protocol implementing method in Ad Hoc network |
| CN101414965A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for saving node energy of delay-tolerant network and intermittently-connected network |
-
2013
- 2013-10-24 CN CN201310505663.4A patent/CN103501530B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6771700B1 (en) * | 1999-10-09 | 2004-08-03 | Qualcomm Incorporated | Method and apparatus for minimizing total transmission energy in a communication system employing retransmission of frame received in error |
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN101335717A (en) * | 2008-07-18 | 2008-12-31 | 西安交通大学 | Energy equalizing routing protocol implementing method in Ad Hoc network |
| CN101414965A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for saving node energy of delay-tolerant network and intermittently-connected network |
Non-Patent Citations (2)
| Title |
|---|
| SONG YUNLONG,LIU MIN: "Energy-Aware Traffic Routing with Named Data Networking", 《CHINA COMMUNICATIONS》, 30 June 2012 (2012-06-30), pages 71 - 80 * |
| 林正松， 曹珍富: "命名数据的Ad Hoc 网络通信方案", 《通信技术》, vol. 46, no. 5, 31 May 2013 (2013-05-31), pages 72 - 74 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104836737A (en) * | 2015-03-27 | 2015-08-12 | 北京邮电大学 | Internet of things communication method taking named data as center |
| CN105682046A (en) * | 2016-03-10 | 2016-06-15 | 重庆邮电大学 | Interest packet forwarding method based on data attributes in vehicle-mounted named data networking |
| CN105682046B (en) * | 2016-03-10 | 2018-12-28 | 重庆邮电大学 | Interest package transmitting method in vehicle-mounted name data network based on data attribute |
| CN107396422A (en) * | 2017-07-18 | 2017-11-24 | 中国科学院信息工程研究所 | The CCN communication means and equipment of a kind of mobile ad-hoc network |
| CN107396422B (en) * | 2017-07-18 | 2019-11-05 | 中国科学院信息工程研究所 | A kind of the CCN communication means and equipment of mobile ad-hoc network |
| CN108574690A (en) * | 2018-02-12 | 2018-09-25 | 东南大学 | A method of alleviating content in name data network and poisons attack |
| CN108574690B (en) * | 2018-02-12 | 2020-07-31 | 东南大学 | Method for relieving content poisoning attack in named data network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103501530B (en) | 2016-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105046935B (en) | A kind of bimodulus heterogeneous communication system wireless based on low-voltage power line and micropower | |
| CN100414927C (en) | Ad hoc network orientation route method based on cross-layer design | |
| CN101471704B (en) | Dual-mode equipment and network management method | |
| CN100589441C (en) | IP packet compression method for terminal-to-terminal link transmission | |
| CN106340176A (en) | Intelligent electricity meter information sharing method, intelligent electricity meter and acquisition router | |
| CN101170499B (en) | A selection method for combined service execution path in self-organized network | |
| CN103501530A (en) | Energy-saving method for wireless self-organizing network based on naming data | |
| CN101364945A (en) | Method for realizing unicast energy-saving routing protocol based on cross-layer mechanism on Ad Hoc network | |
| CN110417662A (en) | A kind of name data network transmission method towards wisdom building | |
| CN108566664A (en) | A kind of WSN clustering routing optimization methods of distribution high energy efficiency | |
| Xiong et al. | A connectivity enhancement scheme based on link transformation in IoT sensing networks | |
| CN101640944A (en) | Clustering and multi-hop communication method of wireless sensor | |
| CN101860938B (en) | Network node and method for realizing autonomous routing control by sensing network context information | |
| CN101330529B (en) | Method for distributing address of self-pruning type tree-shaped structure network | |
| CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
| CN110459049A (en) | A kind of intelligent meter data recording system and its construction method based on Wisun agreement | |
| Guan et al. | Energy-saving link scheduling in energy harvesting wireless multihop networks with the non-ideal battery | |
| CN108900587A (en) | A kind of intelligent terminal acts on behalf of decision system | |
| CN106685819A (en) | AOMDV protocol energy saving method based on node energy division | |
| CN105978946A (en) | Internet of things system framework based on content center network | |
| CN107548019A (en) | The processing method and equipment of networked beacons in radio sensing network | |
| CN101163106B (en) | Method of executing combined service in wireless self-organizing network | |
| CN106031220B (en) | Collect the characteristic in the path between IP endpoint associated with transmission network is wirelessly electrically accessed | |
| CN102694773A (en) | Method for IPv6 wireless sensor network to access to present network | |
| CN104053207A (en) | Wireless sensor network spatial query method |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160629 Termination date: 20191024 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |