CN101141388A - Method for implementing optimization energy consumption in Ad hoc network - Google Patents
Method for implementing optimization energy consumption in Ad hoc network Download PDFInfo
- Publication number
- CN101141388A CN101141388A CNA2007100530224A CN200710053022A CN101141388A CN 101141388 A CN101141388 A CN 101141388A CN A2007100530224 A CNA2007100530224 A CN A2007100530224A CN 200710053022 A CN200710053022 A CN 200710053022A CN 101141388 A CN101141388 A CN 101141388A
- Authority
- CN
- China
- Prior art keywords
- node
- cost
- data packet
- energy consumption
- data item
- 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
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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a method for realizing optimized energy consumption in the Ad hoc network. The present invention proposes an energy model with cross-layer design based on the analyzing the characteristics of the Ad hoc network and by combining the condition of the energy consumption on each layer, the model firstly considers the energy consumption of the physical layer, the data link layer and the network layer of the node, thereby to establish the energy model to each node by utilizing the optimized theory, meanwhile, because the communication of the data information in the Ad hoc network is forwarded by multi-hop among the nodes, when a source node operates the forwarding to a target node for the best path, not only the energy consumption of each node on the path is required to be considered, but also the energy consumption of the complete path is required to be considered, finally the optimal path energy model is established according to the principle of least hop and the least energy consumption on the complete one path, thereby, to avoid the network fault and the impact on the rate of the data information transmission caused by the excessive energy consumption.
Description
Technical Field
The invention belongs to the field of wireless networks, and particularly relates to a method for optimizing energy consumption in an Ad hoc network.
Background
In an Ad hoc network, for the power transmission situation of a certain node S, within the transmission range of S, the influence mainly caused by the signal transmission of the neighboring node is relatively large, and therefore, the power transmission distribution situation of the node S is as shown in fig. 1. The Ad Hoc network is characterized in that each node is equal in status, can move freely, and communicates through a wireless channel. Since the mobile terminal itself is powered by a battery, it is generally desirable that the mobile terminal (such as a notebook computer) can continuously operate for 4-6 hours without being charged. Currently, there are certain difficulties in achieving this goal, mainly due to the limited capacity of the battery. Over the past 30 years, battery manufacturing technology has not made a breakthrough advance. Due to the limitations of manufacturing technology, it is difficult to greatly increase the battery capacity per unit weight. Meanwhile, with the improvement of the performance and the enhancement of the functions of the mobile terminal, the demand for electric energy is continuously increased, so that various energy-saving mechanisms adopted in the Ad Hoc network become a main means for prolonging the working time of the Ad Hoc network. From the Ad hoc network hierarchy, the energy consumption in the whole network is mainly concentrated on the physical layer, the data link layer and the network layer. The physical layer mainly comprises the receiving power when each node receives the signal transmitted by the neighbor node and the consumption of some hardware devices (CPU, LCD, etc.) of the node. The data link layer is based on the basic access mode of sharing wireless channel under independent network configuration by the DCF (Distributed coding Function) of IEEE 802.11 based on the MAC layer. When a certain node (in Sleep state) is going to work normally, monitoring whether a wireless shared channel is occupied or not, if so, continuing to monitor and wait for a plurality of random time segments so as to prepare for sending a data packet for the occupied channel; or when the node is in an Active state, the node normally sends a data packet. Therefore, the energy consumption of the nodes in this layer is mainly determined by whether the nodes are in an Active state or a Sleep state. The energy consumption of the network layer is mainly focused on one path of multi-hop forwarding, including the processes of establishing the path and maintaining the path.
Disclosure of Invention
The invention aims to provide a method for realizing optimal energy consumption in an Ad hoc network by comprehensively considering and establishing a novel cross-level energy model in the Ad hoc network by combining a wireless signal transmission model in a wireless network on the basis of analyzing the characteristics of the Ad hoc network and the consumption energy of each hierarchical structure of the network.
In order to achieve the purpose, the method adopts the following steps:
the first step is as follows: the source node S adds a data item cost to the data packet RREQ to be transmitted to save the energy consumption E (S);
the second step is as follows: when the neighbor node i receives the data packet RREQ, the content of the data item cost is taken out and set as the cost old And updating the content of the data item cost to cost in combination with the energy consumption E (i) of the node new (cost new ＝cost old + E (i)), recording the previous node as S, sequentially forwarding a data packet RREQ to the next neighbor node of i, and sending the data packet RREP to the source node S to establish a reverse path leading to the source node;
the third step: and step 2 is executed in sequence, when the intermediate node j receives the data packet RREQ sent by different three neighbor nodes k, l and m, the corresponding data item cost is taken out respectively (the corresponding content is set as the cost) k ，cost l ，cost m And these three values are different), the three values are first judged, and the smallest one is set as the data item cost min If the data item cost k ＝ cost l ＝cost m Selecting one of the nodes as an upstream node m of j, recording the previous node m, simultaneously forwarding a data packet RREQ to the next node, and sending a data packet RREP to the upstream node m to establish a path leading to the upstream node;
the fourth step: step 3 is executed in sequence, when the destination node D receives the data packet RREQ sent by the neighbor node n, the data content in the data item cost is the whole path from the source node S to the previous item node of the destination nodeConsumption is the sum of Total energy data item cost D-1 Update data item cost = cost D-1 + E (D), recording the previous node n, and sending a data packet RREP to the upstream node to establish a path leading to the upstream node, ending the whole process, and simultaneously successfully establishing the path from the node S to the node D.
In the above step 3, if the data item cost k ，cost l ，，cost m All are not equal, the following procedure is performed:
the first step is as follows: when data item cost min Is equal to data item cost k When the node j updates the data item cost = cost in the data packet RREQ k + E (j), recording the previous node k, simultaneously forwarding a data packet RREQ to the next node, and sending the data packet RREP to the upstream node k to establish a path leading to the upstream node;
the second step: when data item cost min Equals data item cost l When the node j updates the data item cost = cost in the data packet RREQ l + E (j), recording the previous node 1, simultaneously forwarding the RREQ data packet RREQ to the next node, and sending the data packet RREP to the upstream node 1 to establish a path leading to the upstream node;
the third step: when data item cost min Is equal to data item cost m When the node j updates the data item cost = cost in the data packet RREQ m + E (j), and records the previous node m, and forwards RREQ data packet RREQ to the next node, and sends data packet RREP to upstream node m to establish the path to upstream node.
The invention is to ensure that an optimal path can be established before a data packet can be normally sent from a source node to a destination node in a network, the constraint condition met by the path is that the energy consumption of the nodes on the path is as less as possible, the whole energy consumption of the path is minimum, but the hop count on the path is not necessarily required to be minimum, therefore, the invention is different from the traditional path establishment method (the hop count is minimum and energy is not considered).
Drawings
Fig. 1 is a topological diagram of a power transmission model of an Ad hoc network.
Detailed Description
The present invention is described in further detail below with reference to the attached drawing figures.
The invention comprises two parts: the first part is used for establishing an energy model for each node, and the second part is used for establishing an optimal energy consumption model which satisfies the energy consumption minimum and has a small hop count of a path (the condition that the energy consumption minimum and the hop count of the path are simultaneously satisfied is an NP problem) from a source node to a destination node on the basis of the first part.
The establishment of the above model first sets the following conditions:
(1) The initial energy of each node in the network is equal.
(2) The hardware structure and devices of each node itself are the same, and thus the consumed energy is considered to be the same (set to P).
(3) Each node is in two states in the case of the topology of the entire network: active (active) (normal operating state) and sleep (sleep).
(4) When a node is in sleep state, the node continues to listen to the shared channel, so that actively occupying the channel to transmit a data packet may involve energy consumption, and thus the energy is considered to be Q.
(5) The length of a data packet sent by each node in a physical layer, the bandwidth and the sending power P of a channel t Are all the same.
(6) In order to ensure the efficiency of communication transmission between nodes, the distance between two adjacent nodes must not exceed D, and if D is exceeded, the receiving node is considered to not obtain the data packet transmitted by the sending node.
Constructing a model:
wireless signal transmission model
The wireless signal transmission model in the current Ad hoc network is mainly divided into three categories: a Free Space model, a Two Ray group Reflection model and a mixed model based on the advantages of the Two models.
1. Free Space model
The assumptions of this model are: both the receiving node and the sending node are within the corresponding transmission range. The model basically represents a circle of transmission range of the transmitting node. If the receiving node is within this range, the transmitting node receives all packets, otherwise discards all packets.
Wherein P is t : transmission power of the transmitting node, G t : : antenna gain of transmitting node, G r : antenna gain of receiving node, λ: wavelength of wireless transmission medium, d: the distance between the sending node and the receiving node.
2. Two Ray Reflection model
A rarely used case in the transmission model is where the point of two nodes is within the transmission range of each other. The Two Ray Reflection model considers Two cases of a direct transmission path and a ground Reflection path. The model can be used for accurately predicting the receiving power of the receiving node under the condition of long distance between the nodes than a Free Space model.
The meaning of the parameters in the formula is shown as the formula (1). Wherein h is r ，h t The antenna heights of the receiving node and the transmitting node, respectively.
3. Hybrid model
Taken together, the tworayrection model is confusing faster than the FreeSpace model in terms of power consumption. However, the tworayreelection model does not achieve a good effect in a range where the distance between nodes is short due to the mutual influence between the antennas of the receiving node and the transmitting node. In contrast, the FreeStace model shows very good performance in this case. Therefore we set a crossing distance d c To represent the transition values of the distances and thus obtain a hybrid model.
(1)d＜d c Then, using the formula (1) to change d in the formula into d c 。
(2)d＞d c Using the formula (2)
(3)d＝d c ＝(4πh t h r ) When the value is/lambda, the same value can be obtained by the formulas (1) and (2).
Establishing a model:
a first part: energy consumption model of node
Assuming that a certain node is i and the energy consumption of the node is E (i), the energy consumption of each node is mainly concentrated in three levels by analyzing the levels of the Ad hoc network. The receiving power of the signal sent by the adjacent node of the physical layer, and the data link layer mainly relates to two states sleep and active of the node. When the node is in sleep state, the node monitors a shared channel and occupies the channel to prepare for the transition from the active state to the active (normal operation), thereby consuming energy; when the state of the node is acitve, the node also consumes energy to forward the data packet to work normally. The network layer looks for a path (path establishment and path maintenance) to forward the data packet.
Thus, E (i) = α E active +(1-α)E sleep
Wherein E active ＝P t *time+P r *time+P，E sleep = Q, α is the reward factor. Comprehensively analyzing the energy consumption condition of the node at each level according to three conditions:
(1) When the α =1 indicates that the energy of the node is mainly consumed in the route establishment process of the network layer, the maintenance process and the received power of the wireless signal transmission model of the physical layer.
(2) When α =0 indicates that the node's energy consumption is mainly large, the node is busy in the sleep state in the data link layer to listen to the physical shared channel.
(3) When 1 > alpha > 0, it indicates that the energy consumption of the node is now in an active state at this time, that is, the node is about to transition to a sleep state, that is, the total energy consumption of three layers of the physical layer, the data link layer and the network layer.
A second part: the energy consumption model of the optimal path from a certain source node to a destination node in the network is provided based on the energy consumption model of the first part.
The total energy consumption E (r) when there is an n-hop path r from a certain source node S to a destination node D in the whole Ad hoc network (when the path passes through 1, 2.. J.. N nodes).
Therefore, when there are R routes from the source node S to the destination node D in the network, an optimal path is selected according to the principle that the least energy-consuming path among all paths is considered first, and then the path hop count is selected to be smaller from the remaining paths.
Solving the model:
solving the first partial model:
in general, energy formula of each node = Power × time, that is, energy consumed by each node to transmit or receive a packet is determined by the Power transmitted or received by the node and the time to process the packet.
According to the characteristics of the physical layer channel of the Adhoc network
Treatment of
The time of a packet is determined by the size of the transmitted packet and the bandwidth of the packet.
So as to obtain the result that,
wherein P is r And P t Can be calculated according to the previous wireless signal transmission model. The three transmission models correspond to the results of three different calculations. (the following formula is derived by taking a twoRayRefraction model as an example) in combination with the characteristics of an Adhoc network, each node can obtain the received power of a signal transmitted by a neighbor node as long as the node is within the transmission range D of the neighbor node. Let the neighbor node of node i be j, i has k i And (4) each neighbor node. Thus E active The formula is further modified. The modification of equation (5) yields:
wherein P is it ，G ir ，h ir For the transmit power of node i, antenna gain and elevation, d ij Is the distance, P, of node i from neighbor node j jt ，G jt ，h jt The transmit power, antenna gain and elevation for the neighbor node j. Thus, the total energy consumed by node i is derived:
wherein 0 < d ij ≤D，1≤k i ≤n。
Solving the second part of the model:
when there is one n-hop path r, the energy consumption of the corresponding path
In order to simplify the above model, it is assumed that the antenna height of each node in the Adhoc network is h, the gain of the antenna is G, and the transmission power of each node is P t A knot represented by the formula (8)The following fruits were obtained:
meanwhile, the result of the formula (4) can be converted according to the formula (9), and an optimal path which satisfies the path with minimum energy consumption and less hop count is derived, as follows:
therefore, the solution of the optimal path is mainly determined by the transmission distance between the nodes and the number of neighbor nodes around the nodes. Because the topological structure of the Ad hoc network changes frequently, the transmission distance between the nodes and the number of the neighbor nodes is analyzed and calculated according to the topological structure of the actual network. According to the method, the Free Space model and the mixed model can also respectively obtain the energy models of the first part and the second part.
The invention provides an energy model of cross-layer design by combining the energy consumption situation of each layer in the network on the basis of analyzing the characteristics of the Ad hoc network, and provides an optimal energy consumption method in the Ad hoc network. The model firstly considers the energy consumption of the physical layer, the data link layer and the network layer of the nodes, so that an energy model is established for each node by utilizing an optimization theory, and meanwhile, because the communication of data information in the Ad hoc network is forwarded by the nodes in a multi-hop way, when a source node forwards the data information to a destination node to find the best path, the energy consumption of each node on the path is considered, and the energy consumption on the whole path is also considered, so that the optimal path energy model is finally established according to the principle that the energy consumption on the whole path is minimum and the hop count is less, and the network fracture caused by excessive energy consumption and the influence on the efficiency of data information transmission are avoided.
Those not described in detail in this specification are well within the skill of the art.
Claims (3)
1. A method for realizing optimized energy consumption in Ad hoc network adopts the following steps:
the first step is as follows: the source node S adds a data item cost to the data packet RREQ to be transmitted to save the energy consumption E (S);
the second step is as follows: when the neighbor node i receives the data packet RREQ, the content of the data item cost is taken out and set as the cost old And updating the content of the data item cost to cost in combination with the energy consumption E (i) of the node new ＝cost old + E (i), recording the previous node as S, sequentially forwarding a data packet RREQ to the next neighbor node of i, and sending the data packet RREP to the source node S to establish a reverse path leading to the source node;
the third step: and step 2 is executed in sequence, when the intermediate node j receives the data packets RREQ sent by different three neighbor nodes k, l and m, the corresponding data items are respectively taken out to be costs k ， cost l ，cost m And the three values are different from each other, and the three values are judged first to obtain the minimum value set as the data item cost min If the data item cost k ＝cost l ＝cost m Selecting one of the upstream nodes m as j, recording the previous node m, simultaneously forwarding a data packet RREQ to the next node, and sending a data packet RREP to the upstream node m to establish a path leading to the upstream node;
the fourth step: step 3 is executed in sequence, when the destination node D receives the data packet RREQ sent by the neighbor node n, the data content in the data item cost is the sum of total energy consumed by the whole path from the source node S to the previous node of the destination nodeData cost D-1 Update data item cost = cost D-1 + E (D), recording the previous node n, and sending a data packet RREP to the upstream node to establish a path leading to the upstream node, ending the whole process, and simultaneously successfully establishing the path from the node S to the node D.
2. A method for optimizing energy consumption in an Ad hoc network according to claim 1, characterized in that: in step 3, if the data items costk, costl, costm are not equal, the following procedure is performed:
the first step is as follows: when data item cost min Is equal to data item cost k When the node j updates the data item cost = cost in the data packet RREQ k + E (j), recording the previous node k, simultaneously forwarding a data packet RREQ to the next node, and sending the data packet RREP to the upstream node k to establish a path leading to the upstream node;
the second step is that: when data item cost min Is equal to data item cost l When the node j updates the data item cost = cost in the data packet RREQ l + E (j), recording the previous node l, simultaneously forwarding the RREQ data packet RREQ to the next node, and sending the data packet RREP to the upstream node l to establish a path leading to the upstream node;
the third step: when data item cost min Is equal to data item cost m When the node j updates the data item cost = cost in the data packet RREQ m + E (j), and records the previous node m, and forwards RREQ data packet RREQ to the next node, and sends data packet RREP to upstream node m to establish the path to upstream node.
3. A method for optimizing energy consumption in an Ad hoc network according to claim 1, characterised in that: energy consumption
Wherein: p ir ，G ir ，h ir For the transmit power of node i, antenna gain and elevation, d ij Is the distance, P, of node i from neighbor node j ji ，G ji ，h ji The transmission power, antenna gain and height of the neighbor node j; d is more than 0 ij ≤D，1≤k 1 ≤n。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100530224A CN101141388B (en) | 2007-08-23 | 2007-08-23 | Method for implementing optimization energy consumption in Ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100530224A CN101141388B (en) | 2007-08-23 | 2007-08-23 | Method for implementing optimization energy consumption in Ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101141388A true CN101141388A (en) | 2008-03-12 |
| CN101141388B CN101141388B (en) | 2010-09-08 |
Family
ID=39193140
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100530224A Expired - Fee Related CN101141388B (en) | 2007-08-23 | 2007-08-23 | Method for implementing optimization energy consumption in Ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101141388B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101924695A (en) * | 2009-06-12 | 2010-12-22 | 美国博通公司 | Method and system based on the packet classification of efficiency |
| WO2011137680A1 (en) * | 2010-05-06 | 2011-11-10 | 华为技术有限公司 | Method and apparatus for relay node selection and power allocation in wireless relay network |
| CN103391315A (en) * | 2013-06-27 | 2013-11-13 | 杭州东信北邮信息技术有限公司 | P2P (peer-to-peer) network file data synchronization method |
| CN105391631A (en) * | 2015-11-30 | 2016-03-09 | 华南理工大学 | Enhanced stable routing protocol for vehicle Ad Hoc network |
| CN108646804A (en) * | 2018-08-06 | 2018-10-12 | 深圳大图科创技术开发有限公司 | A kind of intelligent greenhouse regulating system |
| CN108983840A (en) * | 2018-08-06 | 2018-12-11 | 深圳源广安智能科技有限公司 | A kind of vehicle interior temperature TT&C system |
| CN109699060A (en) * | 2018-12-17 | 2019-04-30 | 江汉大学 | A kind of means of communication and device of wireless sensor network |
| CN111543114A (en) * | 2018-01-09 | 2020-08-14 | Oppo广东移动通信有限公司 | Network self-organizing method and device |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103379030B (en) * | 2012-04-26 | 2018-07-03 | 华为技术有限公司 | It is a kind of to route relevant power-economizing method, the network equipment and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100713590B1 (en) * | 2005-02-04 | 2007-05-02 | 삼성전자주식회사 | Method for disseminating data by minimum energy in wireless sensor network |
| CN1777139A (en) * | 2005-11-30 | 2006-05-24 | 武汉理工大学 | Energy control based MANET routing selecting method |
-
2007
- 2007-08-23 CN CN2007100530224A patent/CN101141388B/en not_active Expired - Fee Related
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101924695A (en) * | 2009-06-12 | 2010-12-22 | 美国博通公司 | Method and system based on the packet classification of efficiency |
| CN101924695B (en) * | 2009-06-12 | 2016-03-16 | 美国博通公司 | For the method and system that network connects |
| WO2011137680A1 (en) * | 2010-05-06 | 2011-11-10 | 华为技术有限公司 | Method and apparatus for relay node selection and power allocation in wireless relay network |
| CN103391315A (en) * | 2013-06-27 | 2013-11-13 | 杭州东信北邮信息技术有限公司 | P2P (peer-to-peer) network file data synchronization method |
| CN103391315B (en) * | 2013-06-27 | 2016-05-04 | 杭州东信北邮信息技术有限公司 | A kind of P2P network file method of data synchronization |
| CN105391631A (en) * | 2015-11-30 | 2016-03-09 | 华南理工大学 | Enhanced stable routing protocol for vehicle Ad Hoc network |
| CN111543114A (en) * | 2018-01-09 | 2020-08-14 | Oppo广东移动通信有限公司 | Network self-organizing method and device |
| CN108646804A (en) * | 2018-08-06 | 2018-10-12 | 深圳大图科创技术开发有限公司 | A kind of intelligent greenhouse regulating system |
| CN108983840A (en) * | 2018-08-06 | 2018-12-11 | 深圳源广安智能科技有限公司 | A kind of vehicle interior temperature TT&C system |
| CN109699060A (en) * | 2018-12-17 | 2019-04-30 | 江汉大学 | A kind of means of communication and device of wireless sensor network |
| CN109699060B (en) * | 2018-12-17 | 2022-12-06 | 江汉大学 | Communication method and device of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101141388B (en) | 2010-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | LCM: A link-aware clustering mechanism for energy-efficient routing in wireless sensor networks | |
| CN101141388A (en) | Method for implementing optimization energy consumption in Ad hoc network | |
| Nadeem et al. | M-GEAR: Gateway-based energy-aware multi-hop routing protocol for WSNs | |
| Rizvi et al. | A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks | |
| CN102036308A (en) | Energy balancing wireless sensor network clustering method | |
| Raj et al. | Energy efficient routing algorithm in wireless body area networks for smart wearable patches | |
| Agrawal et al. | GCRP: Grid-cycle routing protocol for wireless sensor network with mobile sink | |
| Gherbi et al. | A novel load balancing scheduling algorithm for wireless sensor networks | |
| Meelu et al. | Energy efficiency of cluster‐based routing protocols used in wireless sensor networks | |
| Avokh et al. | Dynamic balanced spanning tree (DBST) for data aggregation in wireless sensor networks | |
| Lindsey et al. | Energy efficient broadcasting for situation awareness in ad hoc networks | |
| Sha et al. | A type of energy-balanced tree based data collection strategy for sensor network with mobile sink | |
| Khan et al. | Energy aware Ad-Hoc on demand multipath distance vector routing | |
| Huang et al. | A routing algorithm based on cross-layer power control in wireless ad hoc networks | |
| Tolba et al. | Distributed clustering algorithm for mobile wireless sensors networks | |
| Kui et al. | Energy-balanced clustering protocol for data gathering in wireless sensor networks with unbalanced traffic load | |
| Tuah et al. | Extending lifetime of heterogenous wireless sensor network using relay node selection | |
| Shukla et al. | An optimal relay node selection technique to support green internet of things | |
| Ren et al. | Review of the cross-layer design in wireless ad hoc and sensor networks | |
| Pitchai et al. | Game theoretical computation based energy efficient routing for wireless sensor networks | |
| Subbu et al. | SFRP: A selective flooding-based routing protocol for clustered wireless sensor networks | |
| Banu et al. | A New Multipath Routing Approach for Energy Efficiency in Wireless Sensor Networks | |
| Sengul et al. | TITAN: On-demand topology management in ad hoc networks | |
| Venkataraman et al. | Energy efficient clustering and routing using ga-eammh | |
| El Ghanami et al. | Grids: geographically repulsive insomnious distributed sensors–an efficient node selection mechanism using passive clustering |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100908 Termination date: 20110823 |