# US 2013/0258920 A1 · Method of reducing energy consumption of a wireless sensor network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0258920 A1
- Document ID: US20130258920A1
- Status: Published application
- Kind: A1
- Application number: 13/435,359
- Filed: 2012-03-30
- Published: 2013-10-03
- Earliest claimed: 2012-03-30
- Assignees: I-Shou University
- Inventors: Jiun-Huei HO; Rong-Ching WU; Chun-Wei TSENG; Chiung-Chang SHIEH; Hong-Chi SHIH
- Web page: https://patentgrep.com/patent/US20130258920A1

## CPC

- H04W 40/10: based on available power or energy
- H04W 40/28: for reactive routing
- H04W 52/0203: {in the radio access network or backbone network of wireless communication networks}
- H04W 52/0219: {where the power saving management affects multiple terminals}
- Y02D 30/70: in wireless communication networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- 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

## Abstract

A method of reducing energy consumption is to be performed by a network node, and includes configuring the network node to perform the consecutive steps of: b1) setting an initial value for each of first and second parameters; b2) skipping to step b5) if the second parameter is smaller than a random value; b3) estimating an amount of energy required for, and computing a probability of, data transmission therefrom; b4) selecting one of other network nodes corresponding to a greatest value of the first parameter for serving as a transmission route; b5) determining whether data transmitted thereby has reached a destination network node, and skipping to step b7) if affirmative; b6) updating the first parameters of the other network nodes, and returning to step b2); and b7) updating the first parameters of the network nodes belonging to an optimal route.

## Claims

### Claim 1

A method of reducing energy consumption of a wireless sensor network, said method to be performed by a plurality of network nodes of the wireless sensor network, each of the network nodes being capable of information processing and wireless communication and having obtained routing information corresponding to one another, said method comprising the steps of:
b1) configuring one of the network nodes to set an initial value for each of first, second, and third parameters, and to proceed to step b2);
b2) configuring said one of the network nodes to generate a first random value having a predetermined range, and to proceed to step b3) if the first random value is greater than the second parameter, and to step b5) if otherwise;
b3) configuring said one of the network nodes to perform an estimation of an amount of energy required by said one of the network nodes for sending data according to a predetermined fitness function, and to proceed to step b4);
b4) configuring said one of the network nodes to compute a probability of data transmission from said one of the network nodes to each of remaining ones of the network nodes according to a predetermined transmission probability relation, and to proceed to step b5);
b5) configuring said one of the network nodes to select one of the remaining ones of the network nodes that corresponds to a greatest value of the first parameter for serving as a transmission route according to a predetermined node selection relation, and to proceed to step b6);
b6) configuring said one of the network nodes to determine whether data transmitted thereby has reached a destination network node, and to proceed to step b8) if affirmative, and to step b7) if otherwise;
b7) configuring said one of the network nodes to update the first parameter of each of the remaining ones of the network nodes according to a first predetermined update relation, and to proceed back to step b2); and
b8) configuring said one of the network nodes to update the first parameters corresponding to the network nodes that belong to an optimal route according to a second predetermined update relation.

### Claim 2 (depends on 1)

The method as claimed in claim 1, wherein the predetermined fitness function is
P(i,j)(r,d)=r(α1+α2d(i,j)n)+Nj
where P(i,j)(r,d) represents an amount of energy required for sending data from an ith network node to a jth network node, r represents a rate of data transmission, d represents a Euclidean distance between the ith and jth network nodes, α1 represents a non-distance factor coefficient, α2 represents a distance factor coefficient, and Nj represents an amount of consumed energy of the jth network node.

### Claim 3 (depends on 1)

The method as claimed in claim 1, wherein the predetermined transmission probability relation is
U
k

(
i
,
j
)
=
{
τ

(
i
,
j
)
·
Δ


P
(
i
,
j
)
β
∑
u
∈
J
k

(
r
)

τ

(
i
,
j
)
·
Δ


P
(
i
,
j
)
β
,
if


s
∈
J
k

(
i
)
0
,
if


s
∉
J
k

(
i
)
where Uk(i,j) is the probability of data transmission, ΔP(i,j) represents a change in amount of energy consumption attributed to the data transmission from the ith network node to the jth network node, Jk (i) represents an aggregation of other network nodes of an ith network node of a kth transmission route, τ(i,j) represents a value of the first parameter of the ith network node and the jth network node, and β is an evaluation parameter.

### Claim 4 (depends on 1)

The method as claimed in claim 1, wherein the first predetermined node update relation is
τ(i,j)=(1−ρ)·τ(i,j)+ρΔP(i,j)
where ΔP(i,j) is equal to (n*P(i,j)(r,s))−1, n represents an nth network node, and ρ represents a volatility rate of the first parameters τ(i,j), which ranges from 0 to 1, for controlling a residual amount of the first parameters τ(i,j) that increases when the network node is chosen and that decreases when otherwise.

### Claim 5 (depends on 1)

The method as claimed in claim 1, wherein the second predetermined node update relation is
τ(i,j)=(1−α)·(i,j)+αΣi=1m-1ΔP(i,j)
where ΔP(i,j) is equal to (n*P(i,j)(r,s))−1, m represents the aggregation of the network nodes in the optimal route, and n represents an nth network node identical to the optimal route.

### Claim 6 (depends on 1)

The method as claimed in claim 1, wherein each of the first, second, and third parameters has a value ranging from 0 to 1.

### Claim 7 (depends on 1)

The method as claimed in claim 1, further comprising, prior to step b1), the steps of:
a1) configuring one of the network nodes to broadcast a route discovery packet to a nearby one of the network nodes within a communication range of said one of the network nodes;
a2) configuring the nearby one of the network nodes to, upon receipt of the route discovery packet, send a reply discovery packet for receipt by said one of the network nodes;
a3) configuring the nearby one of the network nodes to update the route discovery packet received thereby so as to generate an updated route discovery packet, and to broadcast the updated route discovery packet to a portion of remaining ones of the network nodes; and
a4) configuring said one of the network nodes to determine whether there are network nodes from which the reply discovery packets are yet to be received according to a predetermined condition, and to proceed back to step a1) if affirmative, and to step b1) if otherwise.

### Claim 8 (depends on 7)

The method as claimed in claim 7, wherein, in step a4), said one of the network nodes is configured to determine that there is no network node from which the reply discovery packet is yet to be received and to proceed to step b1) if a predetermined time period has elapsed.
